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-155246550200941.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-0050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550200941
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 3.3K Feb 11 06:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 11 06:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 7 05:17 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.4K Feb 5 00:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K 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 8.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 3 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 06:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Jan 31 06:57 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 282K 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-0050-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0050-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1552685169327

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

FORMULA JoinFreeModules-PT-0050-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA JoinFreeModules-PT-0050-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0050-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0050-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0050-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-0050-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA JoinFreeModules-PT-0050-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2601
rslt: Output for CTLFireability @ JoinFreeModules-PT-0050

{
"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:26:09 2019
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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(t109)",
"processed_size": 18,
"rewrites": 26
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))))",
"processed_size": 103,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "AX(EX(FIREABLE(t380)))",
"processed_size": 22,
"rewrites": 25
},
"net":
{
"conflict_clusters": 201,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 246
},
"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(t314)",
"processed_size": 18,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 9,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 9,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 9
},
"processed": "((FIREABLE(t57) AND FIREABLE(t95)) OR FIREABLE(t28) OR FIREABLE(t356) OR FIREABLE(t60) OR (FIREABLE(t134) AND FIREABLE(t58)) OR (FIREABLE(t205) AND FIREABLE(t249)))",
"processed_size": 169,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 2,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 3,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "A (G ((NOT FIREABLE(t87) OR (FIREABLE(t98) AND FIREABLE(t180)) OR (NOT FIREABLE(t342) AND NOT FIREABLE(t39)))))",
"processed_size": 113,
"rewrites": 25
},
"result":
{
"edges": 60,
"markings": 61,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 3,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 3,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 3
},
"processed": "(FIREABLE(t277) AND (FIREABLE(t166) OR FIREABLE(t177)))",
"processed_size": 56,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 367
},
"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(t208) U FIREABLE(t183)))",
"processed_size": 37,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"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": "EG(A(FIREABLE(t206) U FIREABLE(t320)))",
"processed_size": 38,
"rewrites": 25
},
"net":
{
"conflict_clusters": 201,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"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(t205)))",
"processed_size": 22,
"rewrites": 24
},
"result":
{
"edges": 3,
"markings": 4,
"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": 399
},
"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(t363)",
"processed_size": 18,
"rewrites": 26
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 456
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 1,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 1
},
"processed": "E (G (NOT FIREABLE(t171)))",
"processed_size": 26,
"rewrites": 24
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 533
},
"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(t299)",
"processed_size": 18,
"rewrites": 26
},
"result":
{
"edges": 150,
"markings": 150,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1533
},
"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(t338)",
"processed_size": 14,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3066
},
"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(t86)",
"processed_size": 17,
"rewrites": 26
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3066
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": "G (((FIREABLE(t346) OR FIREABLE(t43)) U (FIREABLE(t222) OR FIREABLE(t393))))",
"processed_size": 78,
"rewrites": 25
},
"result":
{
"edges": 10,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 4,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 5,
"unfir": 1,
"visible_places": 0,
"visible_transitions": 5
},
"processed": "E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))))",
"processed_size": 103,
"rewrites": 26
},
"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": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"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": "AX(EX(FIREABLE(t380)))",
"processed_size": 22,
"rewrites": 25
},
"net":
{
"conflict_clusters": 201,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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(t314)",
"processed_size": 18,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 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(t338)",
"processed_size": 14,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"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": "E (F (NOT FIREABLE(t138)))",
"processed_size": 26,
"rewrites": 24
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 22,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 20,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 15084,
"runtime": 969.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : (A(F(**)) AND A(F((** AND A(X(**)))))) : (E((** U **)) OR (A(X(E(X(**)))) AND A(X(E(F(**)))))) : A(F(**)) : (A(G((E(X(**)) OR **))) AND A(F(**))) : ((A(G(**)) OR E(X(**))) AND A(G(*))) : (((E(G(**)) AND E(G(**))) OR (A(X(**)) OR **)) AND A(G(**))) : (E((** U **)) OR ((A(X(**)) AND **) OR (A(F(**)) OR E(G(A((** U **))))))) : (E(F(*)) OR (** AND A(F(**)))) : A(G(A((** U **)))) : E(G(**)) : E(X(A(G(*)))) : E(G(**)) : E((** U **)) : (E((** U E(G(**)))) OR **) : E(F(**))"
},
"net":
{
"arcs": 1152,
"conflict_clusters": 201,
"places": 251,
"places_significant": 200,
"singleton_clusters": 0,
"transitions": 401
},
"result":
{
"preliminary_value": "no no unknown no unknown no no no yes no yes unknown yes unknown no yes ",
"value": "no no unknown no unknown no no no yes no yes unknown yes unknown no 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: 652/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8032
lola: finding significant places
lola: 251 places, 401 transitions, 200 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 (FIREABLE(t363))) : (A (((NOT FIREABLE(t48) AND NOT FIREABLE(t229)) U A (F (FIREABLE(t109))))) AND A (F ((FIREABLE(t177) AND A (X (FIREABLE(t186))))))) : (E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216))))) OR A (X ((E (X (FIREABLE(t380))) AND E (F (FIREABLE(t273))))))) : A (F (FIREABLE(t299))) : (A (G ((E (X (FIREABLE(t259))) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139))))) AND NOT(NOT(A (F (FIREABLE(t314)))))) : ((A (G ((FIREABLE(t390) OR (FIREABLE(t175) AND FIREABLE(t381))))) OR E (X ((NOT FIREABLE(t214) OR (FIREABLE(t232) AND FIREABLE(t393)))))) AND NOT(E (F ((FIREABLE(t53) AND FIREABLE(t164) AND (FIREABLE(t22) OR FIREABLE(t261))))))) : ((((E (G (FIREABLE(t166))) AND E (G (FIREABLE(t24)))) OR A (X ((FIREABLE(t324) OR FIREABLE(t294))))) OR ((FIREABLE(t57) AND FIREABLE(t95)) OR FIREABLE(t28) OR FIREABLE(t356) OR FIREABLE(t60) OR (FIREABLE(t134) AND FIREABLE(t58)) OR (FIREABLE(t205) AND FIREABLE(t249)))) AND A (G ((NOT FIREABLE(t87) OR (FIREABLE(t98) AND FIREABLE(t180)) OR (NOT FIREABLE(t342) AND NOT FIREABLE(t39)))))) : ((E ((FIREABLE(t208) U FIREABLE(t183))) OR ((A (X (FIREABLE(t159))) AND (FIREABLE(t277) AND (FIREABLE(t166) OR FIREABLE(t177)))) OR A (F (NOT FIREABLE(t170))))) OR E (G (A ((FIREABLE(t206) U FIREABLE(t320)))))) : (NOT(E (G (A (G (FIREABLE(t138)))))) OR (FIREABLE(t338) AND A (F (A (F (FIREABLE(t86))))))) : A (G (A (((FIREABLE(t346) OR FIREABLE(t43)) U (FIREABLE(t222) OR FIREABLE(t393)))))) : E (G (E (G ((NOT FIREABLE(t319) AND NOT FIREABLE(t237)))))) : E (X (NOT(E (F ((FIREABLE(t269) AND FIREABLE(t107))))))) : E (G (NOT FIREABLE(t171))) : E (((FIREABLE(t329) OR FIREABLE(t382) OR NOT FIREABLE(t141) OR ((FIREABLE(t238) OR FIREABLE(t254)) AND FIREABLE(t93))) U FIREABLE(t224))) : (E ((FIREABLE(t) U E (G (FIREABLE(t192))))) OR FIREABLE(t22)) : E (F (FIREABLE(t205)))
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:461
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: 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 (FIREABLE(t109))) AND A (F ((FIREABLE(t177) AND A (X (FIREABLE(t186)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t109)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t109)
lola: processed formula length: 18
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 (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: 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(t109)
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216))))) OR (A (X (E (X (FIREABLE(t380))))) AND A (X (E (F (FIREABLE(t273)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))))
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(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))))
lola: processed formula length: 103
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 (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: 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(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
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: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(t273)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(FIREABLE(t273)))
lola: processed formula length: 22
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1252594 markings, 1673837 edges, 250519 markings/sec, 0 secs
lola: 2618789 markings, 3501695 edges, 273239 markings/sec, 5 secs
lola: 3928694 markings, 5253907 edges, 261981 markings/sec, 10 secs
lola: 5340381 markings, 7141342 edges, 282337 markings/sec, 15 secs
lola: 6768574 markings, 9051457 edges, 285639 markings/sec, 20 secs
lola: 8195799 markings, 10961120 edges, 285445 markings/sec, 25 secs
lola: 9603481 markings, 12843409 edges, 281536 markings/sec, 30 secs
lola: 11009907 markings, 14724289 edges, 281285 markings/sec, 35 secs
lola: 12411833 markings, 16599826 edges, 280385 markings/sec, 40 secs
lola: 13806615 markings, 18465341 edges, 278956 markings/sec, 45 secs
lola: 15206433 markings, 20337425 edges, 279964 markings/sec, 50 secs
lola: 16560651 markings, 22149147 edges, 270844 markings/sec, 55 secs
lola: 17832625 markings, 23850575 edges, 254395 markings/sec, 60 secs
lola: 19102326 markings, 25548994 edges, 253940 markings/sec, 65 secs
lola: 20363149 markings, 27234653 edges, 252165 markings/sec, 70 secs
lola: 21648112 markings, 28953217 edges, 256993 markings/sec, 75 secs
lola: 22995173 markings, 30755561 edges, 269412 markings/sec, 80 secs
lola: 24332287 markings, 32544102 edges, 267423 markings/sec, 85 secs
lola: 25585046 markings, 34219430 edges, 250552 markings/sec, 90 secs
lola: 26894401 markings, 35970343 edges, 261871 markings/sec, 95 secs
lola: 28235198 markings, 37763595 edges, 268159 markings/sec, 100 secs
lola: 29311439 markings, 39202979 edges, 215248 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (FIREABLE(t380)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX(FIREABLE(t380)))
lola: processed formula length: 22
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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((E (X (FIREABLE(t259))) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139))))) AND A (F (FIREABLE(t314))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t314)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t314)
lola: processed formula length: 18
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 (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (FIREABLE(t259))) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX(FIREABLE(t259)) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139))))
lola: processed formula length: 71
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 609957 markings, 814868 edges, 121991 markings/sec, 0 secs
lola: 1237830 markings, 1654230 edges, 125575 markings/sec, 5 secs
lola: 1863706 markings, 2491816 edges, 125175 markings/sec, 10 secs
lola: 2485302 markings, 3322583 edges, 124319 markings/sec, 15 secs
lola: 3105691 markings, 4152536 edges, 124078 markings/sec, 20 secs
lola: 3718986 markings, 4973234 edges, 122659 markings/sec, 25 secs
lola: 4331961 markings, 5792591 edges, 122595 markings/sec, 30 secs
lola: 4943292 markings, 6610814 edges, 122266 markings/sec, 35 secs
lola: 5560596 markings, 7435919 edges, 123461 markings/sec, 40 secs
lola: 6172791 markings, 8255262 edges, 122439 markings/sec, 45 secs
lola: 6785780 markings, 9074599 edges, 122598 markings/sec, 50 secs
lola: 7401404 markings, 9898209 edges, 123125 markings/sec, 55 secs
lola: 7993164 markings, 10690152 edges, 118352 markings/sec, 60 secs
lola: 8545560 markings, 11428557 edges, 110479 markings/sec, 65 secs
lola: 9098644 markings, 12168533 edges, 110617 markings/sec, 70 secs
lola: 9670196 markings, 12932800 edges, 114310 markings/sec, 75 secs
lola: 10275953 markings, 13743128 edges, 121151 markings/sec, 80 secs
lola: 10890052 markings, 14564090 edges, 122820 markings/sec, 85 secs
lola: 11502813 markings, 15384413 edges, 122552 markings/sec, 90 secs
lola: 12118176 markings, 16206734 edges, 123073 markings/sec, 95 secs
lola: 12727967 markings, 17022549 edges, 121958 markings/sec, 100 secs
lola: 13338392 markings, 17839538 edges, 122085 markings/sec, 105 secs
lola: 13950402 markings, 18657480 edges, 122402 markings/sec, 110 secs
lola: 14559913 markings, 19472945 edges, 121902 markings/sec, 115 secs
lola: 15174098 markings, 20294039 edges, 122837 markings/sec, 120 secs
lola: 15783899 markings, 21110593 edges, 121960 markings/sec, 125 secs
lola: 16391873 markings, 21922928 edges, 121595 markings/sec, 130 secs
lola: 16576057 markings, 22169982 edges, 36837 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(t390) OR (FIREABLE(t175) AND FIREABLE(t381))))) OR E (X ((NOT FIREABLE(t214) OR (FIREABLE(t232) AND FIREABLE(t393)))))) AND A (G ((NOT FIREABLE(t53) OR NOT FIREABLE(t164) OR (NOT FIREABLE(t22) AND NOT FIREABLE(t261))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t390) OR (FIREABLE(t175) AND FIREABLE(t381)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((FIREABLE(t390) OR (FIREABLE(t175) AND FIREABLE(t381)))))
lola: processed formula length: 64
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (NOT FIREABLE(t390) AND (NOT FIREABLE(t175) OR NOT FIREABLE(t381)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t53) OR NOT FIREABLE(t164) OR (NOT FIREABLE(t22) AND NOT FIREABLE(t261)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((NOT FIREABLE(t53) OR NOT FIREABLE(t164) OR (NOT FIREABLE(t22) AND NOT FIREABLE(t261)))))
lola: processed formula length: 97
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t53) AND FIREABLE(t164) AND (FIREABLE(t22) OR FIREABLE(t261)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((E (G (FIREABLE(t166))) AND E (G (FIREABLE(t24)))) OR (A (X ((FIREABLE(t324) OR FIREABLE(t294)))) OR ((FIREABLE(t57) AND FIREABLE(t95)) OR FIREABLE(t28) OR FIREABLE(t356) OR FIREABLE(t60) OR (FIREABLE(t134) AND FIREABLE(t58)) OR (FIREABLE(t205) AND FIREABLE(t249))))) AND A (G ((NOT FIREABLE(t87) OR (FIREABLE(t98) AND FIREABLE(t180)) OR (NOT FIREABLE(t342) AND NOT FIREABLE(t39))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t57) AND FIREABLE(t95)) OR FIREABLE(t28) OR FIREABLE(t356) OR FIREABLE(t60) OR (FIREABLE(t134) AND FIREABLE(t58)) OR (FIREABLE(t205) AND FIREABLE(t249)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(t57) AND FIREABLE(t95)) OR FIREABLE(t28) OR FIREABLE(t356) OR FIREABLE(t60) OR (FIREABLE(t134) AND FIREABLE(t58)) OR (FIREABLE(t205) AND FIREABLE(t249)))
lola: processed formula length: 169
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t87) OR (FIREABLE(t98) AND FIREABLE(t180)) OR (NOT FIREABLE(t342) AND NOT FIREABLE(t39)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((NOT FIREABLE(t87) OR (FIREABLE(t98) AND FIREABLE(t180)) OR (NOT FIREABLE(t342) AND NOT FIREABLE(t39)))))
lola: processed formula length: 113
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t87) AND (NOT FIREABLE(t98) OR NOT FIREABLE(t180)) AND (FIREABLE(t342) OR FIREABLE(t39)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 61 markings, 60 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((FIREABLE(t208) U FIREABLE(t183))) OR ((A (X (FIREABLE(t159))) AND (FIREABLE(t277) AND (FIREABLE(t166) OR FIREABLE(t177)))) OR (A (F (NOT FIREABLE(t170))) OR E (G (A ((FIREABLE(t206) U FIREABLE(t320))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t170)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: FIREABLE(t170)
lola: processed formula length: 14
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 (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: NOT FIREABLE(t170)
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 / EG
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t277) AND (FIREABLE(t166) OR FIREABLE(t177)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t277) AND (FIREABLE(t166) OR FIREABLE(t177)))
lola: processed formula length: 56
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(t208) U FIREABLE(t183)))
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(t208) U FIREABLE(t183)))
lola: processed formula length: 37
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 (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: 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(t183)
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 /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((FIREABLE(t206) U FIREABLE(t320)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A(FIREABLE(t206) U FIREABLE(t320)))
lola: processed formula length: 38
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((NOT FIREABLE(t269) OR NOT FIREABLE(t107))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((NOT FIREABLE(t269) OR NOT FIREABLE(t107))))
lola: processed formula length: 51
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1340541 markings, 1791504 edges, 268108 markings/sec, 0 secs
lola: 2745612 markings, 3671055 edges, 281014 markings/sec, 5 secs
lola: 4092045 markings, 5472240 edges, 269287 markings/sec, 10 secs
lola: 5496995 markings, 7350820 edges, 280990 markings/sec, 15 secs
lola: 6922495 markings, 9257994 edges, 285100 markings/sec, 20 secs
lola: 8338872 markings, 11152723 edges, 283275 markings/sec, 25 secs
lola: 9774386 markings, 13071942 edges, 287103 markings/sec, 30 secs
lola: 11192958 markings, 14969912 edges, 283714 markings/sec, 35 secs
lola: 12470086 markings, 16678002 edges, 255426 markings/sec, 40 secs
lola: 13751956 markings, 18392451 edges, 256374 markings/sec, 45 secs
lola: 15051796 markings, 20130793 edges, 259968 markings/sec, 50 secs
lola: 16395654 markings, 21927894 edges, 268772 markings/sec, 55 secs
lola: 17617223 markings, 23562543 edges, 244314 markings/sec, 60 secs
lola: 18888085 markings, 25261929 edges, 254172 markings/sec, 65 secs
lola: 20181902 markings, 26992895 edges, 258763 markings/sec, 70 secs
lola: 21533352 markings, 28799982 edges, 270290 markings/sec, 75 secs
lola: 22793425 markings, 30485289 edges, 252015 markings/sec, 80 secs
lola: 24055725 markings, 32174167 edges, 252460 markings/sec, 85 secs
lola: 25267060 markings, 33794038 edges, 242267 markings/sec, 90 secs
lola: 26487752 markings, 35427018 edges, 244138 markings/sec, 95 secs
lola: 27748252 markings, 37112893 edges, 252100 markings/sec, 100 secs
lola: 29101244 markings, 38922030 edges, 270598 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t205)))
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(t205)))
lola: processed formula length: 22
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)
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(t205)
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: 4 markings, 3 edges
lola: subprocess 8 will run for 399 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t363)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t363)
lola: processed formula length: 18
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 (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(t363)
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 / EG
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: subprocess 9 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t171)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (NOT FIREABLE(t171)))
lola: processed formula length: 26
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 150 markings, 150 edges
lola: ========================================
lola: subprocess 10 will run for 533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t299)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t299)
lola: processed formula length: 18
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 (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 150 markings, 150 edges
lola: ========================================
lola: subprocess 11 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t319) AND NOT FIREABLE(t237))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((NOT FIREABLE(t319) AND NOT FIREABLE(t237))))
lola: processed formula length: 51
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: ========================================
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (FIREABLE(t319) OR FIREABLE(t237))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 150 markings, 150 edges
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 799 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t329) OR FIREABLE(t382) OR NOT FIREABLE(t141) OR ((FIREABLE(t238) OR FIREABLE(t254)) AND FIREABLE(t93))) U FIREABLE(t224)))
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(t329) OR FIREABLE(t382) OR NOT FIREABLE(t141) OR ((FIREABLE(t238) OR FIREABLE(t254)) AND FIREABLE(t93))) U FIREABLE(t224)))
lola: processed formula length: 141
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 (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: 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(t224)
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-12-0.sara
sara: try reading problem file CTLFireability-11-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: sara is running 0 secs || 1316942 markings, 1759924 edges, 263388 markings/sec, 0 secs
lola: sara is running 5 secs || 2700833 markings, 3611124 edges, 276778 markings/sec, 5 secs
lola: sara is running 10 secs || 4076389 markings, 5451148 edges, 275111 markings/sec, 10 secs
lola: sara is running 15 secs || 5478425 markings, 7325926 edges, 280407 markings/sec, 15 secs
lola: sara is running 20 secs || 6901849 markings, 9230364 edges, 284685 markings/sec, 20 secs
lola: sara is running 25 secs || 8320008 markings, 11127310 edges, 283632 markings/sec, 25 secs
lola: sara is running 30 secs || 9643255 markings, 12896683 edges, 264649 markings/sec, 30 secs
lola: sara is running 35 secs || 10893069 markings, 14568114 edges, 249963 markings/sec, 35 secs
lola: sara is running 40 secs || 12135753 markings, 16230186 edges, 248537 markings/sec, 40 secs
lola: sara is running 45 secs || 13375584 markings, 17889022 edges, 247966 markings/sec, 45 secs
lola: sara is running 50 secs || 14762753 markings, 19744494 edges, 277434 markings/sec, 50 secs
lola: sara is running 55 secs || 16133849 markings, 21577923 edges, 274219 markings/sec, 55 secs
lola: sara is running 60 secs || 17511919 markings, 23420915 edges, 275614 markings/sec, 60 secs
lola: sara is running 65 secs || 18914685 markings, 25297905 edges, 280553 markings/sec, 65 secs
lola: sara is running 70 secs || 20328230 markings, 27187972 edges, 282709 markings/sec, 70 secs
lola: sara is running 75 secs || 21694427 markings, 29015311 edges, 273239 markings/sec, 75 secs
lola: sara is running 80 secs || 23060100 markings, 30842325 edges, 273135 markings/sec, 80 secs
lola: sara is running 85 secs || 24283766 markings, 32479059 edges, 244733 markings/sec, 85 secs
lola: sara is running 90 secs || 25594175 markings, 34231645 edges, 262082 markings/sec, 90 secs
lola: sara is running 95 secs || 26833051 markings, 35888468 edges, 247775 markings/sec, 95 secs
lola: sara is running 100 secs || 28060365 markings, 37529860 edges, 245463 markings/sec, 100 secs
lola: sara is running 105 secs || 29282685 markings, 39164562 edges, 244464 markings/sec, 105 secs
lola: sara is running 110 secs || 30701409 markings, 41062622 edges, 283745 markings/sec, 110 secs
lola: sara is running 115 secs || 32136147 markings, 42981436 edges, 286948 markings/sec, 115 secs
lola: sara is running 120 secs || 32539300 markings, 43520372 edges, 80631 markings/sec, 120 secs
lola: sara is running 125 secs || 32541136 markings, 43522796 edges, 367 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1022 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((FIREABLE(t) U E (G (FIREABLE(t192))))) OR FIREABLE(t22))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((NOT FIREABLE(t) R F (NOT FIREABLE(t192))) AND NOT FIREABLE(t22))
lola: processed formula length: 66
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 102 markings, 202 edges
lola: subprocess 14 will run for 1533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t138))) OR (FIREABLE(t338) AND A (F (FIREABLE(t86)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1533 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t338)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula: FIREABLE(t338)
lola: processed formula length: 14
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t86)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t86)
lola: processed formula length: 17
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 (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 12 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3066 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((FIREABLE(t346) OR FIREABLE(t43)) U (FIREABLE(t222) OR FIREABLE(t393))))))
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((FIREABLE(t346) OR FIREABLE(t43)) U (FIREABLE(t222) OR FIREABLE(t393))))
lola: processed formula length: 78
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 10 markings, 10 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216))))) OR (A (X (E (X (FIREABLE(t380))))) AND A (X (E (F (FIREABLE(t273)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))))
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(t361) AND NOT FIREABLE(t121)) U (FIREABLE(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))))
lola: processed formula length: 103
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 (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: 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(t65) OR (FIREABLE(t211) AND FIREABLE(t216)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
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: A (X (E (F (FIREABLE(t273)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(FIREABLE(t273)))
lola: processed formula length: 22
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1416430 markings, 1893158 edges, 283286 markings/sec, 0 secs
lola: 2825101 markings, 3777752 edges, 281734 markings/sec, 5 secs
lola: 4214694 markings, 5635739 edges, 277919 markings/sec, 10 secs
lola: 5721684 markings, 7651324 edges, 301398 markings/sec, 15 secs
lola: 7229587 markings, 9668763 edges, 301581 markings/sec, 20 secs
lola: 8725414 markings, 11668900 edges, 299165 markings/sec, 25 secs
lola: 10212980 markings, 13658890 edges, 297513 markings/sec, 30 secs
lola: 11674167 markings, 15613109 edges, 292237 markings/sec, 35 secs
lola: 13171150 markings, 17615158 edges, 299397 markings/sec, 40 secs
lola: 14666593 markings, 19616029 edges, 299089 markings/sec, 45 secs
lola: 16135561 markings, 21580293 edges, 293794 markings/sec, 50 secs
lola: 17560652 markings, 23486369 edges, 285018 markings/sec, 55 secs
lola: 19050775 markings, 25479997 edges, 298025 markings/sec, 60 secs
lola: 20536175 markings, 27466156 edges, 297080 markings/sec, 65 secs
lola: 22012277 markings, 29440725 edges, 295220 markings/sec, 70 secs
lola: 23498186 markings, 31428128 edges, 297182 markings/sec, 75 secs
lola: 24939911 markings, 33356144 edges, 288345 markings/sec, 80 secs
lola: 26335986 markings, 35223928 edges, 279215 markings/sec, 85 secs
lola: 27787270 markings, 37164856 edges, 290257 markings/sec, 90 secs
lola: 29212996 markings, 39071453 edges, 285145 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (E (X (FIREABLE(t380)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX(FIREABLE(t380)))
lola: processed formula length: 22
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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ...considering subproblem: (A (G ((E (X (FIREABLE(t259))) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139))))) AND A (F (FIREABLE(t314))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t314)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t314)
lola: processed formula length: 18
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 (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (FIREABLE(t259))) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EX(FIREABLE(t259)) OR (NOT FIREABLE(t373) AND NOT FIREABLE(t139))))
lola: processed formula length: 71
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 636534 markings, 850259 edges, 127307 markings/sec, 0 secs
lola: 1282867 markings, 1714364 edges, 129267 markings/sec, 5 secs
lola: 1873459 markings, 2504965 edges, 118118 markings/sec, 10 secs
lola: 2472943 markings, 3306178 edges, 119897 markings/sec, 15 secs
lola: 3020856 markings, 4039316 edges, 109583 markings/sec, 20 secs
lola: 3582402 markings, 4790075 edges, 112309 markings/sec, 25 secs
lola: 4161206 markings, 5564378 edges, 115761 markings/sec, 30 secs
lola: 4716911 markings, 6308119 edges, 111141 markings/sec, 35 secs
lola: 5285464 markings, 7067901 edges, 113711 markings/sec, 40 secs
lola: 5924468 markings, 7922866 edges, 127801 markings/sec, 45 secs
lola: 6567488 markings, 8782658 edges, 128604 markings/sec, 50 secs
lola: 7196674 markings, 9624844 edges, 125837 markings/sec, 55 secs
lola: 7851117 markings, 10499447 edges, 130889 markings/sec, 60 secs
lola: 8499004 markings, 11366113 edges, 129577 markings/sec, 65 secs
lola: 9148712 markings, 12235459 edges, 129942 markings/sec, 70 secs
lola: 9809707 markings, 13118918 edges, 132199 markings/sec, 75 secs
lola: 10461634 markings, 13991648 edges, 130385 markings/sec, 80 secs
lola: 11111901 markings, 14860956 edges, 130053 markings/sec, 85 secs
lola: 11756968 markings, 15723857 edges, 129013 markings/sec, 90 secs
lola: 12388699 markings, 16569053 edges, 126346 markings/sec, 95 secs
lola: 13020243 markings, 17413173 edges, 126309 markings/sec, 100 secs
lola: 13647368 markings, 18252898 edges, 125425 markings/sec, 105 secs
lola: 14280063 markings, 19098274 edges, 126539 markings/sec, 110 secs
lola: 14909187 markings, 19940059 edges, 125825 markings/sec, 115 secs
lola: 15543288 markings, 20788429 edges, 126820 markings/sec, 120 secs
lola: 16168682 markings, 21624420 edges, 125079 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((NOT FIREABLE(t269) OR NOT FIREABLE(t107))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((NOT FIREABLE(t269) OR NOT FIREABLE(t107))))
lola: processed formula length: 51
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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1398735 markings, 1869266 edges, 279747 markings/sec, 0 secs
lola: 2837260 markings, 3793976 edges, 287705 markings/sec, 5 secs
lola: 4197494 markings, 5612836 edges, 272047 markings/sec, 10 secs
lola: 5620343 markings, 7515789 edges, 284570 markings/sec, 15 secs
lola: 6985529 markings, 9342292 edges, 273037 markings/sec, 20 secs
lola: 8383821 markings, 11212560 edges, 279658 markings/sec, 25 secs
lola: 9758270 markings, 13050394 edges, 274890 markings/sec, 30 secs
lola: 11131849 markings, 14888324 edges, 274716 markings/sec, 35 secs
lola: 12542633 markings, 16775332 edges, 282157 markings/sec, 40 secs
lola: 13998810 markings, 18722244 edges, 291235 markings/sec, 45 secs
lola: 15452262 markings, 20667045 edges, 290690 markings/sec, 50 secs
lola: 16829904 markings, 22509514 edges, 275528 markings/sec, 55 secs
lola: 18252463 markings, 24411731 edges, 284512 markings/sec, 60 secs
lola: 19701043 markings, 26349078 edges, 289716 markings/sec, 65 secs
lola: 21141895 markings, 28277048 edges, 288170 markings/sec, 70 secs
lola: 22571597 markings, 30188566 edges, 285940 markings/sec, 75 secs
lola: 24012314 markings, 32115624 edges, 288143 markings/sec, 80 secs
lola: 25374216 markings, 33937574 edges, 272380 markings/sec, 85 secs
lola: 26781340 markings, 35819128 edges, 281425 markings/sec, 90 secs
lola: 28224927 markings, 37749844 edges, 288717 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(t329) OR FIREABLE(t382) OR NOT FIREABLE(t141) OR ((FIREABLE(t238) OR FIREABLE(t254)) AND FIREABLE(t93))) U FIREABLE(t224)))
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(t329) OR FIREABLE(t382) OR NOT FIREABLE(t141) OR ((FIREABLE(t238) OR FIREABLE(t254)) AND FIREABLE(t93))) U FIREABLE(t224)))
lola: processed formula length: 141
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 (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: 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(t224)
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-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: sara is running 0 secs || 1366503 markings, 1826145 edges, 273301 markings/sec, 0 secs
lola: sara is running 5 secs || 2806873 markings, 3753044 edges, 288074 markings/sec, 5 secs
lola: sara is running 10 secs || 4244118 markings, 5675210 edges, 287449 markings/sec, 10 secs
lola: sara is running 15 secs || 5684271 markings, 7601186 edges, 288031 markings/sec, 15 secs
lola: sara is running 20 secs || 7088263 markings, 9479627 edges, 280798 markings/sec, 20 secs
lola: sara is running 25 secs || 8497206 markings, 11363702 edges, 281789 markings/sec, 25 secs
lola: sara is running 30 secs || 9884130 markings, 13218586 edges, 277385 markings/sec, 30 secs
lola: sara is running 35 secs || 11210834 markings, 14993616 edges, 265341 markings/sec, 35 secs
lola: sara is running 40 secs || 12461758 markings, 16666819 edges, 250185 markings/sec, 40 secs
lola: sara is running 45 secs || 13681597 markings, 18298525 edges, 243968 markings/sec, 45 secs
lola: sara is running 50 secs || 14896132 markings, 19922752 edges, 242907 markings/sec, 50 secs
lola: sara is running 55 secs || 16112299 markings, 21549155 edges, 243233 markings/sec, 55 secs
lola: sara is running 60 secs || 17316878 markings, 23160057 edges, 240916 markings/sec, 60 secs
lola: sara is running 65 secs || 18559918 markings, 24822656 edges, 248608 markings/sec, 65 secs
lola: sara is running 70 secs || 19794827 markings, 26475168 edges, 246982 markings/sec, 70 secs
lola: sara is running 75 secs || 21024475 markings, 28119604 edges, 245930 markings/sec, 75 secs
lola: sara is running 80 secs || 22242614 markings, 29749289 edges, 243628 markings/sec, 80 secs
lola: sara is running 85 secs || 23568280 markings, 31521544 edges, 265133 markings/sec, 85 secs
lola: sara is running 90 secs || 24931031 markings, 33344210 edges, 272550 markings/sec, 90 secs
lola: sara is running 95 secs || 26338575 markings, 35227366 edges, 281509 markings/sec, 95 secs
lola: sara is running 100 secs || 27626601 markings, 36950409 edges, 257605 markings/sec, 100 secs
lola: sara is running 105 secs || 28854482 markings, 38592176 edges, 245576 markings/sec, 105 secs
lola: sara is running 110 secs || 30075471 markings, 40225313 edges, 244198 markings/sec, 110 secs
lola: sara is running 115 secs || 31353074 markings, 41933926 edges, 255521 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t138))) OR (FIREABLE(t338) AND A (F (FIREABLE(t86)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(t338)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t338)
lola: processed formula length: 14
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t86)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: NOT FIREABLE(t86)
lola: processed formula length: 17
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 (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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 12 markings, 12 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t138)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (NOT FIREABLE(t138)))
lola: processed formula length: 26
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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: NOT FIREABLE(t138)
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-22-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: 51 markings, 50 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no unknown no unknown no no no yes no yes unknown yes unknown no yes
lola:
preliminary result: no no unknown no unknown no no no yes no yes unknown yes unknown no yes
lola: memory consumption: 15084 KB
lola: time consumption: 969 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

BK_STOP 1552686139039

--------------------
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-0050"
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-0050, 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-155246550200941"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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