fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r151-tall-162089151300253
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for PermAdmissibility-PT-01

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4284.691 3600000.00 18239.00 288.80 TFFTFFTFTFTFFFTF normal

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.r151-tall-162089151300253.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 PermAdmissibility-PT-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151300253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 207K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 156K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 768K 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.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Mar 25 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 25 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 484K 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 PermAdmissibility-PT-01-00
FORMULA_NAME PermAdmissibility-PT-01-01
FORMULA_NAME PermAdmissibility-PT-01-02
FORMULA_NAME PermAdmissibility-PT-01-03
FORMULA_NAME PermAdmissibility-PT-01-04
FORMULA_NAME PermAdmissibility-PT-01-05
FORMULA_NAME PermAdmissibility-PT-01-06
FORMULA_NAME PermAdmissibility-PT-01-07
FORMULA_NAME PermAdmissibility-PT-01-08
FORMULA_NAME PermAdmissibility-PT-01-09
FORMULA_NAME PermAdmissibility-PT-01-10
FORMULA_NAME PermAdmissibility-PT-01-11
FORMULA_NAME PermAdmissibility-PT-01-12
FORMULA_NAME PermAdmissibility-PT-01-13
FORMULA_NAME PermAdmissibility-PT-01-14
FORMULA_NAME PermAdmissibility-PT-01-15

=== Now, execution of the tool begins

