Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938500084.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is RefineWMG-PT-025025, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.0K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 56K 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 n0-CTLFireability-00
FORMULA_NAME n0-CTLFireability-01
FORMULA_NAME n0-CTLFireability-02
FORMULA_NAME n0-CTLFireability-03
FORMULA_NAME n0-CTLFireability-04
FORMULA_NAME n0-CTLFireability-05
FORMULA_NAME n0-CTLFireability-06
FORMULA_NAME n0-CTLFireability-07
FORMULA_NAME n0-CTLFireability-08
FORMULA_NAME n0-CTLFireability-09
FORMULA_NAME n0-CTLFireability-10
FORMULA_NAME n0-CTLFireability-11
FORMULA_NAME n0-CTLFireability-12
FORMULA_NAME n0-CTLFireability-13
FORMULA_NAME n0-CTLFireability-14
FORMULA_NAME n0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591226001692

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:13:23] [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 23:13:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:13:23] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-03 23:13:23] [INFO ] Transformed 129 places.
[2020-06-03 23:13:23] [INFO ] Transformed 103 transitions.
[2020-06-03 23:13:23] [INFO ] Parsed PT model containing 129 places and 103 transitions in 70 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Finished random walk after 39814 steps, including 0 resets, run visited all 30 properties in 84 ms. (steps per millisecond=473 )
[2020-06-03 23:13:23] [INFO ] Flatten gal took : 30 ms
[2020-06-03 23:13:23] [INFO ] Flatten gal took : 10 ms
[2020-06-03 23:13:23] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2020-06-03 23:13:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RefineWMG-PT-025025 @ 3570 seconds

FORMULA n0-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA n0-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 881
rslt: Output for CTLFireability @ RefineWMG-PT-025025

