fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r204-csrt-159033411700088
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for TCPcondis-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.530 839633.00 856003.00 1059.50 FFFFFFFFTFFFFF?T normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411700088.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 win2019
Input is TCPcondis-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.1K Apr 12 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 11 20:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rwxr-xr-x 1 mcc users 24K 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 TCPcondis-PT-20-00
FORMULA_NAME TCPcondis-PT-20-01
FORMULA_NAME TCPcondis-PT-20-02
FORMULA_NAME TCPcondis-PT-20-03
FORMULA_NAME TCPcondis-PT-20-04
FORMULA_NAME TCPcondis-PT-20-05
FORMULA_NAME TCPcondis-PT-20-06
FORMULA_NAME TCPcondis-PT-20-07
FORMULA_NAME TCPcondis-PT-20-08
FORMULA_NAME TCPcondis-PT-20-09
FORMULA_NAME TCPcondis-PT-20-10
FORMULA_NAME TCPcondis-PT-20-11
FORMULA_NAME TCPcondis-PT-20-12
FORMULA_NAME TCPcondis-PT-20-13
FORMULA_NAME TCPcondis-PT-20-14
FORMULA_NAME TCPcondis-PT-20-15

=== Now, execution of the tool begins

BK_START 1590646580203

info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ TCPcondis-PT-20 @ 3570 seconds

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

FORMULA TCPcondis-PT-20-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-20-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2731
rslt: Output for LTLFireability @ TCPcondis-PT-20

