Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938800332.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RwMutex-PT-r2000w0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938800332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 3.4K Apr 12 12:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 12:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 9 23:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 9 23:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9M Mar 24 05:38 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-00
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-01
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-02
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-03
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-04
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-05
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-06
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-07
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-08
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-09
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-10
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-11
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-12
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-13
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-14
FORMULA_NAME RwMutex-PT-r2000w0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591234130661

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:28:53] [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-04 01:28:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:28:54] [INFO ] Load time of PNML (sax parser for PT used): 538 ms
[2020-06-04 01:28:54] [INFO ] Transformed 6020 places.
[2020-06-04 01:28:54] [INFO ] Transformed 4020 transitions.
[2020-06-04 01:28:54] [INFO ] Parsed PT model containing 6020 places and 4020 transitions in 739 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 49 ms.
Finished random walk after 13473 steps, including 0 resets, run visited all 38 properties in 3908 ms. (steps per millisecond=3 )
[2020-06-04 01:29:05] [INFO ] Flatten gal took : 7155 ms
[2020-06-04 01:29:12] [INFO ] Flatten gal took : 6444 ms
[2020-06-04 01:29:12] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-04 01:29:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 64 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RwMutex-PT-r2000w0010 @ 3570 seconds

FORMULA RwMutex-PT-r2000w0010-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r2000w0010-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1897
rslt: Output for CTLFireability @ RwMutex-PT-r2000w0010

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 01:29:12 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 206
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(A(EF((1 <= p2362)) U (((p3436 <= 0) OR (p5810 <= 0)) AND (1 <= p1566))) AND EX(AG(((1 <= p4346) AND (1 <= p5911)))))",
"processed_size": 118,
"rewrites": 30
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 1847,
"markings": 643,
"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": 220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "EG(EX(((1 <= p1995) OR (1 <= p2757) OR (p2423 <= 0) OR (p3699 <= 0))))",
"processed_size": 73,
"rewrites": 28
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 643,
"markings": 643,
"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": 236
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p640) AND (1 <= p5095) AND (1 <= p831) AND (1 <= p5286))",
"processed_size": 63,
"rewrites": 28
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space /EXEF",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "AX(((1 <= p423) AND (1 <= p3499) AND (1 <= p583) AND (1 <= p5038)))",
"processed_size": 67,
"rewrites": 27
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 275
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AF(AX(((1 <= p1276) AND (1 <= p2763))))",
"processed_size": 39,
"rewrites": 28
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 643,
"markings": 643,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 309
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "((1 <= p1863) AND (p2848 <= 0) AND ((p158 <= 0) OR (p4613 <= 0)))",
"processed_size": 66,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 386
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(EX(((1 <= p898) AND (1 <= p5353))))",
"processed_size": 38,
"rewrites": 28
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 643,
"markings": 643,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 343
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "((1 <= p2842) AND ((p986 <= 0) OR (p5441 <= 0)))",
"processed_size": 49,
"rewrites": 30
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 12
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 386
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p1853 <= 0) OR ((1 <= p3893) AND (1 <= p4356)) OR ((1 <= p3988) AND (1 <= p5322)))",
"processed_size": 86,
"rewrites": 29
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 26
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 4
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 479
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 2,
"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": "AF(E(((p3932 <= 0) OR (p4756 <= 0)) U ((p321 <= 0) OR (p4776 <= 0))))",
"processed_size": 71,
"rewrites": 28
},
"net":
{
"conflict_clusters": 2011,
"singleton_clusters": 0
},
"result":
{
"edges": 1804,
"markings": 902,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 675
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p1908 <= 0)",
"processed_size": 12,
"rewrites": 30
},
"result":
{
"edges": 643,
"markings": 643,
"produced_by": "state space /EGEF",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_invariance",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p1138 <= 0)",
"processed_size": 12,
"rewrites": 29
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p3938) AND (1 <= p4812))",
"processed_size": 31,
"rewrites": 26
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2701
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p430 <= 0) OR (p4885 <= 0))))",
"processed_size": 38,
"rewrites": 27
},
"result":
{
"edges": 1,
"markings": 2,
"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": 2,
"problems": 2
},
"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": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F (((p430 <= 0) OR (p4885 <= 0))))",
"processed_size": 38,
"rewrites": 27
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3752,
"runtime": 1673.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : A(G((A(F(**)) OR A(G(**))))) : (E(G(*)) AND (A(G(*)) OR **)) : (A((E(F(**)) U **)) AND E(X(A(G(**))))) : E(G(E(X(**)))) : A(G(A(F(**)))) : (E(X(E(F(**)))) AND (E(G(*)) OR (E(X(**)) OR **))) : (E(G(**)) OR (** OR (A(X(**)) OR E(G((E(X(**)) OR **)))))) : A(F(A(G(**)))) : A(F(E((** U **)))) : E((E(G(**)) U **)) : (E(F(*)) AND E(G(E(F(*))))) : (A(F(**)) AND E(F(**))) : (A(X(A(G(**)))) OR A(F(A(X(**))))) : E(F((A(X(**)) AND A(X(**))))) : (E(F(**)) AND (E(G(E(X(**)))) OR **))"
},
"net":
{
"arcs": 52040,
"conflict_clusters": 2011,
"places": 6020,
"places_significant": 2010,
"singleton_clusters": 0,
"transitions": 4020
},
"result":
{
"preliminary_value": "no unknown yes no yes no yes yes no no unknown unknown no no unknown yes ",
"value": "no unknown yes no yes no yes yes no no unknown unknown no no unknown yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 10040/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6020
lola: finding significant places
lola: 6020 places, 4020 transitions, 2010 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 (((1 <= p1853) AND ((p3893 <= 0) OR (p4356 <= 0)) AND ((p3988 <= 0) OR (p5322 <= 0))))) : A (G ((A (F ((((1 <= p4007) AND (1 <= p5500)) OR ((1 <= p4186) AND (1 <= p5751))))) OR A (G (((1 <= p2238) OR ((1 <= p1092) AND (1 <= p5547)))))))) : (E (G (NOT(A (F ((1 <= p2230)))))) AND (NOT(E (F (((1 <= p4003) AND (1 <= p5456))))) OR ((1 <= p3938) AND (1 <= p4812)))) : (A ((E (F ((1 <= p2362))) U (((p3436 <= 0) OR (p5810 <= 0)) AND (1 <= p1566)))) AND E (X (A (G (((1 <= p4346) AND (1 <= p5911))))))) : E (G (E (X (((1 <= p1995) OR (1 <= p2757) OR (p2423 <= 0) OR (p3699 <= 0)))))) : A (G (A (F (((p2842 <= 0) OR ((1 <= p986) AND (1 <= p5441))))))) : (E (X (E (F (((1 <= p640) AND (1 <= p5095) AND (1 <= p831) AND (1 <= p5286)))))) AND ((NOT(A (F ((1 <= p2996)))) OR E (X (((1 <= p2819) AND (1 <= p3010))))) OR (1 <= p2027))) : (((E (G ((p2600 <= 0))) OR (1 <= p2404)) OR A (X (((1 <= p423) AND (1 <= p3499) AND (1 <= p583) AND (1 <= p5038))))) OR E (G ((E (X ((1 <= p1127))) OR ((1 <= p470) AND (1 <= p4925)))))) : A (F (E (G (A (G ((1 <= p1908))))))) : A (F (E ((((p3932 <= 0) OR (p4756 <= 0)) U ((p321 <= 0) OR (p4776 <= 0)))))) : E ((E (G (((1 <= p4370) AND (1 <= p5935)))) U (1 <= p2202))) : (NOT(A (G (((1 <= p430) AND (1 <= p4885))))) AND NOT(A (F (A (G ((1 <= p2593))))))) : (A (F (A ((((1 <= p276) AND (1 <= p4731)) U (1 <= p1138))))) AND A ((A (F (((1 <= p728) AND (1 <= p5183)))) U E (F ((1 <= p1931)))))) : (A (G (A (X (((1 <= p4219) AND (1 <= p5784)))))) OR A (F (A (X (((1 <= p1276) AND (1 <= p2763))))))) : E (F ((A (X ((p1781 <= 0))) AND A (X ((((1 <= p4106) AND (1 <= p5671)) OR (1 <= p2558))))))) : (E (F ((1 <= p3279))) AND (E (G (E (X (((1 <= p898) AND (1 <= p5353)))))) OR ((1 <= p1863) AND (p2848 <= 0) AND ((p158 <= 0) OR (p4613 <= 0)))))
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:461
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:452
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((E (F ((1 <= p2362))) U (((p3436 <= 0) OR (p5810 <= 0)) AND (1 <= p1566)))) AND E (X (A (G (((1 <= p4346) AND (1 <= p5911)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: (A(EF((1 <= p2362)) U (((p3436 <= 0) OR (p5810 <= 0)) AND (1 <= p1566))) AND EX(AG(((1 <= p4346) AND (1 <= p5911)))))
lola: processed formula length: 118
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 643 markings, 1847 edges
lola: ========================================
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((1 <= p1995) OR (1 <= p2757) OR (p2423 <= 0) OR (p3699 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((1 <= p1995) OR (1 <= p2757) OR (p2423 <= 0) OR (p3699 <= 0))))
lola: processed formula length: 73
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 643 markings, 643 edges
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (((1 <= p640) AND (1 <= p5095) AND (1 <= p831) AND (1 <= p5286)))))) AND (E (G ((p2996 <= 0))) OR (E (X (((1 <= p2819) AND (1 <= p3010)))) OR (1 <= p2027))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2027)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2027)
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2996 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p2996 <= 0)))
lola: processed formula length: 20
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p2996)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((1 <= p640) AND (1 <= p5095) AND (1 <= p831) AND (1 <= p5286))))))
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 <= p640) AND (1 <= p5095) AND (1 <= p831) AND (1 <= p5286))
lola: processed formula length: 63
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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 <= p640) AND (1 <= p5095) AND (1 <= p831) AND (1 <= p5286))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p2600 <= 0))) OR ((1 <= p2404) OR (A (X (((1 <= p423) AND (1 <= p3499) AND (1 <= p583) AND (1 <= p5038)))) OR E (G ((E (X ((1 <= p1127))) OR ((1 <= p470) AND (1 <= p4925))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p423) AND (1 <= p3499) AND (1 <= p583) AND (1 <= p5038))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p423) AND (1 <= p3499) AND (1 <= p583) AND (1 <= p5038)))
lola: processed formula length: 67
lola: 27 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: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2404)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2404)
lola: processed formula length: 12
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2600 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p2600 <= 0)))
lola: processed formula length: 20
lola: 27 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 <= p2600)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (((1 <= p4219) AND (1 <= p5784)))))) OR A (F (A (X (((1 <= p1276) AND (1 <= p2763)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p1276) AND (1 <= p2763))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((1 <= p1276) AND (1 <= p2763))))
lola: processed formula length: 39
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 643 markings, 643 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p4219) AND (1 <= p5784))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p4219 <= 0) OR (p5784 <= 0))
lola: processed formula length: 31
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4219 <= 0) OR (p5784 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 2 markings, 1 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((p1781 <= 0))) AND A (X ((((1 <= p4106) AND (1 <= p5671)) OR (1 <= p2558)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((p1781 <= 0)) AND AX((((1 <= p4106) AND (1 <= p5671)) OR (1 <= p2558)))))
lola: processed formula length: 81
lola: 29 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: ========================================
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 29974 markings, 129744 edges, 5995 markings/sec, 0 secs
lola: 60520 markings, 273867 edges, 6109 markings/sec, 5 secs
lola: 90811 markings, 414958 edges, 6058 markings/sec, 10 secs
lola: 121241 markings, 548030 edges, 6086 markings/sec, 15 secs
lola: 151050 markings, 688551 edges, 5962 markings/sec, 20 secs
lola: 181081 markings, 831454 edges, 6006 markings/sec, 25 secs
lola: 210181 markings, 973809 edges, 5820 markings/sec, 30 secs
lola: 239317 markings, 1116233 edges, 5827 markings/sec, 35 secs
lola: 267929 markings, 1264614 edges, 5722 markings/sec, 40 secs
lola: 296566 markings, 1416525 edges, 5727 markings/sec, 45 secs
lola: 324674 markings, 1567537 edges, 5622 markings/sec, 50 secs
lola: 354537 markings, 1695598 edges, 5973 markings/sec, 55 secs
lola: 383699 markings, 1831616 edges, 5832 markings/sec, 60 secs
lola: 413560 markings, 1975514 edges, 5972 markings/sec, 65 secs
lola: 442388 markings, 2117977 edges, 5766 markings/sec, 70 secs
lola: 471963 markings, 2259203 edges, 5915 markings/sec, 75 secs
lola: 501137 markings, 2409201 edges, 5835 markings/sec, 80 secs
lola: 529954 markings, 2562921 edges, 5763 markings/sec, 85 secs
lola: 557907 markings, 2715634 edges, 5591 markings/sec, 90 secs
lola: 587337 markings, 2856210 edges, 5886 markings/sec, 95 secs
lola: 616083 markings, 3001843 edges, 5749 markings/sec, 100 secs
lola: 644660 markings, 3155604 edges, 5715 markings/sec, 105 secs
lola: 673195 markings, 3309990 edges, 5707 markings/sec, 110 secs
lola: 702877 markings, 3460369 edges, 5936 markings/sec, 115 secs
lola: 732563 markings, 3617782 edges, 5937 markings/sec, 120 secs
lola: 761958 markings, 3779790 edges, 5879 markings/sec, 125 secs
lola: 791076 markings, 3947063 edges, 5824 markings/sec, 130 secs
lola: 820193 markings, 4113344 edges, 5823 markings/sec, 135 secs
lola: 848674 markings, 4276911 edges, 5696 markings/sec, 140 secs
lola: 877672 markings, 4444929 edges, 5800 markings/sec, 145 secs
lola: 906923 markings, 4609925 edges, 5850 markings/sec, 150 secs
lola: 935611 markings, 4780645 edges, 5738 markings/sec, 155 secs
lola: 963488 markings, 4949486 edges, 5575 markings/sec, 160 secs
lola: 989514 markings, 5108073 edges, 5205 markings/sec, 165 secs
lola: 1017294 markings, 5263932 edges, 5556 markings/sec, 170 secs
lola: 1044447 markings, 5420658 edges, 5431 markings/sec, 175 secs
lola: 1071693 markings, 5582279 edges, 5449 markings/sec, 180 secs
lola: 1098819 markings, 5741129 edges, 5425 markings/sec, 185 secs
lola: 1126493 markings, 5899241 edges, 5535 markings/sec, 190 secs
lola: 1155177 markings, 6042691 edges, 5737 markings/sec, 195 secs
lola: 1183293 markings, 6188964 edges, 5623 markings/sec, 200 secs
lola: 1207594 markings, 6326258 edges, 4860 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p3279))) AND (E (G (E (X (((1 <= p898) AND (1 <= p5353)))))) OR ((1 <= p1863) AND (p2848 <= 0) AND ((p158 <= 0) OR (p4613 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p1863) AND (p2848 <= 0) AND ((p158 <= 0) OR (p4613 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p1863) AND (p2848 <= 0) AND ((p158 <= 0) OR (p4613 <= 0)))
lola: processed formula length: 66
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: subprocess 7 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p3279)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((1 <= p3279)))
lola: processed formula length: 20
lola: 27 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: (1 <= p3279)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 8 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((1 <= p898) AND (1 <= p5353))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((1 <= p898) AND (1 <= p5353))))
lola: processed formula length: 38
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 643 markings, 643 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p2842 <= 0) OR ((1 <= p986) AND (1 <= p5441)))))))
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: ((1 <= p2842) AND ((p986 <= 0) OR (p5441 <= 0)))
lola: processed formula length: 49
lola: 30 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 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: ((1 <= p2842) AND ((p986 <= 0) OR (p5441 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
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: ((p2842 <= 0) OR ((1 <= p986) AND (1 <= p5441)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 4 markings, 4 edges
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: subprocess 8 will run for 386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p1853) AND ((p3893 <= 0) OR (p4356 <= 0)) AND ((p3988 <= 0) OR (p5322 <= 0)))))
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: ((p1853 <= 0) OR ((1 <= p3893) AND (1 <= p4356)) OR ((1 <= p3988) AND (1 <= p5322)))
lola: processed formula length: 86
lola: 29 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 <= p1853) AND ((p3893 <= 0) OR (p4356 <= 0)) AND ((p3988 <= 0) OR (p5322 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 9 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G (((1 <= p4370) AND (1 <= p5935)))) U (1 <= p2202)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG(((1 <= p4370) AND (1 <= p5935))) U (1 <= p2202))
lola: processed formula length: 53
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 18739 markings, 115368 edges, 3748 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: 62540 markings, 409191 edges, 8760 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: 130300 markings, 848918 edges, 13552 markings/sec, 10 secs
lola: 196159 markings, 1298931 edges, 13172 markings/sec, 15 secs
lola: 261391 markings, 1750928 edges, 13046 markings/sec, 20 secs
lola: 323938 markings, 2212888 edges, 12509 markings/sec, 25 secs
lola: 392248 markings, 2658359 edges, 13662 markings/sec, 30 secs
lola: 456170 markings, 3093004 edges, 12784 markings/sec, 35 secs
lola: 518334 markings, 3541206 edges, 12433 markings/sec, 40 secs
lola: 580346 markings, 3981977 edges, 12402 markings/sec, 45 secs
lola: 639343 markings, 4408297 edges, 11799 markings/sec, 50 secs
lola: 698858 markings, 4837372 edges, 11903 markings/sec, 55 secs
lola: 758284 markings, 5275705 edges, 11885 markings/sec, 60 secs
lola: 815493 markings, 5717386 edges, 11442 markings/sec, 65 secs
lola: 874223 markings, 6172408 edges, 11746 markings/sec, 70 secs
lola: 931286 markings, 6617609 edges, 11413 markings/sec, 75 secs
lola: 987193 markings, 7066986 edges, 11181 markings/sec, 80 secs
lola: 1042441 markings, 7493941 edges, 11050 markings/sec, 85 secs
lola: 1098286 markings, 7934239 edges, 11169 markings/sec, 90 secs
lola: 1157530 markings, 8369885 edges, 11849 markings/sec, 95 secs
lola: 1217049 markings, 8816196 edges, 11904 markings/sec, 100 secs
lola: 1272587 markings, 9267046 edges, 11108 markings/sec, 105 secs
lola: 1332469 markings, 9736477 edges, 11976 markings/sec, 110 secs
lola: 1391555 markings, 10194938 edges, 11817 markings/sec, 115 secs
lola: 1449120 markings, 10647426 edges, 11513 markings/sec, 120 secs
lola: 1503942 markings, 11088852 edges, 10964 markings/sec, 125 secs
lola: 1563390 markings, 11522281 edges, 11890 markings/sec, 130 secs
lola: 1619972 markings, 11959490 edges, 11316 markings/sec, 135 secs
lola: 1675618 markings, 12403512 edges, 11129 markings/sec, 140 secs
lola: 1735419 markings, 12850358 edges, 11960 markings/sec, 145 secs
lola: 1796469 markings, 13304510 edges, 12210 markings/sec, 150 secs
lola: 1857118 markings, 13748604 edges, 12130 markings/sec, 155 secs
lola: 1916012 markings, 14195094 edges, 11779 markings/sec, 160 secs
lola: 1971590 markings, 14607630 edges, 11116 markings/sec, 165 secs
lola: 2022772 markings, 15022815 edges, 10236 markings/sec, 170 secs
lola: 2072469 markings, 15436779 edges, 9939 markings/sec, 175 secs
lola: 2124426 markings, 15858346 edges, 10391 markings/sec, 180 secs
lola: 2173608 markings, 16269938 edges, 9836 markings/sec, 185 secs
lola: 2226368 markings, 16684669 edges, 10552 markings/sec, 190 secs
lola: 2277692 markings, 17107636 edges, 10265 markings/sec, 195 secs
lola: 2328652 markings, 17524390 edges, 10192 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E ((((p3932 <= 0) OR (p4756 <= 0)) U ((p321 <= 0) OR (p4776 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(E(((p3932 <= 0) OR (p4756 <= 0)) U ((p321 <= 0) OR (p4776 <= 0))))
lola: processed formula length: 71
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 902 markings, 1804 edges
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((((1 <= p4007) AND (1 <= p5500)) OR ((1 <= p4186) AND (1 <= p5751))))) OR A (G (((1 <= p2238) OR ((1 <= p1092) AND (1 <= p5547))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF((((1 <= p4007) AND (1 <= p5500)) OR ((1 <= p4186) AND (1 <= p5751)))) OR AG(((1 <= p2238) OR ((1 <= p1092) AND (1 <= p5547))))))
lola: processed formula length: 137
lola: 29 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: 77834 markings, 436727 edges, 15567 markings/sec, 0 secs
lola: 159086 markings, 886785 edges, 16250 markings/sec, 5 secs
lola: 236408 markings, 1337421 edges, 15464 markings/sec, 10 secs
lola: 308925 markings, 1792968 edges, 14503 markings/sec, 15 secs
lola: 388002 markings, 2241821 edges, 15815 markings/sec, 20 secs
lola: 466114 markings, 2697170 edges, 15622 markings/sec, 25 secs
lola: 540058 markings, 3156680 edges, 14789 markings/sec, 30 secs
lola: 616375 markings, 3619657 edges, 15263 markings/sec, 35 secs
lola: 689873 markings, 4084630 edges, 14700 markings/sec, 40 secs
lola: 763996 markings, 4554832 edges, 14825 markings/sec, 45 secs
lola: 834447 markings, 5030158 edges, 14090 markings/sec, 50 secs
lola: 905232 markings, 5505085 edges, 14157 markings/sec, 55 secs
lola: 973668 markings, 5982718 edges, 13687 markings/sec, 60 secs
lola: 1042243 markings, 6450175 edges, 13715 markings/sec, 65 secs
lola: 1111290 markings, 6928661 edges, 13809 markings/sec, 70 secs
lola: 1188578 markings, 7406313 edges, 15458 markings/sec, 75 secs
lola: 1256847 markings, 7882245 edges, 13654 markings/sec, 80 secs
lola: 1324187 markings, 8345378 edges, 13468 markings/sec, 85 secs
lola: 1392073 markings, 8806543 edges, 13577 markings/sec, 90 secs
lola: 1459216 markings, 9268967 edges, 13429 markings/sec, 95 secs
lola: 1525738 markings, 9730792 edges, 13304 markings/sec, 100 secs
lola: 1597673 markings, 10180159 edges, 14387 markings/sec, 105 secs
lola: 1662508 markings, 10636855 edges, 12967 markings/sec, 110 secs
lola: 1732019 markings, 11091722 edges, 13902 markings/sec, 115 secs
lola: 1802851 markings, 11553452 edges, 14166 markings/sec, 120 secs
lola: 1875448 markings, 12012787 edges, 14519 markings/sec, 125 secs
lola: 1944459 markings, 12455968 edges, 13802 markings/sec, 130 secs
lola: 2006420 markings, 12880242 edges, 12392 markings/sec, 135 secs
lola: 2065106 markings, 13311233 edges, 11737 markings/sec, 140 secs
lola: 2124405 markings, 13733793 edges, 11860 markings/sec, 145 secs
lola: 2183319 markings, 14160611 edges, 11783 markings/sec, 150 secs
lola: 2245023 markings, 14587775 edges, 12341 markings/sec, 155 secs
lola: 2302632 markings, 15003818 edges, 11522 markings/sec, 160 secs
lola: 2351343 markings, 15359481 edges, 9742 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 675 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= p1908)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:594
lola: rewrite Frontend/Parser/formula_rewrite.k:629
lola: rewrite Frontend/Parser/formula_rewrite.k:758
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1908 <= 0)
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: (p1908 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation 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 <= p1908)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 643 markings, 643 edges
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: ========================================
lola: subprocess 13 will run for 900 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p1138))) AND E (F ((1 <= p1931))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 900 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1931)))
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 ((1 <= p1931)))
lola: processed formula length: 20
lola: 27 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: (1 <= p1931)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 14 will run for 1351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p1138)))
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: (p1138 <= 0)
lola: processed formula length: 12
lola: 29 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
sara: try reading problem file CTLFireability-13-0.sara.
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p1138)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p2230 <= 0))) AND (A (G (((p4003 <= 0) OR (p5456 <= 0)))) OR ((1 <= p3938) AND (1 <= p4812))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p3938) AND (1 <= p4812))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p3938) AND (1 <= p4812))
lola: processed formula length: 31
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2702 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2230 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p2230 <= 0)))
lola: processed formula length: 20
lola: 27 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p2230)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p430 <= 0) OR (p4885 <= 0)))) AND E (G (E (F ((p2593 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p430 <= 0) OR (p4885 <= 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 (((p430 <= 0) OR (p4885 <= 0))))
lola: processed formula length: 38
lola: 27 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
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: ((p430 <= 0) OR (p4885 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
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: ========================================
lola: ...considering subproblem: E (F ((A (X ((p1781 <= 0))) AND A (X ((((1 <= p4106) AND (1 <= p5671)) OR (1 <= p2558)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((p1781 <= 0)) AND AX((((1 <= p4106) AND (1 <= p5671)) OR (1 <= p2558)))))
lola: processed formula length: 81
lola: 29 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).
sara: place or transition ordering is non-deterministic

lola: 21155 markings, 88434 edges, 4231 markings/sec, 0 secs
lola: 45572 markings, 202722 edges, 4883 markings/sec, 5 secs
lola: 69676 markings, 320801 edges, 4821 markings/sec, 10 secs
lola: 94018 markings, 428249 edges, 4868 markings/sec, 15 secs
lola: 118791 markings, 536307 edges, 4955 markings/sec, 20 secs
lola: 143225 markings, 648478 edges, 4887 markings/sec, 25 secs
lola: 167463 markings, 768977 edges, 4848 markings/sec, 30 secs
lola: 191840 markings, 886402 edges, 4875 markings/sec, 35 secs
lola: 216592 markings, 1003896 edges, 4950 markings/sec, 40 secs
lola: 240768 markings, 1123543 edges, 4835 markings/sec, 45 secs
lola: 264671 markings, 1246455 edges, 4781 markings/sec, 50 secs
lola: 288239 markings, 1373393 edges, 4714 markings/sec, 55 secs
lola: 311892 markings, 1499603 edges, 4731 markings/sec, 60 secs
lola: 336132 markings, 1614500 edges, 4848 markings/sec, 65 secs
lola: 360684 markings, 1724330 edges, 4910 markings/sec, 70 secs
lola: 384995 markings, 1838096 edges, 4862 markings/sec, 75 secs
lola: 409197 markings, 1955150 edges, 4840 markings/sec, 80 secs
lola: 433251 markings, 2072121 edges, 4811 markings/sec, 85 secs
lola: 457513 markings, 2187157 edges, 4852 markings/sec, 90 secs
lola: 481473 markings, 2307629 edges, 4792 markings/sec, 95 secs
lola: 505177 markings, 2432140 edges, 4741 markings/sec, 100 secs
lola: 528830 markings, 2557399 edges, 4731 markings/sec, 105 secs
lola: 552428 markings, 2684309 edges, 4720 markings/sec, 110 secs
lola: 576448 markings, 2801441 edges, 4804 markings/sec, 115 secs
lola: 600138 markings, 2920336 edges, 4738 markings/sec, 120 secs
lola: 623333 markings, 3042698 edges, 4639 markings/sec, 125 secs
lola: 646836 markings, 3167176 edges, 4701 markings/sec, 130 secs
lola: 670264 markings, 3293012 edges, 4686 markings/sec, 135 secs
lola: 693914 markings, 3414809 edges, 4730 markings/sec, 140 secs
lola: 717526 markings, 3538008 edges, 4722 markings/sec, 145 secs
lola: 740911 markings, 3665110 edges, 4677 markings/sec, 150 secs
lola: 764306 markings, 3792747 edges, 4679 markings/sec, 155 secs
lola: 787223 markings, 3927317 edges, 4583 markings/sec, 160 secs
lola: 810414 markings, 4057820 edges, 4638 markings/sec, 165 secs
lola: 833470 markings, 4189977 edges, 4611 markings/sec, 170 secs
lola: 856534 markings, 4322891 edges, 4613 markings/sec, 175 secs
lola: 879619 markings, 4455500 edges, 4617 markings/sec, 180 secs
lola: 902880 markings, 4585128 edges, 4652 markings/sec, 185 secs
lola: 925615 markings, 4722366 edges, 4547 markings/sec, 190 secs
lola: 948453 markings, 4857983 edges, 4568 markings/sec, 195 secs
lola: 971260 markings, 4994920 edges, 4561 markings/sec, 200 secs
lola: 994115 markings, 5132530 edges, 4571 markings/sec, 205 secs
lola: 1016001 markings, 5255662 edges, 4377 markings/sec, 210 secs
lola: 1037938 markings, 5383372 edges, 4387 markings/sec, 215 secs
lola: 1060058 markings, 5510864 edges, 4424 markings/sec, 220 secs
lola: 1081671 markings, 5640246 edges, 4323 markings/sec, 225 secs
lola: 1103235 markings, 5768174 edges, 4313 markings/sec, 230 secs
lola: 1124096 markings, 5886103 edges, 4172 markings/sec, 235 secs
lola: 1146538 markings, 5998917 edges, 4488 markings/sec, 240 secs
lola: 1169445 markings, 6115764 edges, 4581 markings/sec, 245 secs
lola: 1191940 markings, 6235843 edges, 4499 markings/sec, 250 secs
lola: 1214127 markings, 6363660 edges, 4437 markings/sec, 255 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E ((E (G (((1 <= p4370) AND (1 <= p5935)))) U (1 <= p2202)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EG(((1 <= p4370) AND (1 <= p5935))) U (1 <= p2202))
lola: processed formula length: 53
lola: 28 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 58897 markings, 384606 edges, 11779 markings/sec, 0 secs
lola: 125769 markings, 820746 edges, 13374 markings/sec, 5 secs
lola: 190766 markings, 1262148 edges, 12999 markings/sec, 10 secs
lola: 255000 markings, 1704716 edges, 12847 markings/sec, 15 secs
lola: 315732 markings, 2151722 edges, 12146 markings/sec, 20 secs
lola: 382143 markings, 2587578 edges, 13282 markings/sec, 25 secs
lola: 445622 markings, 3023106 edges, 12696 markings/sec, 30 secs
lola: 507629 markings, 3460719 edges, 12401 markings/sec, 35 secs
lola: 568205 markings, 3899312 edges, 12115 markings/sec, 40 secs
lola: 629332 markings, 4333278 edges, 12225 markings/sec, 45 secs
lola: 689200 markings, 4769394 edges, 11974 markings/sec, 50 secs
lola: 748793 markings, 5206010 edges, 11919 markings/sec, 55 secs
lola: 806324 markings, 5645976 edges, 11506 markings/sec, 60 secs
lola: 863243 markings, 6088150 edges, 11384 markings/sec, 65 secs
lola: 919928 markings, 6529605 edges, 11337 markings/sec, 70 secs
lola: 975560 markings, 6971958 edges, 11126 markings/sec, 75 secs
lola: 1032438 markings, 7415464 edges, 11376 markings/sec, 80 secs
lola: 1089266 markings, 7862624 edges, 11366 markings/sec, 85 secs
lola: 1148010 markings, 8302063 edges, 11749 markings/sec, 90 secs
lola: 1207581 markings, 8741346 edges, 11914 markings/sec, 95 secs
lola: 1262482 markings, 9184306 edges, 10980 markings/sec, 100 secs
lola: 1318641 markings, 9626398 edges, 11232 markings/sec, 105 secs
lola: 1373658 markings, 10069003 edges, 11003 markings/sec, 110 secs
lola: 1431996 markings, 10509131 edges, 11668 markings/sec, 115 secs
lola: 1487482 markings, 10952070 edges, 11097 markings/sec, 120 secs
lola: 1546119 markings, 11392031 edges, 11727 markings/sec, 125 secs
lola: 1604639 markings, 11832412 edges, 11704 markings/sec, 130 secs
lola: 1659577 markings, 12275277 edges, 10988 markings/sec, 135 secs
lola: 1717837 markings, 12715948 edges, 11652 markings/sec, 140 secs
lola: 1776130 markings, 13156732 edges, 11659 markings/sec, 145 secs
lola: 1835598 markings, 13596679 edges, 11894 markings/sec, 150 secs
lola: 1895151 markings, 14035879 edges, 11911 markings/sec, 155 secs
lola: 1953117 markings, 14466042 edges, 11593 markings/sec, 160 secs
lola: 2004939 markings, 14874658 edges, 10364 markings/sec, 165 secs
lola: 2054933 markings, 15292979 edges, 9999 markings/sec, 170 secs
lola: 2106877 markings, 15713525 edges, 10389 markings/sec, 175 secs
lola: 2157458 markings, 16132795 edges, 10116 markings/sec, 180 secs
lola: 2209288 markings, 16553002 edges, 10366 markings/sec, 185 secs
lola: 2261705 markings, 16971950 edges, 10483 markings/sec, 190 secs
lola: 2312336 markings, 17389216 edges, 10126 markings/sec, 195 secs
lola: 2360799 markings, 17777714 edges, 9693 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((((1 <= p4007) AND (1 <= p5500)) OR ((1 <= p4186) AND (1 <= p5751))))) OR A (G (((1 <= p2238) OR ((1 <= p1092) AND (1 <= p5547))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AF((((1 <= p4007) AND (1 <= p5500)) OR ((1 <= p4186) AND (1 <= p5751)))) OR AG(((1 <= p2238) OR ((1 <= p1092) AND (1 <= p5547))))))
lola: processed formula length: 137
lola: 29 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: 73177 markings, 410932 edges, 14635 markings/sec, 0 secs
lola: 154131 markings, 857472 edges, 16191 markings/sec, 5 secs
lola: 231344 markings, 1308530 edges, 15443 markings/sec, 10 secs
lola: 304327 markings, 1762318 edges, 14597 markings/sec, 15 secs
lola: 382743 markings, 2209343 edges, 15683 markings/sec, 20 secs
lola: 459523 markings, 2656453 edges, 15356 markings/sec, 25 secs
lola: 532559 markings, 3109266 edges, 14607 markings/sec, 30 secs
lola: 606546 markings, 3558816 edges, 14797 markings/sec, 35 secs
lola: 677210 markings, 4010117 edges, 14133 markings/sec, 40 secs
lola: 749107 markings, 4459488 edges, 14379 markings/sec, 45 secs
lola: 817518 markings, 4916075 edges, 13682 markings/sec, 50 secs
lola: 885376 markings, 5371075 edges, 13572 markings/sec, 55 secs
lola: 951371 markings, 5827156 edges, 13199 markings/sec, 60 secs
lola: 1017605 markings, 6283255 edges, 13247 markings/sec, 65 secs
lola: 1084055 markings, 6738533 edges, 13290 markings/sec, 70 secs
lola: 1154355 markings, 7192923 edges, 14060 markings/sec, 75 secs
lola: 1223739 markings, 7648204 edges, 13877 markings/sec, 80 secs
lola: 1287455 markings, 8105535 edges, 12743 markings/sec, 85 secs
lola: 1354436 markings, 8560930 edges, 13396 markings/sec, 90 secs
lola: 1423345 markings, 9014928 edges, 13782 markings/sec, 95 secs
lola: 1488305 markings, 9470890 edges, 12992 markings/sec, 100 secs
lola: 1558428 markings, 9925165 edges, 14025 markings/sec, 105 secs
lola: 1625611 markings, 10380710 edges, 13437 markings/sec, 110 secs
lola: 1693101 markings, 10835337 edges, 13498 markings/sec, 115 secs
lola: 1761691 markings, 11289225 edges, 13718 markings/sec, 120 secs
lola: 1832508 markings, 11742568 edges, 14163 markings/sec, 125 secs
lola: 1903735 markings, 12195607 edges, 14245 markings/sec, 130 secs
lola: 1971015 markings, 12632465 edges, 13456 markings/sec, 135 secs
lola: 2030003 markings, 13051739 edges, 11798 markings/sec, 140 secs
lola: 2088792 markings, 13476034 edges, 11758 markings/sec, 145 secs
lola: 2147591 markings, 13903312 edges, 11760 markings/sec, 150 secs
lola: 2207227 markings, 14328990 edges, 11927 markings/sec, 155 secs
lola: 2264892 markings, 14733291 edges, 11533 markings/sec, 160 secs
lola: 2318399 markings, 15121344 edges, 10701 markings/sec, 165 secs
lola: 2361218 markings, 15419759 edges, 8564 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E (F (((p430 <= 0) OR (p4885 <= 0)))) AND E (G (E (F ((p2593 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (((p430 <= 0) OR (p4885 <= 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 (((p430 <= 0) OR (p4885 <= 0))))
lola: processed formula length: 38
lola: 27 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: ((p430 <= 0) OR (p4885 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-19-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((p2593 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (p2593 <= 0)
lola: processed formula length: 12
lola: 29 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p2593)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (p2593 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-20-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-0.sara.
lola: state equation: write sara problem file to CTLFireability-20-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-20-1.sara.
lola: sara is running 0 secs || sara is running 0 secs || 88877 markings, 406359 edges, 17775 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 5 secs || sara is running 5 secs || 181092 markings, 831514 edges, 18443 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 269084 markings, 1271460 edges, 17598 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 357112 markings, 1707690 edges, 17606 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 447350 markings, 2139492 edges, 18048 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 532860 markings, 2578365 edges, 17102 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 618382 markings, 3014405 edges, 17104 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 701201 markings, 3451411 edges, 16564 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 780789 markings, 3890874 edges, 15918 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 858464 markings, 4334403 edges, 15535 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 935308 markings, 4778701 edges, 15369 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 1010971 markings, 5226356 edges, 15133 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 1087952 markings, 5676446 edges, 15396 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 1169765 markings, 6117260 edges, 16363 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 1246487 markings, 6562406 edges, 15344 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 1321841 markings, 7007563 edges, 15071 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 1399257 markings, 7451641 edges, 15483 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 1474837 markings, 7897092 edges, 15116 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 1553580 markings, 8339885 edges, 15749 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 1630391 markings, 8784796 edges, 15362 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 1708249 markings, 9228182 edges, 15572 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 1788821 markings, 9670329 edges, 16114 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 1871083 markings, 10110403 edges, 16452 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 1950893 markings, 10548140 edges, 15962 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 2020113 markings, 10959537 edges, 13844 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 2087371 markings, 11378608 edges, 13452 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 2154420 markings, 11798077 edges, 13410 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 2221784 markings, 12207445 edges, 13473 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 2288279 markings, 12615477 edges, 13299 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 2354169 markings, 13021420 edges, 13178 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes no yes no yes yes no no unknown unknown no no unknown yes
lola:
preliminary result: no unknown yes no yes no yes yes no no unknown unknown no no unknown yes
lola: memory consumption: 3752 KB
lola: time consumption: 1673 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="RwMutex-PT-r2000w0010"
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 RwMutex-PT-r2000w0010, 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 r186-oct2-158987938800332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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