fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r148-ebro-155286403700104
Last Updated
Apr 15, 2019

About the Execution of LoLA for ResAllocation-PT-R015C002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4265.660 10738.00 10923.00 17.50 TFTFFTFFFTFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r148-ebro-155286403700104.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is ResAllocation-PT-R015C002, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-ebro-155286403700104
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.9K Feb 12 14:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 14:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 8 16:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 8 16:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 112 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 350 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 01:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 01:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 4 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 1 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:30 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 61K Mar 10 17:31 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 ResAllocation-PT-R015C002-CTLFireability-00
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-01
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-02
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-03
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-04
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-05
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-06
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-07
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-08
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-09
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-10
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-11
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-12
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-13
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-14
FORMULA_NAME ResAllocation-PT-R015C002-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552981065248

info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ ResAllocation-PT-R015C002 @ 3570 seconds

FORMULA ResAllocation-PT-R015C002-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R015C002-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for CTLFireability @ ResAllocation-PT-R015C002

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Mar 19 07:37:45 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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 (G (NOT FIREABLE(t_0_13)))",
"processed_size": 28,
"rewrites": 54
},
"result":
{
"edges": 13,
"markings": 14,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"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": "EG(EX(NOT FIREABLE(t_1_14)))",
"processed_size": 28,
"rewrites": 54
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 5,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 5,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "AF(((((FIREABLE(t_1_12)) AND FIREABLE(t_0_11)) AND AX(FIREABLE(t_0_8))) OR (FIREABLE(t_1_9) OR FIREABLE(t_0_14))))",
"processed_size": 115,
"rewrites": 54
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 75,
"markings": 76,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "AF((AF(FIREABLE(t_0_9)) OR (NOT FIREABLE(t_0_1) AND FIREABLE(t_1_5))))",
"processed_size": 70,
"rewrites": 54
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 379,
"markings": 184,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": "AF((AF(FIREABLE(t_0_14)) OR EX(FIREABLE(t_1_9))))",
"processed_size": 49,
"rewrites": 55
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 827,
"markings": 685,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 5,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "AF(((AF(FIREABLE(t_1_5)) OR (NOT FIREABLE(t_1_9) OR NOT FIREABLE(t_1_1))) AND AX((FIREABLE(t_0_3) OR FIREABLE(t_0_2)))))",
"processed_size": 122,
"rewrites": 55
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 402,
"markings": 171,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": "EG((NOT FIREABLE(t_1_8) OR EX(NOT FIREABLE(t_1_7))))",
"processed_size": 52,
"rewrites": 54
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "A (G ((NOT FIREABLE(t_0_4) OR NOT FIREABLE(t_0_15) OR NOT FIREABLE(t_1_15) OR NOT FIREABLE(t_1_7))))",
"processed_size": 103,
"rewrites": 54
},
"result":
{
"edges": 1040,
"markings": 527,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 8
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 7,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 7
},
"processed": "E (F (((NOT FIREABLE(t_1_8) AND FIREABLE(t_1_0) AND FIREABLE(t_0_2)) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2) AND NOT FIREABLE(t_1_1) AND NOT FIREABLE(t_0_10)))))",
"processed_size": 163,
"rewrites": 53
},
"result":
{
"edges": 91273,
"markings": 23568,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 54,
"problems": 9
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_1_12)) AND NOT FIREABLE(t_0_1))",
"processed_size": 72,
"rewrites": 55
},
"result":
{
"edges": 116,
"markings": 116,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "(NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_1_11) AND (NOT FIREABLE(t_1_2) OR NOT FIREABLE(t_0_8)))",
"processed_size": 97,
"rewrites": 55
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 4
},
"processed": "E(EF(NOT FIREABLE(t_0_8)) U (AG(FIREABLE(t_0_5)) AND (FIREABLE(t_1_8) OR FIREABLE(t_1_14))))",
"processed_size": 93,
"rewrites": 55
},
"net":
{
"conflict_clusters": 17,
"singleton_clusters": 0
},
"result":
{
"edges": 1904640,
"markings": 278528,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "NOT FIREABLE(t_0_11)",
"processed_size": 20,
"rewrites": 55
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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 (G (NOT FIREABLE(t_0_6)))",
"processed_size": 27,
"rewrites": 54
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "(NOT FIREABLE(t_1_3) AND (NOT FIREABLE(t_0_13) OR NOT FIREABLE(t_1_2)))",
"processed_size": 72,
"rewrites": 56
},
"result":
{
"edges": 121,
"markings": 121,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 30,
"problems": 15
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 1,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 2,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "((FIREABLE(t_1_1) AND FIREABLE(t_1_10)) R F (NOT FIREABLE(t_1_6)))",
"processed_size": 66,
"rewrites": 54
},
"result":
{
"edges": 1406011,
"markings": 307897,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1186
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "(NOT FIREABLE(t_0_11) OR NOT FIREABLE(t_0_8) OR NOT FIREABLE(t_1_7))",
"processed_size": 70,
"rewrites": 55
},
"result":
{
"edges": 52,
"markings": 52,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 7
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1780
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "(NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_1_14) OR (NOT FIREABLE(t_0_9) AND NOT FIREABLE(t_0_8)))",
"processed_size": 96,
"rewrites": 52
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (FIREABLE(t_0_0)))",
"processed_size": 23,
"rewrites": 53
},
"result":
{
"edges": 61440,
"markings": 16384,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"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": "E (G (FIREABLE(t_0_11)))",
"processed_size": 24,
"rewrites": 53
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3560
},
"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": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t_1_14)",
"processed_size": 20,
"rewrites": 55
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((FIREABLE(t_0_4) U (FIREABLE(t_1_14) OR FIREABLE(t_1_1))))",
"processed_size": 62,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 9
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "A ((NOT FIREABLE(t_0_0) U (FIREABLE(t_0_8) OR FIREABLE(t_0_14))))",
"processed_size": 66,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "NOT FIREABLE(t_1_14)",
"processed_size": 20,
"rewrites": 55
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "E (G (NOT FIREABLE(t_1_4)))",
"processed_size": 27,
"rewrites": 53
},
"result":
{
"edges": 76,
"markings": 77,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 15516,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((* R A(F(*)))) : ((E(G(**)) AND (* AND E(G(*)))) OR E(G(**))) : (E(G(E(X(*)))) OR A(G(*))) : A(F(((** AND A(X(**))) OR **))) : A(F(**)) : A(G(*)) : (A(F((A(F(**)) OR E(X(**))))) OR A(F((A(F(**)) OR **)))) : A(F(((A(F(**)) OR **) AND A(X(**))))) : (A(F(**)) AND E(F(**))) : (A((** U **)) OR (A((** U **)) OR (E(G(*)) OR A(F(*))))) : E(F(**)) : E(G((* OR E(X(*))))) : A(F(A(G(**)))) : E((E(F(**)) U (A(G(**)) AND **))) : (A(G(*)) OR A(F(**))) : A(F(**))"
},
"net":
{
"arcs": 150,
"conflict_clusters": 17,
"places": 60,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "yes no yes no no yes no no no yes no yes no no no no ",
"value": "yes no yes no no yes no no no yes no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 92/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 60
lola: finding significant places
lola: 60 places, 32 transitions, 30 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 CTLFireability.xml
lola: NOT(E (((NOT FIREABLE(t_1_1) OR NOT FIREABLE(t_1_10)) U E (G (FIREABLE(t_1_6)))))) : ((E (G (E (G (FIREABLE(t_0_11))))) AND NOT(((FIREABLE(t_1_0) AND FIREABLE(t_1_14) AND (FIREABLE(t_0_9) OR FIREABLE(t_0_8))) OR A (F (FIREABLE(t_1_12)))))) OR E (G (FIREABLE(t_0_0)))) : NOT((A (F (A (X (FIREABLE(t_1_14))))) AND E (F (FIREABLE(t_0_13))))) : A (F (((((FIREABLE(t_1_12)) AND FIREABLE(t_0_11)) AND A (X (FIREABLE(t_0_8)))) OR (FIREABLE(t_1_9) OR FIREABLE(t_0_14))))) : A (F (((FIREABLE(t_1_0) AND FIREABLE(t_1_12)) OR FIREABLE(t_0_1)))) : NOT(E (F ((FIREABLE(t_0_4) AND FIREABLE(t_0_15) AND FIREABLE(t_1_15) AND FIREABLE(t_1_7))))) : (A (F ((A (F (FIREABLE(t_0_14))) OR E (X (FIREABLE(t_1_9)))))) OR A (F ((A (F (FIREABLE(t_0_9))) OR (NOT FIREABLE(t_0_1) AND FIREABLE(t_1_5)))))) : A (F (((A (F (FIREABLE(t_1_5))) OR (NOT FIREABLE(t_1_9) OR NOT FIREABLE(t_1_1))) AND A (X ((FIREABLE(t_0_3) OR FIREABLE(t_0_2))))))) : (A (F ((FIREABLE(t_0_11) AND FIREABLE(t_0_8) AND FIREABLE(t_1_7)))) AND E (F (((FIREABLE(t_0_9) AND FIREABLE(t_1_7) AND (FIREABLE(t_1_6) OR FIREABLE(t_0_9))) OR FIREABLE(t_0_4))))) : ((A ((NOT FIREABLE(t_0_0) U (FIREABLE(t_0_8) OR FIREABLE(t_0_14)))) OR A ((FIREABLE(t_0_4) U (FIREABLE(t_1_14) OR FIREABLE(t_1_1))))) OR NOT((A (F (FIREABLE(t_1_4))) AND E (G (NOT FIREABLE(t_1_14)))))) : E (F (((NOT FIREABLE(t_1_8) AND FIREABLE(t_1_0) AND FIREABLE(t_0_2)) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2) AND NOT FIREABLE(t_1_1) AND NOT FIREABLE(t_0_10))))) : E (G (NOT((FIREABLE(t_1_8) AND A (X (FIREABLE(t_1_7))))))) : A (F (A (G ((FIREABLE(t_1_3) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2))))))) : E ((E (F (NOT FIREABLE(t_0_8))) U (A (G (FIREABLE(t_0_5))) AND (FIREABLE(t_1_8) OR FIREABLE(t_1_14))))) : (NOT(E (F (FIREABLE(t_0_6)))) OR NOT(NOT(A (F (FIREABLE(t_0_11)))))) : NOT(NOT(A (F ((FIREABLE(t_1_14) OR FIREABLE(t_1_11) OR (FIREABLE(t_1_2) AND FIREABLE(t_0_8)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X (NOT FIREABLE(t_1_14))))) OR A (G (NOT FIREABLE(t_0_13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_0_13)))
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:788
lola: processed formula: A (G (NOT FIREABLE(t_0_13)))
lola: processed formula length: 28
lola: 54 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_0_13)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (NOT FIREABLE(t_1_14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(NOT FIREABLE(t_1_14)))
lola: processed formula length: 28
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 121 markings, 121 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((FIREABLE(t_1_12)) AND FIREABLE(t_0_11)) AND A (X (FIREABLE(t_0_8)))) OR (FIREABLE(t_1_9) OR FIREABLE(t_0_14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((((FIREABLE(t_1_12)) AND FIREABLE(t_0_11)) AND AX(FIREABLE(t_0_8))) OR (FIREABLE(t_1_9) OR FIREABLE(t_0_14))))
lola: processed formula length: 115
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 76 markings, 75 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((A (F (FIREABLE(t_0_14))) OR E (X (FIREABLE(t_1_9)))))) OR A (F ((A (F (FIREABLE(t_0_9))) OR (NOT FIREABLE(t_0_1) AND FIREABLE(t_1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (FIREABLE(t_0_9))) OR (NOT FIREABLE(t_0_1) AND FIREABLE(t_1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AF(FIREABLE(t_0_9)) OR (NOT FIREABLE(t_0_1) AND FIREABLE(t_1_5))))
lola: processed formula length: 70
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 184 markings, 379 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F (FIREABLE(t_0_14))) OR E (X (FIREABLE(t_1_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((AF(FIREABLE(t_0_14)) OR EX(FIREABLE(t_1_9))))
lola: processed formula length: 49
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 685 markings, 827 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((A (F (FIREABLE(t_1_5))) OR (NOT FIREABLE(t_1_9) OR NOT FIREABLE(t_1_1))) AND A (X ((FIREABLE(t_0_3) OR FIREABLE(t_0_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((AF(FIREABLE(t_1_5)) OR (NOT FIREABLE(t_1_9) OR NOT FIREABLE(t_1_1))) AND AX((FIREABLE(t_0_3) OR FIREABLE(t_0_2)))))
lola: processed formula length: 122
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 171 markings, 402 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t_1_8) OR E (X (NOT FIREABLE(t_1_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((NOT FIREABLE(t_1_8) OR EX(NOT FIREABLE(t_1_7))))
lola: processed formula length: 52
lola: 54 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 121 markings, 121 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_0_4) OR NOT FIREABLE(t_0_15) OR NOT FIREABLE(t_1_15) OR NOT FIREABLE(t_1_7))))
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:788
lola: processed formula: A (G ((NOT FIREABLE(t_0_4) OR NOT FIREABLE(t_0_15) OR NOT FIREABLE(t_1_15) OR NOT FIREABLE(t_1_7))))
lola: processed formula length: 103
lola: 54 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t_0_4) AND FIREABLE(t_0_15) AND FIREABLE(t_1_15) AND FIREABLE(t_1_7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 527 markings, 1040 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t_1_8) AND FIREABLE(t_1_0) AND FIREABLE(t_0_2)) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2) AND NOT FIREABLE(t_1_1) AND NOT FIREABLE(t_0_10)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((NOT FIREABLE(t_1_8) AND FIREABLE(t_1_0) AND FIREABLE(t_0_2)) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2) AND NOT FIREABLE(t_1_1) AND NOT FIREABLE(t_0_10)))))
lola: processed formula length: 163
lola: 53 rewrites
lola: closed formula file CTLFireability.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:711
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(t_1_8) AND FIREABLE(t_1_0) AND FIREABLE(t_0_2)) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2) AND NOT FIREABLE(t_1_1) AND NOT FIREABLE(t_0_10)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 54 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 64)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 23568 markings, 91273 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(t_1_0) AND FIREABLE(t_1_12)) OR FIREABLE(t_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_1_12)) AND NOT FIREABLE(t_0_1))
lola: processed formula length: 72
lola: 55 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((FIREABLE(t_1_0) AND FIREABLE(t_1_12)) OR FIREABLE(t_0_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 116 markings, 116 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t_1_14) OR FIREABLE(t_1_11) OR (FIREABLE(t_1_2) AND FIREABLE(t_0_8)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (NOT FIREABLE(t_1_14) AND NOT FIREABLE(t_1_11) AND (NOT FIREABLE(t_1_2) OR NOT FIREABLE(t_0_8)))
lola: processed formula length: 97
lola: 55 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t_1_14) OR FIREABLE(t_1_11) OR (FIREABLE(t_1_2) AND FIREABLE(t_0_8)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 11 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16 markings, 16 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F (NOT FIREABLE(t_0_8))) U (A (G (FIREABLE(t_0_5))) AND (FIREABLE(t_1_8) OR FIREABLE(t_1_14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF(NOT FIREABLE(t_0_8)) U (AG(FIREABLE(t_0_5)) AND (FIREABLE(t_1_8) OR FIREABLE(t_1_14))))
lola: processed formula length: 93
lola: 55 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 278528 markings, 1904640 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (NOT FIREABLE(t_0_6))) OR A (F (FIREABLE(t_0_11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_0_11)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t_0_11)
lola: processed formula length: 20
lola: 55 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_0_11)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_0_6)))
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:788
lola: processed formula: A (G (NOT FIREABLE(t_0_6)))
lola: processed formula length: 27
lola: 54 rewrites
lola: closed formula file CTLFireability.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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_0_6)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((FIREABLE(t_1_3) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (NOT FIREABLE(t_1_3) AND (NOT FIREABLE(t_0_13) OR NOT FIREABLE(t_1_2)))
lola: processed formula length: 72
lola: 56 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t_1_3) OR (FIREABLE(t_0_13) AND FIREABLE(t_1_2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
sara: try reading problem file CTLFireability-11-0.sara.
sara: could not read problem information -- aborting [#01]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (NOT FIREABLE(t_1_3) AND (NOT FIREABLE(t_0_13) OR NOT FIREABLE(t_1_2)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 121 markings, 121 edges
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 30 literals and 15 conjunctive subformulas
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t_1_1) AND FIREABLE(t_1_10)) R A (F (NOT FIREABLE(t_1_6)))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((FIREABLE(t_1_1) AND FIREABLE(t_1_10)) R F (NOT FIREABLE(t_1_6)))
lola: processed formula length: 66
lola: 54 rewrites
lola: closed formula file CTLFireability.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 insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The universal single path CTL formula holds.
lola: 307897 markings, 1406011 edges
lola: ========================================
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t_0_11) AND FIREABLE(t_0_8) AND FIREABLE(t_1_7)))) AND E (F (((FIREABLE(t_0_9) AND FIREABLE(t_1_7) AND (FIREABLE(t_1_6) OR FIREABLE(t_0_9))) OR FIREABLE(t_0_4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t_0_11) AND FIREABLE(t_0_8) AND FIREABLE(t_1_7))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (NOT FIREABLE(t_0_11) OR NOT FIREABLE(t_0_8) OR NOT FIREABLE(t_1_7))
lola: processed formula length: 70
lola: 55 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t_0_11) AND FIREABLE(t_0_8) AND FIREABLE(t_1_7))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 52 markings, 52 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (FIREABLE(t_0_11))) AND ((NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_1_14) OR (NOT FIREABLE(t_0_9) AND NOT FIREABLE(t_0_8))) AND E (G (NOT FIREABLE(t_1_12))))) OR E (G (FIREABLE(t_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_1_14) OR (NOT FIREABLE(t_0_9) AND NOT FIREABLE(t_0_8)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t_1_0) OR NOT FIREABLE(t_1_14) OR (NOT FIREABLE(t_0_9) AND NOT FIREABLE(t_0_8)))
lola: processed formula length: 96
lola: 52 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (FIREABLE(t_0_0)))
lola: processed formula length: 23
lola: 53 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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(t_0_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 16384 markings, 61440 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t_0_11)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (FIREABLE(t_0_11)))
lola: processed formula length: 24
lola: 53 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
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(t_0_11)
lola: state equation task get result unparse finished id 0
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((NOT FIREABLE(t_0_0) U (FIREABLE(t_0_8) OR FIREABLE(t_0_14)))) OR (A ((FIREABLE(t_0_4) U (FIREABLE(t_1_14) OR FIREABLE(t_1_1)))) OR (E (G (NOT FIREABLE(t_1_4))) OR A (F (FIREABLE(t_1_14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_1_14)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: NOT FIREABLE(t_1_14)
lola: processed formula length: 20
lola: 55 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_1_14)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16 markings, 16 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t_0_4) U (FIREABLE(t_1_14) OR FIREABLE(t_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((FIREABLE(t_0_4) U (FIREABLE(t_1_14) OR FIREABLE(t_1_1))))
lola: processed formula length: 62
lola: 57 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_0_4)
lola: state equation task get result unparse finished id 0
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((NOT FIREABLE(t_0_0) U (FIREABLE(t_0_8) OR FIREABLE(t_0_14))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((NOT FIREABLE(t_0_0) U (FIREABLE(t_0_8) OR FIREABLE(t_0_14))))
lola: processed formula length: 66
lola: 57 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(t_0_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A ((NOT FIREABLE(t_0_0) U (FIREABLE(t_0_8) OR FIREABLE(t_0_14)))) OR (A ((FIREABLE(t_0_4) U (FIREABLE(t_1_14) OR FIREABLE(t_1_1)))) OR (E (G (NOT FIREABLE(t_1_4))) OR A (F (FIREABLE(t_1_14))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t_1_14)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: NOT FIREABLE(t_1_14)
lola: processed formula length: 20
lola: 55 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_1_14)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 16 markings, 16 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t_1_4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (NOT FIREABLE(t_1_4)))
lola: processed formula length: 27
lola: 53 rewrites
lola: closed formula file CTLFireability.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: Planning: workflow for reachability check: stateequation (--findpath=off)
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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t_1_4)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: The predicate is possibly preserved.
lola: 77 markings, 76 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes no no no yes no yes no no no no
lola:
preliminary result: yes no yes no no yes no no no yes no yes no no no no
lola: memory consumption: 15516 KB
lola: time consumption: 10 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552981075986

--------------------
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="ResAllocation-PT-R015C002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is ResAllocation-PT-R015C002, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r148-ebro-155286403700104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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