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

About the Execution of 2020-gold for ServersAndClients-PT-200040

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5561.247 3600000.00 766071.00 2161.50 FFFFTFFFFFFFTFFT 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.r322-tall-162132127800082.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 ServersAndClients-PT-200040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132127800082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 138K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 12 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.9K May 11 20:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 20:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 11 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 16M May 12 08:13 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 ServersAndClients-PT-200040-00
FORMULA_NAME ServersAndClients-PT-200040-01
FORMULA_NAME ServersAndClients-PT-200040-02
FORMULA_NAME ServersAndClients-PT-200040-03
FORMULA_NAME ServersAndClients-PT-200040-04
FORMULA_NAME ServersAndClients-PT-200040-05
FORMULA_NAME ServersAndClients-PT-200040-06
FORMULA_NAME ServersAndClients-PT-200040-07
FORMULA_NAME ServersAndClients-PT-200040-08
FORMULA_NAME ServersAndClients-PT-200040-09
FORMULA_NAME ServersAndClients-PT-200040-10
FORMULA_NAME ServersAndClients-PT-200040-11
FORMULA_NAME ServersAndClients-PT-200040-12
FORMULA_NAME ServersAndClients-PT-200040-13
FORMULA_NAME ServersAndClients-PT-200040-14
FORMULA_NAME ServersAndClients-PT-200040-15

=== Now, execution of the tool begins

