Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853700812.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PhaseVariation-PT-D20CS100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853700812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 4.8K Apr 12 00:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 12 00:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 11 00:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 00:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 10 08:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 08:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 9 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 9 13:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 13M Mar 24 05:37 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 PhaseVariation-PT-D20CS100-CTLFireability-00
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-01
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-02
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-03
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-04
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-05
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-06
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-07
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-08
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-09
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-10
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-11
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-12
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-13
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-14
FORMULA_NAME PhaseVariation-PT-D20CS100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591171420617

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 08:03:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 08:03:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 08:03:43] [INFO ] Load time of PNML (sax parser for PT used): 673 ms
[2020-06-03 08:03:43] [INFO ] Transformed 1202 places.
[2020-06-03 08:03:43] [INFO ] Transformed 13457 transitions.
[2020-06-03 08:03:43] [INFO ] Parsed PT model containing 1202 places and 13457 transitions in 834 ms.
Deduced a syphon composed of 2 places in 30 ms
Reduce places removed 2 places and 52 transitions.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 136 ms.
Incomplete random walk after 100000 steps, including 383 resets, run finished after 4482 ms. (steps per millisecond=22 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
[2020-06-03 08:03:48] [INFO ] Flow matrix only has 799 transitions (discarded 12606 similar events)
// Phase 1: matrix 799 rows 1199 cols
[2020-06-03 08:03:48] [INFO ] Computed 400 place invariants in 44 ms
[2020-06-03 08:03:49] [INFO ] [Real]Absence check using 400 positive place invariants in 139 ms returned unsat
[2020-06-03 08:03:49] [INFO ] [Real]Absence check using 400 positive place invariants in 115 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-06-03 08:03:50] [INFO ] Flatten gal took : 1032 ms
[2020-06-03 08:03:51] [INFO ] Flatten gal took : 520 ms
[2020-06-03 08:03:51] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 39 ms.
[2020-06-03 08:03:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 186 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PhaseVariation-PT-D20CS100 @ 3570 seconds

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D20CS100-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3497
rslt: Output for CTLFireability @ PhaseVariation-PT-D20CS100

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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": "Wed Jun 3 08:03:51 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 218
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EX(AF(AG(((1 <= p404) AND (1 <= p1001) AND (1 <= p1197)))))",
"processed_size": 59,
"rewrites": 34
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 8649,
"markings": 4323,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 233
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "EF((AX(((1 <= p544) AND (1 <= p1091) AND (1 <= p1197))) AND (((p394 <= 0) OR (p994 <= 0) OR (p1197 <= 0)) AND (((p400 <= 0) OR (p999 <= 0) OR (p1197 <= 0)) AND ((p106 <= 0) OR (p832 <= 0) OR (p1197 <= 0))))))",
"processed_size": 214,
"rewrites": 33
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p669) AND (1 <= p1112) AND (1 <= p1197))",
"processed_size": 47,
"rewrites": 33
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 269
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p777 <= 0) OR (p1185 <= 0) OR (p1197 <= 0))",
"processed_size": 47,
"rewrites": 34
},
"result":
{
"edges": 314,
"markings": 315,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 13404
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p517 <= 0) OR (p1057 <= 0) OR (p1197 <= 0))",
"processed_size": 47,
"rewrites": 34
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13405
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((p176 <= 0) OR (p868 <= 0) OR (p1197 <= 0)))",
"processed_size": 50,
"rewrites": 32
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((p121 <= 0) OR (p839 <= 0) OR (p1197 <= 0)))",
"processed_size": 50,
"rewrites": 32
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((p288 <= 0) OR (p943 <= 0) OR (p1197 <= 0)))",
"processed_size": 50,
"rewrites": 32
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p733) AND (1 <= p1145) AND (1 <= p1197))",
"processed_size": 47,
"rewrites": 34
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p776 <= 0) OR (p806 <= 0) OR (p1197 <= 0))))",
"processed_size": 54,
"rewrites": 33
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AX(((1 <= p652) AND (1 <= p1123) AND (1 <= p1197)))",
"processed_size": 51,
"rewrites": 32
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "AX((AF(((1 <= p290) AND (1 <= p963) AND (1 <= p1197) AND (1 <= p587) AND (1 <= p1071))) OR (((1 <= p702) AND (1 <= p1127) AND (1 <= p1197)) OR (((1 <= p361) AND (1 <= p957) AND (1 <= p1197)) OR ((1 <= p693) AND (1 <= p1164) AND (1 <= p1197))))))",
"processed_size": 245,
"rewrites": 33
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 314,
"markings": 315,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 437
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p405) AND (1 <= p1039) AND (1 <= p1197))",
"processed_size": 47,
"rewrites": 34
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 499
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p330 <= 0) OR (p982 <= 0) OR (p1197 <= 0))",
"processed_size": 46,
"rewrites": 34
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13405
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 583
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p694 <= 0) OR (p1125 <= 0) OR (p1197 <= 0) OR (p1164 <= 0))",
"processed_size": 64,
"rewrites": 34
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "state space /EFEG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13404
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability_of_possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 699
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (G (((p135 <= 0) OR (p844 <= 0) OR (p1197 <= 0) OR ((1 <= p292) AND (1 <= p963) AND (1 <= p1197)))))",
"processed_size": 105,
"rewrites": 32
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13405
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 874
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "AF(EG(((p782 <= 0) OR (p809 <= 0) OR (p1197 <= 0))))",
"processed_size": 54,
"rewrites": 33
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 318,
"markings": 318,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1165
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A(EG(((1 <= p308) AND (1 <= p971) AND (1 <= p1197) AND (1 <= p184) AND (1 <= p870))) U EG(((p340 <= 0) OR (p988 <= 0) OR (p1197 <= 0))))",
"processed_size": 138,
"rewrites": 34
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 316,
"markings": 316,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1748
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (((((p265 <= 0) OR (p910 <= 0) OR (p1197 <= 0)) AND ((p200 <= 0) OR (p897 <= 0) OR (p1197 <= 0)) AND ((p339 <= 0) OR (p969 <= 0) OR (p1197 <= 0))) U DEADLOCK))",
"processed_size": 167,
"rewrites": 34
},
"result":
{
"edges": 314,
"markings": 315,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 13404
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": null,
"problems": null
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3497
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))))",
"processed_size": 55,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))))",
"processed_size": 55,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((p319 <= 0) OR (p938 <= 0) OR (p1197 <= 0))",
"processed_size": 46,
"rewrites": 35
},
"result":
{
"edges": 315,
"markings": 316,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 13404
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 510508,
"runtime": 73.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(E(G(**)))) : E(X(A(F(A(G(**)))))) : E(F((A(X(**)) AND (** AND (** AND **))))) : E(X(E(F(**)))) : A(X(A(F(**)))) : A(G(E(F(**)))) : (A(F(**)) OR (A(X(**)) AND (** AND (** AND **)))) : E(G(**)) : (A(X(A(G(*)))) AND (A(X(**)) AND (A(X(**)) AND A(X(**))))) : (E(F(**)) AND A(G(A(F(**))))) : A(F(**)) : (A(X(**)) OR (A(G(*)) AND A(X(*)))) : A((E(G(**)) U E(G(*)))) : E(F(E(G(**)))) : E((** U DEADLOCK)) : A(X((A(F(**)) OR (** OR (** OR **)))))"
},
"net":
{
"arcs": 93001,
"conflict_clusters": 1,
"places": 1199,
"places_significant": 799,
"singleton_clusters": 0,
"transitions": 13405
},
"result":
{
"preliminary_value": "yes no yes yes no no no yes no no no no yes yes yes no ",
"value": "yes no yes yes no no no yes no no no no yes yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 14604/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 38368
lola: finding significant places
lola: 1199 places, 13405 transitions, 799 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 (E (G (((p782 <= 0) OR (p809 <= 0) OR (p1197 <= 0)))))) : E (X (A (F (A (G (((1 <= p404) AND (1 <= p1001) AND (1 <= p1197)))))))) : E (F ((((A (X (((1 <= p544) AND (1 <= p1091) AND (1 <= p1197)))) AND ((p394 <= 0) OR (p994 <= 0) OR (p1197 <= 0))) AND ((p400 <= 0) OR (p999 <= 0) OR (p1197 <= 0))) AND ((p106 <= 0) OR (p832 <= 0) OR (p1197 <= 0))))) : E (X (E (F (((1 <= p669) AND (1 <= p1112) AND (1 <= p1197)))))) : A (X (A (F (((1 <= p777) AND (1 <= p1185) AND (1 <= p1197)))))) : A (G (E (F (E (F (((1 <= p405) AND (1 <= p1039) AND (1 <= p1197)))))))) : (A (F (A ((((1 <= p91) AND (1 <= p823) AND (1 <= p1197)) U ((1 <= p517) AND (1 <= p1057) AND (1 <= p1197)))))) OR (((A (X (((1 <= p312) AND (1 <= p933) AND (1 <= p1197)))) AND (1 <= p765)) AND (1 <= p1161)) AND (1 <= p1197))) : E (G (((p135 <= 0) OR (p844 <= 0) OR (p1197 <= 0) OR ((1 <= p292) AND (1 <= p963) AND (1 <= p1197))))) : A (X ((((NOT(E (F (((1 <= p733) AND (1 <= p1145) AND (1 <= p1197))))) AND ((p288 <= 0) OR (p943 <= 0) OR (p1197 <= 0))) AND ((p121 <= 0) OR (p839 <= 0) OR (p1197 <= 0))) AND ((p176 <= 0) OR (p868 <= 0) OR (p1197 <= 0))))) : (E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0)))) AND A (G (A (F (((1 <= p319) AND (1 <= p938) AND (1 <= p1197))))))) : A (F (((1 <= p330) AND (1 <= p982) AND (1 <= p1197)))) : (A (X (((1 <= p652) AND (1 <= p1123) AND (1 <= p1197)))) OR (NOT(E (F (((1 <= p776) AND (1 <= p806) AND (1 <= p1197))))) AND NOT(E (X ((((1 <= p514) AND (1 <= p1054) AND (1 <= p1197)) OR ((1 <= p632) AND (1 <= p1094) AND (1 <= p1197)))))))) : A ((E (G (((1 <= p308) AND (1 <= p971) AND (1 <= p1197) AND (1 <= p184) AND (1 <= p870)))) U NOT(A (F (((1 <= p340) AND (1 <= p988) AND (1 <= p1197))))))) : E (F (E (G (((p694 <= 0) OR (p1125 <= 0) OR (p1197 <= 0) OR (p1164 <= 0)))))) : E (((((p265 <= 0) OR (p910 <= 0) OR (p1197 <= 0)) AND ((p200 <= 0) OR (p897 <= 0) OR (p1197 <= 0)) AND ((p339 <= 0) OR (p969 <= 0) OR (p1197 <= 0))) U A (X ((1 <= 0))))) : A (X ((((A (F (((1 <= p290) AND (1 <= p963) AND (1 <= p1197) AND (1 <= p587) AND (1 <= p1071)))) OR ((1 <= p702) AND (1 <= p1127) AND (1 <= p1197))) OR ((1 <= p361) AND (1 <= p957) AND (1 <= p1197))) OR ((1 <= p693) AND (1 <= p1164) AND (1 <= p1197)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (A (G (((1 <= p404) AND (1 <= p1001) AND (1 <= p1197))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AF(AG(((1 <= p404) AND (1 <= p1001) AND (1 <= p1197)))))
lola: processed formula length: 59
lola: 34 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: 4323 markings, 8649 edges
lola: ========================================
lola: subprocess 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((1 <= p544) AND (1 <= p1091) AND (1 <= p1197)))) AND (((p394 <= 0) OR (p994 <= 0) OR (p1197 <= 0)) AND (((p400 <= 0) OR (p999 <= 0) OR (p1197 <= 0)) AND ((p106 <= 0) OR (p832 <= 0) OR (p1197 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((1 <= p544) AND (1 <= p1091) AND (1 <= p1197))) AND (((p394 <= 0) OR (p994 <= 0) OR (p1197 <= 0)) AND (((p400 <= 0) OR (p999 <= 0) OR (p1197 <= 0)) AND ((p106 <= 0) OR (p832 <= 0) OR (p1197 <= 0))))))
lola: processed formula length: 214
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 316 markings, 315 edges
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p669) AND (1 <= p1112) AND (1 <= p1197))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: ((1 <= p669) AND (1 <= p1112) AND (1 <= p1197))
lola: processed formula length: 47
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p669) AND (1 <= p1112) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p777) AND (1 <= p1185) AND (1 <= p1197))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p777 <= 0) OR (p1185 <= 0) OR (p1197 <= 0))
lola: processed formula length: 47
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p777) AND (1 <= p1185) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 315 markings, 314 edges
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p517) AND (1 <= p1057) AND (1 <= p1197)))) OR (A (X (((1 <= p312) AND (1 <= p933) AND (1 <= p1197)))) AND ((1 <= p765) AND ((1 <= p1161) AND (1 <= p1197)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p765) AND ((1 <= p1161) AND (1 <= p1197)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p765) AND (1 <= p1161) AND (1 <= p1197))
lola: processed formula length: 47
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p517) AND (1 <= p1057) AND (1 <= p1197))))
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: ((p517 <= 0) OR (p1057 <= 0) OR (p1197 <= 0))
lola: processed formula length: 47
lola: 34 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: ((1 <= p517) AND (1 <= p1057) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 316 markings, 315 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (((p733 <= 0) OR (p1145 <= 0) OR (p1197 <= 0)))))) AND (A (X (((p288 <= 0) OR (p943 <= 0) OR (p1197 <= 0)))) AND (A (X (((p121 <= 0) OR (p839 <= 0) OR (p1197 <= 0)))) AND A (X (((p176 <= 0) OR (p868 <= 0) OR (p1197 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p176 <= 0) OR (p868 <= 0) OR (p1197 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p176 <= 0) OR (p868 <= 0) OR (p1197 <= 0)))
lola: processed formula length: 50
lola: 32 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: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p121 <= 0) OR (p839 <= 0) OR (p1197 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p121 <= 0) OR (p839 <= 0) OR (p1197 <= 0)))
lola: processed formula length: 50
lola: 32 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: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p288 <= 0) OR (p943 <= 0) OR (p1197 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p288 <= 0) OR (p943 <= 0) OR (p1197 <= 0)))
lola: processed formula length: 50
lola: 32 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: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p733 <= 0) OR (p1145 <= 0) OR (p1197 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p733) AND (1 <= p1145) AND (1 <= p1197))
lola: processed formula length: 47
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p733) AND (1 <= p1145) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (((1 <= p652) AND (1 <= p1123) AND (1 <= p1197)))) OR (A (G (((p776 <= 0) OR (p806 <= 0) OR (p1197 <= 0)))) AND A (X ((((p514 <= 0) OR (p1054 <= 0) OR (p1197 <= 0)) AND ((p632 <= 0) OR (p1094 <= 0) OR (p1197 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p776 <= 0) OR (p806 <= 0) OR (p1197 <= 0))))
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 (((p776 <= 0) OR (p806 <= 0) OR (p1197 <= 0))))
lola: processed formula length: 54
lola: 33 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: ((1 <= p776) AND (1 <= p806) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p652) AND (1 <= p1123) AND (1 <= p1197))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p652) AND (1 <= p1123) AND (1 <= p1197)))
lola: processed formula length: 51
lola: 32 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (F (((1 <= p290) AND (1 <= p963) AND (1 <= p1197) AND (1 <= p587) AND (1 <= p1071)))) OR (((1 <= p702) AND (1 <= p1127) AND (1 <= p1197)) OR (((1 <= p361) AND (1 <= p957) AND (1 <= p1197)) OR ((1 <= p693) AND (1 <= p1164) AND (1 <= p1197)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AF(((1 <= p290) AND (1 <= p963) AND (1 <= p1197) AND (1 <= p587) AND (1 <= p1071))) OR (((1 <= p702) AND (1 <= p1127) AND (1 <= p1197)) OR (((1 <= p361) AND (1 <= p957) AND (1 <= p1197)) OR ((1 <= p693) AND (1 <= p1164) AND (1 <= p1197))))))
lola: processed formula length: 245
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 315 markings, 314 edges
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p405) AND (1 <= p1039) AND (1 <= p1197))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p405) AND (1 <= p1039) AND (1 <= p1197))
lola: processed formula length: 47
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p405 <= 0) OR (p1039 <= 0) OR (p1197 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p405) AND (1 <= p1039) AND (1 <= p1197))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p330) AND (1 <= p982) AND (1 <= p1197))))
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: ((p330 <= 0) OR (p982 <= 0) OR (p1197 <= 0))
lola: processed formula length: 46
lola: 34 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: ((1 <= p330) AND (1 <= p982) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 316 markings, 315 edges
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((p694 <= 0) OR (p1125 <= 0) OR (p1197 <= 0) OR (p1164 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: ((p694 <= 0) OR (p1125 <= 0) OR (p1197 <= 0) OR (p1164 <= 0))
lola: processed formula length: 64
lola: 34 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: 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 started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p694) AND (1 <= p1125) AND (1 <= p1197) AND (1 <= p1164))
lola: state equation task get result unparse finished id 0
lola: formula 1: ((p694 <= 0) OR (p1125 <= 0) OR (p1197 <= 0) OR (p1164 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 316 markings, 315 edges
lola: ========================================
lola: subprocess 11 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p135 <= 0) OR (p844 <= 0) OR (p1197 <= 0) OR ((1 <= p292) AND (1 <= p963) AND (1 <= p1197)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p135 <= 0) OR (p844 <= 0) OR (p1197 <= 0) OR ((1 <= p292) AND (1 <= p963) AND (1 <= p1197)))))
lola: processed formula length: 105
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p135) AND (1 <= p844) AND (1 <= p1197) AND ((p292 <= 0) OR (p963 <= 0) OR (p1197 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 316 markings, 315 edges
lola: ========================================
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((p782 <= 0) OR (p809 <= 0) OR (p1197 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((p782 <= 0) OR (p809 <= 0) OR (p1197 <= 0))))
lola: processed formula length: 54
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 318 markings, 318 edges
lola: ========================================
lola: subprocess 13 will run for 1165 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G (((1 <= p308) AND (1 <= p971) AND (1 <= p1197) AND (1 <= p184) AND (1 <= p870)))) U E (G (((p340 <= 0) OR (p988 <= 0) OR (p1197 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG(((1 <= p308) AND (1 <= p971) AND (1 <= p1197) AND (1 <= p184) AND (1 <= p870))) U EG(((p340 <= 0) OR (p988 <= 0) OR (p1197 <= 0))))
lola: processed formula length: 138
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 316 markings, 316 edges
lola: ========================================
lola: subprocess 14 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p265 <= 0) OR (p910 <= 0) OR (p1197 <= 0)) AND ((p200 <= 0) OR (p897 <= 0) OR (p1197 <= 0)) AND ((p339 <= 0) OR (p969 <= 0) OR (p1197 <= 0))) U DEADLOCK))
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 (((((p265 <= 0) OR (p910 <= 0) OR (p1197 <= 0)) AND ((p200 <= 0) OR (p897 <= 0) OR (p1197 <= 0)) AND ((p339 <= 0) OR (p969 <= 0) OR (p1197 <= 0))) U DEADLOCK))
lola: processed formula length: 167
lola: 34 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: DEADLOCK
lola: state equation task get result unparse finished id 0
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 315 markings, 314 edges
lola: ========================================
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0)))) AND A (G (A (F (((1 <= p319) AND (1 <= p938) AND (1 <= p1197)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))))
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 (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))))
lola: processed formula length: 55
lola: 32 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: ((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0)))) AND A (G (A (F (((1 <= p319) AND (1 <= p938) AND (1 <= p1197)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))))
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 (((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))))
lola: processed formula length: 55
lola: 32 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: ((p568 <= 0) OR (p1062 <= 0) OR (p1197 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p319) AND (1 <= p938) AND (1 <= p1197))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p319 <= 0) OR (p938 <= 0) OR (p1197 <= 0))
lola: processed formula length: 46
lola: 35 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 /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: 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: ((1 <= p319) AND (1 <= p938) AND (1 <= p1197))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p319 <= 0) OR (p938 <= 0) OR (p1197 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 316 markings, 315 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no yes no no no no yes yes yes no
lola:
preliminary result: yes no yes yes no no no yes no no no no yes yes yes no
lola: memory consumption: 510508 KB
lola: time consumption: 73 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhaseVariation-PT-D20CS100"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PhaseVariation-PT-D20CS100, 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 r174-csrt-158987853700812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D20CS100.tgz
mv PhaseVariation-PT-D20CS100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "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
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;