{
"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 23:13:33 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 227
},
"exit":
{
"localtimelimitreached": false
},
"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 ((((p120 <= 0) OR (p3 <= 2)) R (1 <= p83)))",
"processed_size": 46,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 244
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"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": "AG(EX((p113 <= 0)))",
"processed_size": 19,
"rewrites": 34
},
"net":
{
"conflict_clusters": 78,
"singleton_clusters": 0
},
"result":
{
"edges": 53430,
"markings": 35153,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 296
},
"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 ((5 <= p4)))",
"processed_size": 17,
"rewrites": 33
},
"result":
{
"edges": 129,
"markings": 130,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 371
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((1 <= p22) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))",
"processed_size": 62,
"rewrites": 34
},
"result":
{
"edges": 51,
"markings": 52,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 424
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p70) AND (1 <= p111) AND (1 <= p112) AND (1 <= p114)) OR (p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))))",
"processed_size": 115,
"rewrites": 34
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p5 <= 0) AND (p62 <= 0) AND ((p117 <= 0) OR (p80 <= 0)))",
"processed_size": 59,
"rewrites": 36
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 3
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

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

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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((1 <= p113))",
"processed_size": 15,
"rewrites": 33
},
"net":
{
"conflict_clusters": 78,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"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": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p113)",
"processed_size": 11,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 22,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 22,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p78)",
"processed_size": 10,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 23,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p80) AND (p30 <= 0) AND (p25 <= 0))))",
"processed_size": 50,
"rewrites": 33
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 24,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 23,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3444,
"runtime": 2689.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(A(F(**)))) : (E(X(**)) AND E(G((E(F(**)) AND **)))) : (A(G(E(F(**)))) OR **) : A(X(E(F(**)))) : (A(G(**)) OR A((** U A(G(**))))) : (A(G(E(X(*)))) OR E((* R *))) : (E(F(**)) OR (** AND A(G(*)))) : A(G((E(F(*)) OR E(F(*))))) : A(G(**)) : E(X(E(F(**)))) : (A(X(A(G(*)))) AND A(X(**))) : A(G(*)) : A(G(*)) : A(G(((E(X(**)) AND **) OR (E(F(**)) AND **)))) : (E((E(F(**)) U **)) AND A(F(**))) : E(F(**))"
},
"net":
{
"arcs": 308,
"conflict_clusters": 78,
"places": 129,
"places_significant": 77,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"preliminary_value": "no unknown unknown unknown unknown no yes unknown no yes no no no unknown unknown yes ",
"value": "no unknown unknown unknown unknown no yes unknown no yes no no no unknown unknown yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (G (A (F (((1 <= p5) OR (1 <= p62) OR ((1 <= p117) AND (1 <= p80))))))) : (E (X ((1 <= p113))) AND E (G ((E (F ((1 <= p80))) AND (1 <= p52))))) : (A (G (E (F ((1 <= p107))))) OR (1 <= p113)) : A (X (E (F (((1 <= p86) AND (1 <= p87) AND (1 <= p89)))))) : (E (G (A (G ((1 <= p63))))) OR A (((1 <= p10) U A (G ((1 <= p67)))))) : (NOT(E (F (A (X ((1 <= p113)))))) OR NOT(A ((((1 <= p120) AND (3 <= p3)) U (p83 <= 0))))) : (E (F (((1 <= p80) AND (p30 <= 0) AND (p25 <= 0)))) OR ((1 <= p78) AND NOT(E (F (((p61 <= 0) OR (p62 <= 0) OR (p64 <= 0))))))) : A (G ((NOT(A (G ((1 <= p12)))) OR NOT(A (G ((1 <= p60))))))) : A (G (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0)))) : E (F (E (X ((1 <= p75))))) : A (X ((NOT(E (F ((1 <= p30)))) AND ((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))))) : NOT(E (F ((((p70 <= 0) OR (p111 <= 0) OR (p112 <= 0) OR (p114 <= 0)) AND (1 <= p76) AND (1 <= p77) AND (1 <= p79))))) : NOT(E (F (((p22 <= 0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))))) : A (G (((E (X ((1 <= p83))) AND ((p112 <= 0) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p12)))) OR (E (F ((1 <= p50))) AND ((1 <= p20) OR (p50 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))) : (E ((E (F (((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) U ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND A ((A (X ((1 <= p107))) U A (F ((1 <= p72)))))) : E (F (E ((((1 <= p67) AND (1 <= p35)) U (5 <= p4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= p113))) AND E (G ((E (F ((1 <= p80))) AND (1 <= p52)))))
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: E (G ((E (F ((1 <= p80))) AND (1 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((1 <= p80)) AND (1 <= p52)))
lola: processed formula length: 35
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3905925 markings, 5936990 edges, 781185 markings/sec, 0 secs
lola: 7765218 markings, 11803093 edges, 771859 markings/sec, 5 secs
lola: 11584282 markings, 17608060 edges, 763813 markings/sec, 10 secs
lola: 15262568 markings, 23199075 edges, 735657 markings/sec, 15 secs
lola: 18860396 markings, 28667769 edges, 719566 markings/sec, 20 secs
lola: 22431637 markings, 34096048 edges, 714248 markings/sec, 25 secs
lola: 26102940 markings, 39676429 edges, 734261 markings/sec, 30 secs
lola: 29766962 markings, 45245746 edges, 732804 markings/sec, 35 secs
lola: 33443943 markings, 50834744 edges, 735396 markings/sec, 40 secs
lola: 37162721 markings, 56487295 edges, 743756 markings/sec, 45 secs
lola: 40775034 markings, 61978023 edges, 722463 markings/sec, 50 secs
lola: 44333768 markings, 67387287 edges, 711747 markings/sec, 55 secs
lola: 47850025 markings, 72732015 edges, 703251 markings/sec, 60 secs
lola: 51568927 markings, 78384740 edges, 743780 markings/sec, 65 secs
lola: 55248290 markings, 83977364 edges, 735873 markings/sec, 70 secs
lola: 58950237 markings, 89604316 edges, 740389 markings/sec, 75 secs
lola: 61600974 markings, 93633438 edges, 530147 markings/sec, 80 secs
lola: 61932314 markings, 94139146 edges, 66268 markings/sec, 85 secs
lola: 63159003 markings, 96002533 edges, 245338 markings/sec, 90 secs
lola: 64946012 markings, 98718140 edges, 357402 markings/sec, 95 secs
lola: 66319884 markings, 100806181 edges, 274774 markings/sec, 100 secs
lola: 67729832 markings, 102949323 edges, 281990 markings/sec, 105 secs
lola: 67842689 markings, 103120859 edges, 22571 markings/sec, 110 secs
lola: 67863185 markings, 103152000 edges, 4099 markings/sec, 115 secs
lola: 68861728 markings, 104669803 edges, 199709 markings/sec, 120 secs
lola: 69620840 markings, 105823639 edges, 151822 markings/sec, 125 secs
lola: 69632002 markings, 105840625 edges, 2232 markings/sec, 130 secs
lola: 71623092 markings, 108867061 edges, 398218 markings/sec, 135 secs
lola: 73478522 markings, 111687318 edges, 371086 markings/sec, 140 secs
lola: 73538884 markings, 111779069 edges, 12072 markings/sec, 145 secs
lola: 73538884 markings, 111779069 edges, 0 markings/sec, 150 secs
lola: 76224250 markings, 115860833 edges, 537073 markings/sec, 155 secs
lola: 76655789 markings, 116516770 edges, 86308 markings/sec, 160 secs
lola: 76817701 markings, 116762869 edges, 32382 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((1 <= p113))
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p86) AND (1 <= p87) AND (1 <= p89))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p86) AND (1 <= p87) AND (1 <= p89))))
lola: processed formula length: 50
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3905992 markings, 5937086 edges, 781198 markings/sec, 0 secs
lola: 7792966 markings, 11845272 edges, 777395 markings/sec, 5 secs
lola: 11543295 markings, 17545761 edges, 750066 markings/sec, 10 secs
lola: 15289278 markings, 23239663 edges, 749197 markings/sec, 15 secs
lola: 18900430 markings, 28728613 edges, 722230 markings/sec, 20 secs
lola: 22444537 markings, 34115661 edges, 708821 markings/sec, 25 secs
lola: 26121239 markings, 39704241 edges, 735340 markings/sec, 30 secs
lola: 29838770 markings, 45354894 edges, 743506 markings/sec, 35 secs
lola: 33496680 markings, 50914936 edges, 731582 markings/sec, 40 secs
lola: 37072876 markings, 56350727 edges, 715239 markings/sec, 45 secs
lola: 40703717 markings, 61869612 edges, 726168 markings/sec, 50 secs
lola: 44331313 markings, 67383557 edges, 725519 markings/sec, 55 secs
lola: 47938079 markings, 72865850 edges, 721353 markings/sec, 60 secs
lola: 51685655 markings, 78562164 edges, 749515 markings/sec, 65 secs
lola: 55404894 markings, 84215405 edges, 743848 markings/sec, 70 secs
lola: 59167604 markings, 89934719 edges, 752542 markings/sec, 75 secs
lola: 61878274 markings, 94054939 edges, 542134 markings/sec, 80 secs
lola: 64551717 markings, 98121558 edges, 534689 markings/sec, 85 secs
lola: 65213631 markings, 99124685 edges, 132383 markings/sec, 90 secs
lola: 66113730 markings, 100492835 edges, 180020 markings/sec, 95 secs
lola: 68341586 markings, 103879173 edges, 445571 markings/sec, 100 secs
lola: 68341586 markings, 103879173 edges, 0 markings/sec, 105 secs
lola: 68341586 markings, 103879173 edges, 0 markings/sec, 110 secs
lola: 68855911 markings, 104660959 edges, 102865 markings/sec, 115 secs
lola: 71165198 markings, 108171066 edges, 461857 markings/sec, 120 secs
lola: 72867605 markings, 110758738 edges, 340481 markings/sec, 125 secs
lola: 72958286 markings, 110896565 edges, 18136 markings/sec, 130 secs
lola: 72958286 markings, 110896565 edges, 0 markings/sec, 135 secs
lola: 72967464 markings, 110910516 edges, 1836 markings/sec, 140 secs
lola: 75890918 markings, 115354168 edges, 584691 markings/sec, 145 secs
lola: 75985935 markings, 115498587 edges, 19003 markings/sec, 150 secs
lola: 75985935 markings, 115498587 edges, 0 markings/sec, 155 secs
lola: 75985935 markings, 115498587 edges, 0 markings/sec, 160 secs
lola: 76352620 markings, 116055944 edges, 73337 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((p113 <= 0))))) OR E ((((p120 <= 0) OR (p3 <= 2)) R (1 <= p83))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 227 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p120 <= 0) OR (p3 <= 2)) R (1 <= p83)))
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 ((((p120 <= 0) OR (p3 <= 2)) R (1 <= p83)))
lola: processed formula length: 46
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /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: (p83 <= 0)
lola: state equation task get result unparse finished id 0
lola: 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p113 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(EX((p113 <= 0)))
lola: processed formula length: 19
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file CTLFireability-2-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 35153 markings, 53430 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((1 <= p75)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:623
lola: rewrite Frontend/Parser/formula_rewrite.k:714
lola: processed formula: (1 <= p75)
lola: processed formula length: 10
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p75)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 13 markings, 12 edges
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: ========================================
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G ((p30 <= 0))))) AND A (X (((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((p56 <= 0) OR (p57 <= 0) OR (p59 <= 0)))
lola: processed formula length: 46
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((p30 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (1 <= p30)
lola: processed formula length: 10
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p30)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 22 markings, 21 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((E (X ((1 <= p83))) AND ((p112 <= 0) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p12)))) OR (E (F ((1 <= p50))) AND ((1 <= p20) OR (p50 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((EX((1 <= p83)) AND ((p112 <= 0) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p12)))) OR (EF((1 <= p50)) AND ((1 <= p20) OR (p50 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))
lola: processed formula length: 201
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3837219 markings, 5832546 edges, 767444 markings/sec, 0 secs
lola: 7652481 markings, 11631739 edges, 763052 markings/sec, 5 secs
lola: 11474650 markings, 17441419 edges, 764434 markings/sec, 10 secs
lola: 15259603 markings, 23194565 edges, 756991 markings/sec, 15 secs
lola: 18836008 markings, 28630707 edges, 715281 markings/sec, 20 secs
lola: 22384964 markings, 34025120 edges, 709791 markings/sec, 25 secs
lola: 26267792 markings, 39927018 edges, 776566 markings/sec, 30 secs
lola: 30231725 markings, 45952196 edges, 792787 markings/sec, 35 secs
lola: 34204792 markings, 51991237 edges, 794613 markings/sec, 40 secs
lola: 38064424 markings, 57857890 edges, 771926 markings/sec, 45 secs
lola: 41762601 markings, 63479121 edges, 739635 markings/sec, 50 secs
lola: 45404367 markings, 69014610 edges, 728353 markings/sec, 55 secs
lola: 49048771 markings, 74554092 edges, 728881 markings/sec, 60 secs
lola: 52788874 markings, 80239058 edges, 748021 markings/sec, 65 secs
lola: 56508181 markings, 85892399 edges, 743861 markings/sec, 70 secs
lola: 60261788 markings, 91597872 edges, 750721 markings/sec, 75 secs
lola: 63164634 markings, 96010813 edges, 580569 markings/sec, 80 secs
lola: 65990096 markings, 100307277 edges, 565092 markings/sec, 85 secs
lola: 66055478 markings, 100404286 edges, 13076 markings/sec, 90 secs
lola: 66055478 markings, 100404286 edges, 0 markings/sec, 95 secs
lola: 66614174 markings, 101253522 edges, 111739 markings/sec, 100 secs
lola: 69189885 markings, 105168596 edges, 515142 markings/sec, 105 secs
lola: 72398862 markings, 110046476 edges, 641795 markings/sec, 110 secs
lola: 72523015 markings, 110234949 edges, 24831 markings/sec, 115 secs
lola: 72523015 markings, 110234949 edges, 0 markings/sec, 120 secs
lola: 74067850 markings, 112583113 edges, 308967 markings/sec, 125 secs
lola: 75030501 markings, 114046331 edges, 192530 markings/sec, 130 secs
lola: 76885051 markings, 116865240 edges, 370910 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((5 <= p4)))
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 ((5 <= p4)))
lola: processed formula length: 17
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (5 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 130 markings, 129 edges
lola: ========================================
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))))
lola: processed formula length: 50
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
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: ((1 <= p76) AND (1 <= p77) AND (1 <= p79))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p22) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((1 <= p22) OR (p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))))
lola: processed formula length: 62
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p22 <= 0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p9))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 9 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p70) AND (1 <= p111) AND (1 <= p112) AND (1 <= p114)) OR (p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((((1 <= p70) AND (1 <= p111) AND (1 <= p112) AND (1 <= p114)) OR (p76 <= 0) OR (p77 <= 0) OR (p79 <= 0))))
lola: processed formula length: 115
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p70 <= 0) OR (p111 <= 0) OR (p112 <= 0) OR (p114 <= 0)) AND (1 <= p76) AND (1 <= p77) AND (1 <= p79))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p5) OR (1 <= p62) OR ((1 <= p117) AND (1 <= p80)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p5 <= 0) AND (p62 <= 0) AND ((p117 <= 0) OR (p80 <= 0)))
lola: processed formula length: 59
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result 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 1
lola: formula 1: ((p5 <= 0) AND (p62 <= 0) AND ((p117 <= 0) OR (p80 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: The predicate does not eventually occur from all states.
lola: 32 markings, 32 edges
lola: formula 0: ((1 <= p5) OR (1 <= p62) OR ((1 <= p117) AND (1 <= p80)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p12 <= 0))) OR E (F ((p60 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((p12 <= 0)) OR EF((p60 <= 0))))
lola: processed formula length: 38
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3772110 markings, 5733579 edges, 754422 markings/sec, 0 secs
lola: 7539856 markings, 11460543 edges, 753549 markings/sec, 5 secs
lola: 11314584 markings, 17198132 edges, 754946 markings/sec, 10 secs
lola: 15043721 markings, 22866424 edges, 745827 markings/sec, 15 secs
lola: 18551281 markings, 28197906 edges, 701512 markings/sec, 20 secs
lola: 22013177 markings, 33460007 edges, 692379 markings/sec, 25 secs
lola: 25644263 markings, 38979251 edges, 726217 markings/sec, 30 secs
lola: 29328151 markings, 44578757 edges, 736778 markings/sec, 35 secs
lola: 32901194 markings, 50009790 edges, 714609 markings/sec, 40 secs
lola: 36506914 markings, 55490477 edges, 721144 markings/sec, 45 secs
lola: 40127145 markings, 60993226 edges, 724046 markings/sec, 50 secs
lola: 43735699 markings, 66478241 edges, 721711 markings/sec, 55 secs
lola: 47314691 markings, 71918318 edges, 715798 markings/sec, 60 secs
lola: 51045684 markings, 77589410 edges, 746199 markings/sec, 65 secs
lola: 54690295 markings, 83129207 edges, 728922 markings/sec, 70 secs
lola: 58318923 markings, 88644728 edges, 725726 markings/sec, 75 secs
lola: 61937557 markings, 94149748 edges, 723727 markings/sec, 80 secs
lola: 63103630 markings, 95917484 edges, 233215 markings/sec, 85 secs
lola: 64919626 markings, 98678106 edges, 363199 markings/sec, 90 secs
lola: 68009546 markings, 103459665 edges, 617984 markings/sec, 95 secs
lola: 69982325 markings, 106373109 edges, 394556 markings/sec, 100 secs
lola: 73046834 markings, 111031166 edges, 612902 markings/sec, 105 secs
lola: 74095745 markings, 112625504 edges, 209782 markings/sec, 110 secs
lola: 74095745 markings, 112625504 edges, 0 markings/sec, 115 secs
lola: 76052374 markings, 115599567 edges, 391326 markings/sec, 120 secs
lola: 76727199 markings, 116625319 edges, 134965 markings/sec, 125 secs
lola: 76727199 markings, 116625319 edges, 0 markings/sec, 130 secs
lola: 76727199 markings, 116625319 edges, 0 markings/sec, 135 secs
lola: 76727199 markings, 116625319 edges, 0 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p63))) OR A (((1 <= p10) U A (G ((1 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (AG((1 <= p63)) OR A((1 <= p10) U AG((1 <= p67))))
lola: processed formula length: 50
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 4026475 markings, 6120207 edges, 805295 markings/sec, 0 secs
lola: 8011010 markings, 12176706 edges, 796907 markings/sec, 5 secs
lola: 11888175 markings, 18070002 edges, 775433 markings/sec, 10 secs
lola: 15682629 markings, 23837569 edges, 758891 markings/sec, 15 secs
lola: 19454794 markings, 29571243 edges, 754433 markings/sec, 20 secs
lola: 23108212 markings, 35124452 edges, 730684 markings/sec, 25 secs
lola: 26920667 markings, 40919383 edges, 762491 markings/sec, 30 secs
lola: 30841642 markings, 46879255 edges, 784195 markings/sec, 35 secs
lola: 34768032 markings, 52847393 edges, 785278 markings/sec, 40 secs
lola: 38555012 markings, 58603585 edges, 757396 markings/sec, 45 secs
lola: 42220876 markings, 64175704 edges, 733173 markings/sec, 50 secs
lola: 45859817 markings, 69706891 edges, 727788 markings/sec, 55 secs
lola: 49683597 markings, 75519034 edges, 764756 markings/sec, 60 secs
lola: 53429816 markings, 81213285 edges, 749244 markings/sec, 65 secs
lola: 57125842 markings, 86831245 edges, 739205 markings/sec, 70 secs
lola: 60896887 markings, 92563232 edges, 754209 markings/sec, 75 secs
lola: 63269574 markings, 96169854 edges, 474537 markings/sec, 80 secs
lola: 63690279 markings, 96810393 edges, 84141 markings/sec, 85 secs
lola: 66693461 markings, 101397698 edges, 600636 markings/sec, 90 secs
lola: 69637862 markings, 105850691 edges, 588880 markings/sec, 95 secs
lola: 72599983 markings, 110351934 edges, 592424 markings/sec, 100 secs
lola: 75340931 markings, 114518177 edges, 548190 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 855 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((E (F (((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) U ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND A (F ((1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (E(EF(((1 <= p111) AND (1 <= p112) AND (1 <= p114))) U ((1 <= p86) AND (1 <= p87) AND (1 <= p89))) AND AF((1 <= p72)))
lola: processed formula length: 118
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3973151 markings, 6039160 edges, 794630 markings/sec, 0 secs
lola: 7920884 markings, 12039699 edges, 789547 markings/sec, 5 secs
lola: 11879960 markings, 18057516 edges, 791815 markings/sec, 10 secs
lola: 15731908 markings, 23912465 edges, 770390 markings/sec, 15 secs
lola: 19519858 markings, 29670152 edges, 757590 markings/sec, 20 secs
lola: 23289595 markings, 35400151 edges, 753947 markings/sec, 25 secs
lola: 27173656 markings, 41303933 edges, 776812 markings/sec, 30 secs
lola: 30959015 markings, 47057666 edges, 757072 markings/sec, 35 secs
lola: 34904272 markings, 53054467 edges, 789051 markings/sec, 40 secs
lola: 38672666 markings, 58782425 edges, 753679 markings/sec, 45 secs
lola: 42538601 markings, 64658639 edges, 773187 markings/sec, 50 secs
lola: 46303180 markings, 70380807 edges, 752916 markings/sec, 55 secs
lola: 50214918 markings, 76326639 edges, 782348 markings/sec, 60 secs
lola: 54197100 markings, 82379557 edges, 796436 markings/sec, 65 secs
lola: 58017275 markings, 88186210 edges, 764035 markings/sec, 70 secs
lola: 61924252 markings, 94125866 edges, 781395 markings/sec, 75 secs
lola: 64047873 markings, 97352740 edges, 424724 markings/sec, 80 secs
lola: 65529455 markings, 99606073 edges, 296316 markings/sec, 85 secs
lola: 68249521 markings, 103740510 edges, 544013 markings/sec, 90 secs
lola: 70352898 markings, 106936375 edges, 420675 markings/sec, 95 secs
lola: 72956825 markings, 110894650 edges, 520785 markings/sec, 100 secs
lola: 73096668 markings, 111106903 edges, 27969 markings/sec, 105 secs
lola: 73096668 markings, 111106903 edges, 0 markings/sec, 110 secs
lola: 73096668 markings, 111106903 edges, 0 markings/sec, 115 secs
lola: 74078821 markings, 112599782 edges, 196431 markings/sec, 120 secs
lola: 75940684 markings, 115429809 edges, 372373 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((1 <= p107))))) OR (1 <= p113))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p113)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p113)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p107)))))
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 <= p107)
lola: processed formula length: 11
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p107)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p107 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-15-1.sara
lola: state equation: write sara problem file to CTLFireability-15-0.sara
lola: lola: state equation: calling and running sarastate equation: calling and running sara