BK_START 1621441168102

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 16:19:29] [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]
[2021-05-19 16:19:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 16:19:30] [INFO ] Load time of PNML (sax parser for PT used): 531 ms
[2021-05-19 16:19:30] [INFO ] Transformed 8841 places.
[2021-05-19 16:19:30] [INFO ] Transformed 16400 transitions.
[2021-05-19 16:19:30] [INFO ] Found NUPN structural information;
[2021-05-19 16:19:30] [INFO ] Parsed PT model containing 8841 places and 16400 transitions in 639 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 135 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 2492 ms. (steps per millisecond=40 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16400 rows 8841 cols
[2021-05-19 16:19:33] [INFO ] Computed 441 place invariants in 572 ms
[2021-05-19 16:19:35] [INFO ] [Real]Absence check using 241 positive place invariants in 558 ms returned unsat
[2021-05-19 16:19:38] [INFO ] [Real]Absence check using 241 positive place invariants in 1404 ms returned sat
[2021-05-19 16:19:39] [INFO ] [Real]Absence check using 241 positive and 200 generalized place invariants in 1440 ms returned sat
[2021-05-19 16:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 16:19:55] [INFO ] [Real]Absence check using state equation in 16104 ms returned (error "Solver has unexpectedly terminated")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-19 16:19:56] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-19 16:19:56] [INFO ] Flatten gal took : 751 ms
FORMULA ServersAndClients-PT-200040-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-200040-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 16:19:56] [INFO ] Applying decomposition
[2021-05-19 16:19:57] [INFO ] Flatten gal took : 549 ms
[2021-05-19 16:19:57] [INFO ] Decomposing Gal with order
[2021-05-19 16:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 16:22:49] [INFO ] Removed a total of 15920 redundant transitions.
[2021-05-19 16:22:55] [INFO ] Flatten gal took : 176587 ms
[2021-05-19 16:23:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 16000 labels/synchronizations in 4367 ms.
[2021-05-19 16:23:05] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-19 16:23:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 106 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ServersAndClients-PT-200040 @ 3570 seconds

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

FORMULA ServersAndClients-PT-200040-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ServersAndClients-PT-200040-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3045
rslt: Output for LTLFireability @ ServersAndClients-PT-200040

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 16:23:06 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 305
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 3,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((G ((F (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027))) AND (F (((1 <= p3102))) OR X (F (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027))))))) OR G (((1 <= p761) AND (p5223 <= 1) AND (1 <= p5223))))))",
"processed_size": 206,
"rewrites": 26
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 339
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 2,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((((1 <= p8) AND (p400 <= 1) AND (1 <= p400)) U G ((X (((1 <= p8) AND (p400 <= 1) AND (1 <= p400))) AND (((p411 <= 1) AND (1 <= p411)) AND ((p1002 <= 1) AND (1 <= p1002)))))) U G (((2 <= p411) OR (p411 <= 0) OR (2 <= p1002) OR (p1002 <= 0))))",
"processed_size": 245,
"rewrites": 26
},
"result":
{
"edges": 15920,
"markings": 8160,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 381
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F (((1 <= p1517))))",
"processed_size": 22,
"rewrites": 26
},
"result":
{
"edges": 5,
"markings": 5,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((1 <= p1567))",
"processed_size": 14,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (((1 <= p1005))) AND G (((1 <= p645) AND (p1404 <= 1) AND (1 <= p1404)))))",
"processed_size": 80,
"rewrites": 26
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"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": 610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G (F ((X (F ((((2 <= p543) OR (p543 <= 0) OR (2 <= p5625) OR (p5625 <= 0)) AND ((2 <= p6598) OR (p6598 <= 0))))) OR ((1 <= p695) AND (p1002 <= 1) AND (1 <= p1002)))))",
"processed_size": 170,
"rewrites": 26
},
"result":
{
"edges": 32801,
"markings": 16762,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 761
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p509 <= 0) OR (2 <= p2811) OR (p2811 <= 0))",
"processed_size": 47,
"rewrites": 28
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 440
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3047
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((G (((2 <= p493) OR (p493 <= 0) OR (2 <= p801) OR (p801 <= 0))) OR ((1 <= p531) AND (p6630 <= 1) AND (1 <= p6630))) AND ((p531 <= 0) OR (2 <= p6630) OR (p6630 <= 0)))))",
"processed_size": 180,
"rewrites": 26
},
"result":
{
"edges": 12473,
"markings": 6392,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1300668,
"runtime": 525.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((G((F(**) AND (F(**) OR X(F(**))))) OR G(**)))) : G(F(((G(*) OR *) AND *))) : ((** U G((X(**) AND (** AND **)))) U G(**)) : X(F(**)) : F(G(**)) : F(**) : (X(F(**)) OR ((** U **) AND **)) : X((X(**) AND G(**))) : F(G(*)) : G(F((X(F(**)) OR **)))"
},
"net":
{
"arcs": 49600,
"conflict_clusters": 8202,
"places": 8841,
"places_significant": 8400,
"singleton_clusters": 0,
"transitions": 16400
},
"result":
{
"preliminary_value": "no no no no no no yes no no yes ",
"value": "no no no no no no yes no no 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: 25241/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 282912
lola: finding significant places
lola: 8841 places, 16400 transitions, 8400 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: (p3102 <= 1)
lola: LP says that atomic proposition is always true: (p713 <= 1)
lola: LP says that atomic proposition is always true: (p761 <= 1)
lola: LP says that atomic proposition is always true: (p531 <= 1)
lola: LP says that atomic proposition is always true: (p531 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p1517 <= 1)
lola: LP says that atomic proposition is always true: (p509 <= 1)
lola: LP says that atomic proposition is always true: (p1567 <= 1)
lola: LP says that atomic proposition is always true: (p1567 <= 1)
lola: LP says that atomic proposition is always true: (p1005 <= 1)
lola: LP says that atomic proposition is always true: (p645 <= 1)
lola: LP says that atomic proposition is always true: (p1137 <= 1)
lola: LP says that atomic proposition is always true: (p695 <= 1)
lola: F (G (X ((G ((F (((1 <= p3102))) U F (X (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027)))))) OR G (((1 <= p761) AND (p5223 <= 1) AND (1 <= p5223))))))) : G (NOT(G (((F (((p493 <= 1) AND (1 <= p493) AND (p801 <= 1) AND (1 <= p801))) AND ((p531 <= 0) OR (2 <= p6630) OR (p6630 <= 0))) OR ((1 <= p531) AND (p6630 <= 1) AND (1 <= p6630)))))) : ((((1 <= p8) AND (p400 <= 1) AND (1 <= p400)) U G (((X (((1 <= p8) AND (p400 <= 1) AND (1 <= p400))) AND ((p411 <= 1) AND (1 <= p411))) AND ((p1002 <= 1) AND (1 <= p1002))))) U G (((2 <= p411) OR (p411 <= 0) OR (2 <= p1002) OR (p1002 <= 0)))) : X (F (((1 <= p1517)))) : F (G (((p443 <= 1) AND (1 <= p443) AND (p8640 <= 1) AND (1 <= p8640)))) : F (((1 <= p509) AND (p2811 <= 1) AND (1 <= p2811))) : (X (F (((2 <= p477) OR (p477 <= 0) OR (2 <= p1806) OR (p1806 <= 0)))) OR ((((p6520 <= 1) AND (1 <= p6520)) U ((1 <= p1567))) AND ((1 <= p1567)))) : X ((X (((1 <= p1005))) AND G (((1 <= p645) AND (p1404 <= 1) AND (1 <= p1404))))) : F (X (G (((((p493 <= 1) AND (1 <= p493) AND (p6831 <= 1) AND (1 <= p6831)) U ((1 <= p1137))) U F (NOT(F (((2 <= p493) OR (p493 <= 0) OR (2 <= p6831) OR (p6831 <= 0))))))))) : X (G (F ((F (X ((((2 <= p543) OR (p543 <= 0) OR (2 <= p5625) OR (p5625 <= 0)) AND ((2 <= p6598) OR (p6598 <= 0))))) OR ((1 <= p695) AND (p1002 <= 1) AND (1 <= p1002))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
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: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 305 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((F (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027))) AND (F (((1 <= p3102))) OR X (F (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027))))))) OR G (((1 <= p761) AND (p5223 <= 1) AND (1 <= p5223))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((F (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027))) AND (F (((1 <= p3102))) OR X (F (((1 <= p713) AND (p6027 <= 1) AND (1 <= p6027))))))) OR G (((1 <= p761) AND (p5223 <= 1) AND (1 <= p5223))))))
lola: processed formula length: 206
lola: 26 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 339 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p8) AND (p400 <= 1) AND (1 <= p400)) U G ((X (((1 <= p8) AND (p400 <= 1) AND (1 <= p400))) AND (((p411 <= 1) AND (1 <= p411)) AND ((p1002 <= 1) AND (1 <= p1002)))))) U G (((2 <= p411) OR (p411 <= 0) OR (2 <= p1002) OR (p1002 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p8) AND (p400 <= 1) AND (1 <= p400)) U G ((X (((1 <= p8) AND (p400 <= 1) AND (1 <= p400))) AND (((p411 <= 1) AND (1 <= p411)) AND ((p1002 <= 1) AND (1 <= p1002)))))) U G (((2 <= p411) OR (p411 <= 0) OR (2 <= p1002) OR (p1002 <= 0))))
lola: processed formula length: 245
lola: 26 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 8160 markings, 15920 edges
lola: ========================================
lola: subprocess 2 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p1517))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p1517))))
lola: processed formula length: 22
lola: 26 rewrites
lola: closed formula file LTLFireability.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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((2 <= p477) OR (p477 <= 0) OR (2 <= p1806) OR (p1806 <= 0)))) OR ((((p6520 <= 1) AND (1 <= p6520)) U ((1 <= p1567))) AND ((1 <= p1567))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1567))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1567))
lola: processed formula length: 14
lola: 26 rewrites
lola: closed formula file LTLFireability.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: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((2 <= p477) OR (p477 <= 0) OR (2 <= p1806) OR (p1806 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((2 <= p477) OR (p477 <= 0) OR (2 <= p1806) OR (p1806 <= 0))))
lola: processed formula length: 71
lola: 26 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 241 markings, 240 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((1 <= p1005))) AND G (((1 <= p645) AND (p1404 <= 1) AND (1 <= p1404)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((1 <= p1005))) AND G (((1 <= p645) AND (p1404 <= 1) AND (1 <= p1404)))))
lola: processed formula length: 80
lola: 26 rewrites
lola: closed formula file LTLFireability.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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (F ((((2 <= p543) OR (p543 <= 0) OR (2 <= p5625) OR (p5625 <= 0)) AND ((2 <= p6598) OR (p6598 <= 0))))) OR ((1 <= p695) AND (p1002 <= 1) AND (1 <= p1002)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (F ((((2 <= p543) OR (p543 <= 0) OR (2 <= p5625) OR (p5625 <= 0)) AND ((2 <= p6598) OR (p6598 <= 0))))) OR ((1 <= p695) AND (p1002 <= 1) AND (1 <= p1002)))))
lola: processed formula length: 170
lola: 26 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 16762 markings, 32801 edges
lola: ========================================
lola: subprocess 6 will run for 761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p509) AND (p2811 <= 1) AND (1 <= p2811)))
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: ((p509 <= 0) OR (2 <= p2811) OR (p2811 <= 0))
lola: processed formula length: 47
lola: 28 rewrites
lola: closed formula file LTLFireability.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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 1015 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p493 <= 1) AND (1 <= p493) AND (p6831 <= 1) AND (1 <= p6831))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p493 <= 1) AND (1 <= p493) AND (p6831 <= 1) AND (1 <= p6831))))
lola: processed formula length: 71
lola: 26 rewrites
lola: closed formula file LTLFireability.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: 5 markings, 6 edges
lola: ========================================
lola: subprocess 8 will run for 1523 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p443 <= 1) AND (1 <= p443) AND (p8640 <= 1) AND (1 <= p8640))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p443 <= 1) AND (1 <= p443) AND (p8640 <= 1) AND (1 <= p8640))))
lola: processed formula length: 71
lola: 26 rewrites
lola: closed formula file LTLFireability.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: 5 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 3047 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G (((2 <= p493) OR (p493 <= 0) OR (2 <= p801) OR (p801 <= 0))) OR ((1 <= p531) AND (p6630 <= 1) AND (1 <= p6630))) AND ((p531 <= 0) OR (2 <= p6630) OR (p6630 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((G (((2 <= p493) OR (p493 <= 0) OR (2 <= p801) OR (p801 <= 0))) OR ((1 <= p531) AND (p6630 <= 1) AND (1 <= p6630))) AND ((p531 <= 0) OR (2 <= p6630) OR (p6630 <= 0)))))
lola: processed formula length: 180
lola: 26 rewrites
lola: closed formula file LTLFireability.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: add low 14068
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: 6392 markings, 12473 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no yes
lola:
preliminary result: no no no no no no yes no no yes
lola: memory consumption: 1300668 KB
lola: time consumption: 525 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="ServersAndClients-PT-200040"
export BK_EXAMINATION="LTLFireability"
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 ServersAndClients-PT-200040, 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 r322-tall-162132127800082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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