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.r011-tall-162038006100209.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is AutoFlight-PT-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 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 29K 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 AutoFlight-PT-04a-00
FORMULA_NAME AutoFlight-PT-04a-01
FORMULA_NAME AutoFlight-PT-04a-02
FORMULA_NAME AutoFlight-PT-04a-03
FORMULA_NAME AutoFlight-PT-04a-04
FORMULA_NAME AutoFlight-PT-04a-05
FORMULA_NAME AutoFlight-PT-04a-06
FORMULA_NAME AutoFlight-PT-04a-07
FORMULA_NAME AutoFlight-PT-04a-08
FORMULA_NAME AutoFlight-PT-04a-09
FORMULA_NAME AutoFlight-PT-04a-10
FORMULA_NAME AutoFlight-PT-04a-11
FORMULA_NAME AutoFlight-PT-04a-12
FORMULA_NAME AutoFlight-PT-04a-13
FORMULA_NAME AutoFlight-PT-04a-14
FORMULA_NAME AutoFlight-PT-04a-15

=== Now, execution of the tool begins

BK_START 1620432893444

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 00:14:55] [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-08 00:14:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 00:14:55] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-08 00:14:55] [INFO ] Transformed 107 places.
[2021-05-08 00:14:55] [INFO ] Transformed 105 transitions.
[2021-05-08 00:14:55] [INFO ] Found NUPN structural information;
[2021-05-08 00:14:55] [INFO ] Parsed PT model containing 107 places and 105 transitions in 86 ms.
Ensure Unique test removed 20 transitions
Reduce redundant transitions removed 20 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3338 resets, run finished after 361 ms. (steps per millisecond=277 ) properties seen :[0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 85 rows 107 cols
[2021-05-08 00:14:55] [INFO ] Computed 28 place invariants in 6 ms
[2021-05-08 00:14:55] [INFO ] [Real]Absence check using 27 positive place invariants in 25 ms returned sat
[2021-05-08 00:14:55] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:55] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-08 00:14:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:55] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2021-05-08 00:14:55] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:55] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-08 00:14:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2021-05-08 00:14:55] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2021-05-08 00:14:55] [INFO ] Computed and/alt/rep : 84/244/84 causal constraints in 7 ms.
[2021-05-08 00:14:56] [INFO ] Added : 71 causal constraints over 15 iterations in 164 ms. Result :sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive place invariants in 9 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-08 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned unsat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-08 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned unsat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-08 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned unsat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-08 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2021-05-08 00:14:56] [INFO ] Deduced a trap composed of 43 places in 45 ms
[2021-05-08 00:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2021-05-08 00:14:56] [INFO ] Computed and/alt/rep : 84/244/84 causal constraints in 9 ms.
[2021-05-08 00:14:56] [INFO ] Added : 64 causal constraints over 13 iterations in 104 ms. Result :sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-08 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:56] [INFO ] [Nat]Absence check using 27 positive place invariants in 8 ms returned unsat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive place invariants in 8 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:14:56] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 00:14:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:14:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2021-05-08 00:14:57] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-08 00:14:57] [INFO ] Flatten gal took : 47 ms
FORMULA AutoFlight-PT-04a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 00:14:57] [INFO ] Applying decomposition
[2021-05-08 00:14:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-08 00:14:57] [INFO ] Flatten gal took : 11 ms
[2021-05-08 00:14:57] [INFO ] Decomposing Gal with order
[2021-05-08 00:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 00:14:57] [INFO ] Removed a total of 22 redundant transitions.
[2021-05-08 00:14:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-08 00:14:57] [INFO ] Flatten gal took : 34 ms
[2021-05-08 00:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2021-05-08 00:14:57] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutoFlight-PT-04a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 00:14:57] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-08 00:14:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AutoFlight-PT-04a @ 3570 seconds

FORMULA AutoFlight-PT-04a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04a-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3531
rslt: Output for LTLCardinality @ AutoFlight-PT-04a

