Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r172-smll-158987827800394.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Referendum-PT-0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-158987827800394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 9.1K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 11 09:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 11 09:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 9 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 21:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 12K Mar 24 05:38 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 Referendum-PT-0010-00
FORMULA_NAME Referendum-PT-0010-01
FORMULA_NAME Referendum-PT-0010-02
FORMULA_NAME Referendum-PT-0010-03
FORMULA_NAME Referendum-PT-0010-04
FORMULA_NAME Referendum-PT-0010-05
FORMULA_NAME Referendum-PT-0010-06
FORMULA_NAME Referendum-PT-0010-07
FORMULA_NAME Referendum-PT-0010-08
FORMULA_NAME Referendum-PT-0010-09
FORMULA_NAME Referendum-PT-0010-10
FORMULA_NAME Referendum-PT-0010-11
FORMULA_NAME Referendum-PT-0010-12
FORMULA_NAME Referendum-PT-0010-13
FORMULA_NAME Referendum-PT-0010-14
FORMULA_NAME Referendum-PT-0010-15

=== Now, execution of the tool begins

BK_START 1591435696159

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 09:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-06 09:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 09:28:19] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-06-06 09:28:19] [INFO ] Transformed 31 places.
[2020-06-06 09:28:19] [INFO ] Transformed 21 transitions.
[2020-06-06 09:28:19] [INFO ] Found NUPN structural information;
[2020-06-06 09:28:19] [INFO ] Parsed PT model containing 31 places and 21 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 37 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 8333 resets, run finished after 420 ms. (steps per millisecond=238 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 21 rows 31 cols
[2020-06-06 09:28:19] [INFO ] Computed 10 place invariants in 4 ms
[2020-06-06 09:28:19] [INFO ] [Real]Absence check using 10 positive place invariants in 28 ms returned unsat
[2020-06-06 09:28:20] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-06 09:28:20] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-06 09:28:20] [INFO ] Flatten gal took : 52 ms
FORMULA Referendum-PT-0010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 09:28:20] [INFO ] Applying decomposition
[2020-06-06 09:28:20] [INFO ] Flatten gal took : 13 ms
[2020-06-06 09:28:20] [INFO ] Decomposing Gal with order
[2020-06-06 09:28:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-06 09:28:20] [INFO ] Flatten gal took : 50 ms
[2020-06-06 09:28:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-06-06 09:28:20] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2020-06-06 09:28:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Referendum-PT-0010 @ 3570 seconds

FORMULA Referendum-PT-0010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0010-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: -1
rslt: Output for LTLFireability @ Referendum-PT-0010

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat Jun 6 09:28:21 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 21,
"adisj": 12,
"aneg": 2,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G ((X (G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))))) AND (G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))))))",
"processed_size": 530,
"rewrites": 78
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 30,
"adisj": 3,
"aneg": 2,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))) U X (G ((G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))))))))",
"processed_size": 528,
"rewrites": 78
},
"result":
{
"edges": 4722061,
"markings": 238002,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 82852,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((X(G(*)) AND (G(*) OR **))) : X((** U X(G((G(*) OR *))))) : (X(F(*)) OR G(((* R *) AND *))) : X(G((** OR (F(**) AND F(G(*)))))) : G(F(*)) : F(G((X(**) AND (** OR ((** U **) AND **))))) : F(G((** OR (G(**) AND F(**))))) : (X(G((G(F(*)) AND **))) AND F(**)) : X(F(**)) : (G(**) OR ((** U **) AND G(**))) : X(G(*)) : (F(((* R *) AND X(*))) AND (F(*) AND **)) : X(F(**))"
},
"net":
{
"arcs": 51,
"conflict_clusters": 31,
"places": 31,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 21
},
"result":
{
"interim_value": "no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown ",
"preliminary_value": "no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown "
},
"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: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 31
lola: finding significant places
lola: 31 places, 21 transitions, 21 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 LTLFireability.xml
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: G ((NOT(X (F ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))))) AND (NOT(F ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))))) : (X ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))) U X (G (NOT(X ((F ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))) AND (((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))))))))) : (NOT(G (X ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))))) OR NOT(F (((((1 <= p0)) U (((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))) OR ((1 <= p0)))))) : X (NOT(F (NOT((NOT(G (F ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))))) U (((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))))))) : NOT(G (F (G ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))))))) : G (F (G ((X (((1 <= p0))) AND ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))) OR (((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))) U ((1 <= p0))) AND (((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))))))))) : F (X (F (((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))) U F (X (F (((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))) U G ((G ((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30)))) U (((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))))))))))))) : (X (G ((NOT(X (F (G (((1 <= p21)))))) AND ((1 <= p28))))) AND F (((1 <= p26)))) : F (X (((1 <= p22)))) : (G (((1 <= p0))) OR ((((1 <= p0)) U ((1 <= p28))) AND G (((p0 <= 0))))) : NOT(F (X ((((1 <= p30)) OR ((1 <= p0)))))) : ((NOT(G (((((1 <= p29)) U ((1 <= p0))) OR X (((1 <= p0)))))) AND NOT(G (((1 <= p24))))) AND ((p30 <= 0))) : F (((1 <= 0) U X (((1 <= p25)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))))) AND (G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))))) AND (G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23... (shortened)
lola: processed formula length: 530
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))) U X (G ((G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p21)) OR ((1 <= p22)) OR ((1 <= p23)) OR ((1 <= p24)) OR ((1 <= p25)) OR ((1 <= p26)) OR ((1 <= p27)) OR ((1 <= p28)) OR ((1 <= p29)) OR ((1 <= p30))) U X (G ((G ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) OR (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= ... (shortened)
lola: processed formula length: 528
lola: 78 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 238002 markings, 4722061 edges
lola: ========================================
lola: subprocess 2 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0))))) OR G (((((p0 <= 0)) R (((p21 <= 0)) AND ((p22 <= 0)) AND ((p23 <= 0)) AND ((p24 <= 0)) AND ((p25 <= 0)) AND ((p26 <= 0)) AND ((p27 <= 0)) AND ((p28 <= 0)) AND ((p29 <= 0)) AND ((p30 <= 0)))) AND ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 82852 KB
lola: time consumption: 331 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 82852 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16066128 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16066396 kB

--------------------
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="Referendum-PT-0010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Referendum-PT-0010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r172-smll-158987827800394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0010.tgz
mv Referendum-PT-0010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;