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

About the Execution of LoLA for JoinFreeModules-PT-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.800 1258304.00 1320930.00 1729.90 TT?FFFF?TTFTF??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/mcc2019-input.r082-csrt-155246550200923.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-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-3954
Executing tool lola
Input is JoinFreeModules-PT-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550200923
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.0K Feb 11 05:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 11 05:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 05:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 05:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 3 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 3 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 06:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 06:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 57K 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 JoinFreeModules-PT-0010-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552684660797

info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ JoinFreeModules-PT-0010 @ 3570 seconds

FORMULA JoinFreeModules-PT-0010-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0010-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2311
rslt: Output for CTLFireability @ JoinFreeModules-PT-0010

{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Mar 15 21:17:40 2019
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": "AF(AX(EG(FIREABLE(t74))))",
"processed_size": 25,
"rewrites": 25
},
"net":
{
"conflict_clusters": 41,
"singleton_clusters": 0
},
"result":
{
"edges": 121,
"markings": 100,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG((AX(NOT FIREABLE(t59)) OR FIREABLE(t12)))",
"processed_size": 44,
"rewrites": 24
},
"net":
{
"conflict_clusters": 41,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"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"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E ((FIREABLE(t69) U FIREABLE(t22)))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"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(t26)",
"processed_size": 13,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 262
},
"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(t2)",
"processed_size": 16,
"rewrites": 25
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 283
},
"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(t40)",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 149,
"markings": 149,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 309
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 3,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "AF((EX(FIREABLE(t8)) AND (EG(FIREABLE(t40)) AND EF((FIREABLE(t33) AND FIREABLE(t58))))))",
"processed_size": 88,
"rewrites": 26
},
"net":
{
"conflict_clusters": 41,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"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": 4,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "EX(A((FIREABLE(t4) OR FIREABLE(t59)) U (FIREABLE(t47) AND FIREABLE(t33))))",
"processed_size": 75,
"rewrites": 24
},
"net":
{
"conflict_clusters": 41,
"singleton_clusters": 0
},
"result":
{
"edges": 120,
"markings": 100,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (FIREABLE(t73)))",
"processed_size": 21,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (FIREABLE(t17)))",
"processed_size": 21,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": 0,
"tneg": 0,
"transition_references": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E (F ((FIREABLE(t64) AND FIREABLE(t72))))",
"processed_size": 41,
"rewrites": 23
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 647
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": 4,
"unfir": 4,
"visible_places": 0,
"visible_transitions": 4
},
"processed": "(NOT FIREABLE(t74) OR NOT FIREABLE(t26) OR NOT FIREABLE(t22) OR NOT FIREABLE(t33))",
"processed_size": 85,
"rewrites": 25
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 18
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1027
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 2,
"G": 0,
"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": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "AF((FIREABLE(t5) AND (EF(FIREABLE(t11)) AND ((FIREABLE(t66) OR FIREABLE(t35)) AND NOT FIREABLE(t58)))))",
"processed_size": 104,
"rewrites": 24
},
"net":
{
"conflict_clusters": 41,
"singleton_clusters": 0
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2942
},
"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(t26)",
"processed_size": 13,
"rewrites": 25
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"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": 2,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 2
},
"processed": "E ((FIREABLE(t69) U FIREABLE(t22)))",
"processed_size": 35,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"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(t26)",
"processed_size": 13,
"rewrites": 24
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 13600,
"runtime": 1259.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(A(X(E(G(**)))))) : E(G((A(X(**)) OR **))) : ((E(X(E(F(**)))) OR E((** U **))) AND E(F(A(G(*))))) : A(F((** AND (E(F(**)) AND **)))) : A(X(A(G(**)))) : A(X(A(F(**)))) : A(F((E(X(**)) AND (E(G(**)) AND E(F(**)))))) : E(G(E((** U **)))) : E(F(**)) : E(F(**)) : E(X(A((** U **)))) : E(G(E(F(**)))) : A(F(*)) : A(G(E(F(**)))) : (A((** U A(G(**)))) OR (A(G(E(F(**)))) OR (E(G(**)) OR A(G(**))))) : E(F(**))"
},
"net":
{
"arcs": 232,
"conflict_clusters": 41,
"places": 51,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "yes yes unknown no no no no unknown yes yes no yes no unknown unknown yes ",
"value": "yes yes unknown no no no no unknown yes yes no yes no unknown 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: 132/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1632
lola: finding significant places
lola: 51 places, 81 transitions, 40 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: A (F (A (X (E (G (FIREABLE(t74))))))) : E (G ((A (X (NOT FIREABLE(t59))) OR FIREABLE(t12)))) : ((E (X (E (F (FIREABLE(t26))))) OR E ((FIREABLE(t69) U FIREABLE(t22)))) AND NOT(A (G (E (F (FIREABLE(t63))))))) : A (F ((FIREABLE(t5) AND (E (F (FIREABLE(t11))) AND ((FIREABLE(t66) OR FIREABLE(t35)) AND NOT FIREABLE(t58)))))) : A (X (E (G (A (G (FIREABLE(t2))))))) : A (X (A (F (A (F (FIREABLE(t40))))))) : A (F (((E (X (FIREABLE(t8))) AND E (G (FIREABLE(t40)))) AND E (F ((FIREABLE(t33) AND FIREABLE(t58))))))) : E (G (E ((NOT FIREABLE(t49) U (FIREABLE(t22) AND FIREABLE(t65)))))) : E ((((FIREABLE(t7) OR FIREABLE(t1) OR (FIREABLE(t16) AND FIREABLE(t5))) AND FIREABLE(t41)) U E (F ((FIREABLE(t64) AND FIREABLE(t72)))))) : E (F (FIREABLE(t73))) : E (X (A (((FIREABLE(t4) OR FIREABLE(t59)) U (FIREABLE(t47) AND FIREABLE(t33)))))) : E (G (E (G (E (F (FIREABLE(t26))))))) : NOT(E (G ((NOT FIREABLE(t74) OR NOT FIREABLE(t26) OR NOT FIREABLE(t22) OR NOT FIREABLE(t33))))) : NOT(E (F (NOT(E (F (FIREABLE(t23))))))) : (A (((NOT FIREABLE(t58) AND NOT FIREABLE(t10)) U A (G (FIREABLE(t68))))) OR (A (G (E (F (FIREABLE(t37))))) OR (E (G (NOT FIREABLE(t69))) OR A (G ((FIREABLE(t20) OR FIREABLE(t3))))))) : E (((FIREABLE(t17) AND FIREABLE(t55)) U E (F (FIREABLE(t17)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:476
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:473
lola: rewrite Frontend/Parser/formula_rewrite.k:461
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: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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:473
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 (A (X (E (G (FIREABLE(t74)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(EG(FIREABLE(t74))))
lola: processed formula length: 25
lola: 25 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 100 markings, 121 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X (NOT FIREABLE(t59))) OR FIREABLE(t12))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((AX(NOT FIREABLE(t59)) OR FIREABLE(t12)))
lola: processed formula length: 44
lola: 24 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: 5 markings, 5 edges
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (E (F (FIREABLE(t26))))) OR E ((FIREABLE(t69) U FIREABLE(t22)))) AND E (F (A (G (NOT FIREABLE(t63))))))
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: E ((FIREABLE(t69) U FIREABLE(t22)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((FIREABLE(t69) U FIREABLE(t22)))
lola: processed formula length: 35
lola: 25 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t22)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t63)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(t63)
lola: processed formula length: 13
lola: 26 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
lola: using tscc preserving stubborn set method (--stubborn)
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: NOT FIREABLE(t63)
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-3-0.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(t63)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file CTLFireability-3-0.sara.
lola: state equation: write sara problem file to CTLFireability-3-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3366430 markings, 3988121 edges, 673286 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6589276 markings, 7806185 edges, 644569 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9709438 markings, 11502617 edges, 624032 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12662183 markings, 15000717 edges, 590549 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15832784 markings, 18756889 edges, 634120 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 18867911 markings, 22352608 edges, 607025 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 21867149 markings, 25905788 edges, 599848 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 24874607 markings, 29468755 edges, 601492 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 28086766 markings, 33274159 edges, 642432 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 31114507 markings, 36861081 edges, 605548 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 34013842 markings, 40295898 edges, 579867 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 36854785 markings, 43661531 edges, 568189 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 39919456 markings, 47292236 edges, 612934 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 42626338 markings, 50499062 edges, 541376 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 45445553 markings, 53838970 edges, 563843 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 48079439 markings, 56959334 edges, 526777 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 50676368 markings, 60035947 edges, 519386 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 53529310 markings, 63415801 edges, 570588 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 56283447 markings, 66678593 edges, 550827 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 58990319 markings, 69885395 edges, 541374 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 61753384 markings, 73158774 edges, 552613 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 64469913 markings, 76377040 edges, 543306 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 67224056 markings, 79639853 edges, 550829 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 69831474 markings, 82728825 edges, 521484 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 72391397 markings, 85761592 edges, 511985 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 74966090 markings, 88811821 edges, 514939 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 77708382 markings, 92060638 edges, 548458 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 80509076 markings, 95378599 edges, 560139 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 83008254 markings, 98339394 edges, 499836 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 85688316 markings, 101514463 edges, 536012 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 88405909 markings, 104733978 edges, 543519 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t26)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: FIREABLE(t26)
lola: processed formula length: 13
lola: 24 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t26)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (FIREABLE(t2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t2)
lola: processed formula length: 16
lola: 25 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--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:711
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(t2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 11 markings, 10 edges
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (FIREABLE(t40)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t40)
lola: processed formula length: 17
lola: 25 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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based 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:753
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(t40)
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-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 149 markings, 149 edges
lola: ========================================
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X (FIREABLE(t8))) AND (E (G (FIREABLE(t40))) AND E (F ((FIREABLE(t33) AND FIREABLE(t58))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX(FIREABLE(t8)) AND (EG(FIREABLE(t40)) AND EF((FIREABLE(t33) AND FIREABLE(t58))))))
lola: processed formula length: 88
lola: 26 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((FIREABLE(t4) OR FIREABLE(t59)) U (FIREABLE(t47) AND FIREABLE(t33))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((FIREABLE(t4) OR FIREABLE(t59)) U (FIREABLE(t47) AND FIREABLE(t33))))
lola: processed formula length: 75
lola: 24 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: 100 markings, 120 edges
lola: ========================================
lola: subprocess 7 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t73)))
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 (FIREABLE(t73)))
lola: processed formula length: 21
lola: 23 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: FIREABLE(t73)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t17)))
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 (FIREABLE(t17)))
lola: processed formula length: 21
lola: 23 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: FIREABLE(t17)
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-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t64) AND FIREABLE(t72))))
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 ((FIREABLE(t64) AND FIREABLE(t72))))
lola: processed formula length: 41
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: sara: try reading problem file CTLFireability-4-0.sara.
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)
sara: place or transition ordering is non-deterministic
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: (FIREABLE(t64) AND FIREABLE(t72))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(t23)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: FIREABLE(t23)
lola: processed formula length: 13
lola: 25 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
lola: using tscc preserving stubborn set method (--stubborn)
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: ========================================
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(t23)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(t23)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-10-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-1.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to CTLFireability-10-0.sara

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-10-0.sara.
sara: place or transition ordering is non-deterministic


lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3570439 markings, 4229794 edges, 714088 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6649157 markings, 7877140 edges, 615744 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9590103 markings, 11361246 edges, 588189 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12437279 markings, 14734293 edges, 569435 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15205603 markings, 18013910 edges, 553665 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17920949 markings, 21230766 edges, 543069 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20628096 markings, 24437903 edges, 541429 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23517246 markings, 27860652 edges, 577830 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 26106944 markings, 30928675 edges, 517940 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28691076 markings, 33990069 edges, 516826 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 31119634 markings, 36867170 edges, 485712 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33503366 markings, 39691157 edges, 476746 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 36080329 markings, 42744059 edges, 515393 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 38670016 markings, 45812046 edges, 517937 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 41061825 markings, 48645621 edges, 478362 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 43648269 markings, 51709751 edges, 517289 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 46285603 markings, 54834191 edges, 527467 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 49122127 markings, 58194591 edges, 567305 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 51447528 markings, 60949492 edges, 465080 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 53742463 markings, 63668288 edges, 458987 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 56223294 markings, 66607303 edges, 496166 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 58911078 markings, 69791505 edges, 537557 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 61410326 markings, 72752340 edges, 499850 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 63977363 markings, 75793512 edges, 513407 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 66514832 markings, 78799624 edges, 507494 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 69092307 markings, 81853137 edges, 515495 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 71368218 markings, 84549397 edges, 455182 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 73699542 markings, 87311297 edges, 466265 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 76028712 markings, 90070664 edges, 465834 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 78211584 markings, 92656712 edges, 436574 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 81024243 markings, 95988842 edges, 562532 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 83625140 markings, 99070104 edges, 520179 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 85974392 markings, 101853246 edges, 469850 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 647 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t74) AND FIREABLE(t26) AND FIREABLE(t22) AND FIREABLE(t33))))
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(t74) OR NOT FIREABLE(t26) OR NOT FIREABLE(t22) OR NOT FIREABLE(t33))
lola: processed formula length: 85
lola: 25 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(t74) AND FIREABLE(t26) AND FIREABLE(t22) AND FIREABLE(t33))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5 markings, 5 edges
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((NOT FIREABLE(t49) U (FIREABLE(t22) AND FIREABLE(t65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: ========================================
lola: processed formula: EG(E(NOT FIREABLE(t49) U (FIREABLE(t22) AND FIREABLE(t65))))
lola: processed formula length: 60
lola: 24 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: 3067901 markings, 3634462 edges, 613580 markings/sec, 0 secs
lola: 5962037 markings, 7063107 edges, 578827 markings/sec, 5 secs
lola: 8694689 markings, 10300484 edges, 546530 markings/sec, 10 secs
lola: 11228255 markings, 13301980 edges, 506713 markings/sec, 15 secs
lola: 13901242 markings, 16468642 edges, 534597 markings/sec, 20 secs
lola: 16478112 markings, 19521463 edges, 515374 markings/sec, 25 secs
lola: 19070873 markings, 22593078 edges, 518552 markings/sec, 30 secs
lola: 21877838 markings, 25918450 edges, 561393 markings/sec, 35 secs
lola: 24565046 markings, 29101978 edges, 537442 markings/sec, 40 secs
lola: 27179126 markings, 32198856 edges, 522816 markings/sec, 45 secs
lola: 29640755 markings, 35115154 edges, 492326 markings/sec, 50 secs
lola: 31993853 markings, 37902834 edges, 470620 markings/sec, 55 secs
lola: 34401678 markings, 40755373 edges, 481565 markings/sec, 60 secs
lola: 37015872 markings, 43852388 edges, 522839 markings/sec, 65 secs
lola: 39390579 markings, 46665711 edges, 474941 markings/sec, 70 secs
lola: 41818864 markings, 49542466 edges, 485657 markings/sec, 75 secs
lola: 44175234 markings, 52334055 edges, 471274 markings/sec, 80 secs
lola: 46564556 markings, 55164685 edges, 477864 markings/sec, 85 secs
lola: 48984001 markings, 58030964 edges, 483889 markings/sec, 90 secs
lola: 51111169 markings, 60551008 edges, 425434 markings/sec, 95 secs
lola: 53260635 markings, 63097456 edges, 429893 markings/sec, 100 secs
lola: 55519715 markings, 65773783 edges, 451816 markings/sec, 105 secs
lola: 57866303 markings, 68553768 edges, 469318 markings/sec, 110 secs
lola: 60118354 markings, 71221757 edges, 450410 markings/sec, 115 secs
lola: 62196590 markings, 73683842 edges, 415647 markings/sec, 120 secs
lola: 64430622 markings, 76330496 edges, 446806 markings/sec, 125 secs
lola: 66717709 markings, 79039978 edges, 457417 markings/sec, 130 secs
lola: 69162792 markings, 81936651 edges, 489017 markings/sec, 135 secs
lola: 71462000 markings, 84660502 edges, 459842 markings/sec, 140 secs
lola: 73889588 markings, 87536460 edges, 485518 markings/sec, 145 secs
lola: 74963004 markings, 88808139 edges, 214683 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1027 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t5) AND (E (F (FIREABLE(t11))) AND ((FIREABLE(t66) OR FIREABLE(t35)) AND NOT FIREABLE(t58))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((FIREABLE(t5) AND (EF(FIREABLE(t11)) AND ((FIREABLE(t66) OR FIREABLE(t35)) AND NOT FIREABLE(t58)))))
lola: processed formula length: 104
lola: 24 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1541 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((NOT FIREABLE(t58) AND NOT FIREABLE(t10)) U A (G (FIREABLE(t68))))) OR (A (G (E (F (FIREABLE(t37))))) OR (E (G (NOT FIREABLE(t69))) OR A (G ((FIREABLE(t20) OR FIREABLE(t3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: (A((NOT FIREABLE(t58) AND NOT FIREABLE(t10)) U AG(FIREABLE(t68))) OR (AG(EF(FIREABLE(t37))) OR (EG(NOT FIREABLE(t69)) OR AG((FIREABLE(t20) OR FIREABLE(t3))))))
lola: processed formula length: 160
lola: 28 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 6 significant temporal operators and needs 26 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3236871 markings, 3844025 edges, 647374 markings/sec, 0 secs
lola: 6294313 markings, 7466160 edges, 611488 markings/sec, 5 secs
lola: 9119053 markings, 10812603 edges, 564948 markings/sec, 10 secs
lola: 11721529 markings, 13895728 edges, 520495 markings/sec, 15 secs
lola: 14292478 markings, 16941536 edges, 514190 markings/sec, 20 secs
lola: 16755711 markings, 19859690 edges, 492647 markings/sec, 25 secs
lola: 19395435 markings, 22986965 edges, 527945 markings/sec, 30 secs
lola: 22221140 markings, 26334576 edges, 565141 markings/sec, 35 secs
lola: 24919510 markings, 29531305 edges, 539674 markings/sec, 40 secs
lola: 27486472 markings, 32572366 edges, 513392 markings/sec, 45 secs
lola: 29873194 markings, 35399893 edges, 477344 markings/sec, 50 secs
lola: 32271125 markings, 38240714 edges, 479586 markings/sec, 55 secs
lola: 34660815 markings, 41071765 edges, 477938 markings/sec, 60 secs
lola: 37244305 markings, 44132411 edges, 516698 markings/sec, 65 secs
lola: 39608979 markings, 46933835 edges, 472935 markings/sec, 70 secs
lola: 42073217 markings, 49853184 edges, 492848 markings/sec, 75 secs
lola: 44581535 markings, 52824775 edges, 501664 markings/sec, 80 secs
lola: 47088364 markings, 55794607 edges, 501366 markings/sec, 85 secs
lola: 49447930 markings, 58589965 edges, 471913 markings/sec, 90 secs
lola: 51595815 markings, 61134558 edges, 429577 markings/sec, 95 secs
lola: 53784105 markings, 63727005 edges, 437658 markings/sec, 100 secs
lola: 56246885 markings, 66644635 edges, 492556 markings/sec, 105 secs
lola: 58732384 markings, 69589181 edges, 497100 markings/sec, 110 secs
lola: 61047035 markings, 72331358 edges, 462930 markings/sec, 115 secs
lola: 63425892 markings, 75149576 edges, 475771 markings/sec, 120 secs
lola: 65872526 markings, 78048087 edges, 489327 markings/sec, 125 secs
lola: 68438641 markings, 81088147 edges, 513223 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (FIREABLE(t26)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: FIREABLE(t26)
lola: processed formula length: 13
lola: 25 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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(t26)
lola: state equation task get result unparse finished id 1
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
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(t26)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Reachability of the predicate is possibly preserved.
lola: 5 markings, 5 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ...considering subproblem: ((E (X (E (F (FIREABLE(t26))))) OR E ((FIREABLE(t69) U FIREABLE(t22)))) AND E (F (A (G (NOT FIREABLE(t63))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t69) U FIREABLE(t22)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((FIREABLE(t69) U FIREABLE(t22)))
lola: processed formula length: 35
lola: 25 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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (NOT FIREABLE(t63)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: FIREABLE(t63)
lola: processed formula length: 13
lola: 26 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
lola: using tscc preserving stubborn set method (--stubborn)
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: NOT FIREABLE(t63)
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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(t63)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3468289 markings, 4108775 edges, 693658 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6541080 markings, 7749085 edges, 614558 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9552665 markings, 11316881 edges, 602317 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12426915 markings, 14721984 edges, 574850 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15650990 markings, 18541537 edges, 644815 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 18682818 markings, 22133314 edges, 606366 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 21658098 markings, 25658109 edges, 595056 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 24648665 markings, 29201075 edges, 598113 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 27916136 markings, 33071986 edges, 653494 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 30972050 markings, 36692317 edges, 611183 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 33906934 markings, 40169227 edges, 586977 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 36720101 markings, 43501997 edges, 562633 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 39657069 markings, 46981384 edges, 587394 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 42290631 markings, 50101369 edges, 526712 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 44897873 markings, 53190171 edges, 521448 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 47489002 markings, 56259853 edges, 518226 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 50245054 markings, 59524952 edges, 551210 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 53282105 markings, 63122926 edges, 607410 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 56251071 markings, 66640241 edges, 593793 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 58955018 markings, 69843573 edges, 540789 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 61699991 markings, 73095515 edges, 548995 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 64381615 markings, 76272429 edges, 536325 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 67265095 markings, 79688472 edges, 576696 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 70027675 markings, 82961291 edges, 552516 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 72764975 markings, 86204150 edges, 547460 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 75372296 markings, 89293052 edges, 521464 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 77962088 markings, 92361185 edges, 517958 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 80625618 markings, 95516679 edges, 532706 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 83018989 markings, 98352104 edges, 478674 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 85519821 markings, 101314830 edges, 500166 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 88055652 markings, 104319052 edges, 507166 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (F (FIREABLE(t26)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: FIREABLE(t26)
lola: processed formula length: 13
lola: 24 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 /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--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:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: FIREABLE(t26)
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-18-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(t23)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: FIREABLE(t23)
lola: processed formula length: 13
lola: 25 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
lola: using tscc preserving stubborn set method (--stubborn)
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 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: FIREABLE(t23)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: calling and running sara
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(t23)
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-17-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLFireability-17-0.sara.
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3436612 markings, 4071288 edges, 687322 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6643131 markings, 7869992 edges, 641304 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 9632776 markings, 11411812 edges, 597929 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 12387749 markings, 14675613 edges, 550995 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 15054978 markings, 17835464 edges, 533446 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17542868 markings, 20782844 edges, 497578 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20162528 markings, 23886354 edges, 523932 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 23030961 markings, 27284571 edges, 573687 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25571838 markings, 30294735 edges, 508175 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 28179898 markings, 33384470 edges, 521612 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 30524108 markings, 36161649 edges, 468842 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 33018251 markings, 39116445 edges, 498829 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 35413613 markings, 41954208 edges, 479072 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 37878522 markings, 44874371 edges, 492982 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 40162308 markings, 47579958 edges, 456757 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 42583215 markings, 50447981 edges, 484181 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 45056046 markings, 53377531 edges, 494566 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 47717620 markings, 56530686 edges, 532315 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 50120388 markings, 59377243 edges, 480554 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 52346394 markings, 62014365 edges, 445201 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 54806249 markings, 64928533 edges, 491971 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 57342257 markings, 67932919 edges, 507202 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 59892505 markings, 70954192 edges, 510050 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 62245639 markings, 73741967 edges, 470627 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 64717224 markings, 76670016 edges, 494317 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 67281873 markings, 79708352 edges, 512930 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 69670875 markings, 82538568 edges, 477800 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 71976598 markings, 85270139 edges, 461145 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 74361994 markings, 88096119 edges, 477079 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 76813403 markings, 91000272 edges, 490282 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 79358809 markings, 94015823 edges, 509081 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 82182686 markings, 97361255 edges, 564775 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 84751082 markings, 100404009 edges, 513679 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 87239168 markings, 103351620 edges, 497617 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (G (E ((NOT FIREABLE(t49) U (FIREABLE(t22) AND FIREABLE(t65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E(NOT FIREABLE(t49) U (FIREABLE(t22) AND FIREABLE(t65))))
lola: processed formula length: 60
lola: 24 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: 3085969 markings, 3655862 edges, 617194 markings/sec, 0 secs
lola: 5942696 markings, 7040209 edges, 571345 markings/sec, 5 secs
lola: 8736945 markings, 10350564 edges, 558850 markings/sec, 10 secs
lola: 11247708 markings, 13325004 edges, 502153 markings/sec, 15 secs
lola: 13907193 markings, 16475700 edges, 531897 markings/sec, 20 secs
lola: 16283955 markings, 19291421 edges, 475352 markings/sec, 25 secs
lola: 18699831 markings, 22153509 edges, 483175 markings/sec, 30 secs
lola: 21526571 markings, 25502342 edges, 565348 markings/sec, 35 secs
lola: 24178433 markings, 28643987 edges, 530372 markings/sec, 40 secs
lola: 26736510 markings, 31674517 edges, 511615 markings/sec, 45 secs
lola: 29181898 markings, 34571536 edges, 489078 markings/sec, 50 secs
lola: 31512790 markings, 37332924 edges, 466178 markings/sec, 55 secs
lola: 33750281 markings, 39983671 edges, 447498 markings/sec, 60 secs
lola: 36244526 markings, 42938588 edges, 498849 markings/sec, 65 secs
lola: 38547843 markings, 45667310 edges, 460663 markings/sec, 70 secs
lola: 40803717 markings, 48339850 edges, 451175 markings/sec, 75 secs
lola: 43241288 markings, 51227603 edges, 487514 markings/sec, 80 secs
lola: 45499982 markings, 53903461 edges, 451739 markings/sec, 85 secs
lola: 48091207 markings, 56973274 edges, 518245 markings/sec, 90 secs
lola: 50360961 markings, 59662242 edges, 453951 markings/sec, 95 secs
lola: 52522827 markings, 62223388 edges, 432373 markings/sec, 100 secs
lola: 54728650 markings, 64836607 edges, 441165 markings/sec, 105 secs
lola: 57029541 markings, 67562449 edges, 460178 markings/sec, 110 secs
lola: 59378691 markings, 70345511 edges, 469830 markings/sec, 115 secs
lola: 61513578 markings, 72874693 edges, 426977 markings/sec, 120 secs
lola: 63796251 markings, 75578946 edges, 456535 markings/sec, 125 secs
lola: 66082195 markings, 78287094 edges, 457189 markings/sec, 130 secs
lola: 68533539 markings, 81191186 edges, 490269 markings/sec, 135 secs
lola: 70776738 markings, 83848683 edges, 448640 markings/sec, 140 secs
lola: 73230396 markings, 86755508 edges, 490732 markings/sec, 145 secs
lola: 74990079 markings, 88840218 edges, 351937 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (((NOT FIREABLE(t58) AND NOT FIREABLE(t10)) U A (G (FIREABLE(t68))))) OR (A (G (E (F (FIREABLE(t37))))) OR (E (G (NOT FIREABLE(t69))) OR A (G ((FIREABLE(t20) OR FIREABLE(t3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: (A((NOT FIREABLE(t58) AND NOT FIREABLE(t10)) U AG(FIREABLE(t68))) OR (AG(EF(FIREABLE(t37))) OR (EG(NOT FIREABLE(t69)) OR AG((FIREABLE(t20) OR FIREABLE(t3))))))
lola: processed formula length: 160
lola: 28 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 6 significant temporal operators and needs 26 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3293402 markings, 3910978 edges, 658680 markings/sec, 0 secs
lola: 6345212 markings, 7526464 edges, 610362 markings/sec, 5 secs
lola: 9223355 markings, 10936179 edges, 575629 markings/sec, 10 secs
lola: 11902180 markings, 14109754 edges, 535765 markings/sec, 15 secs
lola: 14493976 markings, 17180255 edges, 518359 markings/sec, 20 secs
lola: 16909605 markings, 20042034 edges, 483126 markings/sec, 25 secs
lola: 19379249 markings, 22967799 edges, 493929 markings/sec, 30 secs
lola: 22017061 markings, 26092803 edges, 527562 markings/sec, 35 secs
lola: 24560768 markings, 29106299 edges, 508741 markings/sec, 40 secs
lola: 27131594 markings, 32151938 edges, 514165 markings/sec, 45 secs
lola: 29579224 markings, 35051625 edges, 489526 markings/sec, 50 secs
lola: 31933616 markings, 37840867 edges, 470878 markings/sec, 55 secs
lola: 34300580 markings, 40645002 edges, 473393 markings/sec, 60 secs
lola: 36843726 markings, 43657850 edges, 508629 markings/sec, 65 secs
lola: 39200942 markings, 46450420 edges, 471443 markings/sec, 70 secs
lola: 41532090 markings, 49212122 edges, 466230 markings/sec, 75 secs
lola: 44038076 markings, 52180934 edges, 501197 markings/sec, 80 secs
lola: 46513128 markings, 55113123 edges, 495010 markings/sec, 85 secs
lola: 49075159 markings, 58148339 edges, 512406 markings/sec, 90 secs
lola: 51334557 markings, 60825043 edges, 451880 markings/sec, 95 secs
lola: 53533198 markings, 63429752 edges, 439728 markings/sec, 100 secs
lola: 55959923 markings, 66304689 edges, 485345 markings/sec, 105 secs
lola: 58357160 markings, 69144661 edges, 479447 markings/sec, 110 secs
lola: 60662125 markings, 71875343 edges, 460993 markings/sec, 115 secs
lola: 62859932 markings, 74479082 edges, 439561 markings/sec, 120 secs
lola: 65334508 markings, 77410727 edges, 494915 markings/sec, 125 secs
lola: 67832982 markings, 80370616 edges, 499695 markings/sec, 130 secs
lola: 70064805 markings, 83014655 edges, 446365 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes unknown no no no no unknown yes yes no yes no unknown unknown yes
lola:
preliminary result: yes yes unknown no no no no unknown yes yes no yes no unknown unknown yes
lola: memory consumption: 13600 KB
lola: time consumption: 1259 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552685919101

--------------------
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="JoinFreeModules-PT-0010"
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 JoinFreeModules-PT-0010, 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 r082-csrt-155246550200923"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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