{
"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": "Sat May 8 00:14:58 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"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 ((F ((((p88 <= 0)) OR ((1 <= p93)))) AND ((((p31 <= 0)) OR ((1 <= p15))) OR X ((((p88 <= 0)) OR ((1 <= p93))))))))",
"processed_size": 122,
"rewrites": 34
},
"result":
{
"edges": 158111,
"markings": 46798,
"produced_by": "LTL model checker",
"value": false
},
"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": 594
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p34)))",
"processed_size": 16,
"rewrites": 34
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p94)) AND ((p77 <= 0)))))",
"processed_size": 39,
"rewrites": 34
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 2,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((G (((p28 <= 0))) AND X (((((1 <= p13)) AND ((p84 <= 0))) AND (((p7 <= 0)) OR ((1 <= p8)))))))",
"processed_size": 98,
"rewrites": 34
},
"result":
{
"edges": 19,
"markings": 19,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 7,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F ((((p15 <= 0)) OR ((1 <= p75)))) OR (X (X (G ((G (F (((1 <= p57)))) OR (((p15 <= 0)) OR ((1 <= p75))))))) AND (((p15 <= 0)) OR ((1 <= p75))))))",
"processed_size": 151,
"rewrites": 34
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 2,
"aneg": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((G ((((p69 <= 0)) AND (((p64 <= 0)) OR ((1 <= p61))))) R F (((p69 <= 0)))))",
"processed_size": 79,
"rewrites": 34
},
"result":
{
"edges": 28910227,
"markings": 3497902,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1765
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 4,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p52 <= 0)) OR ((1 <= p74)) OR (((1 <= p32)) AND ((p90 <= 0))) OR (((1 <= p79)) AND ((p83 <= 0))))",
"processed_size": 103,
"rewrites": 36
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3531
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 6,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p55) AND (((p73 <= 0)) OR ((1 <= p68)))) U ((((p71 <= 0)) OR ((1 <= p45))) U ((1 <= p49))))",
"processed_size": 101,
"rewrites": 34
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 28852,
"runtime": 39.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((F(**) AND (** OR X(**))))) : (X(F(**)) OR (G(**) AND X(F(**)))) : (** U (** U **)) : F(**) : G((G(*) AND X((* AND **)))) : X((F(**) OR (X(X(G((G(F(**)) OR (** OR **))))) AND **))) : X((G((* AND *)) R F(*)))"
},
"net":
{
"arcs": 300,
"conflict_clusters": 55,
"places": 107,
"places_significant": 79,
"singleton_clusters": 0,
"transitions": 85
},
"result":
{
"preliminary_value": "no no no no no yes yes ",
"value": "no no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 192/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 107
lola: finding significant places
lola: 107 places, 85 transitions, 79 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: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: F (G (((0 <= 0) U G (F (G (((((p31 <= 0)) OR ((1 <= p15))) U X ((((p88 <= 0)) OR ((1 <= p93))))))))))) : (G (((1 <= p34))) U X (F ((((1 <= p94)) AND ((p77 <= 0)))))) : (((1 <= p55) AND (((p73 <= 0)) OR ((1 <= p68)))) U ((((p71 <= 0)) OR ((1 <= p45))) U ((1 <= p49)))) : F ((((1 <= p52)) AND ((p74 <= 0)) AND (((p32 <= 0)) OR ((1 <= p90))) AND (((p79 <= 0)) OR ((1 <= p83))))) : G (((NOT(F ((F ((((p13 <= 0)) OR ((1 <= p84)))) U ((1 <= p28))))) AND NOT(X ((((p13 <= 0)) OR ((1 <= p84)))))) AND X ((((p7 <= 0)) OR ((1 <= p8)))))) : X ((F ((((p15 <= 0)) OR ((1 <= p75)))) OR (X (G (X (((G (X (F (((1 <= p57))))) OR ((p15 <= 0))) OR ((1 <= p75)))))) AND (((p15 <= 0)) OR ((1 <= p75)))))) : NOT(X (((F (((1 <= p69))) OR F ((((1 <= p64)) AND ((p61 <= 0))))) U G (((1 <= p69))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((((p88 <= 0)) OR ((1 <= p93)))) AND ((((p31 <= 0)) OR ((1 <= p15))) OR X ((((p88 <= 0)) OR ((1 <= p93))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((((p88 <= 0)) OR ((1 <= p93)))) AND ((((p31 <= 0)) OR ((1 <= p15))) OR X ((((p88 <= 0)) OR ((1 <= p93))))))))
lola: processed formula length: 122
lola: 34 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: 46798 markings, 158111 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p94)) AND ((p77 <= 0))))) OR (G (((1 <= p34))) AND X (F ((((1 <= p94)) AND ((p77 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p34)))
lola: processed formula length: 16
lola: 34 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p94)) AND ((p77 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p94)) AND ((p77 <= 0)))))
lola: processed formula length: 39
lola: 34 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: 18 markings, 18 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p28 <= 0))) AND X (((((1 <= p13)) AND ((p84 <= 0))) AND (((p7 <= 0)) OR ((1 <= p8)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p28 <= 0))) AND X (((((1 <= p13)) AND ((p84 <= 0))) AND (((p7 <= 0)) OR ((1 <= p8)))))))
lola: processed formula length: 98
lola: 34 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((((p15 <= 0)) OR ((1 <= p75)))) OR (X (X (G ((G (F (((1 <= p57)))) OR (((p15 <= 0)) OR ((1 <= p75))))))) AND (((p15 <= 0)) OR ((1 <= p75))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((((p15 <= 0)) OR ((1 <= p75)))) OR (X (X (G ((G (F (((1 <= p57)))) OR (((p15 <= 0)) OR ((1 <= p75))))))) AND (((p15 <= 0)) OR ((1 <= p75))))))
lola: processed formula length: 151
lola: 34 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p69 <= 0)) AND (((p64 <= 0)) OR ((1 <= p61))))) R F (((p69 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p69 <= 0)) AND (((p64 <= 0)) OR ((1 <= p61))))) R F (((p69 <= 0)))))
lola: processed formula length: 79
lola: 34 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: 819170 markings, 4237087 edges, 163834 markings/sec, 0 secs
lola: 1442881 markings, 8254951 edges, 124742 markings/sec, 5 secs
lola: 1998770 markings, 12332954 edges, 111178 markings/sec, 10 secs
lola: 2533645 markings, 16288833 edges, 106975 markings/sec, 15 secs
lola: 3003570 markings, 20285679 edges, 93985 markings/sec, 20 secs
lola: 3435954 markings, 24128843 edges, 86477 markings/sec, 25 secs
lola: 3497882 markings, 27871834 edges, 12386 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3497902 markings, 28910227 edges
lola: ========================================
lola: subprocess 5 will run for 1765 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p52)) AND ((p74 <= 0)) AND (((p32 <= 0)) OR ((1 <= p90))) AND (((p79 <= 0)) OR ((1 <= p83)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p52 <= 0)) OR ((1 <= p74)) OR (((1 <= p32)) AND ((p90 <= 0))) OR (((1 <= p79)) AND ((p83 <= 0))))
lola: processed formula length: 103
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 6 will run for 3531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p55) AND (((p73 <= 0)) OR ((1 <= p68)))) U ((((p71 <= 0)) OR ((1 <= p45))) U ((1 <= p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p55) AND (((p73 <= 0)) OR ((1 <= p68)))) U ((((p71 <= 0)) OR ((1 <= p45))) U ((1 <= p49))))
lola: processed formula length: 101
lola: 34 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: 18 markings, 18 edges
lola: RESULT
lola:
SUMMARY: no no no no no yes yes
lola:
preliminary result: no no no no no yes yes
lola: ========================================
lola: memory consumption: 28852 KB
lola: time consumption: 39 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="AutoFlight-PT-04a"
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 AutoFlight-PT-04a, 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 r011-tall-162038006100209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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