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.r075-tall-162039097000010.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 DES-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097000010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K 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 DES-PT-01a-00
FORMULA_NAME DES-PT-01a-01
FORMULA_NAME DES-PT-01a-02
FORMULA_NAME DES-PT-01a-03
FORMULA_NAME DES-PT-01a-04
FORMULA_NAME DES-PT-01a-05
FORMULA_NAME DES-PT-01a-06
FORMULA_NAME DES-PT-01a-07
FORMULA_NAME DES-PT-01a-08
FORMULA_NAME DES-PT-01a-09
FORMULA_NAME DES-PT-01a-10
FORMULA_NAME DES-PT-01a-11
FORMULA_NAME DES-PT-01a-12
FORMULA_NAME DES-PT-01a-13
FORMULA_NAME DES-PT-01a-14
FORMULA_NAME DES-PT-01a-15

=== Now, execution of the tool begins

BK_START 1620498850989

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 18:34:13] [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-08 18:34:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 18:34:13] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-08 18:34:13] [INFO ] Transformed 119 places.
[2021-05-08 18:34:13] [INFO ] Transformed 76 transitions.
[2021-05-08 18:34:13] [INFO ] Found NUPN structural information;
[2021-05-08 18:34:13] [INFO ] Parsed PT model containing 119 places and 76 transitions in 81 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2464 steps, including 97 resets, run visited all 35 properties in 26 ms. (steps per millisecond=94 )
[2021-05-08 18:34:13] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-08 18:34:13] [INFO ] Flatten gal took : 43 ms
FORMULA DES-PT-01a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 18:34:13] [INFO ] Applying decomposition
[2021-05-08 18:34:13] [INFO ] Flatten gal took : 12 ms
[2021-05-08 18:34:13] [INFO ] Decomposing Gal with order
[2021-05-08 18:34:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 18:34:13] [INFO ] Removed a total of 20 redundant transitions.
[2021-05-08 18:34:13] [INFO ] Flatten gal took : 40 ms
[2021-05-08 18:34:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2021-05-08 18:34:13] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-08 18:34:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ DES-PT-01a @ 3570 seconds

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

