Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.7K Apr 12 17:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 12 17:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 20:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 14 12:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 14 12:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 10 20:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 20:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 05:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 05:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 8.1K 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 SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591203872685

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 17:04:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 17:04:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 17:04:35] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2020-06-03 17:04:35] [INFO ] Transformed 9 places.
[2020-06-03 17:04:35] [INFO ] Transformed 8 transitions.
[2020-06-03 17:04:35] [INFO ] Parsed PT model containing 9 places and 8 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Finished random walk after 20485 steps, including 0 resets, run visited all 21 properties in 21 ms. (steps per millisecond=975 )
[2020-06-03 17:04:35] [INFO ] Flatten gal took : 21 ms
[2020-06-03 17:04:35] [INFO ] Flatten gal took : 3 ms
[2020-06-03 17:04:35] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2020-06-03 17:04:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SmallOperatingSystem-PT-MT8192DC4096 @ 3570 seconds

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT8192DC4096-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1326
rslt: Output for CTLFireability @ SmallOperatingSystem-PT-MT8192DC4096

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:04:36 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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 ((1 <= p3)))",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"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": "((p1 <= 0) OR (p2 <= 0))",
"processed_size": 25,
"rewrites": 27
},
"result":
{
"edges": 4095,
"markings": 4096,
"produced_by": "state space /EXEF",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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": "A (G (((1 <= p1) AND (1 <= p2))))",
"processed_size": 33,
"rewrites": 26
},
"result":
{
"edges": 4096,
"markings": 4097,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 336
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"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": "AF(EG((1 <= p4)))",
"processed_size": 17,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 32768,
"markings": 16384,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 378
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"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": "AF(EG(((1 <= p4) AND (1 <= p6))))",
"processed_size": 33,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 32768,
"markings": 16384,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 432
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E(EG((p7 <= 0)) U ((1 <= p5) AND (1 <= p6)))",
"processed_size": 44,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 176203778,
"markings": 50348033,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 485
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "EG(A(((p5 <= 0) OR (p6 <= 0)) U ((1 <= p4) AND (1 <= p6))))",
"processed_size": 60,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 8198,
"markings": 8193,
"produced_by": "CTL model checker",
"value": true
},
"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": 612
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"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": "AF(E((p4 <= 0) U ((1 <= p1) AND (1 <= p2) AND (1 <= p5) AND (1 <= p6))))",
"processed_size": 72,
"rewrites": 26
},
"net":
{
"conflict_clusters": 4,
"singleton_clusters": 0
},
"result":
{
"edges": 8198,
"markings": 8193,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 816
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": "A ((((1 <= p7) OR ((1 <= p1) AND (1 <= p2))) U ((1 <= p4) AND (1 <= p6))))",
"processed_size": 75,
"rewrites": 29
},
"result":
{
"edges": 4095,
"markings": 4096,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "universal_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1225
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E ((((p4 <= 0) OR ((1 <= p4) AND (1 <= p2) AND (1 <= p5)) OR ((p8 <= 0) AND (1 <= p7))) U ((1 <= p5) AND (1 <= p6))))",
"processed_size": 119,
"rewrites": 27
},
"result":
{
"edges": 4096,
"markings": 4097,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "existential_until",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2450
},
"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": 2,
"visible_transitions": 0
},
"processed": "((p4 <= 0) AND ((p4 <= 0) OR (p6 <= 0)))",
"processed_size": 41,
"rewrites": 27
},
"result":
{
"edges": 4096,
"markings": 4097,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0)))",
"processed_size": 43,
"rewrites": 27
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"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 <= p8)))",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": 2,
"visible_transitions": 0
},
"processed": "((p4 <= 0) AND ((p4 <= 0) OR (p6 <= 0)))",
"processed_size": 41,
"rewrites": 27
},
"result":
{
"edges": 4096,
"markings": 4097,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 19,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"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 <= p5) AND (1 <= p6))",
"processed_size": 25,
"rewrites": 27
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 20,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0)))",
"processed_size": 43,
"rewrites": 27
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 21,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"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 <= p8)))",
"processed_size": 17,
"rewrites": 25
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 22,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 19,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3740,
"runtime": 2244.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((** U **)) : A(F(E(G(**)))) : A(G(E(F(**)))) : A(F(E((** U **)))) : (A(F(**)) AND (E(G(**)) OR (E(X(*)) OR ((A(X(**)) AND A((** U **))) OR **)))) : E(F((A((** U **)) AND A(G(**))))) : E(G(A((** U **)))) : (E(X(A(G(**)))) OR E(X(E(X(**))))) : A(F((E(X(*)) AND (A(F(**)) OR E(G(**)))))) : A(F(E(G(**)))) : E((E(G(**)) U **)) : A(F(**)) : (A(F(*)) AND (A(F(**)) AND (E((* R *)) AND (E(F(**)) OR (E(G(**)) AND (** AND **)))))) : A(X(A(G(**)))) : A(G(**)) : E((** U **))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no yes unknown no yes unknown yes unknown yes yes no yes yes no no no ",
"value": "no yes unknown no yes unknown yes unknown yes yes no yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: A ((((1 <= p7) OR ((1 <= p1) AND (1 <= p2))) U ((1 <= p4) AND (1 <= p6)))) : A (F (E (G (((1 <= p4) AND (1 <= p6)))))) : A (G (A (G (E (F (((1 <= p2) AND (1 <= p5)))))))) : A (F (E (((p4 <= 0) U ((1 <= p1) AND (1 <= p2) AND (1 <= p5) AND (1 <= p6)))))) : (A (F ((((p2 <= 0) OR (p5 <= 0)) AND ((p5 <= 0) OR (p6 <= 0)) AND (1 <= p4) AND (1 <= p6)))) AND (((E (G ((1 <= p3))) OR NOT(A (X ((1 <= p4))))) OR (A (X (((1 <= p5) AND (1 <= p6) AND (1 <= p3)))) AND A (((1 <= p8) U ((1 <= p4) AND (1 <= p6)))))) OR ((p8 <= 0) AND ((p4 <= 0) OR (p6 <= 0))))) : E (F ((A (((1 <= p8) U ((1 <= p1) AND (1 <= p2)))) AND A (G ((p7 <= 0)))))) : E (G (A ((((p5 <= 0) OR (p6 <= 0)) U ((1 <= p4) AND (1 <= p6)))))) : (E (X (A (G (((1 <= p7) OR ((1 <= p1) AND (1 <= p2))))))) OR E (X (E (X ((1 <= p7)))))) : A (F ((NOT(A (X ((1 <= p7)))) AND (A (F (((1 <= p2) AND (1 <= p5)))) OR E (G ((1 <= p4))))))) : A (F (A (F (E (G ((1 <= p4))))))) : E ((E (G ((p7 <= 0))) U ((1 <= p5) AND (1 <= p6)))) : A (F ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5))))) : (((NOT(E (G (((1 <= p5) AND (1 <= p6))))) AND A (F (((1 <= p4) OR ((1 <= p4) AND (1 <= p6)))))) AND NOT(A ((((1 <= p1) AND (1 <= p2)) U (1 <= p7))))) AND (E (F ((1 <= p8))) OR ((E (G ((((1 <= p1) AND (1 <= p2)) OR ((1 <= p5) AND (1 <= p6))))) AND (1 <= p7)) AND ((p4 <= 0) OR (p6 <= 0))))) : A (G (A (X (E (G (((1 <= p1) AND (1 <= p2)))))))) : A (G (((1 <= p1) AND (1 <= p2)))) : E ((((p4 <= 0) OR ((1 <= p4) AND (1 <= p2) AND (1 <= p5)) OR ((p8 <= 0) AND (1 <= p7))) U ((1 <= p5) AND (1 <= p6))))
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((p2 <= 0) OR (p5 <= 0)) AND ((p5 <= 0) OR (p6 <= 0)) AND (1 <= p4) AND (1 <= p6)))) AND (E (G ((1 <= p3))) OR (E (X ((p4 <= 0))) OR ((A (X (((1 <= p5) AND (1 <= p6) AND (1 <= p3)))) AND A (((1 <= p8) U ((1 <= p4) AND (1 <= p6))))) OR ((p8 <= 0) AND ((p4 <= 0) OR (p6 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((p2 <= 0) OR (p5 <= 0)) AND ((p5 <= 0) OR (p6 <= 0)) AND (1 <= p4) AND (1 <= p6))))
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: (((1 <= p2) AND (1 <= p5)) OR ((1 <= p5) AND (1 <= p6)) OR (p4 <= 0) OR (p6 <= 0))
lola: processed formula length: 85
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p2 <= 0) OR (p5 <= 0)) AND ((p5 <= 0) OR (p6 <= 0)) AND (1 <= p4) AND (1 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4097 markings, 4096 edges
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p3)))
lola: processed formula length: 17
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((p4 <= 0))
lola: processed formula length: 13
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G (((1 <= p7) OR ((1 <= p1) AND (1 <= p2))))))) OR E (X (E (X ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= p7) OR ((1 <= p1) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((1 <= p7) OR ((1 <= p1) AND (1 <= p2)))))
lola: processed formula length: 49
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2604245 markings, 6470773 edges, 520849 markings/sec, 0 secs
lola: 5208614 markings, 12958113 edges, 520874 markings/sec, 5 secs
lola: 7787171 markings, 19385959 edges, 515711 markings/sec, 10 secs
lola: 10258063 markings, 25546135 edges, 494178 markings/sec, 15 secs
lola: 12724700 markings, 31697859 edges, 493327 markings/sec, 20 secs
lola: 15113976 markings, 37657147 edges, 477855 markings/sec, 25 secs
lola: 17518670 markings, 43655686 edges, 480939 markings/sec, 30 secs
lola: 19846309 markings, 49462478 edges, 465528 markings/sec, 35 secs
lola: 22312447 markings, 55614700 edges, 493228 markings/sec, 40 secs
lola: 24692729 markings, 61555391 edges, 476056 markings/sec, 45 secs
lola: 27087064 markings, 67528630 edges, 478867 markings/sec, 50 secs
lola: 29413674 markings, 73334519 edges, 465322 markings/sec, 55 secs
lola: 31737581 markings, 79134594 edges, 464781 markings/sec, 60 secs
lola: 34096815 markings, 85022559 edges, 471847 markings/sec, 65 secs
lola: 36466453 markings, 90935976 edges, 473928 markings/sec, 70 secs
lola: 38676809 markings, 96453463 edges, 442071 markings/sec, 75 secs
lola: 40996226 markings, 102241763 edges, 463883 markings/sec, 80 secs
lola: 43119656 markings, 107542683 edges, 424686 markings/sec, 85 secs
lola: 45286453 markings, 112949935 edges, 433359 markings/sec, 90 secs
lola: 47699794 markings, 118974088 edges, 482668 markings/sec, 95 secs
lola: 50303288 markings, 125473511 edges, 520699 markings/sec, 100 secs
lola: 52651706 markings, 131335912 edges, 469684 markings/sec, 105 secs
lola: 54950742 markings, 137074625 edges, 459807 markings/sec, 110 secs
lola: 57337172 markings, 143031887 edges, 477286 markings/sec, 115 secs
lola: 59635334 markings, 148769611 edges, 459632 markings/sec, 120 secs
lola: 61947810 markings, 154542965 edges, 462495 markings/sec, 125 secs
lola: 64221158 markings, 160218212 edges, 454670 markings/sec, 130 secs
lola: 66530066 markings, 165982124 edges, 461782 markings/sec, 135 secs
lola: 68794013 markings, 171635604 edges, 452789 markings/sec, 140 secs
lola: 71062326 markings, 177297484 edges, 453663 markings/sec, 145 secs
lola: 73280655 markings, 182836061 edges, 443666 markings/sec, 150 secs
lola: 75478956 markings, 188324523 edges, 439660 markings/sec, 155 secs
lola: 77688621 markings, 193841238 edges, 441933 markings/sec, 160 secs
lola: 79932511 markings, 199443503 edges, 448778 markings/sec, 165 secs
lola: 82145005 markings, 204969151 edges, 442499 markings/sec, 170 secs
lola: 84326788 markings, 210415483 edges, 436357 markings/sec, 175 secs
lola: 86456028 markings, 215732397 edges, 425848 markings/sec, 180 secs
lola: 88545088 markings, 220948798 edges, 417812 markings/sec, 185 secs
lola: 90802318 markings, 226583663 edges, 451446 markings/sec, 190 secs
lola: 93027470 markings, 232140182 edges, 445030 markings/sec, 195 secs
lola: 95202777 markings, 237572002 edges, 435061 markings/sec, 200 secs
lola: 97410351 markings, 243084305 edges, 441515 markings/sec, 205 secs
lola: 99697235 markings, 248794894 edges, 457377 markings/sec, 210 secs
lola: 102107567 markings, 254812064 edges, 482066 markings/sec, 215 secs
lola: 104445390 markings, 260650073 edges, 467565 markings/sec, 220 secs
lola: 106730458 markings, 266376359 edges, 457014 markings/sec, 225 secs
lola: 108805585 markings, 271539758 edges, 415025 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: unknown unknown unknown unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 132 KB
lola: time consumption: 240 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((p7 <= 0))) AND (A (F (((1 <= p2) AND (1 <= p5)))) OR E (G ((1 <= p4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EX((p7 <= 0)) AND (AF(((1 <= p2) AND (1 <= p5))) OR EG((1 <= p4)))))
lola: processed formula length: 72
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16384 markings, 49154 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((1 <= p1) AND (1 <= p2))))))
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: ((p1 <= 0) OR (p2 <= 0))
lola: processed formula length: 25
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 /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: ((p1 <= 0) OR (p2 <= 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-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 4096 markings, 4095 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p1) AND (1 <= p2))))
lola: processed formula length: 33
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p1 <= 0) OR (p2 <= 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-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4097 markings, 4096 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p2) AND (1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) OR (p5 <= 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-5-0.sara
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: lola: state equation: calling and running sara
state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p2) AND (1 <= p5))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-5-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-5-1.sara.
sara: try reading problem file CTLFireability-5-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 2993220 markings, 7661752 edges, 598644 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 5729388 markings, 14778488 edges, 547234 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8392161 markings, 21726086 edges, 532555 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 10949332 markings, 28407447 edges, 511434 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 13514281 markings, 35053945 edges, 512990 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 16011448 markings, 41643902 edges, 499433 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 18513649 markings, 48198151 edges, 500440 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 20973166 markings, 54658230 edges, 491903 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 23392369 markings, 61028914 edges, 483841 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 25876619 markings, 67579095 edges, 496850 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 28354664 markings, 74046625 edges, 495609 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 30775350 markings, 80432167 edges, 484137 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 33208858 markings, 86779876 edges, 486702 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 35601337 markings, 93106126 edges, 478496 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 37905890 markings, 99219058 edges, 460911 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 40331307 markings, 105524267 edges, 485083 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 42669315 markings, 111724234 edges, 467602 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 45092454 markings, 118104371 edges, 484628 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 47569843 markings, 124568081 edges, 495478 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 49940322 markings, 130784344 edges, 474096 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 52373028 markings, 137231325 edges, 486541 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 54772388 markings, 143608038 edges, 479872 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 57181442 markings, 149873031 edges, 481811 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 59438042 markings, 155928647 edges, 451320 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 61750510 markings, 162085177 edges, 462494 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 64110556 markings, 168253253 edges, 472009 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 66542309 markings, 174476883 edges, 486351 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 68711255 markings, 180349013 edges, 433789 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 70949186 markings, 186341620 edges, 447586 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 73359330 markings, 192532701 edges, 482029 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 75598642 markings, 198611518 edges, 447862 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 77964265 markings, 204854707 edges, 473125 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 80164539 markings, 210681374 edges, 440055 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 82327160 markings, 216333053 edges, 432524 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 84394214 markings, 221837803 edges, 413411 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 86623148 markings, 227657639 edges, 445787 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 88711123 markings, 233152045 edges, 417595 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 90997079 markings, 239096945 edges, 457191 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 93145538 markings, 244736388 edges, 429692 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 95220113 markings, 250313475 edges, 414915 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 97378284 markings, 255958768 edges, 431634 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 99698795 markings, 261906232 edges, 464102 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 101777049 markings, 267528251 edges, 415651 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 103955266 markings, 273176430 edges, 435643 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 106186802 markings, 279158747 edges, 446307 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 108404859 markings, 285012716 edges, 443611 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 110721678 markings, 291191062 edges, 463364 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 113055075 markings, 297211971 edges, 466679 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 115231423 markings, 303034335 edges, 435270 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 117430683 markings, 308919729 edges, 439852 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 119562674 markings, 314610939 edges, 426398 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 121655741 markings, 320185693 edges, 418613 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 123806379 markings, 325939222 edges, 430128 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 126092013 markings, 331818870 edges, 457127 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 128259319 markings, 337489790 edges, 433461 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 130351989 markings, 343082231 edges, 418534 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 132428574 markings, 348549673 edges, 415317 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 134555979 markings, 354123410 edges, 425481 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 136668276 markings, 359554675 edges, 422459 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 138801619 markings, 365230073 edges, 426669 markings/sec, 295 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown yes unknown unknown unknown yes unknown unknown unknown unknown no no unknown
lola: memory consumption: 15362648 KB
lola: time consumption: 543 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p5) AND (1 <= p6)) OR ((1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5)))))
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: (((p5 <= 0) OR (p6 <= 0)) AND ((p4 <= 0) OR (p6 <= 0)) AND ((p2 <= 0) OR (p5 <= 0)))
lola: processed formula length: 87
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: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 <= p5) AND (1 <= p6)) OR ((1 <= p4) AND (1 <= p6)) OR ((1 <= p2) AND (1 <= p5)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation 0: solution produced
lola: The predicate eventually occurs.
lola: 4097 markings, 4096 edges
lola: ========================================
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((1 <= p4)))
lola: processed formula length: 17
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16384 markings, 32768 edges
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p4) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p4) AND (1 <= p6))))
lola: processed formula length: 33
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16384 markings, 32768 edges
lola: ========================================
lola: subprocess 9 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((p7 <= 0))) U ((1 <= p5) AND (1 <= p6))))
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((p7 <= 0)) U ((1 <= p5) AND (1 <= p6)))
lola: processed formula length: 44
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2567047 markings, 8207292 edges, 513409 markings/sec, 0 secs
lola: 5324756 markings, 17031764 edges, 551542 markings/sec, 5 secs
lola: 7923241 markings, 25348114 edges, 519697 markings/sec, 10 secs
lola: 10551114 markings, 33751131 edges, 525575 markings/sec, 15 secs
lola: 13094695 markings, 41887341 edges, 508716 markings/sec, 20 secs
lola: 15778863 markings, 50472110 edges, 536834 markings/sec, 25 secs
lola: 18475705 markings, 59115225 edges, 539368 markings/sec, 30 secs
lola: 20953130 markings, 67043407 edges, 495485 markings/sec, 35 secs
lola: 23370121 markings, 74777835 edges, 483398 markings/sec, 40 secs
lola: 26148447 markings, 83664489 edges, 555665 markings/sec, 45 secs
lola: 28891972 markings, 92437598 edges, 548705 markings/sec, 50 secs
lola: 31432027 markings, 100576793 edges, 508011 markings/sec, 55 secs
lola: 33909015 markings, 108503053 edges, 495398 markings/sec, 60 secs
lola: 36462247 markings, 116674057 edges, 510646 markings/sec, 65 secs
lola: 38956784 markings, 124656458 edges, 498907 markings/sec, 70 secs
lola: 41477786 markings, 132724072 edges, 504200 markings/sec, 75 secs
lola: 43018034 markings, 139553473 edges, 308050 markings/sec, 80 secs
lola: 44385603 markings, 146391614 edges, 273514 markings/sec, 85 secs
lola: 45814283 markings, 153530549 edges, 285736 markings/sec, 90 secs
lola: 47151422 markings, 160216186 edges, 267428 markings/sec, 95 secs
lola: 48558347 markings, 167252422 edges, 281385 markings/sec, 100 secs
lola: 49923847 markings, 174077150 edges, 273100 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 50348033 markings, 176203778 edges
lola: ========================================
lola: subprocess 10 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((((p5 <= 0) OR (p6 <= 0)) U ((1 <= p4) AND (1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(A(((p5 <= 0) OR (p6 <= 0)) U ((1 <= p4) AND (1 <= p6))))
lola: processed formula length: 60
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 8193 markings, 8198 edges
lola: ========================================
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (((1 <= p8) U ((1 <= p1) AND (1 <= p2)))) AND A (G ((p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((A((1 <= p8) U ((1 <= p1) AND (1 <= p2))) AND AG((p7 <= 0))))
lola: processed formula length: 64
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1924601 markings, 8675430 edges, 384920 markings/sec, 0 secs
lola: 3680702 markings, 16586380 edges, 351220 markings/sec, 5 secs
lola: 5190957 markings, 23388718 edges, 302051 markings/sec, 10 secs
lola: 6821628 markings, 30732677 edges, 326134 markings/sec, 15 secs
lola: 8488513 markings, 38239300 edges, 333377 markings/sec, 20 secs
lola: 10155413 markings, 45745727 edges, 333380 markings/sec, 25 secs
lola: 11793370 markings, 53121488 edges, 327591 markings/sec, 30 secs
lola: 13440264 markings, 60537783 edges, 329379 markings/sec, 35 secs
lola: 15055009 markings, 67808024 edges, 322949 markings/sec, 40 secs
lola: 16697104 markings, 75202251 edges, 328419 markings/sec, 45 secs
lola: 18272900 markings, 82297737 edges, 315159 markings/sec, 50 secs
lola: 19816226 markings, 89246111 edges, 308665 markings/sec, 55 secs
lola: 21411671 markings, 96429749 edges, 319089 markings/sec, 60 secs
lola: 22946304 markings, 103339561 edges, 306927 markings/sec, 65 secs
lola: 24479253 markings, 110241397 edges, 306590 markings/sec, 70 secs
lola: 26060779 markings, 117361818 edges, 316305 markings/sec, 75 secs
lola: 27595815 markings, 124273160 edges, 307007 markings/sec, 80 secs
lola: 29093163 markings, 131014343 edges, 299470 markings/sec, 85 secs
lola: 30542277 markings, 137538814 edges, 289823 markings/sec, 90 secs
lola: 32018958 markings, 144187522 edges, 295336 markings/sec, 95 secs
lola: 33552561 markings, 151090917 edges, 306721 markings/sec, 100 secs
lola: 35040200 markings, 157789356 edges, 297528 markings/sec, 105 secs
lola: 36558754 markings, 164625524 edges, 303711 markings/sec, 110 secs
lola: 38071975 markings, 171437628 edges, 302644 markings/sec, 115 secs
lola: 39607095 markings, 178349182 edges, 307024 markings/sec, 120 secs
lola: 41105338 markings, 185094360 edges, 299649 markings/sec, 125 secs
lola: 42611524 markings, 191875231 edges, 301237 markings/sec, 130 secs
lola: 44099167 markings, 198572172 edges, 297529 markings/sec, 135 secs
lola: 45553982 markings, 205121349 edges, 290963 markings/sec, 140 secs
lola: 47170477 markings, 212398670 edges, 323299 markings/sec, 145 secs
lola: 48796852 markings, 219720302 edges, 325275 markings/sec, 150 secs
lola: 50393665 markings, 226909624 edges, 319363 markings/sec, 155 secs
lola: 51995166 markings, 234118823 edges, 320300 markings/sec, 160 secs
lola: 53502304 markings, 240903827 edges, 301428 markings/sec, 165 secs
lola: 55016996 markings, 247722767 edges, 302938 markings/sec, 170 secs
lola: 56547495 markings, 254612839 edges, 306100 markings/sec, 175 secs
lola: 58005670 markings, 261176966 edges, 291635 markings/sec, 180 secs
lola: 59513222 markings, 267963534 edges, 301510 markings/sec, 185 secs
lola: 61033248 markings, 274807056 edges, 304005 markings/sec, 190 secs
lola: 62532885 markings, 281557351 edges, 299927 markings/sec, 195 secs
lola: 63988008 markings, 288108589 edges, 291025 markings/sec, 200 secs
lola: 65425486 markings, 294578863 edges, 287496 markings/sec, 205 secs
lola: 66961242 markings, 301492813 edges, 307151 markings/sec, 210 secs
lola: 68470933 markings, 308288384 edges, 301938 markings/sec, 215 secs
lola: 69974968 markings, 315059389 edges, 300807 markings/sec, 220 secs
lola: 71482864 markings, 321847492 edges, 301579 markings/sec, 225 secs
lola: 72958339 markings, 328489765 edges, 295095 markings/sec, 230 secs
lola: 74336633 markings, 334694046 edges, 275659 markings/sec, 235 secs
lola: 75755950 markings, 341083111 edges, 283863 markings/sec, 240 secs
lola: 77220811 markings, 347677405 edges, 292972 markings/sec, 245 secs
lola: 78603502 markings, 353902300 edges, 276538 markings/sec, 250 secs
lola: 79994624 markings, 360164164 edges, 278224 markings/sec, 255 secs
lola: 81397479 markings, 366478856 edges, 280571 markings/sec, 260 secs
lola: 82750290 markings, 372568901 edges, 270562 markings/sec, 265 secs
lola: 84151797 markings, 378877672 edges, 280301 markings/sec, 270 secs
lola: 85484921 markings, 384879101 edges, 266625 markings/sec, 275 secs
lola: 86878888 markings, 391154584 edges, 278793 markings/sec, 280 secs
lola: 88185250 markings, 397035728 edges, 261272 markings/sec, 285 secs
lola: 89537624 markings, 403122439 edges, 270475 markings/sec, 290 secs
lola: 91015407 markings, 409775176 edges, 295557 markings/sec, 295 secs
lola: 92396319 markings, 415990736 edges, 276182 markings/sec, 300 secs
lola: 93762238 markings, 422139458 edges, 273184 markings/sec, 305 secs
lola: 95099722 markings, 428160137 edges, 267497 markings/sec, 310 secs
lola: 96440448 markings, 434195673 edges, 268145 markings/sec, 315 secs
lola: 97829821 markings, 440450026 edges, 277875 markings/sec, 320 secs
lola: 99155711 markings, 446418409 edges, 265178 markings/sec, 325 secs
lola: 100601515 markings, 452927073 edges, 289161 markings/sec, 330 secs
lola: 101977061 markings, 459119146 edges, 275109 markings/sec, 335 secs
lola: 103389112 markings, 465475749 edges, 282410 markings/sec, 340 secs
lola: 104838333 markings, 471998080 edges, 289844 markings/sec, 345 secs
lola: 106180026 markings, 478039101 edges, 268339 markings/sec, 350 secs
lola: 107516110 markings, 484053857 edges, 267217 markings/sec, 355 secs
lola: 108784924 markings, 489764498 edges, 253763 markings/sec, 360 secs
lola: 110097611 markings, 495673219 edges, 262537 markings/sec, 365 secs
lola: 111368397 markings, 501393994 edges, 254157 markings/sec, 370 secs
lola: 112610125 markings, 506982844 edges, 248346 markings/sec, 375 secs
lola: 113846517 markings, 512547742 edges, 247278 markings/sec, 380 secs
lola: 115045670 markings, 517946151 edges, 239831 markings/sec, 385 secs
lola: 116319576 markings, 523680004 edges, 254781 markings/sec, 390 secs
lola: 117429134 markings, 528674772 edges, 221912 markings/sec, 395 secs
lola: 118650597 markings, 534173786 edges, 244293 markings/sec, 400 secs
lola: 119956611 markings, 540052031 edges, 261203 markings/sec, 405 secs
lola: 121304265 markings, 546119586 edges, 269531 markings/sec, 410 secs
lola: 122602542 markings, 551962721 edges, 259655 markings/sec, 415 secs
lola: 123861735 markings, 557631717 edges, 251839 markings/sec, 420 secs
lola: 125162637 markings, 563486636 edges, 260180 markings/sec, 425 secs
lola: 126425476 markings, 569171730 edges, 252568 markings/sec, 430 secs
lola: 127756646 markings, 575163074 edges, 266234 markings/sec, 435 secs
lola: 129068952 markings, 581071089 edges, 262461 markings/sec, 440 secs
lola: 130291106 markings, 586571323 edges, 244431 markings/sec, 445 secs
lola: 131551162 markings, 592243668 edges, 252011 markings/sec, 450 secs
lola: 132740598 markings, 597597999 edges, 237887 markings/sec, 455 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 612 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (((p4 <= 0) U ((1 <= p1) AND (1 <= p2) AND (1 <= p5) AND (1 <= p6))))))
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((p4 <= 0) U ((1 <= p1) AND (1 <= p2) AND (1 <= p5) AND (1 <= p6))))
lola: processed formula length: 72
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 8193 markings, 8198 edges
lola: ========================================
lola: subprocess 13 will run for 816 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p7) OR ((1 <= p1) AND (1 <= p2))) U ((1 <= p4) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A ((((1 <= p7) OR ((1 <= p1) AND (1 <= p2))) U ((1 <= p4) AND (1 <= p6))))
lola: processed formula length: 75
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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p7) OR ((1 <= p1) AND (1 <= p2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
lola: 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 4096 markings, 4095 edges
lola: ========================================
lola: subprocess 14 will run for 1225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p4 <= 0) OR ((1 <= p4) AND (1 <= p2) AND (1 <= p5)) OR ((p8 <= 0) AND (1 <= p7))) U ((1 <= p5) AND (1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p4 <= 0) OR ((1 <= p4) AND (1 <= p2) AND (1 <= p5)) OR ((p8 <= 0) AND (1 <= p7))) U ((1 <= p5) AND (1 <= p6))))
lola: processed formula length: 119
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (1 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 4097 markings, 4096 edges
lola: ========================================
lola: subprocess 15 will run for 2450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p5 <= 0) OR (p6 <= 0)))) AND (A (F (((1 <= p4) OR ((1 <= p4) AND (1 <= p6))))) AND (E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0))) AND (E (F ((1 <= p8))) OR (E (G ((((1 <= p1) AND (1 <= p2)) OR ((1 <= p5) AND (1 <= p6))))) AND ((1 <= p7) AND ((p4 <= 0) OR (p6 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2450 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) OR ((1 <= p4) AND (1 <= p6)))))
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: ((p4 <= 0) AND ((p4 <= 0) OR (p6 <= 0)))
lola: processed formula length: 41
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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: The predicate eventually occurs.
lola: state equation task get result unparse finished++ id 0
lola: 4097 markings, 4096 edges
lola: formula 0: ((1 <= p4) OR ((1 <= p4) AND (1 <= p6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0)))
lola: processed formula length: 43
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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 3 markings, 3 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p7)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p8)))
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 <= p8)))
lola: processed formula length: 17
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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 <= p8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-18-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
sara: try reading problem file CTLFireability-15-0.sara.
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: (E (X (A (G (((1 <= p7) OR ((1 <= p1) AND (1 <= p2))))))) OR E (X (E (X ((1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((1 <= p7) OR ((1 <= p1) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((1 <= p7) OR ((1 <= p1) AND (1 <= p2)))))
lola: processed formula length: 49
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: 2848298 markings, 7078466 edges, 569660 markings/sec, 0 secs
lola: 5480967 markings, 13637067 edges, 526534 markings/sec, 5 secs
lola: 8204684 markings, 20426894 edges, 544743 markings/sec, 10 secs
lola: 10785415 markings, 26861491 edges, 516146 markings/sec, 15 secs
lola: 13466843 markings, 33548153 edges, 536286 markings/sec, 20 secs
lola: 16100656 markings, 40117839 edges, 526763 markings/sec, 25 secs
lola: 18683128 markings, 46560765 edges, 516494 markings/sec, 30 secs
lola: 21228397 markings, 52910512 edges, 509054 markings/sec, 35 secs
lola: 23764029 markings, 59237388 edges, 507126 markings/sec, 40 secs
lola: 26381515 markings, 65768265 edges, 523497 markings/sec, 45 secs
lola: 28856463 markings, 71944282 edges, 494990 markings/sec, 50 secs
lola: 31454283 markings, 78427142 edges, 519564 markings/sec, 55 secs
lola: 33998451 markings, 84776438 edges, 508834 markings/sec, 60 secs
lola: 36526182 markings, 91085486 edges, 505546 markings/sec, 65 secs
lola: 39007000 markings, 97276663 edges, 496164 markings/sec, 70 secs
lola: 41471230 markings, 103427206 edges, 492846 markings/sec, 75 secs
lola: 43867019 markings, 109407954 edges, 479158 markings/sec, 80 secs
lola: 46302451 markings, 115487538 edges, 487086 markings/sec, 85 secs
lola: 48909765 markings, 121995046 edges, 521463 markings/sec, 90 secs
lola: 51504070 markings, 128471166 edges, 518861 markings/sec, 95 secs
lola: 54024301 markings, 134761887 edges, 504046 markings/sec, 100 secs
lola: 56612320 markings, 141223438 edges, 517604 markings/sec, 105 secs
lola: 59178856 markings, 147629158 edges, 513307 markings/sec, 110 secs
lola: 61664378 markings, 153835664 edges, 497104 markings/sec, 115 secs
lola: 64152867 markings, 160047231 edges, 497698 markings/sec, 120 secs
lola: 66691872 markings, 166387115 edges, 507801 markings/sec, 125 secs
lola: 69237386 markings, 172740963 edges, 509103 markings/sec, 130 secs
lola: 71587361 markings, 178609189 edges, 469995 markings/sec, 135 secs
lola: 73995287 markings, 184620234 edges, 481585 markings/sec, 140 secs
lola: 76396410 markings, 190616354 edges, 480225 markings/sec, 145 secs
lola: 78881742 markings, 196820487 edges, 497066 markings/sec, 150 secs
lola: 81237878 markings, 202703521 edges, 471227 markings/sec, 155 secs
lola: 83657890 markings, 208746124 edges, 484002 markings/sec, 160 secs
lola: 86018126 markings, 214638989 edges, 472047 markings/sec, 165 secs
lola: 88466641 markings, 220752569 edges, 489703 markings/sec, 170 secs
lola: 90980476 markings, 227029354 edges, 502767 markings/sec, 175 secs
lola: 93495716 markings, 233309633 edges, 503048 markings/sec, 180 secs
lola: 95962471 markings, 239468335 edges, 493351 markings/sec, 185 secs
lola: 98386264 markings, 245521691 edges, 484759 markings/sec, 190 secs
lola: 100821416 markings, 251600944 edges, 487030 markings/sec, 195 secs
lola: 103191490 markings, 257519456 edges, 474015 markings/sec, 200 secs
lola: 105654811 markings, 263671434 edges, 492664 markings/sec, 205 secs
lola: 108001949 markings, 269532530 edges, 469428 markings/sec, 210 secs
lola: 110071346 markings, 274698492 edges, 413879 markings/sec, 215 secs
lola: 112211366 markings, 280043359 edges, 428004 markings/sec, 220 secs
lola: 114067320 markings, 284677306 edges, 371191 markings/sec, 225 secs
lola: 115995514 markings, 289492294 edges, 385639 markings/sec, 230 secs
lola: 117984796 markings, 294459851 edges, 397856 markings/sec, 235 secs
lola: 119974963 markings, 299429599 edges, 398033 markings/sec, 240 secs
lola: 122041739 markings, 304590674 edges, 413355 markings/sec, 245 secs
lola: 124027323 markings, 309548850 edges, 397117 markings/sec, 250 secs
lola: 126261941 markings, 315129778 edges, 446924 markings/sec, 255 secs
lola: 128182637 markings, 319925499 edges, 384139 markings/sec, 260 secs
lola: 130417475 markings, 325506889 edges, 446968 markings/sec, 265 secs
lola: 132468828 markings, 330629353 edges, 410271 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX((1 <= p7)))
lola: processed formula length: 17
lola: 26 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p2) AND (1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) OR (p5 <= 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 task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p2) AND (1 <= p5))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-17-1.sara
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-17-0.sara.
sara: try reading problem file CTLFireability-17-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3091760 markings, 7928274 edges, 618352 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 6072552 markings, 15687521 edges, 596158 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 8967034 markings, 23182406 edges, 578896 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 11759894 markings, 30532029 edges, 558572 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 14579349 markings, 37858662 edges, 563891 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 17331009 markings, 45158615 edges, 550332 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 20084279 markings, 52334994 edges, 550654 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 22807890 markings, 59492920 edges, 544722 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 25313672 markings, 66101309 edges, 501156 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 27810547 markings, 72628329 edges, 499375 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 30382326 markings, 79349569 edges, 514356 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 32962673 markings, 86124786 edges, 516069 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 35515620 markings, 92897028 edges, 510589 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 37956031 markings, 99364151 edges, 488082 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 40527398 markings, 106057172 edges, 514273 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 42929310 markings, 112411894 edges, 480382 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 45488419 markings, 119089966 edges, 511822 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 47934364 markings, 125552726 edges, 489189 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 50501753 markings, 132326250 edges, 513478 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 53042927 markings, 139003979 edges, 508235 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 55544870 markings, 145669956 edges, 500389 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 58066487 markings, 152242439 edges, 504323 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 60569619 markings, 158905558 edges, 500626 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 63012798 markings, 165393426 edges, 488636 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 65645365 markings, 172175727 edges, 526513 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 67906434 markings, 178230744 edges, 452214 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 70238334 markings, 184496582 edges, 466380 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 72933265 markings, 191351074 edges, 538986 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 75258308 markings, 197692542 edges, 465009 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 77636506 markings, 203951059 edges, 475640 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 80015945 markings, 210297225 edges, 475888 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 82501815 markings, 216827208 edges, 497174 markings/sec, 155 secs
lola: sara is running 160 secs || sara is running 160 secs || 84871105 markings, 223121596 edges, 473858 markings/sec, 160 secs
lola: sara is running 165 secs || sara is running 165 secs || 87262414 markings, 229386758 edges, 478262 markings/sec, 165 secs
lola: sara is running 170 secs || sara is running 170 secs || 89776524 markings, 235932778 edges, 502822 markings/sec, 170 secs
lola: sara is running 175 secs || sara is running 175 secs || 92169456 markings, 242197855 edges, 478586 markings/sec, 175 secs
lola: sara is running 180 secs || sara is running 180 secs || 94440693 markings, 248223308 edges, 454247 markings/sec, 180 secs
lola: sara is running 185 secs || sara is running 185 secs || 96884936 markings, 254662163 edges, 488849 markings/sec, 185 secs
lola: sara is running 190 secs || sara is running 190 secs || 99414270 markings, 261150586 edges, 505867 markings/sec, 190 secs
lola: sara is running 195 secs || sara is running 195 secs || 101902305 markings, 267811789 edges, 497607 markings/sec, 195 secs
lola: sara is running 200 secs || sara is running 200 secs || 104311701 markings, 274175917 edges, 481879 markings/sec, 200 secs
lola: sara is running 205 secs || sara is running 205 secs || 106639489 markings, 280336292 edges, 465558 markings/sec, 205 secs
lola: sara is running 210 secs || sara is running 210 secs || 108986518 markings, 286610057 edges, 469406 markings/sec, 210 secs
lola: sara is running 215 secs || sara is running 215 secs || 111468519 markings, 293099561 edges, 496400 markings/sec, 215 secs
lola: sara is running 220 secs || sara is running 220 secs || 113746960 markings, 299026957 edges, 455688 markings/sec, 220 secs
lola: sara is running 225 secs || sara is running 225 secs || 116119837 markings, 305393972 edges, 474575 markings/sec, 225 secs
lola: sara is running 230 secs || sara is running 230 secs || 118451627 markings, 311514548 edges, 466358 markings/sec, 230 secs
lola: sara is running 235 secs || sara is running 235 secs || 120666788 markings, 317558675 edges, 443032 markings/sec, 235 secs
lola: sara is running 240 secs || sara is running 240 secs || 123157829 markings, 324161366 edges, 498208 markings/sec, 240 secs
lola: sara is running 245 secs || sara is running 245 secs || 125675886 markings, 330759486 edges, 503611 markings/sec, 245 secs
lola: sara is running 250 secs || sara is running 250 secs || 128119003 markings, 337087471 edges, 488623 markings/sec, 250 secs
lola: sara is running 255 secs || sara is running 255 secs || 130263113 markings, 342856762 edges, 428822 markings/sec, 255 secs
lola: sara is running 260 secs || sara is running 260 secs || 132470974 markings, 348674228 edges, 441572 markings/sec, 260 secs
lola: sara is running 265 secs || sara is running 265 secs || 134798728 markings, 354792151 edges, 465551 markings/sec, 265 secs
lola: sara is running 270 secs || sara is running 270 secs || 137138028 markings, 360824692 edges, 467860 markings/sec, 270 secs
lola: sara is running 275 secs || sara is running 275 secs || 139512290 markings, 367103715 edges, 474852 markings/sec, 275 secs
lola: sara is running 280 secs || sara is running 280 secs || 141806496 markings, 373269652 edges, 458841 markings/sec, 280 secs
lola: sara is running 285 secs || sara is running 285 secs || 144163737 markings, 379454916 edges, 471448 markings/sec, 285 secs
lola: sara is running 290 secs || sara is running 290 secs || 146620839 markings, 385890427 edges, 491420 markings/sec, 290 secs
lola: sara is running 295 secs || sara is running 295 secs || 148896830 markings, 391844411 edges, 455198 markings/sec, 295 secs
lola: sara is running 300 secs || sara is running 300 secs || 150808271 markings, 396882706 edges, 382288 markings/sec, 300 secs
lola: sara is running 305 secs || sara is running 305 secs || 152836765 markings, 402393516 edges, 405699 markings/sec, 305 secs
lola: sara is running 310 secs || sara is running 310 secs || 155001868 markings, 407930863 edges, 433021 markings/sec, 310 secs
lola: sara is running 315 secs || sara is running 315 secs || 157000683 markings, 413229194 edges, 399763 markings/sec, 315 secs
lola: sara is running 320 secs || sara is running 320 secs || 159051789 markings, 418743099 edges, 410221 markings/sec, 320 secs
lola: sara is running 325 secs || sara is running 325 secs || 161159232 markings, 424333887 edges, 421489 markings/sec, 325 secs
lola: sara is running 330 secs || sara is running 330 secs || 163267330 markings, 429827402 edges, 421620 markings/sec, 330 secs
lola: sara is running 335 secs || sara is running 335 secs || 165363048 markings, 435519448 edges, 419144 markings/sec, 335 secs
lola: sara is running 340 secs || sara is running 340 secs || 167573636 markings, 441287396 edges, 442118 markings/sec, 340 secs
lola: sara is running 345 secs || sara is running 345 secs || 169669614 markings, 446598125 edges, 419196 markings/sec, 345 secs
lola: sara is running 350 secs || sara is running 350 secs || 171796382 markings, 452210917 edges, 425354 markings/sec, 350 secs
lola: sara is running 355 secs || sara is running 355 secs || 173729707 markings, 457559134 edges, 386665 markings/sec, 355 secs
lola: sara is running 360 secs || sara is running 360 secs || 175687722 markings, 462827198 edges, 391603 markings/sec, 360 secs
lola: sara is running 365 secs || sara is running 365 secs || 177720777 markings, 468200232 edges, 406611 markings/sec, 365 secs
lola: sara is running 370 secs || sara is running 370 secs || 179757812 markings, 473407180 edges, 407407 markings/sec, 370 secs
lola: sara is running 375 secs || sara is running 375 secs || 181754452 markings, 478727174 edges, 399328 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (F ((A (((1 <= p8) U ((1 <= p1) AND (1 <= p2)))) AND A (G ((p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((A((1 <= p8) U ((1 <= p1) AND (1 <= p2))) AND AG((p7 <= 0))))
lola: processed formula length: 64
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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1781572 markings, 8031193 edges, 356314 markings/sec, 0 secs
lola: 3513333 markings, 15832337 edges, 346352 markings/sec, 5 secs
lola: 5129263 markings, 23110835 edges, 323186 markings/sec, 10 secs
lola: 6795369 markings, 30614260 edges, 333221 markings/sec, 15 secs
lola: 8432415 markings, 37986806 edges, 327409 markings/sec, 20 secs
lola: 9987243 markings, 44988532 edges, 310966 markings/sec, 25 secs
lola: 11462892 markings, 51633261 edges, 295130 markings/sec, 30 secs
lola: 13093072 markings, 58974475 edges, 326036 markings/sec, 35 secs
lola: 14734283 markings, 66364135 edges, 328242 markings/sec, 40 secs
lola: 16275177 markings, 73302321 edges, 308179 markings/sec, 45 secs
lola: 17767127 markings, 80019931 edges, 298390 markings/sec, 50 secs
lola: 19291077 markings, 86881984 edges, 304790 markings/sec, 55 secs
lola: 20960177 markings, 94396925 edges, 333820 markings/sec, 60 secs
lola: 22577154 markings, 101677261 edges, 323395 markings/sec, 65 secs
lola: 24188470 markings, 108931764 edges, 322263 markings/sec, 70 secs
lola: 25797822 markings, 116177497 edges, 321870 markings/sec, 75 secs
lola: 27369259 markings, 123252956 edges, 314287 markings/sec, 80 secs
lola: 28924380 markings, 130254522 edges, 311024 markings/sec, 85 secs
lola: 30421280 markings, 136993542 edges, 299380 markings/sec, 90 secs
lola: 32012151 markings, 144156681 edges, 318174 markings/sec, 95 secs
lola: 33599402 markings, 151301911 edges, 317450 markings/sec, 100 secs
lola: 35148990 markings, 158278440 edges, 309918 markings/sec, 105 secs
lola: 36661669 markings, 165088329 edges, 302536 markings/sec, 110 secs
lola: 38176758 markings, 171909748 edges, 303018 markings/sec, 115 secs
lola: 39688435 markings, 178715970 edges, 302335 markings/sec, 120 secs
lola: 41231921 markings, 185663802 edges, 308697 markings/sec, 125 secs
lola: 42768433 markings, 192581298 edges, 307302 markings/sec, 130 secs
lola: 44292085 markings, 199440638 edges, 304730 markings/sec, 135 secs
lola: 45785198 markings, 206163385 edges, 298623 markings/sec, 140 secs
lola: 47511143 markings, 213932493 edges, 345189 markings/sec, 145 secs
lola: 49130093 markings, 221220700 edges, 323790 markings/sec, 150 secs
lola: 50670223 markings, 228154602 edges, 308026 markings/sec, 155 secs
lola: 52209033 markings, 235081621 edges, 307762 markings/sec, 160 secs
lola: 53782540 markings, 242165336 edges, 314701 markings/sec, 165 secs
lola: 55324994 markings, 249109316 edges, 308491 markings/sec, 170 secs
lola: 56910747 markings, 256248334 edges, 317151 markings/sec, 175 secs
lola: 58465799 markings, 263248826 edges, 311010 markings/sec, 180 secs
lola: 59937613 markings, 269874169 edges, 294363 markings/sec, 185 secs
lola: 61449055 markings, 276678010 edges, 302288 markings/sec, 190 secs
lola: 62992386 markings, 283626573 edges, 308666 markings/sec, 195 secs
lola: 64531710 markings, 290555557 edges, 307865 markings/sec, 200 secs
lola: 66057884 markings, 297425777 edges, 305235 markings/sec, 205 secs
lola: 67636479 markings, 304532410 edges, 315719 markings/sec, 210 secs
lola: 69238045 markings, 311741867 edges, 320313 markings/sec, 215 secs
lola: 70772784 markings, 318651033 edges, 306948 markings/sec, 220 secs
lola: 72296161 markings, 325509109 edges, 304675 markings/sec, 225 secs
lola: 73787957 markings, 332224897 edges, 298359 markings/sec, 230 secs
lola: 75246817 markings, 338792019 edges, 291772 markings/sec, 235 secs
lola: 76754958 markings, 345581251 edges, 301628 markings/sec, 240 secs
lola: 78273162 markings, 352415712 edges, 303641 markings/sec, 245 secs
lola: 79798389 markings, 359281566 edges, 305045 markings/sec, 250 secs
lola: 81236226 markings, 365753514 edges, 287567 markings/sec, 255 secs
lola: 82690102 markings, 372297839 edges, 290775 markings/sec, 260 secs
lola: 84170151 markings, 378960248 edges, 296010 markings/sec, 265 secs
lola: 85602738 markings, 385409600 edges, 286517 markings/sec, 270 secs
lola: 87019636 markings, 391787535 edges, 283380 markings/sec, 275 secs
lola: 88488202 markings, 398398745 edges, 293713 markings/sec, 280 secs
lola: 90068944 markings, 405514392 edges, 316148 markings/sec, 285 secs
lola: 91660866 markings, 412680080 edges, 318384 markings/sec, 290 secs
lola: 93202766 markings, 419621986 edges, 308380 markings/sec, 295 secs
lola: 94699013 markings, 426356565 edges, 299249 markings/sec, 300 secs
lola: 96235176 markings, 433272532 edges, 307233 markings/sec, 305 secs
lola: 97807687 markings, 440350293 edges, 314502 markings/sec, 310 secs
lola: 99304981 markings, 447091000 edges, 299459 markings/sec, 315 secs
lola: 100757200 markings, 453627195 edges, 290444 markings/sec, 320 secs
lola: 102180999 markings, 460036464 edges, 284760 markings/sec, 325 secs
lola: 103661322 markings, 466700327 edges, 296065 markings/sec, 330 secs
lola: 105172604 markings, 473503718 edges, 302256 markings/sec, 335 secs
lola: 106636418 markings, 480093374 edges, 292763 markings/sec, 340 secs
lola: 108074317 markings, 486566972 edges, 287580 markings/sec, 345 secs
lola: 109067257 markings, 491035498 edges, 198588 markings/sec, 350 secs
lola: 110372508 markings, 496911116 edges, 261050 markings/sec, 355 secs
lola: 111299846 markings, 501099105 edges, 185468 markings/sec, 360 secs
lola: 112533744 markings, 506638765 edges, 246780 markings/sec, 365 secs
lola: 113767947 markings, 512195216 edges, 246841 markings/sec, 370 secs
lola: 115001773 markings, 517748423 edges, 246765 markings/sec, 375 secs
lola: 115871836 markings, 521664643 edges, 174013 markings/sec, 380 secs
lola: 117176509 markings, 527538433 edges, 260935 markings/sec, 385 secs
lola: 118246332 markings, 532354471 edges, 213965 markings/sec, 390 secs
lola: 119640537 markings, 538629751 edges, 278841 markings/sec, 395 secs
lola: 120984188 markings, 544677519 edges, 268730 markings/sec, 400 secs
lola: 122251676 markings, 550383714 edges, 253498 markings/sec, 405 secs
lola: 123188349 markings, 554599857 edges, 187335 markings/sec, 410 secs
lola: 124178680 markings, 559057404 edges, 198066 markings/sec, 415 secs
lola: 125318624 markings, 564189216 edges, 227989 markings/sec, 420 secs
lola: 126694729 markings, 570382890 edges, 275221 markings/sec, 425 secs
lola: 128060654 markings, 576532761 edges, 273185 markings/sec, 430 secs
lola: 129403835 markings, 582577752 edges, 268636 markings/sec, 435 secs
lola: 130676773 markings, 588308462 edges, 254588 markings/sec, 440 secs
lola: 131987976 markings, 594209817 edges, 262241 markings/sec, 445 secs
lola: 133354395 markings, 600361305 edges, 273284 markings/sec, 450 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F (((p5 <= 0) OR (p6 <= 0)))) AND (A (F (((1 <= p4) OR ((1 <= p4) AND (1 <= p6))))) AND (E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0))) AND (E (F ((1 <= p8))) OR (E (G ((((1 <= p1) AND (1 <= p2)) OR ((1 <= p5) AND (1 <= p6))))) AND ((1 <= p7) AND ((p4 <= 0) OR (p6 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p4) OR ((1 <= p4) AND (1 <= p6)))))
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: ((p4 <= 0) AND ((p4 <= 0) OR (p6 <= 0)))
lola: processed formula length: 41
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: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 <= p4) OR ((1 <= p4) AND (1 <= p6)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-19-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 4097 markings, 4096 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((p5 <= 0) OR (p6 <= 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:788
lola: processed formula: ((1 <= p5) AND (1 <= p6))
lola: processed formula length: 25
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: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p5 <= 0) OR (p6 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E ((((p1 <= 0) OR (p2 <= 0)) R (p7 <= 0)))
lola: processed formula length: 43
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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 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 <= p7)
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-21-0.sara
lola: state equation: calling and running sara
lola: 1
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 3 markings, 3 edges
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p8)))
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 <= p8)))
lola: processed formula length: 17
lola: 25 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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 <= p8)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-22-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no yes unknown yes unknown yes yes no yes yes no no no
lola:
preliminary result: no yes unknown no yes unknown yes unknown yes yes no yes yes no no no
lola: memory consumption: 3740 KB
lola: time consumption: 2244 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="SmallOperatingSystem-PT-MT8192DC4096"
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 SmallOperatingSystem-PT-MT8192DC4096, 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 r194-csrt-159033389600148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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