Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938800322.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RwMutex-PT-r1000w0010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938800322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 2.8K Apr 12 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 12 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 9 23:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 9 23:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 2.0M Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RwMutex-PT-r1000w0010-00
FORMULA_NAME RwMutex-PT-r1000w0010-01
FORMULA_NAME RwMutex-PT-r1000w0010-02
FORMULA_NAME RwMutex-PT-r1000w0010-03
FORMULA_NAME RwMutex-PT-r1000w0010-04
FORMULA_NAME RwMutex-PT-r1000w0010-05
FORMULA_NAME RwMutex-PT-r1000w0010-06
FORMULA_NAME RwMutex-PT-r1000w0010-07
FORMULA_NAME RwMutex-PT-r1000w0010-08
FORMULA_NAME RwMutex-PT-r1000w0010-09
FORMULA_NAME RwMutex-PT-r1000w0010-10
FORMULA_NAME RwMutex-PT-r1000w0010-11
FORMULA_NAME RwMutex-PT-r1000w0010-12
FORMULA_NAME RwMutex-PT-r1000w0010-13
FORMULA_NAME RwMutex-PT-r1000w0010-14
FORMULA_NAME RwMutex-PT-r1000w0010-15

=== Now, execution of the tool begins

BK_START 1591233641126

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:20:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:20:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:20:42] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2020-06-04 01:20:42] [INFO ] Transformed 3020 places.
[2020-06-04 01:20:42] [INFO ] Transformed 2020 transitions.
[2020-06-04 01:20:42] [INFO ] Parsed PT model containing 3020 places and 2020 transitions in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 3536 steps, including 0 resets, run visited all 40 properties in 519 ms. (steps per millisecond=6 )
[2020-06-04 01:20:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-04 01:20:45] [INFO ] Flatten gal took : 1834 ms
FORMULA RwMutex-PT-r1000w0010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:20:46] [INFO ] Flatten gal took : 1572 ms
[2020-06-04 01:20:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-04 01:20:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 38 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RwMutex-PT-r1000w0010 @ 3570 seconds

FORMULA RwMutex-PT-r1000w0010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r1000w0010-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RwMutex-PT-r1000w0010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2462
rslt: Output for LTLFireability @ RwMutex-PT-r1000w0010

{
"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": "Thu Jun 4 01:20:47 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 250
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 4,
"aconj": 3,
"adisj": 0,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((G ((X (X (G (((p2172 <= 0) OR (p2959 <= 0))))) AND ((p2172 <= 0) OR (p2959 <= 0)))) R X ((F ((p589 <= 0)) AND ((p1290 <= 0) OR (p1364 <= 0))))))",
"processed_size": 151,
"rewrites": 73
},
"result":
{
"edges": 53,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 21
},
"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": 269
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((G (((p2131 <= 0) OR (p2918 <= 0))) OR (F (G (((p2131 <= 0) OR (p2918 <= 0)))) AND F (G ((X ((1 <= p159)) AND (1 <= p159)))))))",
"processed_size": 132,
"rewrites": 73
},
"result":
{
"edges": 55,
"markings": 54,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "X (X ((X (F ((1 <= p658))) AND (((p1135 <= 0) OR (p1349 <= 0)) R (p144 <= 0)))))",
"processed_size": 81,
"rewrites": 73
},
"result":
{
"edges": 3874558,
"markings": 740229,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 348
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 350
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X ((X (X (G ((p573 <= 0)))) AND (1 <= p573)))",
"processed_size": 45,
"rewrites": 73
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 394
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "((p643 <= 0) OR (p1040 <= 0))",
"processed_size": 30,
"rewrites": 75
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 451
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((p1040 <= 0))",
"processed_size": 16,
"rewrites": 73
},
"result":
{
"edges": 165,
"markings": 165,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 451
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((((1 <= p1972) AND (1 <= p2759)) U X (F (((1 <= p1972) AND (1 <= p2759))))))",
"processed_size": 79,
"rewrites": 73
},
"result":
{
"edges": 356,
"markings": 356,
"produced_by": "LTL model checker",
"value": false
},
"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": 526
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 526
},
"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 <= p1198) AND (1 <= p2654))",
"processed_size": 31,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 597
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 4,
"aconj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "X (X ((F ((1 <= p280)) U X (X (F ((((p516 <= 0) AND (p280 <= 0)) OR (1 <= p93))))))))",
"processed_size": 86,
"rewrites": 73
},
"result":
{
"edges": 742,
"markings": 742,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 10,
"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": 747
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p386)))",
"processed_size": 19,
"rewrites": 73
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 996
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G (((p1465 <= 0) OR (p2252 <= 0))))",
"processed_size": 39,
"rewrites": 73
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 1494
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p322)",
"processed_size": 11,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"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 <= p1198) AND (1 <= p2654))",
"processed_size": 31,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p299 <= 0)",
"processed_size": 11,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 18,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "(p1019 <= 0)",
"processed_size": 12,
"rewrites": 75
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p552 <= 0)))",
"processed_size": 19,
"rewrites": 73
},
"result":
{
"edges": 1252,
"markings": 628,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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": "F (G (((p1246 <= 0) OR (p1360 <= 0))))",
"processed_size": 39,
"rewrites": 73
},
"result":
{
"edges": 4,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 5652,
"runtime": 1108.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(G((G(**) OR *))) AND X(G(**))) : ((** OR (G(**) AND F(**))) AND (F(**) OR **)) : (F(G(*)) OR G(F(*))) : X((G((X(X(G(*))) AND *)) R X((F(*) AND *)))) : (F(G((F(**) OR **))) AND (X(**) U **)) : F(G(**)) : F((G(**) OR (F(G(**)) AND F(G((X(**) AND **)))))) : X(X((X(F(**)) AND (* R *)))) : (F(G((X(**) OR F(**)))) AND G((X(**) OR **))) : X((X(X(G(*))) AND **)) : (F(**) OR X(*)) : X((** U X(F(**)))) : F(G(*)) : (X((G(**) OR **)) AND ((** U **) OR **)) : X(X((F(**) U X(X(F(*))))))"
},
"net":
{
"arcs": 26040,
"conflict_clusters": 1011,
"places": 3020,
"places_significant": 1010,
"singleton_clusters": 0,
"transitions": 2020
},
"result":
{
"preliminary_value": "no no no no no no no no unknown no no no no unknown no ",
"value": "no no no no no no no no unknown no no no no unknown no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5040/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3020
lola: finding significant places
lola: 3020 places, 2020 transitions, 1010 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: (NOT(F (G (F ((NOT(G ((1 <= p416))) AND (p516 <= 0)))))) AND G (X ((1 <= p416)))) : ((G (((1 <= p2005) AND (1 <= p2791))) U (p299 <= 0)) AND (F ((1 <= p1019)) OR (1 <= p322))) : (NOT(F (G (F (((1 <= p1246) AND (1 <= p1360)))))) OR NOT(F (G ((1 <= p552))))) : X (NOT((F ((X (X (F (((1 <= p2172) AND (1 <= p2959))))) OR ((1 <= p2172) AND (1 <= p2959)))) U X ((G ((1 <= p589)) OR ((1 <= p1290) AND (1 <= p1364))))))) : ((X (F (((1 <= p2179) AND (1 <= p2966)))) U F (G ((F ((1 <= p635)) OR (1 <= p730))))) AND (X ((1 <= p730)) U (1 <= p635))) : (((1 <= p350) OR ((1 <= p1924) AND (1 <= p2711))) U F (X (G ((1 <= p386))))) : F ((F (X (X (G ((X ((1 <= p159)) AND (1 <= p159)))))) U G (((p2131 <= 0) OR (p2918 <= 0))))) : X (X ((F (X ((1 <= p658))) AND NOT((((1 <= p1135) AND (1 <= p1349)) U (1 <= p144)))))) : (F (G ((X ((p309 <= 0)) OR F ((1 <= p309))))) AND G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552))))) : X ((G (NOT(X (X ((1 <= p573))))) AND (1 <= p573))) : (NOT(G (NOT((NOT(G (((1 <= p1232) AND (1 <= p2987)))) U F (((1 <= p643) AND (1 <= p1040))))))) OR NOT(X ((1 <= p1040)))) : X ((((1 <= p1972) AND (1 <= p2759)) U F (X (((1 <= p1972) AND (1 <= p2759)))))) : NOT(F (G (F (X (((1 <= p1465) AND (1 <= p2252))))))) : (X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654)))) AND ((((1 <= p1862) AND (1 <= p2649)) U ((1 <= p1797) AND (1 <= p2584))) OR ((1 <= p1198) AND (1 <= p2654)))) : X (X ((F ((1 <= p280)) U NOT(G (X (X ((((1 <= p516) OR (1 <= p280)) AND (p93 <= 0)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((G ((1 <= p416)) OR (1 <= p516)))) AND X (G ((1 <= p416))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((1 <= p416)) OR (1 <= p516))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G ((1 <= p416)) OR (1 <= p516))))
lola: processed formula length: 40
lola: 73 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: add low 2010
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: 4 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 1 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G ((X (X (G (((p2172 <= 0) OR (p2959 <= 0))))) AND ((p2172 <= 0) OR (p2959 <= 0)))) R X ((F ((p589 <= 0)) AND ((p1290 <= 0) OR (p1364 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X (X (G (((p2172 <= 0) OR (p2959 <= 0))))) AND ((p2172 <= 0) OR (p2959 <= 0)))) R X ((F ((p589 <= 0)) AND ((p1290 <= 0) OR (p1364 <= 0))))))
lola: processed formula length: 151
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 21 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: 53 markings, 53 edges
lola: ========================================
lola: subprocess 2 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((F ((1 <= p635)) OR (1 <= p730)))) AND (X ((1 <= p730)) U (1 <= p635)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p635)) OR (1 <= p730))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p635)) OR (1 <= p730))))
lola: processed formula length: 40
lola: 73 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 2010
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, 8 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((p2131 <= 0) OR (p2918 <= 0))) OR (F (G (((p2131 <= 0) OR (p2918 <= 0)))) AND F (G ((X ((1 <= p159)) AND (1 <= p159)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((p2131 <= 0) OR (p2918 <= 0))) OR (F (G (((p2131 <= 0) OR (p2918 <= 0)))) AND F (G ((X ((1 <= p159)) AND (1 <= p159)))))))
lola: processed formula length: 132
lola: 73 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: add low 2010
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: 54 markings, 55 edges
lola: ========================================
lola: subprocess 4 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (F ((1 <= p658))) AND (((p1135 <= 0) OR (p1349 <= 0)) R (p144 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (F ((1 <= p658))) AND (((p1135 <= 0) OR (p1349 <= 0)) R (p144 <= 0)))))
lola: processed formula length: 81
lola: 73 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 171511 markings, 807090 edges, 34302 markings/sec, 0 secs
lola: 328640 markings, 1616411 edges, 31426 markings/sec, 5 secs
lola: 482693 markings, 2417016 edges, 30811 markings/sec, 10 secs
lola: 629382 markings, 3240359 edges, 29338 markings/sec, 15 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: 740229 markings, 3874558 edges
lola: subprocess 5 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((X ((p309 <= 0)) OR F ((1 <= p309))))) AND G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 5 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552))))
lola: processed formula length: 76
lola: 73 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: 170399 markings, 801074 edges, 34080 markings/sec, 0 secs
lola: 332313 markings, 1637085 edges, 32383 markings/sec, 5 secs
lola: 493209 markings, 2475342 edges, 32179 markings/sec, 10 secs
lola: 642828 markings, 3311365 edges, 29924 markings/sec, 15 secs
lola: 798986 markings, 4133825 edges, 31232 markings/sec, 20 secs
lola: 961427 markings, 4952652 edges, 32488 markings/sec, 25 secs
lola: 1122584 markings, 5778589 edges, 32231 markings/sec, 30 secs
lola: 1274806 markings, 6595539 edges, 30444 markings/sec, 35 secs
lola: 1422330 markings, 7435702 edges, 29505 markings/sec, 40 secs
lola: 1577876 markings, 8258766 edges, 31109 markings/sec, 45 secs
lola: 1726167 markings, 9092669 edges, 29658 markings/sec, 50 secs
lola: 1875964 markings, 9926215 edges, 29959 markings/sec, 55 secs
lola: 2021759 markings, 10756499 edges, 29159 markings/sec, 60 secs
lola: 2161640 markings, 11587112 edges, 27976 markings/sec, 65 secs
lola: 2306527 markings, 12426226 edges, 28977 markings/sec, 70 secs
lola: 2448985 markings, 13270826 edges, 28492 markings/sec, 75 secs
lola: 2586135 markings, 14114452 edges, 27430 markings/sec, 80 secs
lola: 2725642 markings, 14946265 edges, 27901 markings/sec, 85 secs
lola: 2876453 markings, 15778036 edges, 30162 markings/sec, 90 secs
lola: 3024460 markings, 16607891 edges, 29601 markings/sec, 95 secs
lola: 3164836 markings, 17438862 edges, 28075 markings/sec, 100 secs
lola: 3296721 markings, 18265048 edges, 26377 markings/sec, 105 secs
lola: 3437441 markings, 19095724 edges, 28144 markings/sec, 110 secs
lola: 3585801 markings, 19931607 edges, 29672 markings/sec, 115 secs
lola: 3728666 markings, 20751305 edges, 28573 markings/sec, 120 secs
lola: 3850546 markings, 21515265 edges, 24376 markings/sec, 125 secs
lola: 3954615 markings, 22162242 edges, 20814 markings/sec, 130 secs
lola: 4091533 markings, 22957482 edges, 27384 markings/sec, 135 secs
lola: 4229473 markings, 23744653 edges, 27588 markings/sec, 140 secs
lola: 4366212 markings, 24554137 edges, 27348 markings/sec, 145 secs
lola: 4499435 markings, 25343190 edges, 26645 markings/sec, 150 secs
lola: 4631096 markings, 26125633 edges, 26332 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p309 <= 0)) OR F ((1 <= p309)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p309 <= 0)) OR F ((1 <= p309)))))
lola: processed formula length: 44
lola: 73 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: 169989 markings, 751207 edges, 33998 markings/sec, 0 secs
lola: 340453 markings, 1565477 edges, 34093 markings/sec, 5 secs
lola: 498174 markings, 2386540 edges, 31544 markings/sec, 10 secs
lola: 661610 markings, 3211003 edges, 32687 markings/sec, 15 secs
lola: 823538 markings, 4033352 edges, 32386 markings/sec, 20 secs
lola: 979599 markings, 4860706 edges, 31212 markings/sec, 25 secs
lola: 1126123 markings, 5698951 edges, 29305 markings/sec, 30 secs
lola: 1276139 markings, 6533579 edges, 30003 markings/sec, 35 secs
lola: 1440263 markings, 7357009 edges, 32825 markings/sec, 40 secs
lola: 1609885 markings, 8160606 edges, 33924 markings/sec, 45 secs
lola: 1766065 markings, 8967222 edges, 31236 markings/sec, 50 secs
lola: 1925359 markings, 9772438 edges, 31859 markings/sec, 55 secs
lola: 2084340 markings, 10574543 edges, 31796 markings/sec, 60 secs
lola: 2237954 markings, 11384803 edges, 30723 markings/sec, 65 secs
lola: 2384103 markings, 12202180 edges, 29230 markings/sec, 70 secs
lola: 2531322 markings, 13019356 edges, 29444 markings/sec, 75 secs
lola: 2680722 markings, 13856000 edges, 29880 markings/sec, 80 secs
lola: 2840666 markings, 14680130 edges, 31989 markings/sec, 85 secs
lola: 2992396 markings, 15511906 edges, 30346 markings/sec, 90 secs
lola: 3141126 markings, 16347249 edges, 29746 markings/sec, 95 secs
lola: 3286605 markings, 17187526 edges, 29096 markings/sec, 100 secs
lola: 3447494 markings, 18002381 edges, 32178 markings/sec, 105 secs
lola: 3600764 markings, 18825470 edges, 30654 markings/sec, 110 secs
lola: 3752791 markings, 19646473 edges, 30405 markings/sec, 115 secs
lola: 3897548 markings, 20461996 edges, 28951 markings/sec, 120 secs
lola: 4037018 markings, 21219119 edges, 27894 markings/sec, 125 secs
lola: 4173319 markings, 21975591 edges, 27260 markings/sec, 130 secs
lola: 4311904 markings, 22733657 edges, 27717 markings/sec, 135 secs
lola: 4449401 markings, 23509646 edges, 27499 markings/sec, 140 secs
lola: 4585949 markings, 24290682 edges, 27310 markings/sec, 145 secs
lola: 4716583 markings, 25061145 edges, 26127 markings/sec, 150 secs
lola: 4838820 markings, 25762911 edges, 24447 markings/sec, 155 secs
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: subprocess 6 will run for 350 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (G ((p573 <= 0)))) AND (1 <= p573)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (G ((p573 <= 0)))) AND (1 <= p573)))
lola: processed formula length: 45
lola: 73 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: 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: 52 markings, 52 edges
lola: ========================================
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p643) AND (1 <= p1040))) OR X ((p1040 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p643) AND (1 <= p1040)))
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: ((p643 <= 0) OR (p1040 <= 0))
lola: processed formula length: 30
lola: 75 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p1040 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p1040 <= 0))
lola: processed formula length: 16
lola: 73 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 165 markings, 165 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p1972) AND (1 <= p2759)) U X (F (((1 <= p1972) AND (1 <= p2759))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p1972) AND (1 <= p2759)) U X (F (((1 <= p1972) AND (1 <= p2759))))))
lola: processed formula length: 79
lola: 73 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: 356 markings, 356 edges
lola: ========================================
lola: subprocess 9 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654)))) AND ((((1 <= p1862) AND (1 <= p2649)) U ((1 <= p1797) AND (1 <= p2584))) OR ((1 <= p1198) AND (1 <= p2654))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1198) AND (1 <= p2654))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1198) AND (1 <= p2654))
lola: processed formula length: 31
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654))))
lola: processed formula length: 76
lola: 73 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: 169199 markings, 792824 edges, 33840 markings/sec, 0 secs
lola: 329351 markings, 1618499 edges, 32030 markings/sec, 5 secs
lola: 486774 markings, 2438366 edges, 31485 markings/sec, 10 secs
lola: 634912 markings, 3267041 edges, 29628 markings/sec, 15 secs
lola: 790121 markings, 4089977 edges, 31042 markings/sec, 20 secs
lola: 953621 markings, 4907165 edges, 32700 markings/sec, 25 secs
lola: 1112742 markings, 5727165 edges, 31824 markings/sec, 30 secs
lola: 1266849 markings, 6545637 edges, 30821 markings/sec, 35 secs
lola: 1412761 markings, 7380033 edges, 29182 markings/sec, 40 secs
lola: 1567620 markings, 8206280 edges, 30972 markings/sec, 45 secs
lola: 1716567 markings, 9037352 edges, 29789 markings/sec, 50 secs
lola: 1866226 markings, 9869577 edges, 29932 markings/sec, 55 secs
lola: 2012073 markings, 10698390 edges, 29169 markings/sec, 60 secs
lola: 2152403 markings, 11531004 edges, 28066 markings/sec, 65 secs
lola: 2295684 markings, 12361069 edges, 28656 markings/sec, 70 secs
lola: 2435786 markings, 13191043 edges, 28020 markings/sec, 75 secs
lola: 2571955 markings, 14025026 edges, 27234 markings/sec, 80 secs
lola: 2710809 markings, 14857311 edges, 27771 markings/sec, 85 secs
lola: 2860241 markings, 15686677 edges, 29886 markings/sec, 90 secs
lola: 3006488 markings, 16503289 edges, 29249 markings/sec, 95 secs
lola: 3147330 markings, 17335738 edges, 28168 markings/sec, 100 secs
lola: 3281585 markings, 18171064 edges, 26851 markings/sec, 105 secs
lola: 3422076 markings, 19003844 edges, 28098 markings/sec, 110 secs
lola: 3568865 markings, 19838342 edges, 29358 markings/sec, 115 secs
lola: 3714489 markings, 20669430 edges, 29125 markings/sec, 120 secs
lola: 3844457 markings, 21472090 edges, 25994 markings/sec, 125 secs
lola: 3969704 markings, 22253555 edges, 25049 markings/sec, 130 secs
lola: 4077091 markings, 22878425 edges, 21477 markings/sec, 135 secs
lola: 4213545 markings, 23642924 edges, 27291 markings/sec, 140 secs
lola: 4331203 markings, 24354481 edges, 23532 markings/sec, 145 secs
lola: 4439863 markings, 24965960 edges, 21732 markings/sec, 150 secs
lola: 4562096 markings, 25724159 edges, 24447 markings/sec, 155 secs
lola: 4693217 markings, 26504042 edges, 26224 markings/sec, 160 secs
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: subprocess 10 will run for 597 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((1 <= p280)) U X (X (F ((((p516 <= 0) AND (p280 <= 0)) OR (1 <= p93))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((1 <= p280)) U X (X (F ((((p516 <= 0) AND (p280 <= 0)) OR (1 <= p93))))))))
lola: processed formula length: 86
lola: 73 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 742 markings, 742 edges
lola: ========================================
lola: subprocess 11 will run for 747 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p386)))
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 ((1 <= p386)))
lola: processed formula length: 19
lola: 73 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: add low 1513
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 996 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p1465 <= 0) OR (p2252 <= 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 (((p1465 <= 0) OR (p2252 <= 0))))
lola: processed formula length: 39
lola: 73 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: add low 1513
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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p299 <= 0) OR (G (((1 <= p2005) AND (1 <= p2791))) AND F ((p299 <= 0)))) AND (F ((1 <= p1019)) OR (1 <= p322)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p322)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p322)
lola: processed formula length: 11
lola: 73 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 14 will run for 2988 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p299 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p299 <= 0)
lola: processed formula length: 11
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the 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: subprocess 14 will run for 2988 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p1246 <= 0) OR (p1360 <= 0)))) OR G (F ((p552 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2988 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p552 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p552 <= 0)))
lola: processed formula length: 19
lola: 73 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: 628 markings, 1252 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: (F (G ((X ((p309 <= 0)) OR F ((1 <= p309))))) AND G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((p1765 <= 0) OR (p2552 <= 0))) OR ((1 <= p1765) AND (1 <= p2552))))
lola: processed formula length: 76
lola: 73 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: 172309 markings, 810849 edges, 34462 markings/sec, 0 secs
lola: 333730 markings, 1645061 edges, 32284 markings/sec, 5 secs
lola: 493557 markings, 2477238 edges, 31965 markings/sec, 10 secs
lola: 644020 markings, 3318412 edges, 30093 markings/sec, 15 secs
lola: 793406 markings, 4106985 edges, 29877 markings/sec, 20 secs
lola: 958503 markings, 4936316 edges, 33019 markings/sec, 25 secs
lola: 1119362 markings, 5763145 edges, 32172 markings/sec, 30 secs
lola: 1275240 markings, 6598136 edges, 31176 markings/sec, 35 secs
lola: 1423747 markings, 7443346 edges, 29701 markings/sec, 40 secs
lola: 1581454 markings, 8277265 edges, 31541 markings/sec, 45 secs
lola: 1731647 markings, 9122778 edges, 30039 markings/sec, 50 secs
lola: 1883505 markings, 9965795 edges, 30372 markings/sec, 55 secs
lola: 2030681 markings, 10807425 edges, 29435 markings/sec, 60 secs
lola: 2172773 markings, 11651351 edges, 28418 markings/sec, 65 secs
lola: 2318206 markings, 12493583 edges, 29087 markings/sec, 70 secs
lola: 2460348 markings, 13340042 edges, 28428 markings/sec, 75 secs
lola: 2597145 markings, 14186800 edges, 27359 markings/sec, 80 secs
lola: 2742243 markings, 15028557 edges, 29020 markings/sec, 85 secs
lola: 2892422 markings, 15871628 edges, 30036 markings/sec, 90 secs
lola: 3040639 markings, 16708863 edges, 29643 markings/sec, 95 secs
lola: 3181939 markings, 17544272 edges, 28260 markings/sec, 100 secs
lola: 3312754 markings, 18366759 edges, 26163 markings/sec, 105 secs
lola: 3457720 markings, 19207552 edges, 28993 markings/sec, 110 secs
lola: 3605904 markings, 20049309 edges, 29637 markings/sec, 115 secs
lola: 3751153 markings, 20890386 edges, 29050 markings/sec, 120 secs
lola: 3875540 markings, 21676897 edges, 24877 markings/sec, 125 secs
lola: 4008600 markings, 22479372 edges, 26612 markings/sec, 130 secs
lola: 4145411 markings, 23272269 edges, 27362 markings/sec, 135 secs
lola: 4284843 markings, 24059789 edges, 27886 markings/sec, 140 secs
lola: 4414904 markings, 24828394 edges, 26012 markings/sec, 145 secs
lola: 4541781 markings, 25613433 edges, 25375 markings/sec, 150 secs
lola: 4676558 markings, 26400085 edges, 26955 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p309 <= 0)) OR F ((1 <= p309)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p309 <= 0)) OR F ((1 <= p309)))))
lola: processed formula length: 44
lola: 73 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: 171606 markings, 759348 edges, 34321 markings/sec, 0 secs
lola: 342566 markings, 1575974 edges, 34192 markings/sec, 5 secs
lola: 502295 markings, 2404215 edges, 31946 markings/sec, 10 secs
lola: 665205 markings, 3229745 edges, 32582 markings/sec, 15 secs
lola: 827283 markings, 4054353 edges, 32416 markings/sec, 20 secs
lola: 983232 markings, 4880969 edges, 31190 markings/sec, 25 secs
lola: 1129759 markings, 5720933 edges, 29305 markings/sec, 30 secs
lola: 1280345 markings, 6558904 edges, 30117 markings/sec, 35 secs
lola: 1448821 markings, 7396095 edges, 33695 markings/sec, 40 secs
lola: 1622110 markings, 8221613 edges, 34658 markings/sec, 45 secs
lola: 1781090 markings, 9048350 edges, 31796 markings/sec, 50 secs
lola: 1945450 markings, 9874825 edges, 32872 markings/sec, 55 secs
lola: 2108797 markings, 10700279 edges, 32669 markings/sec, 60 secs
lola: 2264943 markings, 11529919 edges, 31229 markings/sec, 65 secs
lola: 2411930 markings, 12365803 edges, 29397 markings/sec, 70 secs
lola: 2562489 markings, 13201355 edges, 30112 markings/sec, 75 secs
lola: 2717116 markings, 14034950 edges, 30925 markings/sec, 80 secs
lola: 2874475 markings, 14862868 edges, 31472 markings/sec, 85 secs
lola: 3025627 markings, 15702898 edges, 30230 markings/sec, 90 secs
lola: 3176765 markings, 16544482 edges, 30228 markings/sec, 95 secs
lola: 3324333 markings, 17384184 edges, 29514 markings/sec, 100 secs
lola: 3484458 markings, 18200118 edges, 32025 markings/sec, 105 secs
lola: 3637756 markings, 19025978 edges, 30660 markings/sec, 110 secs
lola: 3789948 markings, 19852338 edges, 30438 markings/sec, 115 secs
lola: 3933503 markings, 20655896 edges, 28711 markings/sec, 120 secs
lola: 4076263 markings, 21426095 edges, 28552 markings/sec, 125 secs
lola: 4215601 markings, 22207555 edges, 27868 markings/sec, 130 secs
lola: 4352196 markings, 22956863 edges, 27319 markings/sec, 135 secs
lola: 4486332 markings, 23719619 edges, 26827 markings/sec, 140 secs
lola: 4617544 markings, 24478448 edges, 26242 markings/sec, 145 secs
lola: 4749299 markings, 25253082 edges, 26351 markings/sec, 150 secs
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: (X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654)))) AND ((((1 <= p1862) AND (1 <= p2649)) U ((1 <= p1797) AND (1 <= p2584))) OR ((1 <= p1198) AND (1 <= p2654))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p1198) AND (1 <= p2654))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1198) AND (1 <= p2654))
lola: processed formula length: 31
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p1862) AND (1 <= p2649))) OR ((1 <= p1198) AND (1 <= p2654))))
lola: processed formula length: 76
lola: 73 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: 166832 markings, 781234 edges, 33366 markings/sec, 0 secs
lola: 326516 markings, 1602007 edges, 31937 markings/sec, 5 secs
lola: 483483 markings, 2419398 edges, 31393 markings/sec, 10 secs
lola: 631162 markings, 3247910 edges, 29536 markings/sec, 15 secs
lola: 785853 markings, 4070072 edges, 30938 markings/sec, 20 secs
lola: 948885 markings, 4882609 edges, 32606 markings/sec, 25 secs
lola: 1107016 markings, 5700201 edges, 31626 markings/sec, 30 secs
lola: 1262480 markings, 6520880 edges, 31093 markings/sec, 35 secs
lola: 1407824 markings, 7352265 edges, 29069 markings/sec, 40 secs
lola: 1562169 markings, 8175589 edges, 30869 markings/sec, 45 secs
lola: 1710272 markings, 9003939 edges, 29621 markings/sec, 50 secs
lola: 1859367 markings, 9830955 edges, 29819 markings/sec, 55 secs
lola: 2004255 markings, 10657189 edges, 28978 markings/sec, 60 secs
lola: 2144092 markings, 11484357 edges, 27967 markings/sec, 65 secs
lola: 2286872 markings, 12309213 edges, 28556 markings/sec, 70 secs
lola: 2427075 markings, 13138114 edges, 28041 markings/sec, 75 secs
lola: 2563117 markings, 13969571 edges, 27208 markings/sec, 80 secs
lola: 2700528 markings, 14800276 edges, 27482 markings/sec, 85 secs
lola: 2849950 markings, 15624283 edges, 29884 markings/sec, 90 secs
lola: 2996428 markings, 16447345 edges, 29296 markings/sec, 95 secs
lola: 3137373 markings, 17273111 edges, 28189 markings/sec, 100 secs
lola: 3270931 markings, 18103885 edges, 26712 markings/sec, 105 secs
lola: 3409463 markings, 18931926 edges, 27706 markings/sec, 110 secs
lola: 3554663 markings, 19760114 edges, 29040 markings/sec, 115 secs
lola: 3700866 markings, 20584674 edges, 29241 markings/sec, 120 secs
lola: 3801030 markings, 21200844 edges, 20033 markings/sec, 125 secs
lola: 3855055 markings, 21544576 edges, 10805 markings/sec, 130 secs
lola: 3954352 markings, 22158521 edges, 19859 markings/sec, 135 secs
lola: 3983359 markings, 22330632 edges, 5801 markings/sec, 140 secs
lola: 3983523 markings, 22331629 edges, 33 markings/sec, 145 secs
lola: 4090502 markings, 22949705 edges, 21396 markings/sec, 150 secs
lola: 4162102 markings, 23359367 edges, 14320 markings/sec, 155 secs
lola: 4263498 markings, 23928176 edges, 20279 markings/sec, 160 secs
lola: 4393186 markings, 24698393 edges, 25938 markings/sec, 165 secs
lola: 4426807 markings, 24894924 edges, 6724 markings/sec, 170 secs
lola: 4501276 markings, 25352087 edges, 14894 markings/sec, 175 secs
lola: 4560735 markings, 25716424 edges, 11892 markings/sec, 180 secs
lola: 4576341 markings, 25807436 edges, 3121 markings/sec, 185 secs
lola: 4701490 markings, 26561984 edges, 25030 markings/sec, 190 secs
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: (((p299 <= 0) OR (G (((1 <= p2005) AND (1 <= p2791))) AND F ((p299 <= 0)))) AND (F ((1 <= p1019)) OR (1 <= p322)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p322)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p322)
lola: processed formula length: 11
lola: 73 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: ========================================
lola: ...considering subproblem: (p299 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p299 <= 0)
lola: processed formula length: 11
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((1 <= p1019))
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: (p1019 <= 0)
lola: processed formula length: 12
lola: 75 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: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (G (((p1246 <= 0) OR (p1360 <= 0)))) OR G (F ((p552 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (F ((p552 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p552 <= 0)))
lola: processed formula length: 19
lola: 73 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: 628 markings, 1252 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((p1246 <= 0) OR (p1360 <= 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 (((p1246 <= 0) OR (p1360 <= 0))))
lola: processed formula length: 39
lola: 73 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: add low 1513
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: 3 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no unknown no no no no unknown no
lola:
preliminary result: no no no no no no no no unknown no no no no unknown no
lola: memory consumption: 5652 KB
lola: time consumption: 1108 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="RwMutex-PT-r1000w0010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is RwMutex-PT-r1000w0010, 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 r186-oct2-158987938800322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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