{
"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": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 28 06:16:20 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 4,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (F ((X ((NOT FIREABLE(xCLOSE2) AND FIREABLE(xCLOSE3))) OR G (F ((G (NOT FIREABLE(raf1)) OR (NOT FIREABLE(ras) AND NOT FIREABLE(raf1))))))))",
"processed_size": 141,
"rewrites": 71
},
"result":
{
"edges": 802,
"markings": 674,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((((FIREABLE(xrf) AND FIREABLE(xrs1)) AND G (F (NOT FIREABLE(xrf2)))) OR X (FIREABLE(xrs1))))",
"processed_size": 95,
"rewrites": 71
},
"result":
{
"edges": 1160311,
"markings": 357822,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A (F ((F (FIREABLE(xrf1)) OR X (G (NOT FIREABLE(xAOPEN))))))",
"processed_size": 60,
"rewrites": 71
},
"result":
{
"edges": 188,
"markings": 188,
"produced_by": "LTL model checker",
"value": false
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (X ((X (FIREABLE(xras)) U ((FIREABLE(xras) AND G (FIREABLE(xSEND))) U NOT FIREABLE(xAOPEN)))))",
"processed_size": 96,
"rewrites": 71
},
"result":
{
"edges": 187,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((G (FIREABLE(POPEN)) OR (G (F ((FIREABLE(xrf1) AND X (F ((NOT FIREABLE(xrf) AND G (NOT FIREABLE(xrf1)))))))) AND F (G (FIREABLE(POPEN))))))",
"processed_size": 142,
"rewrites": 71
},
"result":
{
"edges": 187,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 6,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 6,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A ((FIREABLE(rf2) OR ((FIREABLE(rs) AND F (FIREABLE(xraf2))) OR (FIREABLE(rf2) AND X ((FIREABLE(rs) U FIREABLE(CLOSE3)))))))",
"processed_size": 124,
"rewrites": 71
},
"result":
{
"edges": 187,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (X (NOT FIREABLE(xCLOSE2)))",
"processed_size": 29,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(xSEND)",
"processed_size": 15,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G ((NOT FIREABLE(AOPEN) OR X (FIREABLE(AOPEN)))))",
"processed_size": 52,
"rewrites": 71
},
"result":
{
"edges": 206,
"markings": 206,
"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": 445
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (X ((FIREABLE(xend) OR (FIREABLE(xras) U FIREABLE(ras)))))",
"processed_size": 60,
"rewrites": 71
},
"result":
{
"edges": 187,
"markings": 187,
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (G (FIREABLE(ras)))",
"processed_size": 21,
"rewrites": 73
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A (((G (FIREABLE(xCLOSE2)) OR ((NOT FIREABLE(xrf1) R NOT FIREABLE(xPOPEN)) R X (F (NOT FIREABLE(xrf1))))) U G (FIREABLE(xCLOSE2))))",
"processed_size": 131,
"rewrites": 71
},
"result":
{
"edges": 1636,
"markings": 1273,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 787
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "A (F (G (FIREABLE(xrf2))))",
"processed_size": 26,
"rewrites": 71
},
"result":
{
"edges": 77,
"markings": 76,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1050
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 2,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "A ((G (FIREABLE(raf)) OR F (NOT FIREABLE(xrs1))))",
"processed_size": 49,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1575
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (F (((FIREABLE(raf2) AND FIREABLE(xraf1)) AND G ((FIREABLE(AOPEN) OR FIREABLE(xSEND))))))",
"processed_size": 92,
"rewrites": 71
},
"result":
{
"edges": 275,
"markings": 275,
"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": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3150
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "FIREABLE(xraf2)",
"processed_size": 15,
"rewrites": 71
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 12924,
"runtime": 839.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A((G(*) OR G(F(*)))) AND **) : A(F((X(*) OR G(F((G(*) OR (* AND *))))))) : A(((** AND G(F(*))) OR X(**))) : A(F((F(**) OR X(G(*))))) : A(X((X(**) U ((** AND G(**)) U **)))) : A((G(**) OR (G(F((** AND X(F((* AND G(*))))))) AND F(G(**))))) : A((** OR ((** AND F(**)) OR (** AND X((** U **)))))) : A(F((** AND G(**)))) : A(X(*)) : (A(F(*)) AND A(G((* OR X(*))))) : A(X((** OR (** U **)))) : A(F(G(**))) : (A(G(**)) AND A(F((** OR X(X(F((G(**) OR G(**))))))))) : A(((G(*) OR ((* R *) R X(F(*)))) U G(**))) : A((** U (** AND X(F(**))))) : A((G(**) OR F(**)))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no no no no no no no no yes no no no no no unknown yes ",
"value": "no no no no no no no no yes no no no no no unknown 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: 62/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: A ((NOT((F (FIREABLE(xrf)) AND G (F (G (FIREABLE(xraf2)))))) AND (FIREABLE(xraf2) U FIREABLE(xraf2)))) : A (F (NOT((X ((FIREABLE(xCLOSE2) OR NOT FIREABLE(xCLOSE3))) AND G (X (F (G ((FIREABLE(ras) U FIREABLE(raf1)))))))))) : A ((((FIREABLE(xrf) AND FIREABLE(xrs1)) AND NOT(X (F (X (G (FIREABLE(xrf2))))))) OR X (FIREABLE(xrs1)))) : A (F (((FIREABLE(xrf1) OR F (FIREABLE(xrf1))) OR G (NOT(X (FIREABLE(xAOPEN))))))) : A (X ((X (FIREABLE(xras)) U ((FIREABLE(xras) AND G (FIREABLE(xSEND))) U NOT FIREABLE(xAOPEN))))) : A ((G (F ((FIREABLE(xrf1) AND X (NOT(G ((FIREABLE(xrf) OR F (FIREABLE(xrf1))))))))) U G (FIREABLE(POPEN)))) : A (((FIREABLE(rf2) OR (FIREABLE(rs) AND F (FIREABLE(xraf2)))) OR (FIREABLE(rf2) AND X ((FIREABLE(rs) U FIREABLE(CLOSE3)))))) : A (F (((FIREABLE(raf2) AND FIREABLE(xraf1)) AND G ((FIREABLE(AOPEN) OR FIREABLE(xSEND)))))) : A (NOT(X ((FIREABLE(xCLOSE2) U FIREABLE(xCLOSE2))))) : A ((NOT(G (FIREABLE(xSEND))) AND NOT(F ((FIREABLE(AOPEN) AND X (NOT FIREABLE(AOPEN))))))) : A (X ((FIREABLE(xend) OR (FIREABLE(xras) U FIREABLE(ras))))) : A (F (((NOT FIREABLE(xrf2) OR G (FIREABLE(ras))) U X (((FIREABLE(xrf2) U FIREABLE(xrf2)) U F (G (FIREABLE(xrf2)))))))) : A ((G (FIREABLE(ras)) AND F ((FIREABLE(end) OR F (X (X ((G (FIREABLE(ras)) OR G (FIREABLE(xend)))))))))) : A ((NOT((F (NOT FIREABLE(xCLOSE2)) AND ((FIREABLE(xrf1) U FIREABLE(xPOPEN)) U X (G (FIREABLE(xrf1)))))) U G (FIREABLE(xCLOSE2)))) : A ((FIREABLE(xSEND) U ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND (FIREABLE(xCLOSE3) OR FIREABLE(rs1))) AND X (F (FIREABLE(ras)))))) : A ((G (FIREABLE(raf)) OR F (NOT FIREABLE(xrs1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:500
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
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:338
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((NOT FIREABLE(xCLOSE2) AND FIREABLE(xCLOSE3))) OR G (F ((G (NOT FIREABLE(raf1)) OR (NOT FIREABLE(ras) AND NOT FIREABLE(raf1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((NOT FIREABLE(xCLOSE2) AND FIREABLE(xCLOSE3))) OR G (F ((G (NOT FIREABLE(raf1)) OR (NOT FIREABLE(ras) AND NOT FIREABLE(raf1))))))))
lola: processed formula length: 141
lola: 71 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: 674 markings, 802 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((FIREABLE(xrf) AND FIREABLE(xrs1)) AND G (F (NOT FIREABLE(xrf2)))) OR X (FIREABLE(xrs1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((FIREABLE(xrf) AND FIREABLE(xrs1)) AND G (F (NOT FIREABLE(xrf2)))) OR X (FIREABLE(xrs1))))
lola: processed formula length: 95
lola: 71 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: 357822 markings, 1160311 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F (FIREABLE(xrf1)) OR X (G (NOT FIREABLE(xAOPEN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (FIREABLE(xrf1)) OR X (G (NOT FIREABLE(xAOPEN))))))
lola: processed formula length: 60
lola: 71 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: 188 markings, 188 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (FIREABLE(xras)) U ((FIREABLE(xras) AND G (FIREABLE(xSEND))) U NOT FIREABLE(xAOPEN)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (FIREABLE(xras)) U ((FIREABLE(xras) AND G (FIREABLE(xSEND))) U NOT FIREABLE(xAOPEN)))))
lola: processed formula length: 96
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 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: 187 markings, 187 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(POPEN)) OR (G (F ((FIREABLE(xrf1) AND X (F ((NOT FIREABLE(xrf) AND G (NOT FIREABLE(xrf1)))))))) AND F (G (FIREABLE(POPEN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (FIREABLE(POPEN)) OR (G (F ((FIREABLE(xrf1) AND X (F ((NOT FIREABLE(xrf) AND G (NOT FIREABLE(xrf1)))))))) AND F (G (FIREABLE(POPEN))))))
lola: processed formula length: 142
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: 187 markings, 187 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(rf2) OR ((FIREABLE(rs) AND F (FIREABLE(xraf2))) OR (FIREABLE(rf2) AND X ((FIREABLE(rs) U FIREABLE(CLOSE3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(rf2) OR ((FIREABLE(rs) AND F (FIREABLE(xraf2))) OR (FIREABLE(rf2) AND X ((FIREABLE(rs) U FIREABLE(CLOSE3)))))))
lola: processed formula length: 124
lola: 71 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: 187 markings, 187 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(xCLOSE2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (NOT FIREABLE(xCLOSE2)))
lola: processed formula length: 29
lola: 71 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (NOT FIREABLE(xSEND))) AND A (G ((NOT FIREABLE(AOPEN) OR X (FIREABLE(AOPEN))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(xSEND)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(xSEND)
lola: processed formula length: 15
lola: 73 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(AOPEN) OR X (FIREABLE(AOPEN)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((NOT FIREABLE(AOPEN) OR X (FIREABLE(AOPEN)))))
lola: processed formula length: 52
lola: 71 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: 206 markings, 206 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(xend) OR (FIREABLE(xras) U FIREABLE(ras)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(xend) OR (FIREABLE(xras) U FIREABLE(ras)))))
lola: processed formula length: 60
lola: 71 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: 187 markings, 187 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(ras))) AND A (F ((FIREABLE(end) OR X (X (F ((G (FIREABLE(ras)) OR G (FIREABLE(xend))))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ras)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (FIREABLE(ras)))
lola: processed formula length: 21
lola: 73 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(ras)
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to LTLFireability-9-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((G (FIREABLE(xCLOSE2)) OR ((NOT FIREABLE(xrf1) R NOT FIREABLE(xPOPEN)) R X (F (NOT FIREABLE(xrf1))))) U G (FIREABLE(xCLOSE2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((G (FIREABLE(xCLOSE2)) OR ((NOT FIREABLE(xrf1) R NOT FIREABLE(xPOPEN)) R X (F (NOT FIREABLE(xrf1))))) U G (FIREABLE(xCLOSE2))))
lola: processed formula length: 131
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 1273 markings, 1636 edges
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(xSEND) U ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND (FIREABLE(xCLOSE3) OR FIREABLE(rs1))) AND X (F (FIREABLE(ras))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(xSEND) U ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND (FIREABLE(xCLOSE3) OR FIREABLE(rs1))) AND X (F (FIREABLE(ras))))))
lola: processed formula length: 133
lola: 71 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
sara: try reading problem file LTLFireability-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: 1861048 markings, 6224643 edges, 372210 markings/sec, 0 secs
lola: 3482793 markings, 12032674 edges, 324349 markings/sec, 5 secs
lola: 5008837 markings, 17658385 edges, 305209 markings/sec, 10 secs
lola: 6561939 markings, 23357031 edges, 310620 markings/sec, 15 secs
lola: 8025483 markings, 28795430 edges, 292709 markings/sec, 20 secs
lola: 9415766 markings, 34111505 edges, 278057 markings/sec, 25 secs
lola: 10879499 markings, 39605388 edges, 292747 markings/sec, 30 secs
lola: 12307653 markings, 44930362 edges, 285631 markings/sec, 35 secs
lola: 13658307 markings, 50109329 edges, 270131 markings/sec, 40 secs
lola: 15007652 markings, 55298772 edges, 269869 markings/sec, 45 secs
lola: 16342935 markings, 60508119 edges, 267057 markings/sec, 50 secs
lola: 17757262 markings, 65866777 edges, 282865 markings/sec, 55 secs
lola: 19139975 markings, 71062380 edges, 276543 markings/sec, 60 secs
lola: 20429173 markings, 76081714 edges, 257840 markings/sec, 65 secs
lola: 21719787 markings, 81093175 edges, 258123 markings/sec, 70 secs
lola: 22977772 markings, 86041053 edges, 251597 markings/sec, 75 secs
lola: 24224235 markings, 90975303 edges, 249293 markings/sec, 80 secs
lola: 25509609 markings, 96018136 edges, 257075 markings/sec, 85 secs
lola: 26864309 markings, 101194345 edges, 270940 markings/sec, 90 secs
lola: 28188903 markings, 106203265 edges, 264919 markings/sec, 95 secs
lola: 29468905 markings, 111141192 edges, 256000 markings/sec, 100 secs
lola: 30714876 markings, 116004257 edges, 249194 markings/sec, 105 secs
lola: 31915443 markings, 120790865 edges, 240113 markings/sec, 110 secs
lola: 33151384 markings, 125607374 edges, 247188 markings/sec, 115 secs
lola: 34402407 markings, 130522495 edges, 250205 markings/sec, 120 secs
lola: 35574077 markings, 135320650 edges, 234334 markings/sec, 125 secs
lola: 36849586 markings, 140296124 edges, 255102 markings/sec, 130 secs
lola: 38041020 markings, 145212910 edges, 238287 markings/sec, 135 secs
lola: 39405889 markings, 150301821 edges, 272974 markings/sec, 140 secs
lola: 40677601 markings, 155186061 edges, 254342 markings/sec, 145 secs
lola: 41910199 markings, 159993426 edges, 246520 markings/sec, 150 secs
lola: 43114424 markings, 164706862 edges, 240845 markings/sec, 155 secs
lola: 44341112 markings, 169477259 edges, 245338 markings/sec, 160 secs
lola: 45512347 markings, 174193266 edges, 234247 markings/sec, 165 secs
lola: 46682435 markings, 178801147 edges, 234018 markings/sec, 170 secs
lola: 47860444 markings, 183572260 edges, 235602 markings/sec, 175 secs
lola: 49055149 markings, 188288595 edges, 238941 markings/sec, 180 secs
lola: 50183420 markings, 192990654 edges, 225654 markings/sec, 185 secs
lola: 51437064 markings, 197849303 edges, 250729 markings/sec, 190 secs
lola: 52562089 markings, 202481874 edges, 225005 markings/sec, 195 secs
lola: 53699739 markings, 207187540 edges, 227530 markings/sec, 200 secs
lola: 55057128 markings, 212093382 edges, 271478 markings/sec, 205 secs
lola: 56261530 markings, 216759365 edges, 240880 markings/sec, 210 secs
lola: 57388700 markings, 221307436 edges, 225434 markings/sec, 215 secs
lola: 58538721 markings, 225766136 edges, 230004 markings/sec, 220 secs
lola: 59676897 markings, 230261658 edges, 227635 markings/sec, 225 secs
lola: 60788153 markings, 234698189 edges, 222251 markings/sec, 230 secs
lola: 61911921 markings, 239245006 edges, 224754 markings/sec, 235 secs
lola: 63051317 markings, 243704791 edges, 227879 markings/sec, 240 secs
lola: 64143718 markings, 248220938 edges, 218480 markings/sec, 245 secs
lola: 65381747 markings, 253052832 edges, 247606 markings/sec, 250 secs
lola: 66486374 markings, 257534506 edges, 220925 markings/sec, 255 secs
lola: 67586419 markings, 262150003 edges, 220009 markings/sec, 260 secs
lola: 68848523 markings, 267081755 edges, 252421 markings/sec, 265 secs
lola: 69996797 markings, 271719016 edges, 229655 markings/sec, 270 secs
lola: 71110237 markings, 276399326 edges, 222688 markings/sec, 275 secs
lola: 72253712 markings, 281240824 edges, 228695 markings/sec, 280 secs
lola: 73557806 markings, 286076017 edges, 260819 markings/sec, 285 secs
lola: 74765506 markings, 290555557 edges, 241540 markings/sec, 290 secs
lola: 75818084 markings, 294870521 edges, 210516 markings/sec, 295 secs
lola: 76985547 markings, 299370563 edges, 233493 markings/sec, 300 secs
lola: 78023906 markings, 303643770 edges, 207672 markings/sec, 305 secs
lola: 79208058 markings, 308171192 edges, 236830 markings/sec, 310 secs
lola: 80221886 markings, 312276028 edges, 202766 markings/sec, 315 secs
lola: 81294837 markings, 316673476 edges, 214590 markings/sec, 320 secs
lola: 82420957 markings, 321072611 edges, 225224 markings/sec, 325 secs
lola: 83424660 markings, 325192985 edges, 200741 markings/sec, 330 secs
lola: 84472422 markings, 329558608 edges, 209552 markings/sec, 335 secs
lola: 85690316 markings, 334227689 edges, 243579 markings/sec, 340 secs
lola: 86701038 markings, 338378538 edges, 202144 markings/sec, 345 secs
lola: 87723215 markings, 342621495 edges, 204435 markings/sec, 350 secs
lola: 88780613 markings, 347071466 edges, 211480 markings/sec, 355 secs
lola: 90028273 markings, 351868756 edges, 249532 markings/sec, 360 secs
lola: 91073325 markings, 356126548 edges, 209010 markings/sec, 365 secs
lola: 92103631 markings, 360430777 edges, 206061 markings/sec, 370 secs
lola: 93165853 markings, 364922130 edges, 212444 markings/sec, 375 secs
lola: 94280855 markings, 369670319 edges, 223000 markings/sec, 380 secs
lola: 95599344 markings, 374537338 edges, 263698 markings/sec, 385 secs
lola: 96695902 markings, 378769772 edges, 219312 markings/sec, 390 secs
lola: 97902457 markings, 383246182 edges, 241311 markings/sec, 395 secs
lola: 98579769 markings, 386098790 edges, 135462 markings/sec, 400 secs
lola: 98587430 markings, 386132431 edges, 1532 markings/sec, 405 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 787 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(xrf2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(xrf2))))
lola: processed formula length: 26
lola: 71 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: 76 markings, 77 edges
lola: ========================================
lola: subprocess 13 will run for 1050 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(raf)) OR F (NOT FIREABLE(xrs1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (FIREABLE(raf)) OR F (NOT FIREABLE(xrs1))))
lola: processed formula length: 49
lola: 71 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(raf2) AND FIREABLE(xraf1)) AND G ((FIREABLE(AOPEN) OR FIREABLE(xSEND))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((FIREABLE(raf2) AND FIREABLE(xraf1)) AND G ((FIREABLE(AOPEN) OR FIREABLE(xSEND))))))
lola: processed formula length: 92
lola: 71 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: 275 markings, 275 edges
lola: ========================================
lola: subprocess 15 will run for 3150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((G (NOT FIREABLE(xrf)) OR G (F (NOT FIREABLE(xraf2))))) AND FIREABLE(xraf2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3150 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(xraf2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(xraf2)
lola: processed formula length: 15
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 0 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(xSEND) U ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND (FIREABLE(xCLOSE3) OR FIREABLE(rs1))) AND X (F (FIREABLE(ras))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(xSEND) U ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND (FIREABLE(xCLOSE3) OR FIREABLE(rs1))) AND X (F (FIREABLE(ras))))))
lola: processed formula length: 133
lola: 71 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: 1796386 markings, 6000597 edges, 359277 markings/sec, 0 secs
lola: 3430517 markings, 11852773 edges, 326826 markings/sec, 5 secs
lola: 4892027 markings, 17207258 edges, 292302 markings/sec, 10 secs
lola: 6316288 markings, 22462530 edges, 284852 markings/sec, 15 secs
lola: 7703313 markings, 27590666 edges, 277405 markings/sec, 20 secs
lola: 9015132 markings, 32587855 edges, 262364 markings/sec, 25 secs
lola: 10330354 markings, 37644356 edges, 263044 markings/sec, 30 secs
lola: 11767436 markings, 42886109 edges, 287416 markings/sec, 35 secs
lola: 13114661 markings, 48044401 edges, 269445 markings/sec, 40 secs
lola: 14412950 markings, 53018150 edges, 259658 markings/sec, 45 secs
lola: 15704722 markings, 58075255 edges, 258354 markings/sec, 50 secs
lola: 17017219 markings, 63220306 edges, 262499 markings/sec, 55 secs
lola: 18411640 markings, 68309192 edges, 278884 markings/sec, 60 secs
lola: 19701277 markings, 73248107 edges, 257927 markings/sec, 65 secs
lola: 20966604 markings, 78101682 edges, 253065 markings/sec, 70 secs
lola: 22207386 markings, 82957871 edges, 248156 markings/sec, 75 secs
lola: 23449394 markings, 87824064 edges, 248402 markings/sec, 80 secs
lola: 24670176 markings, 92663046 edges, 244156 markings/sec, 85 secs
lola: 25881339 markings, 97543063 edges, 242233 markings/sec, 90 secs
lola: 27262014 markings, 102657274 edges, 276135 markings/sec, 95 secs
lola: 28529245 markings, 107485033 edges, 253446 markings/sec, 100 secs
lola: 29793961 markings, 112366787 edges, 252943 markings/sec, 105 secs
lola: 31026801 markings, 117183945 edges, 246568 markings/sec, 110 secs
lola: 32279034 markings, 122126237 edges, 250447 markings/sec, 115 secs
lola: 33494087 markings, 127016503 edges, 243011 markings/sec, 120 secs
lola: 34748328 markings, 131915889 edges, 250848 markings/sec, 125 secs
lola: 35959802 markings, 136833319 edges, 242295 markings/sec, 130 secs
lola: 37192161 markings, 141705037 edges, 246472 markings/sec, 135 secs
lola: 38450431 markings, 146795672 edges, 251654 markings/sec, 140 secs
lola: 39789884 markings, 151752957 edges, 267891 markings/sec, 145 secs
lola: 41064111 markings, 156624984 edges, 254845 markings/sec, 150 secs
lola: 42295736 markings, 161420736 edges, 246325 markings/sec, 155 secs
lola: 43466208 markings, 166118020 edges, 234094 markings/sec, 160 secs
lola: 44668651 markings, 170819570 edges, 240489 markings/sec, 165 secs
lola: 45900670 markings, 175670790 edges, 246404 markings/sec, 170 secs
lola: 47034846 markings, 180272957 edges, 226835 markings/sec, 175 secs
lola: 48278313 markings, 185174259 edges, 248693 markings/sec, 180 secs
lola: 49430681 markings, 189847946 edges, 230474 markings/sec, 185 secs
lola: 50636796 markings, 194734370 edges, 241223 markings/sec, 190 secs
lola: 51846416 markings, 199511451 edges, 241924 markings/sec, 195 secs
lola: 52982561 markings, 204245330 edges, 227229 markings/sec, 200 secs
lola: 54292081 markings, 209335674 edges, 261904 markings/sec, 205 secs
lola: 55501027 markings, 213924546 edges, 241789 markings/sec, 210 secs
lola: 56706452 markings, 218590217 edges, 241085 markings/sec, 215 secs
lola: 57938447 markings, 223335256 edges, 246399 markings/sec, 220 secs
lola: 59045133 markings, 227824029 edges, 221337 markings/sec, 225 secs
lola: 60248438 markings, 232532360 edges, 240661 markings/sec, 230 secs
lola: 61366325 markings, 237064565 edges, 223577 markings/sec, 235 secs
lola: 62578816 markings, 241808412 edges, 242498 markings/sec, 240 secs
lola: 63672132 markings, 246255875 edges, 218663 markings/sec, 245 secs
lola: 64825409 markings, 250978378 edges, 230655 markings/sec, 250 secs
lola: 66015931 markings, 255625377 edges, 238104 markings/sec, 255 secs
lola: 67121943 markings, 260193200 edges, 221202 markings/sec, 260 secs
lola: 68272579 markings, 264960264 edges, 230127 markings/sec, 265 secs
lola: 69496961 markings, 269688895 edges, 244876 markings/sec, 270 secs
lola: 70595057 markings, 274227539 edges, 219619 markings/sec, 275 secs
lola: 71683863 markings, 278825865 edges, 217761 markings/sec, 280 secs
lola: 72959304 markings, 283845200 edges, 255088 markings/sec, 285 secs
lola: 74141181 markings, 288201874 edges, 236375 markings/sec, 290 secs
lola: 75258154 markings, 292628315 edges, 223395 markings/sec, 295 secs
lola: 76446461 markings, 297139091 edges, 237661 markings/sec, 300 secs
lola: 77481426 markings, 301353731 edges, 206993 markings/sec, 305 secs
lola: 78598717 markings, 305772795 edges, 223458 markings/sec, 310 secs
lola: 79683401 markings, 310117665 edges, 216937 markings/sec, 315 secs
lola: 80724111 markings, 314380946 edges, 208142 markings/sec, 320 secs
lola: 81915298 markings, 318972289 edges, 238237 markings/sec, 325 secs
lola: 82923573 markings, 323088212 edges, 201655 markings/sec, 330 secs
lola: 83925720 markings, 327274430 edges, 200429 markings/sec, 335 secs
lola: 85031048 markings, 331750000 edges, 221066 markings/sec, 340 secs
lola: 86174324 markings, 336250480 edges, 228655 markings/sec, 345 secs
lola: 87232215 markings, 340560543 edges, 211578 markings/sec, 350 secs
lola: 88305682 markings, 345079969 edges, 214693 markings/sec, 355 secs
lola: 89444925 markings, 349709154 edges, 227849 markings/sec, 360 secs
lola: 90589604 markings, 354195689 edges, 228936 markings/sec, 365 secs
lola: 91627062 markings, 358456191 edges, 207492 markings/sec, 370 secs
lola: 92731450 markings, 363064542 edges, 220878 markings/sec, 375 secs
lola: 93837807 markings, 367772015 edges, 221271 markings/sec, 380 secs
lola: 95090331 markings, 372696831 edges, 250505 markings/sec, 385 secs
lola: 96258101 markings, 377102462 edges, 233554 markings/sec, 390 secs
lola: 97501174 markings, 381593571 edges, 248615 markings/sec, 395 secs
lola: 98471250 markings, 385745409 edges, 194015 markings/sec, 400 secs
lola: 98607391 markings, 386218353 edges, 27228 markings/sec, 405 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no no no no no unknown yes
lola:
preliminary result: no no no no no no no no yes no no no no no unknown yes
lola: memory consumption: 12924 KB
lola: time consumption: 839 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished

BK_STOP 1590647419836

--------------------
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="TCPcondis-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="win2019"
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 win2019"
echo " Input is TCPcondis-PT-20, 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 r204-csrt-159033411700088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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