BK_START 1621015396520

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 18:03:18] [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-14 18:03:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 18:03:18] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2021-05-14 18:03:18] [INFO ] Transformed 168 places.
[2021-05-14 18:03:18] [INFO ] Transformed 592 transitions.
[2021-05-14 18:03:18] [INFO ] Parsed PT model containing 168 places and 592 transitions in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 5882 resets, run finished after 728 ms. (steps per millisecond=137 ) properties seen :[1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1]
// Phase 1: matrix 592 rows 168 cols
[2021-05-14 18:03:19] [INFO ] Computed 32 place invariants in 34 ms
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 26 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 6 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 6 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 5 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 8 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 5 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 11 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 9 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 14 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 25 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 8 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 3 ms returned unsat
[2021-05-14 18:03:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 13 ms returned unsat
Successfully simplified 22 atomic propositions for a total of 28 simplifications.
[2021-05-14 18:03:20] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-14 18:03:20] [INFO ] Flatten gal took : 108 ms
FORMULA PermAdmissibility-PT-01-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 18:03:20] [INFO ] Flatten gal took : 57 ms
[2021-05-14 18:03:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-14 18:03:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PermAdmissibility-PT-01 @ 3570 seconds

FORMULA PermAdmissibility-PT-01-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-01-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-01-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-01-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-01-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-01-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PermAdmissibility-PT-01-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3561
rslt: Output for LTLCardinality @ PermAdmissibility-PT-01

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "X (F ((X (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148))) OR (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148)) OR (p127 + p129 + p130 + p131 + p132 + p149 + p150 + p151 <= p105 + p107 + p108 + p94)))))",
"processed_size": 247,
"rewrites": 41
},
"result":
{
"edges": 4,
"markings": 5,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (((1 <= p98) U X (F ((p152 <= p141))))))",
"processed_size": 45,
"rewrites": 41
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 712
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p145 + 1 <= p89)))",
"processed_size": 25,
"rewrites": 41
},
"result":
{
"edges": 17,
"markings": 17,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "G ((G ((G ((1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60)) OR G ((1 <= p164)))) OR ((p90 + p88 + p86 + p85 + p79 + p89 + p91 + p92 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60) OR (1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60))))",
"processed_size": 245,
"rewrites": 41
},
"result":
{
"edges": 17,
"markings": 17,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 3562
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)",
"processed_size": 51,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)",
"processed_size": 51,
"rewrites": 41
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G ((F ((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43)) AND (F (G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND G (((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43) OR G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))))))",
"processed_size": 356,
"rewrites": 41
},
"result":
{
"edges": 150836,
"markings": 63268,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24276,
"runtime": 9.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G((G(**) OR G(**))) OR (** OR **))) : X(F((X(F(*)) OR (F(**) OR **)))) : (G((F(**) AND (F(G(**)) AND G((** OR G(**)))))) OR **) : X(X((** U X(F(**))))) : G(F(*)) : G(F(**)) : (X(**) OR G(**))"
},
"net":
{
"arcs": 3456,
"conflict_clusters": 72,
"places": 168,
"places_significant": 136,
"singleton_clusters": 0,
"transitions": 592
},
"result":
{
"preliminary_value": "no yes no yes no yes no ",
"value": "no yes no yes no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 760/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5376
lola: finding significant places
lola: 168 places, 592 transitions, 136 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: G (((G ((G ((1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60)) OR G ((1 <= p164)))) OR (p90 + p88 + p86 + p85 + p79 + p89 + p91 + p92 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60)) OR (1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60))) : X (F (((F (NOT(X ((p147 + p148 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))) OR F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148))) OR (p127 + p129 + p130 + p131 + p132 + p149 + p150 + p151 <= p105 + p107 + p108 + p94)))) : (G ((F ((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43)) AND G (((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43) U G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))))) OR (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) : X ((((1 <= 0) U X ((1 <= p98))) U ((1 <= 0) U F (X (((1 <= 0) U X ((p152 <= p141)))))))) : F (((0 <= 0) U NOT(F (G (X (X (G ((p89 <= p145))))))))) : G (F (NOT(G (X (NOT(F ((p102 <= p157)))))))) : (X ((1 <= p157)) OR G ((1 <= p157)))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148))) OR (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148)) OR (p127 + p129 + p130 + p131 + p132 + p149 + p150 + p151 <= p105 + p107 + p108 + p94)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148))) OR (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p147 + p148)) OR (p127 + p129 + p130 + p131 + p132 + p149 + p150 + p151 <= p105 + p107 + p108 + p94)))))
lola: processed formula length: 247
lola: 41 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((1 <= p98) U X (F ((p152 <= p141))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((1 <= p98) U X (F ((p152 <= p141))))))
lola: processed formula length: 45
lola: 41 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 2 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p157)) OR G ((1 <= p157)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p157))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p157))
lola: processed formula length: 15
lola: 41 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p157))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p157))
lola: processed formula length: 15
lola: 41 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: 17 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p102 <= p157)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p102 <= p157)))
lola: processed formula length: 22
lola: 41 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 52793 markings, 73544 edges
lola: ========================================
lola: subprocess 4 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p145 + 1 <= p89)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p145 + 1 <= p89)))
lola: processed formula length: 25
lola: 41 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 5 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((G ((1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60)) OR G ((1 <= p164)))) OR ((p90 + p88 + p86 + p85 + p79 + p89 + p91 + p92 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60) OR (1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((G ((1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60)) OR G ((1 <= p164)))) OR ((p90 + p88 + p86 + p85 + p79 + p89 + p91 + p92 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60) OR (1 <= p49 + p50 + p51 + p53 + p54 + p55 + p56 + p60))))
lola: processed formula length: 245
lola: 41 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: 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 6 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((F ((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43)) AND (F (G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND G (((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43) OR G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))))) OR (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: processed formula length: 51
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 ((F ((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43)) AND (F (G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND G (((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43) OR G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))))) OR (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p116 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: processed formula length: 51
lola: 41 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43)) AND (F (G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND G (((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43) OR G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43)) AND (F (G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND G (((p109 + p110 + p111 + p112 + p113 + p114 + p115 + p124 <= p33 + p34 + p36 + p37 + p38 + p39 + p40 + p43) OR G ((1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))))))
lola: processed formula length: 356
lola: 41 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: 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: 63268 markings, 150836 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no yes no
lola:
preliminary result: no yes no yes no yes no
lola: memory consumption: 24276 KB
lola: time consumption: 9 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="PermAdmissibility-PT-01"
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 PermAdmissibility-PT-01, 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 r151-tall-162089151300253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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