Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.6K Apr 12 18:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 12 18:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 11 20:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 20:58 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 3.5K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 05:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 10 05:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K 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 SwimmingPool-PT-09-CTLFireability-00
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-01
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-02
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-03
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-04
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-05
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-06
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-07
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-08
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-09
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591213750902

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:49:13] [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 19:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:49:13] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2020-06-03 19:49:13] [INFO ] Transformed 9 places.
[2020-06-03 19:49:13] [INFO ] Transformed 7 transitions.
[2020-06-03 19:49:13] [INFO ] Parsed PT model containing 9 places and 7 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Finished random walk after 2933 steps, including 0 resets, run visited all 22 properties in 8 ms. (steps per millisecond=366 )
[2020-06-03 19:49:13] [INFO ] Flatten gal took : 53 ms
[2020-06-03 19:49:13] [INFO ] Flatten gal took : 5 ms
[2020-06-03 19:49:13] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-03 19:49:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ SwimmingPool-PT-09 @ 3570 seconds

FORMULA SwimmingPool-PT-09-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-09-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2436
rslt: Output for CTLFireability @ SwimmingPool-PT-09

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(A((1 <= p6) U (1 <= p2)))",
"processed_size": 28,
"rewrites": 33
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 179,
"markings": 180,
"produced_by": "CTL model checker",
"value": false
},
"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": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 33
},
"result":
{
"edges": 269,
"markings": 270,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 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": "A (((1 <= p2) R ((p6 <= 0) OR (p5 <= 0))))",
"processed_size": 43,
"rewrites": 36
},
"result":
{
"edges": 24480,
"markings": 12376,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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 <= p4)",
"processed_size": 9,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"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": "AX((1 <= p2))",
"processed_size": 13,
"rewrites": 32
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"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 <= p6)",
"processed_size": 9,
"rewrites": 31
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 33
},
"result":
{
"edges": 269,
"markings": 270,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 299
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EX(AG(((p3 <= 0) OR (p7 <= 0))))",
"processed_size": 33,
"rewrites": 33
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 182,
"markings": 183,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 4,
"type": "boolean"
}
},

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

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 548
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A((1 <= p2) U (AG((1 <= p6)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p2))))",
"processed_size": 73,
"rewrites": 33
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 181,
"markings": 181,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 658
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "(E((((1 <= p4)) AND (1 <= p3) AND (1 <= p7) AND (1 <= p5)) U AG(((1 <= p1) AND (1 <= p8)))) OR AF(((((1 <= p1) AND (1 <= p8) AND (1 <= p6)) OR (1 <= p2)) AND (((1 <= p6) AND (1 <= p2)) OR (p4 <= 0)))))",
"processed_size": 203,
"rewrites": 34
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 541,
"markings": 540,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1096
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((((1 <= p3) AND (1 <= p7)) R ((p3 <= 0) OR (p7 <= 0) OR (p5 <= 0))))",
"processed_size": 73,
"rewrites": 36
},
"result":
{
"edges": 1490580,
"markings": 506506,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "universal_release",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

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

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

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

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

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p3 <= 0) OR (p7 <= 0))",
"processed_size": 25,
"rewrites": 34
},
"result":
{
"edges": 360,
"markings": 361,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF((EG(((1 <= p0) AND (1 <= p7))) OR ((1 <= p4) OR ((1 <= p4) OR ((p1 <= 0) OR (p8 <= 0))))))",
"processed_size": 93,
"rewrites": 33
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 1,
"markings": 1,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3332,
"runtime": 1134.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(A(F(**)) OR A((* R *))) : (A(F(**)) OR A(F(**))) : A(F(**)) : (E(F(E(G(*)))) OR E(G(E((** U **))))) : A(F(**)) : (E(X(A((** U **)))) OR E(X(**))) : (A(F(**)) AND A(F((E(G(**)) OR (** OR (** OR (** OR **))))))) : A(F(**)) : A((** U (A(G(**)) OR **))) : E(X(E(G(**)))) : (E((** U A(G(**)))) OR A(F(**))) : (A((* R *)) AND (** OR (A(X(**)) OR (A(F(**)) OR **)))) : E((** U A(F(**)))) : A(G((A(X(**)) OR (A(F(**)) OR **)))) : (E(X(A(G(*)))) OR E(X(E(G(**))))) : (A(F(E(G(**)))) AND (A(F(E(X(**)))) AND (A(F(**)) OR E(G(*)))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "yes yes yes no yes no yes yes no no yes yes yes unknown no yes ",
"value": "yes yes yes no yes no yes yes no no yes yes yes unknown no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: (A (F (((1 <= p3) AND (1 <= p7) AND (1 <= p4)))) OR NOT(E ((((p3 <= 0) OR (p7 <= 0)) U ((1 <= p3) AND (1 <= p7) AND (1 <= p5)))))) : (A (F ((1 <= p4))) OR A (F ((1 <= p5)))) : A (F (A ((((1 <= p6) OR ((1 <= p1) AND (1 <= p8))) U (1 <= p4))))) : (E (F (NOT(A (F ((1 <= p4)))))) OR E (G (E ((((1 <= p3) AND (1 <= p7)) U (1 <= p5)))))) : A (F (((1 <= p3) AND (1 <= p7)))) : E (X ((A (((1 <= p6) U (1 <= p2))) OR ((1 <= p1) AND (1 <= p8))))) : (A (F (((1 <= p3) AND (1 <= p7)))) AND A (F (((((E (G (((1 <= p0) AND (1 <= p7)))) OR (1 <= p4)) OR (1 <= p4)) OR (p1 <= 0)) OR (p8 <= 0))))) : A (F (((p4 <= 0) AND (1 <= p3) AND (1 <= p7) AND ((1 <= p6) OR (1 <= p0))))) : A (((1 <= p2) U (A (G ((1 <= p6))) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p2))))) : E (X (E (G ((p2 <= 0))))) : (E (((((1 <= p4)) AND (1 <= p3) AND (1 <= p7) AND (1 <= p5)) U A (G (((1 <= p1) AND (1 <= p8)))))) OR A (F (((((1 <= p1) AND (1 <= p8) AND (1 <= p6)) OR (1 <= p2)) AND (((1 <= p6) AND (1 <= p2)) OR (p4 <= 0)))))) : (NOT(E (((p2 <= 0) U ((1 <= p6) AND (1 <= p5))))) AND ((((1 <= p4) OR A (X ((1 <= p2)))) OR A (F ((1 <= p5)))) OR (1 <= p6))) : E (((1 <= p2) U A (F (((1 <= p2) OR ((1 <= p3) AND (1 <= p7))))))) : A (G (((A (X ((1 <= p4))) OR A (F ((1 <= p6)))) OR ((p2 <= 0) AND ((p0 <= 0) OR (p7 <= 0)))))) : E (X ((NOT(E (F (((1 <= p3) AND (1 <= p7))))) OR E (G ((p2 <= 0)))))) : ((A (F (E (G (((1 <= p3) AND (1 <= p7)))))) AND A (F (E (X ((1 <= p6)))))) AND (A (F ((1 <= p2))) OR NOT(A (F (((1 <= p4) AND (1 <= p1) AND (1 <= p8)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:440
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 (A (((1 <= p6) U (1 <= p2))))) OR E (X (((1 <= p1) AND (1 <= p8)))))
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 (X (((1 <= p1) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p1) AND (1 <= p8)))
lola: processed formula length: 29
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (((1 <= p6) U (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(A((1 <= p6) U (1 <= p2)))
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 180 markings, 179 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 0)
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 /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 270 markings, 269 edges
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: calling and running sara
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= p2) R ((p6 <= 0) OR (p5 <= 0)))) AND ((1 <= p4) OR (A (X ((1 <= p2))) OR (A (F ((1 <= p5))) OR (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p2) R ((p6 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (((1 <= p2) R ((p6 <= 0) OR (p5 <= 0))))
lola: processed formula length: 43
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 <= p6) AND (1 <= p5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 12376 markings, 24480 edges
lola: ========================================
sara: try reading problem file CTLFireability-0.sara.
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p4)
lola: processed formula length: 9
lola: 31 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p2))
lola: processed formula length: 13
lola: 32 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p6)
lola: processed formula length: 9
lola: 31 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((1 <= p4))) OR (A (F ((1 <= p6))) OR ((p2 <= 0) AND ((p0 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AX((1 <= p4)) OR (AF((1 <= p6)) OR ((p2 <= 0) AND ((p0 <= 0) OR (p7 <= 0))))))
lola: processed formula length: 83
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).
sara: place or transition ordering is non-deterministic

lola: 2609514 markings, 6790286 edges, 521903 markings/sec, 0 secs
lola: 4959975 markings, 13184240 edges, 470092 markings/sec, 5 secs
lola: 7308442 markings, 19627177 edges, 469693 markings/sec, 10 secs
lola: 9587723 markings, 25942135 edges, 455856 markings/sec, 15 secs
lola: 11626236 markings, 31586165 edges, 407703 markings/sec, 20 secs
lola: 13555948 markings, 36979570 edges, 385942 markings/sec, 25 secs
lola: 15453019 markings, 42299470 edges, 379414 markings/sec, 30 secs
lola: 17227642 markings, 47269461 edges, 354925 markings/sec, 35 secs
lola: 19161813 markings, 52696517 edges, 386834 markings/sec, 40 secs
lola: 21135831 markings, 58236489 edges, 394804 markings/sec, 45 secs
lola: 23165745 markings, 63936179 edges, 405983 markings/sec, 50 secs
lola: 25148792 markings, 69504137 edges, 396609 markings/sec, 55 secs
lola: 27155608 markings, 75154988 edges, 401363 markings/sec, 60 secs
lola: 28954426 markings, 80313684 edges, 359764 markings/sec, 65 secs
lola: 30790696 markings, 85445929 edges, 367254 markings/sec, 70 secs
lola: 32648173 markings, 90677848 edges, 371495 markings/sec, 75 secs
lola: 34373354 markings, 95616743 edges, 345036 markings/sec, 80 secs
lola: 36365094 markings, 101202973 edges, 398348 markings/sec, 85 secs
lola: 38106199 markings, 106227052 edges, 348221 markings/sec, 90 secs
lola: 39945390 markings, 111360468 edges, 367838 markings/sec, 95 secs
lola: 41684874 markings, 116390493 edges, 347897 markings/sec, 100 secs
lola: 43592978 markings, 121716920 edges, 381621 markings/sec, 105 secs
lola: 45367394 markings, 126851673 edges, 354883 markings/sec, 110 secs
lola: 47255850 markings, 132121691 edges, 377691 markings/sec, 115 secs
lola: 48995610 markings, 137153174 edges, 347952 markings/sec, 120 secs
lola: 50882706 markings, 142431413 edges, 377419 markings/sec, 125 secs
lola: 52553004 markings, 147246764 edges, 334060 markings/sec, 130 secs
lola: 54427888 markings, 152578964 edges, 374977 markings/sec, 135 secs
lola: 56059758 markings, 157199130 edges, 326374 markings/sec, 140 secs
lola: 57747473 markings, 162091452 edges, 337543 markings/sec, 145 secs
lola: 59607951 markings, 167294150 edges, 372096 markings/sec, 150 secs
lola: 61206478 markings, 171897369 edges, 319705 markings/sec, 155 secs
lola: 62984266 markings, 177063721 edges, 355558 markings/sec, 160 secs
lola: 64890038 markings, 182371351 edges, 381154 markings/sec, 165 secs
lola: 66566913 markings, 187220857 edges, 335375 markings/sec, 170 secs
lola: 68416562 markings, 192606106 edges, 369930 markings/sec, 175 secs
lola: 70336352 markings, 197936252 edges, 383958 markings/sec, 180 secs
lola: 72108352 markings, 203072600 edges, 354400 markings/sec, 185 secs
lola: 74142028 markings, 208912892 edges, 406735 markings/sec, 190 secs
lola: 75881796 markings, 213795360 edges, 347954 markings/sec, 195 secs
lola: 77587116 markings, 218740686 edges, 341064 markings/sec, 200 secs
lola: 79452526 markings, 224179692 edges, 373082 markings/sec, 205 secs
lola: 81221047 markings, 229065077 edges, 353704 markings/sec, 210 secs
lola: 82880614 markings, 233870562 edges, 331913 markings/sec, 215 secs
lola: 84683768 markings, 239124127 edges, 360631 markings/sec, 220 secs
lola: 86674798 markings, 244681067 edges, 398206 markings/sec, 225 secs
lola: 88369690 markings, 249569597 edges, 338978 markings/sec, 230 secs
lola: 90128333 markings, 254685650 edges, 351729 markings/sec, 235 secs
lola: 92147440 markings, 260464725 edges, 403821 markings/sec, 240 secs
lola: 93925734 markings, 265472467 edges, 355659 markings/sec, 245 secs
lola: 95645908 markings, 270464603 edges, 344035 markings/sec, 250 secs
lola: 97481998 markings, 275819492 edges, 367218 markings/sec, 255 secs
lola: 99478448 markings, 281393722 edges, 399290 markings/sec, 260 secs
lola: 101135912 markings, 286168322 edges, 331493 markings/sec, 265 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown no unknown unknown unknown no unknown yes unknown unknown unknown unknown
lola: memory consumption: 7537244 KB
lola: time consumption: 278 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G (((p3 <= 0) OR (p7 <= 0)))))) OR E (X (E (G ((p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
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 /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 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-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 270 markings, 269 edges
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p3 <= 0) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG(((p3 <= 0) OR (p7 <= 0))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 183 markings, 182 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G (((1 <= p3) AND (1 <= p7)))))) AND (A (F (E (X ((1 <= p6))))) AND (A (F ((1 <= p2))) OR E (G (((p4 <= 0) OR (p1 <= 0) OR (p8 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p3) AND (1 <= p7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p3) AND (1 <= p7))))
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1016746 markings, 3495586 edges
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EX((1 <= p6)))
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 271 markings, 270 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p4)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 631 markings, 630 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 361 markings, 360 edges
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p4 <= 0) AND (1 <= p3) AND (1 <= p7) AND ((1 <= p6) OR (1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p4) OR (p3 <= 0) OR (p7 <= 0) OR ((p6 <= 0) AND (p0 <= 0)))
lola: processed formula length: 69
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p4 <= 0) AND (1 <= p3) AND (1 <= p7) AND ((1 <= p6) OR (1 <= p0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
sara: try reading problem file CTLFireability-7-0.sara.
lola: state equation: write sara problem file to CTLFireability-8-0.sara
sara: place or transition ordering is non-deterministic

lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 24571 markings, 36675 edges
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p2) U A (F (((1 <= p2) OR ((1 <= p3) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((1 <= p2) U AF(((1 <= p2) OR ((1 <= p3) AND (1 <= p7)))))
lola: processed formula length: 60
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24571 markings, 36676 edges
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p2) U (A (G ((1 <= p6))) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((1 <= p2) U (AG((1 <= p6)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p2))))
lola: processed formula length: 73
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 181 markings, 181 edges
lola: ========================================
lola: subprocess 11 will run for 658 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((1 <= p4)) AND (1 <= p3) AND (1 <= p7) AND (1 <= p5)) U A (G (((1 <= p1) AND (1 <= p8)))))) OR A (F (((((1 <= p1) AND (1 <= p8) AND (1 <= p6)) OR (1 <= p2)) AND (((1 <= p6) AND (1 <= p2)) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: (E((((1 <= p4)) AND (1 <= p3) AND (1 <= p7) AND (1 <= p5)) U AG(((1 <= p1) AND (1 <= p8)))) OR AF(((((1 <= p1) AND (1 <= p8) AND (1 <= p6)) OR (1 <= p2)) AND (((1 <= p6) AND (1 <= p2)) OR (p4 <= 0)))))
lola: processed formula length: 203
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 540 markings, 541 edges
lola: ========================================
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p4))) OR A (F ((1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 822 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p5 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p5)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 27811 markings, 38835 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p3) AND (1 <= p7) AND (1 <= p4)))) OR A ((((1 <= p3) AND (1 <= p7)) R ((p3 <= 0) OR (p7 <= 0) OR (p5 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1096 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p3) AND (1 <= p7)) R ((p3 <= 0) OR (p7 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((1 <= p3) AND (1 <= p7)) R ((p3 <= 0) OR (p7 <= 0) OR (p5 <= 0))))
lola: processed formula length: 73
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 /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 <= p3) AND (1 <= p7) AND (1 <= p5))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 506506 markings, 1490580 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((p4 <= 0))))) OR E (G (E ((((1 <= p3) AND (1 <= p7)) U (1 <= p5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p4 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (p4 <= 0)
lola: processed formula length: 9
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p4)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation 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: (p4 <= 0)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-1.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate is not possibly preserved from any reachable marking.
lola: 1260 markings, 2518 edges
lola: ========================================
lola: subprocess 15 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E ((((1 <= p3) AND (1 <= p7)) U (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E(((1 <= p3) AND (1 <= p7)) U (1 <= p5)))
lola: processed formula length: 44
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p3) AND (1 <= p7)))) AND A (F ((E (G (((1 <= p0) AND (1 <= p7)))) OR ((1 <= p4) OR ((1 <= p4) OR ((p1 <= 0) OR (p8 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: The predicate eventually occurs.
lola: 361 markings, 360 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
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: A (G ((A (X ((1 <= p4))) OR (A (F ((1 <= p6))) OR ((p2 <= 0) AND ((p0 <= 0) OR (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AX((1 <= p4)) OR (AF((1 <= p6)) OR ((p2 <= 0) AND ((p0 <= 0) OR (p7 <= 0))))))
lola: processed formula length: 83
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: 2606162 markings, 6780886 edges, 521232 markings/sec, 0 secs
lola: 4907060 markings, 13034925 edges, 460180 markings/sec, 5 secs
lola: 7195564 markings, 19310349 edges, 457701 markings/sec, 10 secs
lola: 9396290 markings, 25399182 edges, 440145 markings/sec, 15 secs
lola: 11592672 markings, 31493515 edges, 439276 markings/sec, 20 secs
lola: 13473860 markings, 36745688 edges, 376238 markings/sec, 25 secs
lola: 15452382 markings, 42297669 edges, 395704 markings/sec, 30 secs
lola: 17508805 markings, 48078770 edges, 411285 markings/sec, 35 secs
lola: 19539547 markings, 53784709 edges, 406148 markings/sec, 40 secs
lola: 21582068 markings, 59522964 edges, 408504 markings/sec, 45 secs
lola: 23524666 markings, 64968911 edges, 388520 markings/sec, 50 secs
lola: 25537434 markings, 70618026 edges, 402554 markings/sec, 55 secs
lola: 27521498 markings, 76190121 edges, 396813 markings/sec, 60 secs
lola: 29516529 markings, 81870854 edges, 399006 markings/sec, 65 secs
lola: 31357764 markings, 87081508 edges, 368247 markings/sec, 70 secs
lola: 33281288 markings, 92472282 edges, 384705 markings/sec, 75 secs
lola: 35152336 markings, 97873024 edges, 374210 markings/sec, 80 secs
lola: 37100170 markings, 103315399 edges, 389567 markings/sec, 85 secs
lola: 39127235 markings, 109030302 edges, 405413 markings/sec, 90 secs
lola: 40905148 markings, 114129329 edges, 355583 markings/sec, 95 secs
lola: 42895470 markings, 119721403 edges, 398064 markings/sec, 100 secs
lola: 44678178 markings, 124852245 edges, 356542 markings/sec, 105 secs
lola: 46736484 markings, 130635864 edges, 411661 markings/sec, 110 secs
lola: 48516118 markings, 135761098 edges, 355927 markings/sec, 115 secs
lola: 50325826 markings, 140858533 edges, 361942 markings/sec, 120 secs
lola: 51691878 markings, 144756344 edges, 273210 markings/sec, 125 secs
lola: 53405154 markings, 149721821 edges, 342655 markings/sec, 130 secs
lola: 55367163 markings, 155206007 edges, 392402 markings/sec, 135 secs
lola: 56935236 markings, 159732128 edges, 313615 markings/sec, 140 secs
lola: 58723022 markings, 164927588 edges, 357557 markings/sec, 145 secs
lola: 60446282 markings, 169699360 edges, 344652 markings/sec, 150 secs
lola: 62067014 markings, 174394090 edges, 324146 markings/sec, 155 secs
lola: 63963050 markings, 179736419 edges, 379207 markings/sec, 160 secs
lola: 65581754 markings, 184366019 edges, 323741 markings/sec, 165 secs
lola: 67308388 markings, 189375515 edges, 345327 markings/sec, 170 secs
lola: 69283668 markings, 194922142 edges, 395056 markings/sec, 175 secs
lola: 70972770 markings, 199776237 edges, 337820 markings/sec, 180 secs
lola: 72746288 markings, 204929294 edges, 354704 markings/sec, 185 secs
lola: 74755242 markings, 210563231 edges, 401791 markings/sec, 190 secs
lola: 76412456 markings, 215329688 edges, 331443 markings/sec, 195 secs
lola: 78117948 markings, 220286692 edges, 341098 markings/sec, 200 secs
lola: 80120923 markings, 225931663 edges, 400595 markings/sec, 205 secs
lola: 81801476 markings, 230740919 edges, 336111 markings/sec, 210 secs
lola: 83519190 markings, 235727986 edges, 343543 markings/sec, 215 secs
lola: 85410830 markings, 241246404 edges, 378328 markings/sec, 220 secs
lola: 87278400 markings, 246414176 edges, 373514 markings/sec, 225 secs
lola: 88942650 markings, 251233353 edges, 332850 markings/sec, 230 secs
lola: 90755672 markings, 256516826 edges, 362604 markings/sec, 235 secs
lola: 92798702 markings, 262234924 edges, 408606 markings/sec, 240 secs
lola: 94483452 markings, 267085861 edges, 336950 markings/sec, 245 secs
lola: 96224346 markings, 272148393 edges, 348179 markings/sec, 250 secs
lola: 98096634 markings, 277615684 edges, 374458 markings/sec, 255 secs
lola: 100035866 markings, 282989995 edges, 387846 markings/sec, 260 secs
lola: 101681104 markings, 287750581 edges, 329048 markings/sec, 265 secs
lola: 103348226 markings, 292605581 edges, 333424 markings/sec, 270 secs
lola: 105229404 markings, 298102446 edges, 376236 markings/sec, 275 secs
lola: 107125990 markings, 303342605 edges, 379317 markings/sec, 280 secs
lola: 108799610 markings, 308188454 edges, 334724 markings/sec, 285 secs
lola: 110511948 markings, 313177188 edges, 342468 markings/sec, 290 secs
lola: 112217126 markings, 318162120 edges, 341036 markings/sec, 295 secs
lola: 114050918 markings, 323233477 edges, 366758 markings/sec, 300 secs
lola: 115674040 markings, 327922274 edges, 324624 markings/sec, 305 secs
lola: 117371586 markings, 332862189 edges, 339509 markings/sec, 310 secs
lola: 119153218 markings, 338066150 edges, 356326 markings/sec, 315 secs
lola: 121186346 markings, 343755860 edges, 406626 markings/sec, 320 secs
lola: 122734554 markings, 348201473 edges, 309642 markings/sec, 325 secs
lola: 124326020 markings, 352824102 edges, 318293 markings/sec, 330 secs
lola: 125856963 markings, 357289077 edges, 306189 markings/sec, 335 secs
lola: 127601067 markings, 362390290 edges, 348821 markings/sec, 340 secs
lola: 129617374 markings, 367993274 edges, 403261 markings/sec, 345 secs
lola: 131273884 markings, 372774331 edges, 331302 markings/sec, 350 secs
lola: 132946758 markings, 377641251 edges, 334575 markings/sec, 355 secs
lola: 134665822 markings, 382661068 edges, 343813 markings/sec, 360 secs
lola: 136511902 markings, 388065541 edges, 369216 markings/sec, 365 secs
lola: 138423370 markings, 393334533 edges, 382294 markings/sec, 370 secs
lola: 140052570 markings, 398050116 edges, 325840 markings/sec, 375 secs
lola: 141722758 markings, 402915249 edges, 334038 markings/sec, 380 secs
lola: 143460720 markings, 407993420 edges, 347592 markings/sec, 385 secs
lola: 145318910 markings, 413435289 edges, 371638 markings/sec, 390 secs
lola: 147214123 markings, 418649263 edges, 379043 markings/sec, 395 secs
lola: 148796053 markings, 423228875 edges, 316386 markings/sec, 400 secs
lola: 150424638 markings, 427972053 edges, 325717 markings/sec, 405 secs
lola: 152114490 markings, 432908644 edges, 337970 markings/sec, 410 secs
lola: 153917244 markings, 438189883 edges, 360551 markings/sec, 415 secs
lola: 155807050 markings, 443419648 edges, 377961 markings/sec, 420 secs
lola: 157355482 markings, 447879970 edges, 309686 markings/sec, 425 secs
lola: 158915582 markings, 452414358 edges, 312020 markings/sec, 430 secs
lola: 160539422 markings, 457155875 edges, 324768 markings/sec, 435 secs
lola: 162161800 markings, 461901991 edges, 324476 markings/sec, 440 secs
lola: 163959420 markings, 467168963 edges, 359524 markings/sec, 445 secs
lola: 165843444 markings, 472346621 edges, 376805 markings/sec, 450 secs
lola: 167323268 markings, 476626532 edges, 295965 markings/sec, 455 secs
lola: 168850446 markings, 481071426 edges, 305436 markings/sec, 460 secs
lola: 170485328 markings, 485845404 edges, 326976 markings/sec, 465 secs
lola: 172058504 markings, 490451233 edges, 314635 markings/sec, 470 secs
lola: 173833588 markings, 495656065 edges, 355017 markings/sec, 475 secs
lola: 175724344 markings, 500851944 edges, 378151 markings/sec, 480 secs
lola: 177325237 markings, 505480633 edges, 320179 markings/sec, 485 secs
lola: 178765848 markings, 509672926 edges, 288122 markings/sec, 490 secs
lola: 180258110 markings, 514030887 edges, 298452 markings/sec, 495 secs
lola: 181836534 markings, 518648925 edges, 315685 markings/sec, 500 secs
lola: 183626738 markings, 523897560 edges, 358041 markings/sec, 505 secs
lola: 185535533 markings, 529190312 edges, 381759 markings/sec, 510 secs
lola: 187153034 markings, 533838229 edges, 323500 markings/sec, 515 secs
lola: 188691466 markings, 538308435 edges, 307686 markings/sec, 520 secs
lola: 190312490 markings, 543038447 edges, 324205 markings/sec, 525 secs
lola: 191859212 markings, 547562100 edges, 309344 markings/sec, 530 secs
lola: 193587498 markings, 552627731 edges, 345657 markings/sec, 535 secs
lola: 195391450 markings, 557921433 edges, 360790 markings/sec, 540 secs
lola: 197251414 markings, 562998656 edges, 371993 markings/sec, 545 secs
lola: 198859478 markings, 567656944 edges, 321613 markings/sec, 550 secs
lola: 200452528 markings, 572297959 edges, 318610 markings/sec, 555 secs
lola: 202102844 markings, 577122216 edges, 330063 markings/sec, 560 secs
lola: 203772232 markings, 582010092 edges, 333878 markings/sec, 565 secs
lola: 205544134 markings, 587207728 edges, 354380 markings/sec, 570 secs
lola: 207584106 markings, 592881330 edges, 407994 markings/sec, 575 secs
lola: 209192399 markings, 597499081 edges, 321659 markings/sec, 580 secs
lola: 210745680 markings, 602012185 edges, 310656 markings/sec, 585 secs
lola: 212277546 markings, 606481047 edges, 306373 markings/sec, 590 secs
lola: 213862094 markings, 611115379 edges, 316910 markings/sec, 595 secs
lola: 215493516 markings, 615896137 edges, 326284 markings/sec, 600 secs
lola: 217179340 markings, 620842015 edges, 337165 markings/sec, 605 secs
lola: 219205334 markings, 626481432 edges, 405199 markings/sec, 610 secs
lola: 220409992 markings, 629925795 edges, 240932 markings/sec, 615 secs
lola: 221553796 markings, 633238107 edges, 228761 markings/sec, 620 secs
lola: 222592449 markings, 636259520 edges, 207731 markings/sec, 625 secs
lola: 224014734 markings, 640410606 edges, 284457 markings/sec, 630 secs
lola: 225387254 markings, 644422475 edges, 274504 markings/sec, 635 secs
lola: 226718825 markings, 648324834 edges, 266314 markings/sec, 640 secs
lola: 227982678 markings, 652031282 edges, 252771 markings/sec, 645 secs
lola: 228837012 markings, 654538382 edges, 170867 markings/sec, 650 secs
lola: 230232940 markings, 658637502 edges, 279186 markings/sec, 655 secs
lola: 231301246 markings, 661471246 edges, 213661 markings/sec, 660 secs
lola: 231757912 markings, 662759618 edges, 91333 markings/sec, 665 secs
lola: 232543332 markings, 665015408 edges, 157084 markings/sec, 670 secs
lola: 233831474 markings, 668745770 edges, 257628 markings/sec, 675 secs
lola: 235125430 markings, 672512484 edges, 258791 markings/sec, 680 secs
lola: 236169972 markings, 675563763 edges, 208908 markings/sec, 685 secs
lola: 237396502 markings, 679150336 edges, 245306 markings/sec, 690 secs
lola: 238740988 markings, 683087087 edges, 268897 markings/sec, 695 secs
lola: 239967674 markings, 686683944 edges, 245337 markings/sec, 700 secs
lola: 241269518 markings, 690504126 edges, 260369 markings/sec, 705 secs
lola: 242578610 markings, 694351851 edges, 261818 markings/sec, 710 secs
lola: 244229920 markings, 698853584 edges, 330262 markings/sec, 715 secs
lola: 245319046 markings, 701977782 edges, 217825 markings/sec, 720 secs
lola: 246488338 markings, 705367121 edges, 233858 markings/sec, 725 secs
lola: 247750517 markings, 709041257 edges, 252436 markings/sec, 730 secs
lola: 248701718 markings, 711819028 edges, 190240 markings/sec, 735 secs
lola: 249593942 markings, 714427196 edges, 178445 markings/sec, 740 secs
lola: 250686102 markings, 717624350 edges, 218432 markings/sec, 745 secs
lola: 251999882 markings, 721472317 edges, 262756 markings/sec, 750 secs
lola: 253344744 markings, 725418326 edges, 268972 markings/sec, 755 secs
lola: 254269114 markings, 728132012 edges, 184874 markings/sec, 760 secs
lola: 255317366 markings, 731211883 edges, 209650 markings/sec, 765 secs
lola: 256801235 markings, 735357980 edges, 296774 markings/sec, 770 secs
lola: 257810513 markings, 738145423 edges, 201856 markings/sec, 775 secs
lola: 258697798 markings, 740703083 edges, 177457 markings/sec, 780 secs
lola: 259796084 markings, 743890745 edges, 219657 markings/sec, 785 secs
lola: 260872094 markings, 747024103 edges, 215202 markings/sec, 790 secs
lola: 261796422 markings, 749723254 edges, 184866 markings/sec, 795 secs
lola: 262741770 markings, 752487138 edges, 189070 markings/sec, 800 secs
lola: 263530038 markings, 754792097 edges, 157654 markings/sec, 805 secs
lola: 264653695 markings, 758084056 edges, 224731 markings/sec, 810 secs
lola: 265741066 markings, 761274969 edges, 217474 markings/sec, 815 secs
lola: 267148762 markings, 765407405 edges, 281539 markings/sec, 820 secs
lola: 268232086 markings, 768590344 edges, 216665 markings/sec, 825 secs
lola: 269063429 markings, 771032383 edges, 166269 markings/sec, 830 secs
lola: 270309091 markings, 774515734 edges, 249132 markings/sec, 835 secs
lola: 271501166 markings, 777789528 edges, 238415 markings/sec, 840 secs
lola: 272738778 markings, 781364545 edges, 247522 markings/sec, 845 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F (((1 <= p3) AND (1 <= p7)))) AND A (F ((E (G (((1 <= p0) AND (1 <= p7)))) OR ((1 <= p4) OR ((1 <= p4) OR ((p1 <= 0) OR (p8 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p3) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p3) AND (1 <= p7))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 361 markings, 360 edges
lola: state equation: write sara problem file to CTLFireability-17-0.sara
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: A (F ((E (G (((1 <= p0) AND (1 <= p7)))) OR ((1 <= p4) OR ((1 <= p4) OR ((p1 <= 0) OR (p8 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((EG(((1 <= p0) AND (1 <= p7))) OR ((1 <= p4) OR ((1 <= p4) OR ((p1 <= 0) OR (p8 <= 0))))))
lola: processed formula length: 93
lola: 33 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes no no yes yes yes unknown no yes
lola:
preliminary result: yes yes yes no yes no yes yes no no yes yes yes unknown no yes
sara: try reading problem file CTLFireability-17-0.sara.
sara: place or transition ordering is non-deterministic

lola: memory consumption: 3332 KB
lola: time consumption: 1134 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16303852 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16303088 kB

--------------------
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="SwimmingPool-PT-09"
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 SwimmingPool-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r194-csrt-159033389800308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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