FORMULA DES-PT-01a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DES-PT-01a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-01a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DES-PT-01a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2352
rslt: Output for LTLFireability @ DES-PT-01a

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 5,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((((p6 <= 0) OR (p19 <= 0)) AND (G (((p6 <= 0) OR (p19 <= 0))) OR G (F ((G (((p96 <= 0) OR (2 <= p101) OR (p101 <= 0))) AND ((p6 <= 0) OR (p19 <= 0)))))))) AND F (((p96 <= 0) OR (2 <= p101) OR (p101 <= 0)))))",
"processed_size": 221,
"rewrites": 126
},
"result":
{
"edges": 195736782,
"markings": 22396652,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 281
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 3,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((G ((((1 <= p18) AND (1 <= p92)) OR ((1 <= p50) AND (1 <= p67)))) R X (((1 <= p18) AND (1 <= p92))))))",
"processed_size": 109,
"rewrites": 126
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 306
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G (((p72 <= 0) OR (p88 <= 0))) OR (((p17 <= 0) OR (p24 <= 0)) AND ((p72 <= 0) OR (p88 <= 0))))))",
"processed_size": 106,
"rewrites": 126
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 337
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 1,
"adisj": 3,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(F ((((p23 <= 0) OR (p25 <= 0)) AND ((p48 <= 0) OR (p65 <= 0)))) U X (X (((1 <= p13) AND (1 <= p98)))))",
"processed_size": 105,
"rewrites": 126
},
"result":
{
"edges": 17,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 375
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 7,
"adisj": 0,
"aneg": 2,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 5,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((F ((X (((p103 <= 0) OR (p113 <= 0))) OR ((1 <= p103) AND (1 <= p113)))) AND (F (((1 <= p2) AND (1 <= p114))) OR (((1 <= p2) AND (1 <= p114)) OR (((1 <= p50) AND (1 <= p67)) OR (X (((p103 <= 0) OR (p113 <= 0))) OR ((1 <= p103) AND (1 <= p113)))))))))",
"processed_size": 258,
"rewrites": 126
},
"result":
{
"edges": 60861,
"markings": 15727,
"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": 422
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 422
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p20) AND (1 <= p30)) U ((1 <= p56) AND (1 <= p73)))",
"processed_size": 59,
"rewrites": 126
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F (((1 <= p20) AND (1 <= p30))) OR ((1 <= p36) AND (1 <= p99)))))",
"processed_size": 72,
"rewrites": 126
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 482
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (G ((X (X (G (((p8 <= 0) OR (p28 <= 0))))) AND ((p77 <= 0) OR (p79 <= 0) OR (p81 <= 0) OR (p83 <= 0) OR (p85 <= 0) OR (p87 <= 0) OR (p89 <= 0) OR (p91 <= 0)))))",
"processed_size": 170,
"rewrites": 126
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"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": 562
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p66) AND (1 <= p82))) AND ((1 <= p6))))",
"processed_size": 53,
"rewrites": 126
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": 675
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F (((p20 <= 0) OR (p30 <= 0)))) AND ((p6 <= 0))))",
"processed_size": 57,
"rewrites": 126
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 675
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 4,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (X (F ((G (((p70 <= 0) OR (p86 <= 0))) OR (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)) AND (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)) AND ((p70 <= 0) OR (p86 <= 0))))))))",
"processed_size": 174,
"rewrites": 126
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 844
},
"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": 3,
"visible_transitions": 0
},
"processed": "((p41 <= 0) OR (p43 <= 0) OR (p100 <= 0))",
"processed_size": 43,
"rewrites": 128
},
"result":
{
"edges": 25,
"markings": 26,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1125
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F (G (((p5 <= 0) OR (p7 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0))))",
"processed_size": 93,
"rewrites": 126
},
"result":
{
"edges": 22076,
"markings": 5178,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 1688
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((G (((p21 <= 0) OR (p22 <= 0))) OR F (((p1 <= 0) OR (p37 <= 0) OR (p39 <= 0))))))",
"processed_size": 90,
"rewrites": 126
},
"result":
{
"edges": 887582014,
"markings": 96301944,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"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": 2352
},
"child":
[

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p107) AND (1 <= p113))",
"processed_size": 29,
"rewrites": 126
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((((1 <= p107) AND (1 <= p113)) OR (G (((p107 <= 0) OR (p113 <= 0))) AND F (((1 <= p107) AND (1 <= p113))))))",
"processed_size": 112,
"rewrites": 126
},
"result":
{
"edges": 26,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 52120,
"runtime": 1218.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : X((G((* AND (G(*) OR G(F((G(*) AND *)))))) AND F(*))) : X(X((G(*) R X(*)))) : F(G((G(*) OR F(*)))) : X(F((G(*) OR (* AND *)))) : F(**) : (F(**) U X(X(*))) : X(G((F((X(*) OR **)) AND (F(**) OR (** OR (** OR (X(*) OR **))))))) : (X(F((F(**) OR **))) OR (** U **)) : (G((** OR (G(**) AND F(**)))) OR **) : X(G((X(X(G(*))) AND *))) : (F((X(F(*)) AND *)) OR X((G(**) AND **))) : X(X(F((G(*) OR (* AND (* AND *))))))"
},
"net":
{
"arcs": 317,
"conflict_clusters": 46,
"places": 119,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no no no yes yes no yes no no no no yes yes ",
"value": "no no no yes yes no yes no no no no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 181/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 119
lola: finding significant places
lola: 119 places, 62 transitions, 60 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: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 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: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p99 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: G (F (NOT(F (X (X (F (X (((1 <= p5) AND (1 <= p7) AND (1 <= p11) AND (1 <= p12) AND (1 <= p14) AND (1 <= p16)))))))))) : NOT(X ((F ((F (G (X ((F (((1 <= p96) AND (p101 <= 1) AND (1 <= p101))) OR ((1 <= p6) AND (1 <= p19)))))) U ((1 <= p6) AND (1 <= p19)))) OR G (((1 <= p96) AND (p101 <= 1) AND (1 <= p101)))))) : X (X (NOT((F ((((p18 <= 0) OR (p92 <= 0)) AND ((p50 <= 0) OR (p67 <= 0)))) U X (((p18 <= 0) OR (p92 <= 0))))))) : G (F ((((1 <= p1) AND (1 <= p37) AND (1 <= p39)) U G (X (NOT(X ((F (((1 <= p21) AND (1 <= p22))) AND G (((1 <= p1) AND (1 <= p37) AND (1 <= p39))))))))))) : NOT(X (G ((((1 <= p17) AND (1 <= p24)) U ((1 <= p72) AND (1 <= p88)))))) : F ((F (((((X (X ((((1 <= p52) AND (1 <= p69)) OR ((1 <= p46) AND (1 <= p63))))) AND X (((1 <= p26) AND (1 <= p31) AND (1 <= p33)))) AND ((1 <= p41))) AND ((1 <= p43))) AND ((1 <= p100)))) U ((1 <= p41) AND (1 <= p43) AND (1 <= p100)))) : (NOT(G (NOT(F ((((p23 <= 0) OR (p25 <= 0)) AND ((p48 <= 0) OR (p65 <= 0))))))) U X (NOT(X (((p13 <= 0) OR (p98 <= 0)))))) : G (X (G ((((F (((1 <= p2) AND (1 <= p114))) OR ((1 <= p2) AND (1 <= p114))) OR ((1 <= p50) AND (1 <= p67))) U (NOT(X (((1 <= p103) AND (1 <= p113)))) OR ((1 <= p103) AND (1 <= p113))))))) : (X (F ((F (((1 <= p20) AND (1 <= p30))) OR ((1 <= p36) AND (1 <= p99))))) OR (((1 <= p20) AND (1 <= p30)) U ((1 <= p56) AND (1 <= p73)))) : (G ((G (((p107 <= 0) OR (p113 <= 0))) U ((1 <= p107) AND (1 <= p113)))) OR ((1 <= p107) AND (1 <= p113))) : G (NOT(X ((F (X (X (((1 <= p8) AND (1 <= p28))))) OR ((1 <= p77) AND (1 <= p79) AND (1 <= p81) AND (1 <= p83) AND (1 <= p85) AND (1 <= p87) AND (1 <= p89) AND (1 <= p91)))))) : (NOT(G ((X (G (((1 <= p20) AND (1 <= p30)))) OR ((1 <= p6))))) OR X ((G (((1 <= p66) AND (1 <= p82))) AND ((1 <= p6))))) : F (NOT(G ((X ((X (((1 <= p26) AND (1 <= p31) AND (1 <= p33))) OR X (((1 <= p26) AND (1 <= p31) AND (1 <= p33))))) U X (X (((1 <= p70) AND (1 <= p86))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:356
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:318
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p6 <= 0) OR (p19 <= 0)) AND (G (((p6 <= 0) OR (p19 <= 0))) OR G (F ((G (((p96 <= 0) OR (2 <= p101) OR (p101 <= 0))) AND ((p6 <= 0) OR (p19 <= 0)))))))) AND F (((p96 <= 0) OR (2 <= p101) OR (p101 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p6 <= 0) OR (p19 <= 0)) AND (G (((p6 <= 0) OR (p19 <= 0))) OR G (F ((G (((p96 <= 0) OR (2 <= p101) OR (p101 <= 0))) AND ((p6 <= 0) OR (p19 <= 0)))))))) AND F (((p96 <= 0) OR (2 <= p101) OR (p101 <= 0)))))
lola: processed formula length: 221
lola: 126 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: 723423 markings, 5483934 edges, 144685 markings/sec, 0 secs
lola: 1417497 markings, 10837988 edges, 138815 markings/sec, 5 secs
lola: 2070061 markings, 16098054 edges, 130513 markings/sec, 10 secs
lola: 2674734 markings, 21369756 edges, 120935 markings/sec, 15 secs
lola: 3281486 markings, 26667386 edges, 121350 markings/sec, 20 secs
lola: 3866683 markings, 31794042 edges, 117039 markings/sec, 25 secs
lola: 4508807 markings, 37141458 edges, 128425 markings/sec, 30 secs
lola: 5148671 markings, 42344810 edges, 127973 markings/sec, 35 secs
lola: 5748173 markings, 47578717 edges, 119900 markings/sec, 40 secs
lola: 6318804 markings, 52624834 edges, 114126 markings/sec, 45 secs
lola: 6900457 markings, 57827054 edges, 116331 markings/sec, 50 secs
lola: 7531539 markings, 63073931 edges, 126216 markings/sec, 55 secs
lola: 8151839 markings, 68119560 edges, 124060 markings/sec, 60 secs
lola: 8740858 markings, 73277281 edges, 117804 markings/sec, 65 secs
lola: 9300546 markings, 78194618 edges, 111938 markings/sec, 70 secs
lola: 9861289 markings, 83299535 edges, 112149 markings/sec, 75 secs
lola: 10415315 markings, 88511704 edges, 110805 markings/sec, 80 secs
lola: 10973257 markings, 93522914 edges, 111588 markings/sec, 85 secs
lola: 11527837 markings, 98696365 edges, 110916 markings/sec, 90 secs
lola: 12038146 markings, 103745344 edges, 102062 markings/sec, 95 secs
lola: 12524301 markings, 108682397 edges, 97231 markings/sec, 100 secs
lola: 13071654 markings, 113833453 edges, 109471 markings/sec, 105 secs
lola: 13637842 markings, 119055417 edges, 113238 markings/sec, 110 secs
lola: 14214074 markings, 124077434 edges, 115246 markings/sec, 115 secs
lola: 14782390 markings, 129195360 edges, 113663 markings/sec, 120 secs
lola: 15354641 markings, 134327964 edges, 114450 markings/sec, 125 secs
lola: 15850772 markings, 139487894 edges, 99226 markings/sec, 130 secs
lola: 16372375 markings, 144560741 edges, 104321 markings/sec, 135 secs
lola: 16847821 markings, 149291599 edges, 95089 markings/sec, 140 secs
lola: 17343089 markings, 154280303 edges, 99054 markings/sec, 145 secs
lola: 17848219 markings, 159408070 edges, 101026 markings/sec, 150 secs
lola: 18422995 markings, 164522548 edges, 114955 markings/sec, 155 secs
lola: 19070406 markings, 169512980 edges, 129482 markings/sec, 160 secs
lola: 19728480 markings, 174550738 edges, 131615 markings/sec, 165 secs
lola: 20310600 markings, 179493090 edges, 116424 markings/sec, 170 secs
lola: 20874723 markings, 184270048 edges, 112825 markings/sec, 175 secs
lola: 21535219 markings, 189269504 edges, 132099 markings/sec, 180 secs
lola: 22208023 markings, 194333555 edges, 134561 markings/sec, 185 secs
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: 22396652 markings, 195736782 edges
lola: ========================================
lola: subprocess 1 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G ((((1 <= p18) AND (1 <= p92)) OR ((1 <= p50) AND (1 <= p67)))) R X (((1 <= p18) AND (1 <= p92))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G ((((1 <= p18) AND (1 <= p92)) OR ((1 <= p50) AND (1 <= p67)))) R X (((1 <= p18) AND (1 <= p92))))))
lola: processed formula length: 109
lola: 126 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 2 will run for 306 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p72 <= 0) OR (p88 <= 0))) OR (((p17 <= 0) OR (p24 <= 0)) AND ((p72 <= 0) OR (p88 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p72 <= 0) OR (p88 <= 0))) OR (((p17 <= 0) OR (p24 <= 0)) AND ((p72 <= 0) OR (p88 <= 0))))))
lola: processed formula length: 106
lola: 126 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p23 <= 0) OR (p25 <= 0)) AND ((p48 <= 0) OR (p65 <= 0)))) U X (X (((1 <= p13) AND (1 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((p23 <= 0) OR (p25 <= 0)) AND ((p48 <= 0) OR (p65 <= 0)))) U X (X (((1 <= p13) AND (1 <= p98)))))
lola: processed formula length: 105
lola: 126 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 13 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((X (((p103 <= 0) OR (p113 <= 0))) OR ((1 <= p103) AND (1 <= p113)))) AND (F (((1 <= p2) AND (1 <= p114))) OR (((1 <= p2) AND (1 <= p114)) OR (((1 <= p50) AND (1 <= p67)) OR (X (((p103 <= 0) OR (p113 <= 0))) OR ((1 <= p103) AND (1 <= p113)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((X (((p103 <= 0) OR (p113 <= 0))) OR ((1 <= p103) AND (1 <= p113)))) AND (F (((1 <= p2) AND (1 <= p114))) OR (((1 <= p2) AND (1 <= p114)) OR (((1 <= p50) AND (1 <= p67)) OR (X (((p103 <= 0) OR (p113 <= 0))) OR ((1 <= p103) AND (1 <= p113)))))))))
lola: processed formula length: 258
lola: 126 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: 15727 markings, 60861 edges
lola: ========================================
lola: subprocess 5 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F (((1 <= p20) AND (1 <= p30))) OR ((1 <= p36) AND (1 <= p99))))) OR (((1 <= p20) AND (1 <= p30)) U ((1 <= p56) AND (1 <= p73))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 422 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p20) AND (1 <= p30)) U ((1 <= p56) AND (1 <= p73)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p20) AND (1 <= p30)) U ((1 <= p56) AND (1 <= p73)))
lola: processed formula length: 59
lola: 126 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((1 <= p20) AND (1 <= p30))) OR ((1 <= p36) AND (1 <= p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((1 <= p20) AND (1 <= p30))) OR ((1 <= p36) AND (1 <= p99)))))
lola: processed formula length: 72
lola: 126 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: 27 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 482 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (G (((p8 <= 0) OR (p28 <= 0))))) AND ((p77 <= 0) OR (p79 <= 0) OR (p81 <= 0) OR (p83 <= 0) OR (p85 <= 0) OR (p87 <= 0) OR (p89 <= 0) OR (p91 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (G (((p8 <= 0) OR (p28 <= 0))))) AND ((p77 <= 0) OR (p79 <= 0) OR (p81 <= 0) OR (p83 <= 0) OR (p85 <= 0) OR (p87 <= 0) OR (p89 <= 0) OR (p91 <= 0)))))
lola: processed formula length: 170
lola: 126 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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 7 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (F (((p20 <= 0) OR (p30 <= 0)))) AND ((p6 <= 0)))) OR X ((G (((1 <= p66) AND (1 <= p82))) AND ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p66) AND (1 <= p82))) AND ((1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p66) AND (1 <= p82))) AND ((1 <= p6))))
lola: processed formula length: 53
lola: 126 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: 27 markings, 27 edges
lola: ========================================
lola: subprocess 8 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F (((p20 <= 0) OR (p30 <= 0)))) AND ((p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F (((p20 <= 0) OR (p30 <= 0)))) AND ((p6 <= 0))))
lola: processed formula length: 57
lola: 126 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G (((p70 <= 0) OR (p86 <= 0))) OR (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)) AND (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)) AND ((p70 <= 0) OR (p86 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G (((p70 <= 0) OR (p86 <= 0))) OR (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)) AND (((p26 <= 0) OR (p31 <= 0) OR (p33 <= 0)) AND ((p70 <= 0) OR (p86 <= 0))))))))
lola: processed formula length: 174
lola: 126 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: 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 9 will run for 844 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p41) AND (1 <= p43) AND (1 <= p100)))
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: ((p41 <= 0) OR (p43 <= 0) OR (p100 <= 0))
lola: processed formula length: 43
lola: 128 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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 10 will run for 1125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p7 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0))))
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 (((p5 <= 0) OR (p7 <= 0) OR (p11 <= 0) OR (p12 <= 0) OR (p14 <= 0) OR (p16 <= 0))))
lola: processed formula length: 93
lola: 126 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: 5178 markings, 22076 edges
lola: ========================================
lola: subprocess 11 will run for 1688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((p21 <= 0) OR (p22 <= 0))) OR F (((p1 <= 0) OR (p37 <= 0) OR (p39 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((p21 <= 0) OR (p22 <= 0))) OR F (((p1 <= 0) OR (p37 <= 0) OR (p39 <= 0))))))
lola: processed formula length: 90
lola: 126 rewrites
lola: closed formula file LTLFireability.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: 707219 markings, 5079962 edges, 141444 markings/sec, 0 secs
lola: 1419421 markings, 10031631 edges, 142440 markings/sec, 5 secs
lola: 1972980 markings, 14697756 edges, 110712 markings/sec, 10 secs
lola: 2600471 markings, 19580047 edges, 125498 markings/sec, 15 secs
lola: 3275044 markings, 24512169 edges, 134915 markings/sec, 20 secs
lola: 3836835 markings, 29403155 edges, 112358 markings/sec, 25 secs
lola: 4442388 markings, 34258129 edges, 121111 markings/sec, 30 secs
lola: 5098544 markings, 39108936 edges, 131231 markings/sec, 35 secs
lola: 5666811 markings, 43807962 edges, 113653 markings/sec, 40 secs
lola: 6217711 markings, 48366498 edges, 110180 markings/sec, 45 secs
lola: 6798920 markings, 52923644 edges, 116242 markings/sec, 50 secs
lola: 7318691 markings, 57340804 edges, 103954 markings/sec, 55 secs
lola: 7868662 markings, 61684909 edges, 109994 markings/sec, 60 secs
lola: 8419044 markings, 66159972 edges, 110076 markings/sec, 65 secs
lola: 9018442 markings, 70982918 edges, 119880 markings/sec, 70 secs
lola: 9591683 markings, 75668394 edges, 114648 markings/sec, 75 secs
lola: 10123095 markings, 80178324 edges, 106282 markings/sec, 80 secs
lola: 10544655 markings, 84307969 edges, 84312 markings/sec, 85 secs
lola: 11032909 markings, 88698744 edges, 97651 markings/sec, 90 secs
lola: 11556625 markings, 93067464 edges, 104743 markings/sec, 95 secs
lola: 12080904 markings, 97596236 edges, 104856 markings/sec, 100 secs
lola: 12685180 markings, 101956233 edges, 120855 markings/sec, 105 secs
lola: 13182863 markings, 106394676 edges, 99537 markings/sec, 110 secs
lola: 13671180 markings, 110748336 edges, 97663 markings/sec, 115 secs
lola: 14153861 markings, 114946599 edges, 96536 markings/sec, 120 secs
lola: 14657087 markings, 119101151 edges, 100645 markings/sec, 125 secs
lola: 15204633 markings, 123234325 edges, 109509 markings/sec, 130 secs
lola: 15678815 markings, 127308475 edges, 94836 markings/sec, 135 secs
lola: 16150955 markings, 131499556 edges, 94428 markings/sec, 140 secs
lola: 16559372 markings, 135446284 edges, 81683 markings/sec, 145 secs
lola: 17117551 markings, 139597084 edges, 111636 markings/sec, 150 secs
lola: 17714436 markings, 143597453 edges, 119377 markings/sec, 155 secs
lola: 18175845 markings, 147643513 edges, 92282 markings/sec, 160 secs
lola: 18570868 markings, 151679836 edges, 79005 markings/sec, 165 secs
lola: 19027721 markings, 156089302 edges, 91371 markings/sec, 170 secs
lola: 19411912 markings, 160020980 edges, 76838 markings/sec, 175 secs
lola: 19801242 markings, 163722484 edges, 77866 markings/sec, 180 secs
lola: 20210670 markings, 167563594 edges, 81886 markings/sec, 185 secs
lola: 20663214 markings, 171645075 edges, 90509 markings/sec, 190 secs
lola: 21271078 markings, 176134933 edges, 121573 markings/sec, 195 secs
lola: 21868543 markings, 180756521 edges, 119493 markings/sec, 200 secs
lola: 22394094 markings, 185198766 edges, 105110 markings/sec, 205 secs
lola: 22927326 markings, 189494677 edges, 106646 markings/sec, 210 secs
lola: 23480080 markings, 194004256 edges, 110551 markings/sec, 215 secs
lola: 24041177 markings, 198225405 edges, 112219 markings/sec, 220 secs
lola: 24529535 markings, 202263604 edges, 97672 markings/sec, 225 secs
lola: 25091242 markings, 206839348 edges, 112341 markings/sec, 230 secs
lola: 25628613 markings, 211651821 edges, 107474 markings/sec, 235 secs
lola: 26046181 markings, 215860470 edges, 83514 markings/sec, 240 secs
lola: 26541387 markings, 220079012 edges, 99041 markings/sec, 245 secs
lola: 26987631 markings, 224388281 edges, 89249 markings/sec, 250 secs
lola: 27494793 markings, 228554475 edges, 101432 markings/sec, 255 secs
lola: 27957115 markings, 233063683 edges, 92464 markings/sec, 260 secs
lola: 28448422 markings, 237377729 edges, 98261 markings/sec, 265 secs
lola: 29026530 markings, 241411467 edges, 115622 markings/sec, 270 secs
lola: 29506004 markings, 245383841 edges, 95895 markings/sec, 275 secs
lola: 30074462 markings, 250185446 edges, 113692 markings/sec, 280 secs
lola: 30589550 markings, 254901775 edges, 103018 markings/sec, 285 secs
lola: 31083878 markings, 259687607 edges, 98866 markings/sec, 290 secs
lola: 31525568 markings, 264323159 edges, 88338 markings/sec, 295 secs
lola: 31972885 markings, 268929043 edges, 89463 markings/sec, 300 secs
lola: 32383067 markings, 273519428 edges, 82036 markings/sec, 305 secs
lola: 32855827 markings, 278089926 edges, 94552 markings/sec, 310 secs
lola: 33291379 markings, 282574551 edges, 87110 markings/sec, 315 secs
lola: 33745790 markings, 287264976 edges, 90882 markings/sec, 320 secs
lola: 34156641 markings, 291854121 edges, 82170 markings/sec, 325 secs
lola: 34664119 markings, 296583635 edges, 101496 markings/sec, 330 secs
lola: 35203498 markings, 301301478 edges, 107876 markings/sec, 335 secs
lola: 35693304 markings, 305908699 edges, 97961 markings/sec, 340 secs
lola: 36156717 markings, 310333616 edges, 92683 markings/sec, 345 secs
lola: 36576382 markings, 314581270 edges, 83933 markings/sec, 350 secs
lola: 37062322 markings, 319146567 edges, 97188 markings/sec, 355 secs
lola: 37551189 markings, 323765809 edges, 97773 markings/sec, 360 secs
lola: 38061023 markings, 328628827 edges, 101967 markings/sec, 365 secs
lola: 38548716 markings, 333125321 edges, 97539 markings/sec, 370 secs
lola: 39020873 markings, 337660808 edges, 94431 markings/sec, 375 secs
lola: 39481028 markings, 342448319 edges, 92031 markings/sec, 380 secs
lola: 39915451 markings, 346830524 edges, 86885 markings/sec, 385 secs
lola: 40351241 markings, 351332584 edges, 87158 markings/sec, 390 secs
lola: 40815402 markings, 356034725 edges, 92832 markings/sec, 395 secs
lola: 41283144 markings, 360320777 edges, 93548 markings/sec, 400 secs
lola: 41675328 markings, 364516292 edges, 78437 markings/sec, 405 secs
lola: 42166665 markings, 368749019 edges, 98267 markings/sec, 410 secs
lola: 42592769 markings, 372794018 edges, 85221 markings/sec, 415 secs
lola: 42952125 markings, 376678764 edges, 71871 markings/sec, 420 secs
lola: 43327100 markings, 380810810 edges, 74995 markings/sec, 425 secs
lola: 43704042 markings, 385147670 edges, 75388 markings/sec, 430 secs
lola: 44147992 markings, 389624493 edges, 88790 markings/sec, 435 secs
lola: 44595005 markings, 394013308 edges, 89403 markings/sec, 440 secs
lola: 45035215 markings, 398469562 edges, 88042 markings/sec, 445 secs
lola: 45469448 markings, 402948429 edges, 86847 markings/sec, 450 secs
lola: 45912614 markings, 407520799 edges, 88633 markings/sec, 455 secs
lola: 46371710 markings, 412287315 edges, 91819 markings/sec, 460 secs
lola: 46810663 markings, 416807123 edges, 87791 markings/sec, 465 secs
lola: 47281997 markings, 421457320 edges, 94267 markings/sec, 470 secs
lola: 47694862 markings, 425490656 edges, 82573 markings/sec, 475 secs
lola: 48084041 markings, 429501088 edges, 77836 markings/sec, 480 secs
lola: 48441213 markings, 433301158 edges, 71434 markings/sec, 485 secs
lola: 48814245 markings, 437259953 edges, 74606 markings/sec, 490 secs
lola: 49324919 markings, 441584148 edges, 102135 markings/sec, 495 secs
lola: 49768306 markings, 445914218 edges, 88677 markings/sec, 500 secs
lola: 50192943 markings, 450150992 edges, 84927 markings/sec, 505 secs
lola: 50596177 markings, 454244211 edges, 80647 markings/sec, 510 secs
lola: 50999518 markings, 458427336 edges, 80668 markings/sec, 515 secs
lola: 51359167 markings, 462421944 edges, 71930 markings/sec, 520 secs
lola: 51782315 markings, 466925360 edges, 84630 markings/sec, 525 secs
lola: 52194793 markings, 471200857 edges, 82496 markings/sec, 530 secs
lola: 52551580 markings, 475041875 edges, 71357 markings/sec, 535 secs
lola: 52879797 markings, 478672852 edges, 65643 markings/sec, 540 secs
lola: 53292871 markings, 483041938 edges, 82615 markings/sec, 545 secs
lola: 53682377 markings, 487403645 edges, 77901 markings/sec, 550 secs
lola: 54176925 markings, 491645690 edges, 98910 markings/sec, 555 secs
lola: 54632583 markings, 495818789 edges, 91132 markings/sec, 560 secs
lola: 55106928 markings, 500160856 edges, 94869 markings/sec, 565 secs
lola: 55508395 markings, 504440398 edges, 80293 markings/sec, 570 secs
lola: 55968253 markings, 508294670 edges, 91972 markings/sec, 575 secs
lola: 56397994 markings, 512031889 edges, 85948 markings/sec, 580 secs
lola: 56750443 markings, 515887254 edges, 70490 markings/sec, 585 secs
lola: 57089233 markings, 519700251 edges, 67758 markings/sec, 590 secs
lola: 57460720 markings, 523940501 edges, 74297 markings/sec, 595 secs
lola: 57872175 markings, 528073670 edges, 82291 markings/sec, 600 secs
lola: 58295546 markings, 532272699 edges, 84674 markings/sec, 605 secs
lola: 58758637 markings, 536292996 edges, 92618 markings/sec, 610 secs
lola: 59159365 markings, 539824695 edges, 80146 markings/sec, 615 secs
lola: 59549710 markings, 543384838 edges, 78069 markings/sec, 620 secs
lola: 59976944 markings, 547337324 edges, 85447 markings/sec, 625 secs
lola: 60376800 markings, 551206824 edges, 79971 markings/sec, 630 secs
lola: 60840512 markings, 555865688 edges, 92742 markings/sec, 635 secs
lola: 61252070 markings, 560382515 edges, 82312 markings/sec, 640 secs
lola: 61673944 markings, 564943104 edges, 84375 markings/sec, 645 secs
lola: 62102589 markings, 569588813 edges, 85729 markings/sec, 650 secs
lola: 62665752 markings, 574130046 edges, 112633 markings/sec, 655 secs
lola: 63140292 markings, 578463375 edges, 94908 markings/sec, 660 secs
lola: 63594778 markings, 582844815 edges, 90897 markings/sec, 665 secs
lola: 64040964 markings, 587137510 edges, 89237 markings/sec, 670 secs
lola: 64492383 markings, 591716265 edges, 90284 markings/sec, 675 secs
lola: 64929098 markings, 596210945 edges, 87343 markings/sec, 680 secs
lola: 65344222 markings, 600637159 edges, 83025 markings/sec, 685 secs
lola: 65815515 markings, 605060541 edges, 94259 markings/sec, 690 secs
lola: 66245046 markings, 609162851 edges, 85906 markings/sec, 695 secs
lola: 66650620 markings, 613381105 edges, 81115 markings/sec, 700 secs
lola: 67013137 markings, 617303150 edges, 72503 markings/sec, 705 secs
lola: 67503247 markings, 621756428 edges, 98022 markings/sec, 710 secs
lola: 68025195 markings, 626263365 edges, 104390 markings/sec, 715 secs
lola: 68476114 markings, 630709024 edges, 90184 markings/sec, 720 secs
lola: 68986894 markings, 635286772 edges, 102156 markings/sec, 725 secs
lola: 69535961 markings, 639723847 edges, 109813 markings/sec, 730 secs
lola: 69998437 markings, 644211846 edges, 92495 markings/sec, 735 secs
lola: 70454350 markings, 648616844 edges, 91183 markings/sec, 740 secs
lola: 70858742 markings, 652904240 edges, 80878 markings/sec, 745 secs
lola: 71340247 markings, 657426946 edges, 96301 markings/sec, 750 secs
lola: 71791427 markings, 661991863 edges, 90236 markings/sec, 755 secs
lola: 72272697 markings, 666373380 edges, 96254 markings/sec, 760 secs
lola: 72707227 markings, 670500526 edges, 86906 markings/sec, 765 secs
lola: 73191571 markings, 674999450 edges, 96869 markings/sec, 770 secs
lola: 73685810 markings, 679548029 edges, 98848 markings/sec, 775 secs
lola: 74206535 markings, 684165972 edges, 104145 markings/sec, 780 secs
lola: 74755219 markings, 688884785 edges, 109737 markings/sec, 785 secs
lola: 75269760 markings, 693656654 edges, 102908 markings/sec, 790 secs
lola: 75724619 markings, 698172798 edges, 90972 markings/sec, 795 secs
lola: 76282121 markings, 702907637 edges, 111500 markings/sec, 800 secs
lola: 76769332 markings, 707575381 edges, 97442 markings/sec, 805 secs
lola: 77261392 markings, 712124819 edges, 98412 markings/sec, 810 secs
lola: 77678276 markings, 716615621 edges, 83377 markings/sec, 815 secs
lola: 78119820 markings, 721167337 edges, 88309 markings/sec, 820 secs
lola: 78619325 markings, 725155176 edges, 99901 markings/sec, 825 secs
lola: 79133333 markings, 729274500 edges, 102802 markings/sec, 830 secs
lola: 79615099 markings, 733330153 edges, 96353 markings/sec, 835 secs
lola: 80094939 markings, 737350312 edges, 95968 markings/sec, 840 secs
lola: 80585605 markings, 741427280 edges, 98133 markings/sec, 845 secs
lola: 80977689 markings, 745203515 edges, 78417 markings/sec, 850 secs
lola: 81449702 markings, 749566452 edges, 94403 markings/sec, 855 secs
lola: 81924636 markings, 753471317 edges, 94987 markings/sec, 860 secs
lola: 82347232 markings, 757370806 edges, 84519 markings/sec, 865 secs
lola: 82748994 markings, 761654053 edges, 80352 markings/sec, 870 secs
lola: 83173480 markings, 765565572 edges, 84897 markings/sec, 875 secs
lola: 83548605 markings, 769259074 edges, 75025 markings/sec, 880 secs
lola: 83924738 markings, 772983469 edges, 75227 markings/sec, 885 secs
lola: 84365810 markings, 776953564 edges, 88214 markings/sec, 890 secs
lola: 84897656 markings, 781559758 edges, 106369 markings/sec, 895 secs
lola: 85389882 markings, 785766098 edges, 98445 markings/sec, 900 secs
lola: 85922730 markings, 790418146 edges, 106570 markings/sec, 905 secs
lola: 86431412 markings, 794658703 edges, 101736 markings/sec, 910 secs
lola: 86884746 markings, 799252823 edges, 90667 markings/sec, 915 secs
lola: 87407817 markings, 803549501 edges, 104614 markings/sec, 920 secs
lola: 87934173 markings, 807961931 edges, 105271 markings/sec, 925 secs
lola: 88472632 markings, 812148870 edges, 107692 markings/sec, 930 secs
lola: 88936885 markings, 816199066 edges, 92851 markings/sec, 935 secs
lola: 89440511 markings, 820341379 edges, 100725 markings/sec, 940 secs
lola: 89891209 markings, 824904300 edges, 90140 markings/sec, 945 secs
lola: 90354834 markings, 829626925 edges, 92725 markings/sec, 950 secs
lola: 90808735 markings, 834284142 edges, 90780 markings/sec, 955 secs
lola: 91237040 markings, 838823633 edges, 85661 markings/sec, 960 secs
lola: 91609418 markings, 843313205 edges, 74476 markings/sec, 965 secs
lola: 92042924 markings, 847227845 edges, 86701 markings/sec, 970 secs
lola: 92498890 markings, 851186333 edges, 91193 markings/sec, 975 secs
lola: 92950009 markings, 855192679 edges, 90224 markings/sec, 980 secs
lola: 93419779 markings, 859310474 edges, 93954 markings/sec, 985 secs
lola: 93838631 markings, 863439628 edges, 83770 markings/sec, 990 secs
lola: 94235299 markings, 867809983 edges, 79334 markings/sec, 995 secs
lola: 94640891 markings, 871872467 edges, 81118 markings/sec, 1000 secs
lola: 95098894 markings, 876141624 edges, 91601 markings/sec, 1005 secs
lola: 95546368 markings, 880431626 edges, 89495 markings/sec, 1010 secs
lola: 96033850 markings, 884874195 edges, 97496 markings/sec, 1015 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 96301944 markings, 887582014 edges
lola: ========================================
lola: subprocess 12 will run for 2352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p107) AND (1 <= p113)) OR (G (((p107 <= 0) OR (p113 <= 0))) AND F (((1 <= p107) AND (1 <= p113)))))) OR ((1 <= p107) AND (1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p107) AND (1 <= p113))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p107) AND (1 <= p113))
lola: processed formula length: 29
lola: 126 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 ((((1 <= p107) AND (1 <= p113)) OR (G (((p107 <= 0) OR (p113 <= 0))) AND F (((1 <= p107) AND (1 <= p113)))))) OR ((1 <= p107) AND (1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p107) AND (1 <= p113))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p107) AND (1 <= p113))
lola: processed formula length: 29
lola: 126 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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 ((((1 <= p107) AND (1 <= p113)) OR (G (((p107 <= 0) OR (p113 <= 0))) AND F (((1 <= p107) AND (1 <= p113))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p107) AND (1 <= p113)) OR (G (((p107 <= 0) OR (p113 <= 0))) AND F (((1 <= p107) AND (1 <= p113))))))
lola: processed formula length: 112
lola: 126 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: 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: 26 markings, 26 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no no no yes yes
lola:
preliminary result: no no no yes yes no yes no no no no yes yes
lola: memory consumption: 52120 KB
lola: time consumption: 1218 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="DES-PT-01a"
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 DES-PT-01a, 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 r075-tall-162039097000010"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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