sara: try reading problem file CTLFireability-15-1.sara.
sara: try reading problem file CTLFireability-15-0.sara.
sara: sara: place or transition ordering is non-deterministicplace or transition ordering is non-deterministic



lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 3888017 markings, 5909746 edges, 777603 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8173364 markings, 12423478 edges, 857069 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 12127850 markings, 18434301 edges, 790897 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 15952597 markings, 24247905 edges, 764949 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 19686782 markings, 29923884 edges, 746837 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 23449106 markings, 35642621 edges, 752465 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 27302171 markings, 41499272 edges, 770613 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 31164738 markings, 47370368 edges, 772513 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 35040610 markings, 53261686 edges, 775174 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 38819926 markings, 59006255 edges, 755863 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 42533916 markings, 64651529 edges, 742798 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 46148848 markings, 70146218 edges, 722986 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 49954246 markings, 75930415 edges, 761080 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 53727736 markings, 81666109 edges, 754698 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 57658513 markings, 87640901 edges, 786155 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 61477952 markings, 93446460 edges, 763888 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 65155756 markings, 99036716 edges, 735561 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 68864056 markings, 104673343 edges, 741660 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 71379665 markings, 108497057 edges, 503122 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 73649008 markings, 111946467 edges, 453869 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 73823481 markings, 112211666 edges, 34895 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 74538393 markings, 113298311 edges, 142982 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 74550966 markings, 113317429 edges, 2515 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 77700286 markings, 118104398 edges, 629864 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 81223585 markings, 123459810 edges, 704660 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 83999374 markings, 127679006 edges, 555158 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 87134857 markings, 132444953 edges, 627097 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p80) AND (p30 <= 0) AND (p25 <= 0)))) OR ((1 <= p78) AND A (G (((1 <= p61) AND (1 <= p62) AND (1 <= p64))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2148 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p78)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p78)
lola: processed formula length: 10
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= p113))) AND E (G ((E (F ((1 <= p80))) AND (1 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((1 <= p80))) AND (1 <= p52))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EF((1 <= p80)) AND (1 <= p52)))
lola: processed formula length: 35
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3704697 markings, 5631115 edges, 740939 markings/sec, 0 secs
lola: 7464782 markings, 11346428 edges, 752017 markings/sec, 5 secs
lola: 11278964 markings, 17143985 edges, 762836 markings/sec, 10 secs
lola: 15105452 markings, 22960236 edges, 765298 markings/sec, 15 secs
lola: 18770078 markings, 28530493 edges, 732925 markings/sec, 20 secs
lola: 22355713 markings, 33980647 edges, 717127 markings/sec, 25 secs
lola: 26055376 markings, 39604141 edges, 739933 markings/sec, 30 secs
lola: 29697640 markings, 45140368 edges, 728453 markings/sec, 35 secs
lola: 33443472 markings, 50834029 edges, 749166 markings/sec, 40 secs
lola: 37207978 markings, 56556084 edges, 752901 markings/sec, 45 secs
lola: 40901138 markings, 62169685 edges, 738632 markings/sec, 50 secs
lola: 44504880 markings, 67647396 edges, 720748 markings/sec, 55 secs
lola: 48096356 markings, 73106435 edges, 718295 markings/sec, 60 secs
lola: 51864856 markings, 78834543 edges, 753700 markings/sec, 65 secs
lola: 55582985 markings, 84486095 edges, 743626 markings/sec, 70 secs
lola: 59278287 markings, 90102964 edges, 739060 markings/sec, 75 secs
lola: 62707839 markings, 95316161 edges, 685910 markings/sec, 80 secs
lola: 65564445 markings, 99658949 edges, 571321 markings/sec, 85 secs
lola: 68617435 markings, 104298928 edges, 610598 markings/sec, 90 secs
lola: 71652586 markings, 108912148 edges, 607030 markings/sec, 95 secs
lola: 72591551 markings, 110339130 edges, 187793 markings/sec, 100 secs
lola: 72591551 markings, 110339130 edges, 0 markings/sec, 105 secs
lola: 72603562 markings, 110357374 edges, 2402 markings/sec, 110 secs
lola: 75679388 markings, 115033316 edges, 615165 markings/sec, 115 secs
lola: 75814767 markings, 115238423 edges, 27076 markings/sec, 120 secs
lola: 75814767 markings, 115238423 edges, 0 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((1 <= p113))
lola: processed formula length: 15
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p86) AND (1 <= p87) AND (1 <= p89))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p86) AND (1 <= p87) AND (1 <= p89))))
lola: processed formula length: 50
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3943894 markings, 5994696 edges, 788779 markings/sec, 0 secs
lola: 7861148 markings, 11948900 edges, 783451 markings/sec, 5 secs
lola: 11916474 markings, 18113022 edges, 811065 markings/sec, 10 secs
lola: 15862593 markings, 24111102 edges, 789224 markings/sec, 15 secs
lola: 19582979 markings, 29766090 edges, 744077 markings/sec, 20 secs
lola: 23397889 markings, 35564754 edges, 762982 markings/sec, 25 secs
lola: 27385682 markings, 41626214 edges, 797559 markings/sec, 30 secs
lola: 31171334 markings, 47380394 edges, 757130 markings/sec, 35 secs
lola: 35009323 markings, 53214128 edges, 767598 markings/sec, 40 secs
lola: 38977847 markings, 59246294 edges, 793705 markings/sec, 45 secs
lola: 42815083 markings, 65078910 edges, 767447 markings/sec, 50 secs
lola: 46508139 markings, 70692342 edges, 738611 markings/sec, 55 secs
lola: 50513033 markings, 76779777 edges, 800979 markings/sec, 60 secs
lola: 54520015 markings, 82870386 edges, 801396 markings/sec, 65 secs
lola: 58439715 markings, 88828319 edges, 783940 markings/sec, 70 secs
lola: 62269367 markings, 94649536 edges, 765930 markings/sec, 75 secs
lola: 62966017 markings, 95708308 edges, 139330 markings/sec, 80 secs
lola: 66024968 markings, 100358162 edges, 611790 markings/sec, 85 secs
lola: 68302049 markings, 103819092 edges, 455416 markings/sec, 90 secs
lola: 69862601 markings, 106191101 edges, 312110 markings/sec, 95 secs
lola: 69984767 markings, 106376819 edges, 24433 markings/sec, 100 secs
lola: 72371770 markings, 110005313 edges, 477401 markings/sec, 105 secs
lola: 73875406 markings, 112290580 edges, 300727 markings/sec, 110 secs
lola: 73875406 markings, 112290580 edges, 0 markings/sec, 115 secs
lola: 73875406 markings, 112290580 edges, 0 markings/sec, 120 secs
lola: 73875406 markings, 112290580 edges, 0 markings/sec, 125 secs
lola: 75619398 markings, 114941690 edges, 348798 markings/sec, 130 secs
lola: 76774936 markings, 116697883 edges, 231108 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (((E (X ((1 <= p83))) AND ((p112 <= 0) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p12)))) OR (E (F ((1 <= p50))) AND ((1 <= p20) OR (p50 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(((EX((1 <= p83)) AND ((p112 <= 0) OR ((1 <= p26) AND (1 <= p27) AND (1 <= p29) AND (1 <= p12)))) OR (EF((1 <= p50)) AND ((1 <= p20) OR (p50 <= 0) OR ((1 <= p41) AND (1 <= p42) AND (1 <= p44))))))
lola: processed formula length: 201
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3948195 markings, 6001224 edges, 789639 markings/sec, 0 secs
lola: 7882807 markings, 11981818 edges, 786922 markings/sec, 5 secs
lola: 11868041 markings, 18039384 edges, 797047 markings/sec, 10 secs
lola: 15737585 markings, 23921097 edges, 773909 markings/sec, 15 secs
lola: 19494896 markings, 29632205 edges, 751462 markings/sec, 20 secs
lola: 23122361 markings, 35145959 edges, 725493 markings/sec, 25 secs
lola: 26930328 markings, 40934074 edges, 761593 markings/sec, 30 secs
lola: 30728286 markings, 46706960 edges, 759592 markings/sec, 35 secs
lola: 34543124 markings, 52505508 edges, 762968 markings/sec, 40 secs
lola: 38347996 markings, 58288921 edges, 760974 markings/sec, 45 secs
lola: 41980629 markings, 63810526 edges, 726527 markings/sec, 50 secs
lola: 45627902 markings, 69354383 edges, 729455 markings/sec, 55 secs
lola: 49371274 markings, 75044302 edges, 748674 markings/sec, 60 secs
lola: 53158668 markings, 80801143 edges, 757479 markings/sec, 65 secs
lola: 56966655 markings, 86589269 edges, 761597 markings/sec, 70 secs
lola: 60828551 markings, 92459341 edges, 772379 markings/sec, 75 secs
lola: 62419221 markings, 94877312 edges, 318134 markings/sec, 80 secs
lola: 63917109 markings, 97153979 edges, 299578 markings/sec, 85 secs
lola: 66621606 markings, 101264975 edges, 540899 markings/sec, 90 secs
lola: 67599147 markings, 102750672 edges, 195508 markings/sec, 95 secs
lola: 67619715 markings, 102781934 edges, 4114 markings/sec, 100 secs
lola: 70061521 markings, 106493483 edges, 488361 markings/sec, 105 secs
lola: 72944340 markings, 110876569 edges, 576564 markings/sec, 110 secs
lola: 74802505 markings, 113699778 edges, 371633 markings/sec, 115 secs
lola: 74802505 markings, 113699778 edges, 0 markings/sec, 120 secs
lola: 74802505 markings, 113699778 edges, 0 markings/sec, 125 secs
lola: 74802505 markings, 113699778 edges, 0 markings/sec, 130 secs
lola: 76757389 markings, 116671194 edges, 390977 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p12 <= 0))) OR E (F ((p60 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((EF((p12 <= 0)) OR EF((p60 <= 0))))
lola: processed formula length: 38
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3977842 markings, 6046296 edges, 795568 markings/sec, 0 secs
lola: 7844807 markings, 11924065 edges, 773393 markings/sec, 5 secs
lola: 11719018 markings, 17812870 edges, 774842 markings/sec, 10 secs
lola: 15580326 markings, 23682068 edges, 772262 markings/sec, 15 secs
lola: 19297772 markings, 29332591 edges, 743489 markings/sec, 20 secs
lola: 22814626 markings, 34678213 edges, 703371 markings/sec, 25 secs
lola: 26597920 markings, 40428810 edges, 756659 markings/sec, 30 secs
lola: 30430759 markings, 46254725 edges, 766568 markings/sec, 35 secs
lola: 34239218 markings, 52043568 edges, 761692 markings/sec, 40 secs
lola: 37981663 markings, 57732079 edges, 748489 markings/sec, 45 secs
lola: 41705928 markings, 63392967 edges, 744853 markings/sec, 50 secs
lola: 45359416 markings, 68946271 edges, 730698 markings/sec, 55 secs
lola: 49061220 markings, 74573029 edges, 740361 markings/sec, 60 secs
lola: 52772945 markings, 80214840 edges, 742345 markings/sec, 65 secs
lola: 56396952 markings, 85723324 edges, 724801 markings/sec, 70 secs
lola: 60065857 markings, 91300051 edges, 733781 markings/sec, 75 secs
lola: 61923884 markings, 94125681 edges, 371605 markings/sec, 80 secs
lola: 62984194 markings, 95745621 edges, 212062 markings/sec, 85 secs
lola: 65713673 markings, 99896900 edges, 545896 markings/sec, 90 secs
lola: 68866426 markings, 104676933 edges, 630551 markings/sec, 95 secs
lola: 69286681 markings, 105315726 edges, 84051 markings/sec, 100 secs
lola: 71504167 markings, 108686309 edges, 443497 markings/sec, 105 secs
lola: 72014734 markings, 109462360 edges, 102113 markings/sec, 110 secs
lola: 73157505 markings, 111199383 edges, 228554 markings/sec, 115 secs
lola: 76246874 markings, 115895217 edges, 617874 markings/sec, 120 secs
lola: 76358804 markings, 116065331 edges, 22386 markings/sec, 125 secs
lola: 76666855 markings, 116533589 edges, 61610 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p63))) OR A (((1 <= p10) U A (G ((1 <= p67))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: (AG((1 <= p63)) OR A((1 <= p10) U AG((1 <= p67))))
lola: processed formula length: 50
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3874189 markings, 5888730 edges, 774838 markings/sec, 0 secs
lola: 7745600 markings, 11773279 edges, 774282 markings/sec, 5 secs
lola: 11570256 markings, 17586758 edges, 764931 markings/sec, 10 secs
lola: 15370209 markings, 23362681 edges, 759991 markings/sec, 15 secs
lola: 19086131 markings, 29010906 edges, 743184 markings/sec, 20 secs
lola: 22729191 markings, 34548338 edges, 728612 markings/sec, 25 secs
lola: 26505633 markings, 40288545 edges, 755288 markings/sec, 30 secs
lola: 30227841 markings, 45946293 edges, 744442 markings/sec, 35 secs
lola: 33933318 markings, 51578604 edges, 741095 markings/sec, 40 secs
lola: 37648704 markings, 57225993 edges, 743077 markings/sec, 45 secs
lola: 41284814 markings, 62752883 edges, 727222 markings/sec, 50 secs
lola: 44879264 markings, 68216454 edges, 718890 markings/sec, 55 secs
lola: 48512884 markings, 73739568 edges, 726724 markings/sec, 60 secs
lola: 52262436 markings, 79438872 edges, 749910 markings/sec, 65 secs
lola: 55975409 markings, 85082588 edges, 742595 markings/sec, 70 secs
lola: 59750229 markings, 90820312 edges, 754964 markings/sec, 75 secs
lola: 63043907 markings, 95826926 edges, 658736 markings/sec, 80 secs
lola: 64197270 markings, 97580515 edges, 230673 markings/sec, 85 secs
lola: 67349450 markings, 102371204 edges, 630436 markings/sec, 90 secs
lola: 67427650 markings, 102489986 edges, 15640 markings/sec, 95 secs
lola: 67448204 markings, 102521238 edges, 4111 markings/sec, 100 secs
lola: 70649607 markings, 107387515 edges, 640281 markings/sec, 105 secs
lola: 73538234 markings, 111779376 edges, 577725 markings/sec, 110 secs
lola: 74486803 markings, 113219903 edges, 189714 markings/sec, 115 secs
lola: 75272539 markings, 114414230 edges, 157147 markings/sec, 120 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (E ((E (F (((1 <= p111) AND (1 <= p112) AND (1 <= p114)))) U ((1 <= p86) AND (1 <= p87) AND (1 <= p89)))) AND A (F ((1 <= p72))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (E(EF(((1 <= p111) AND (1 <= p112) AND (1 <= p114))) U ((1 <= p86) AND (1 <= p87) AND (1 <= p89))) AND AF((1 <= p72)))
lola: processed formula length: 118
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3859765 markings, 5866816 edges, 771953 markings/sec, 0 secs
lola: 7754581 markings, 11786909 edges, 778963 markings/sec, 5 secs
lola: 11580226 markings, 17601894 edges, 765129 markings/sec, 10 secs
lola: 15340410 markings, 23317382 edges, 752037 markings/sec, 15 secs
lola: 18980048 markings, 28849643 edges, 727928 markings/sec, 20 secs
lola: 22490403 markings, 34185385 edges, 702071 markings/sec, 25 secs
lola: 26181157 markings, 39795327 edges, 738151 markings/sec, 30 secs
lola: 29875729 markings, 45411071 edges, 738914 markings/sec, 35 secs
lola: 33516748 markings, 50945407 edges, 728204 markings/sec, 40 secs
lola: 37324353 markings, 56732987 edges, 761521 markings/sec, 45 secs
lola: 41096870 markings, 62467216 edges, 754503 markings/sec, 50 secs
lola: 44788680 markings, 68078771 edges, 738362 markings/sec, 55 secs
lola: 48354786 markings, 73499241 edges, 713221 markings/sec, 60 secs
lola: 52127831 markings, 79234284 edges, 754609 markings/sec, 65 secs
lola: 55884531 markings, 84945115 edges, 751340 markings/sec, 70 secs
lola: 59679545 markings, 90712859 edges, 759003 markings/sec, 75 secs
lola: 62813056 markings, 95477019 edges, 626702 markings/sec, 80 secs
lola: 65274732 markings, 99218067 edges, 492335 markings/sec, 85 secs
lola: 65356775 markings, 99342264 edges, 16409 markings/sec, 90 secs
lola: 65356775 markings, 99342264 edges, 0 markings/sec, 95 secs
lola: 65356775 markings, 99342264 edges, 0 markings/sec, 100 secs
lola: 66596689 markings, 101226927 edges, 247983 markings/sec, 105 secs
lola: 68563086 markings, 104215859 edges, 393279 markings/sec, 110 secs
lola: 68563086 markings, 104215859 edges, 0 markings/sec, 115 secs
lola: 68563086 markings, 104215859 edges, 0 markings/sec, 120 secs
lola: 68563086 markings, 104215859 edges, 0 markings/sec, 125 secs
lola: 68563086 markings, 104215859 edges, 0 markings/sec, 130 secs
lola: 68563086 markings, 104215859 edges, 0 markings/sec, 135 secs
lola: 69227442 markings, 105225680 edges, 132871 markings/sec, 140 secs
lola: 71803295 markings, 109140970 edges, 515171 markings/sec, 145 secs
lola: 71803295 markings, 109140970 edges, 0 markings/sec, 150 secs
lola: 74308384 markings, 112948712 edges, 501018 markings/sec, 155 secs
lola: 74654248 markings, 113474414 edges, 69173 markings/sec, 160 secs
lola: 76357245 markings, 116062969 edges, 340599 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((1 <= p107))))) OR (1 <= p113))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p113)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p113)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
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 <= p107)
lola: processed formula length: 11
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (1 <= p107)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p107 <= 0)
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-23-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLFireability-23-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-23-0.sara.sara:
try reading problem file CTLFireability-23-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 || 4075269 markings, 6194371 edges, 815054 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 8028546 markings, 12203353 edges, 790655 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 12022248 markings, 18273795 edges, 798740 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 15897719 markings, 24164489 edges, 775094 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 19676942 markings, 29908917 edges, 755845 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 23450852 markings, 35645269 edges, 754782 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 27352270 markings, 41575435 edges, 780284 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 31109998 markings, 47287172 edges, 751546 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 34894863 markings, 53040159 edges, 756973 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 38715746 markings, 58847891 edges, 764177 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 42449767 markings, 64523602 edges, 746804 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 46176265 markings, 70187897 edges, 745300 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 50066086 markings, 76100421 edges, 777964 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 53950571 markings, 82004841 edges, 776897 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 57842275 markings, 87920210 edges, 778341 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 61713657 markings, 93804722 edges, 774276 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 65417421 markings, 99434448 edges, 740753 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 69189152 markings, 105167470 edges, 754346 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 71991645 markings, 109427271 edges, 560499 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 73318999 markings, 111444851 edges, 265471 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 76527131 markings, 116321206 edges, 641626 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 79672280 markings, 121101828 edges, 629030 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 81542650 markings, 123944794 edges, 374074 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 83504081 markings, 126926149 edges, 392286 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 84901945 markings, 129050919 edges, 279573 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 87036094 markings, 132294841 edges, 426830 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 88462472 markings, 134462924 edges, 285276 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 88462472 markings, 134462924 edges, 0 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= p80) AND (p30 <= 0) AND (p25 <= 0)))) OR ((1 <= p78) AND A (G (((1 <= p61) AND (1 <= p62) AND (1 <= p64))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p78)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p78)
lola: processed formula length: 10
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p80) AND (p30 <= 0) AND (p25 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p80) AND (p30 <= 0) AND (p25 <= 0))))
lola: processed formula length: 50
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p80) AND (p30 <= 0) AND (p25 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to CTLFireability-24-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown unknown unknown unknown no yes unknown no yes no no no unknown unknown yes
lola:
preliminary result: no unknown unknown unknown unknown no yes unknown no yes no no no unknown unknown yes
sara: try reading problem file CTLFireability-24-0.sara.
sara: place or transition ordering is non-deterministic
lola: memory consumption: 3444 KB
lola: time consumption: 2689 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="RefineWMG-PT-025025"
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 RefineWMG-PT-025025, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938500084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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