Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 13 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rwxr-xr-x 1 mcc users 60K Apr 27 14:36 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 IOTPpurchase-PT-C05M04P03D02-CTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591205095295

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

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA IOTPpurchase-PT-C05M04P03D02-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2820
rslt: Output for CTLFireability @ IOTPpurchase-PT-C05M04P03D02

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 17:24:57 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": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((1 <= p2) OR ((1 <= p37) AND (1 <= p87)))))",
"processed_size": 51,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E ((((p69 <= 0) OR (p90 <= 0)) U ((1 <= p70) AND (1 <= p83) AND (1 <= p38) AND (1 <= p67) AND (1 <= p95))))",
"processed_size": 108,
"rewrites": 39
},
"result":
{
"edges": 5096,
"markings": 1618,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 5,
"problems": 5
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"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": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0))",
"processed_size": 72,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p2 <= 0) OR (p107 <= 0))",
"processed_size": 27,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((p105 <= 0) OR ((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p1) AND (1 <= p91)))",
"processed_size": 121,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 440
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "AF(AX(((1 <= p105) AND (1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))",
"processed_size": 81,
"rewrites": 38
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 293
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A((1 <= p2) U (AX(((1 <= p38) AND (1 <= p67) AND (1 <= p95))) OR EF(((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109)))))",
"processed_size": 129,
"rewrites": 39
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 81,
"markings": 81,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 320
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p18) AND (1 <= p34) AND (1 <= p46) AND (1 <= p49) AND ((1 <= p89) OR (1 <= p92)))))",
"processed_size": 97,
"rewrites": 37
},
"result":
{
"edges": 40,
"markings": 41,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 352
},
"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": "((p69 <= 0) OR (p90 <= 0))",
"processed_size": 27,
"rewrites": 40
},
"result":
{
"markings": 17299248,
"produced_by": "parallel",
"stats":
{
"edges": 100227768
},
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
},
"type": "dfs/tscc"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "globally_possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 373
},
"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 ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80)))",
"processed_size": 73,
"rewrites": 40
},
"result":
{
"edges": 31396593,
"markings": 9030919,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 5,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EG(AF(((p69 <= 0) OR (p90 <= 0))))",
"processed_size": 35,
"rewrites": 38
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 181,
"markings": 93,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 475
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A(((1 <= p12) AND (1 <= p58) AND (1 <= p103) AND (1 <= p2)) R EF(((p61 <= 0) OR (p64 <= 0))))",
"processed_size": 94,
"rewrites": 38
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 126909405,
"markings": 17403840,
"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": 525
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 1,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "EF((AG(((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))) AND ((p2 <= 0) OR ((1 <= p46) AND (1 <= p49) AND (((1 <= p50) AND (1 <= p88)) OR ((1 <= p61) AND (1 <= p64)))))))",
"processed_size": 181,
"rewrites": 38
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 141583814,
"markings": 17406024,
"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": 596
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 2,
"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": "AG(AF(AG((1 <= p3))))",
"processed_size": 21,
"rewrites": 39
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 182,
"markings": 87,
"produced_by": "CTL model checker",
"value": false
},
"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": 745
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E(((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0) OR (p9 <= 0) OR (p23 <= 0) OR (p33 <= 0) OR (p57 <= 0) OR (p108 <= 0) OR (p12 <= 0) OR (p58 <= 0) OR (p103 <= 0) OR (p17 <= 0) OR (p19 <= 0)) U AG(((1 <= p82) OR ((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93)))))",
"processed_size": 307,
"rewrites": 38
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 128888872,
"markings": 17406024,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 940
},
"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": "((p17 <= 0) OR (p19 <= 0))",
"processed_size": 27,
"rewrites": 39
},
"result":
{
"edges": 87,
"markings": 87,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1410
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 15,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "E (((((p29 <= 0) OR (p39 <= 0) OR (p43 <= 0) OR (p55 <= 0) OR (p72 <= 0) OR (p86 <= 0)) AND (1 <= p7) AND (1 <= p24) AND (1 <= p31) AND (1 <= p74) AND (1 <= p106)) R (((p105 <= 0) OR (p0 <= 0) OR (p81 <= 0)) AND (p85 <= 0))))",
"processed_size": 232,
"rewrites": 39
},
"result":
{
"edges": 128,
"markings": 123,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 7
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "existential_release",
"workflow": "stateequation"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2820
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))",
"processed_size": 257,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 2,
"aneg": 0,
"comp": 17,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 17,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))",
"processed_size": 257,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "AF(EG((p89 <= 0)))",
"processed_size": 18,
"rewrites": 38
},
"net":
{
"conflict_clusters": 44,
"singleton_clusters": 0
},
"result":
{
"edges": 3782,
"markings": 1426,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 44172,
"runtime": 750.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((E(X(**)) OR (E(X(*)) AND E(F(**)))) AND (E((** U **)) OR (E(G(**)) AND E(G(**))))) : E(F(*)) : E(G(E(F(*)))) : A(G(E(F(A(G(**)))))) : (A(X(A(G(*)))) AND (** OR E(X(A(F(**)))))) : E((* R *)) : A((* R E(F(*)))) : E(G(A(F(**)))) : E(F((A(X(**)) AND E(F(**))))) : (A(F(E(G(**)))) AND **) : E((** U A(G(**)))) : E(F(A(G(**)))) : E(F((A(G(*)) AND **))) : (A(F(A(X(**)))) OR (A(X(**)) AND (E(F(**)) AND ((** OR (E(G(*)) OR **)) AND **)))) : A((** U (A(X(**)) OR E(F(**))))) : A(G(A(F(A(G(**))))))"
},
"net":
{
"arcs": 224,
"conflict_clusters": 44,
"places": 111,
"places_significant": 44,
"singleton_clusters": 0,
"transitions": 45
},
"result":
{
"preliminary_value": "no yes yes no no no yes yes yes no no no no no yes no ",
"value": "no yes yes no no no yes yes yes no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 156/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3552
lola: finding significant places
lola: 111 places, 45 transitions, 44 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: ((E (X (((p82 <= 0) OR (p2 <= 0)))) OR (NOT(A (X (((1 <= p62) AND (1 <= p65))))) AND E (F (((1 <= p92) AND (1 <= p16) AND (1 <= p60)))))) AND (E ((((p69 <= 0) OR (p90 <= 0)) U ((1 <= p70) AND (1 <= p83) AND (1 <= p38) AND (1 <= p67) AND (1 <= p95)))) OR (E (G (((1 <= p2) OR ((1 <= p37) AND (1 <= p87))))) AND E (G (((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND (1 <= p1) AND (1 <= p91))))))) : NOT(A (G (((p18 <= 0) OR (p34 <= 0) OR (p46 <= 0) OR (p49 <= 0) OR ((p89 <= 0) AND (p92 <= 0)))))) : NOT(A (F (A (G (((1 <= p17) AND (1 <= p19))))))) : A (G (E (F (A (G (((1 <= p69) AND (1 <= p90)))))))) : (NOT(E (X (E (F (((1 <= p16) AND (1 <= p60))))))) AND (((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0)) OR E (X (A (F (((1 <= p12) AND (1 <= p58) AND (1 <= p103)))))))) : NOT(A (((((1 <= p29) AND (1 <= p39) AND (1 <= p43) AND (1 <= p55) AND (1 <= p72) AND (1 <= p86)) OR (p7 <= 0) OR (p24 <= 0) OR (p31 <= 0) OR (p74 <= 0) OR (p106 <= 0)) U (((1 <= p105) AND (1 <= p0) AND (1 <= p81)) OR (1 <= p85))))) : NOT(E ((((p12 <= 0) OR (p58 <= 0) OR (p103 <= 0) OR (p2 <= 0)) U A (G (((1 <= p61) AND (1 <= p64))))))) : E (G (A (F (((p69 <= 0) OR (p90 <= 0)))))) : E (F ((A (X (((1 <= p15) AND (1 <= p99)))) AND E (F (((p1 <= 0) OR (p91 <= 0))))))) : (A (F (E (G ((p89 <= 0))))) AND ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))) : E ((((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0) OR (p9 <= 0) OR (p23 <= 0) OR (p33 <= 0) OR (p57 <= 0) OR (p108 <= 0) OR (p12 <= 0) OR (p58 <= 0) OR (p103 <= 0) OR (p17 <= 0) OR (p19 <= 0)) U A (G (((1 <= p82) OR ((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))))) : E (F (A (G (((p4 <= 0) AND ((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))))))) : E (F ((NOT(E (F (((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80))))) AND ((p2 <= 0) OR ((1 <= p46) AND (1 <= p49) AND (((1 <= p50) AND (1 <= p88)) OR ((1 <= p61) AND (1 <= p64)))))))) : (A (F (A (X (((1 <= p105) AND (1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93)))))) OR (((A (X (((1 <= p66) AND (1 <= p79)))) AND E (F (((1 <= p50) AND (1 <= p88) AND (1 <= p66) AND (1 <= p79))))) AND ((((p2 <= 0) OR (p107 <= 0)) OR NOT(A (F (((1 <= p9) AND (1 <= p23) AND (1 <= p33) AND (1 <= p57) AND (1 <= p108)))))) OR ((1 <= p15) AND (1 <= p99)))) AND ((p105 <= 0) OR ((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p1) AND (1 <= p91))))) : A (((1 <= p2) U (A (X (((1 <= p38) AND (1 <= p67) AND (1 <= p95)))) OR E (F (((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109))))))) : A (G (A (F (A (G ((1 <= p3)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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 (((p82 <= 0) OR (p2 <= 0)))) OR (E (X (((p62 <= 0) OR (p65 <= 0)))) AND E (F (((1 <= p92) AND (1 <= p16) AND (1 <= p60)))))) AND (E ((((p69 <= 0) OR (p90 <= 0)) U ((1 <= p70) AND (1 <= p83) AND (1 <= p38) AND (1 <= p67) AND (1 <= p95)))) OR (E (G (((1 <= p2) OR ((1 <= p37) AND (1 <= p87))))) AND E (G (((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND (1 <= p1) AND (1 <= p91)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p2) OR ((1 <= p37) AND (1 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p2) OR ((1 <= p37) AND (1 <= p87)))))
lola: processed formula length: 51
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p2 <= 0) AND ((p37 <= 0) OR (p87 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p92) AND (1 <= p16) AND (1 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p92) AND (1 <= p16) AND (1 <= p60))))
lola: processed formula length: 50
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p92) AND (1 <= p16) AND (1 <= p60))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 47 markings, 46 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p69 <= 0) OR (p90 <= 0)) U ((1 <= p70) AND (1 <= p83) AND (1 <= p38) AND (1 <= p67) AND (1 <= p95))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p69 <= 0) OR (p90 <= 0)) U ((1 <= p70) AND (1 <= p83) AND (1 <= p38) AND (1 <= p67) AND (1 <= p95))))
lola: processed formula length: 108
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p70) AND (1 <= p83) AND (1 <= p38) AND (1 <= p67) AND (1 <= p95))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 1618 markings, 5096 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (((p16 <= 0) OR (p60 <= 0)))))) AND (((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0)) OR E (X (A (F (((1 <= p12) AND (1 <= p58) AND (1 <= p103))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0))
lola: processed formula length: 72
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((p16 <= 0) OR (p60 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:624
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: ((1 <= p16) AND (1 <= p60))
lola: processed formula length: 27
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: formula 0: ((1 <= p16) AND (1 <= p60))
lola: state equation task get result unparse finished id 0
lola: The predicate is not invariant from successors.
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: 30 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (((1 <= p15) AND (1 <= p99)))) AND E (F (((p1 <= 0) OR (p91 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((1 <= p15) AND (1 <= p99))) AND EF(((p1 <= 0) OR (p91 <= 0)))))
lola: processed formula length: 72
lola: 39 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: 1173505 markings, 3627281 edges, 234701 markings/sec, 0 secs
lola: 1939716 markings, 6439877 edges, 153242 markings/sec, 5 secs
lola: 2606553 markings, 9036549 edges, 133367 markings/sec, 10 secs
lola: 3335163 markings, 11994627 edges, 145722 markings/sec, 15 secs
lola: 4119948 markings, 15291829 edges, 156957 markings/sec, 20 secs
lola: 4884227 markings, 18604843 edges, 152856 markings/sec, 25 secs
lola: 5620194 markings, 21871618 edges, 147193 markings/sec, 30 secs
lola: 6306980 markings, 24987597 edges, 137357 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 6306980 markings, 24987597 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X (((1 <= p105) AND (1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93)))))) OR (A (X (((1 <= p66) AND (1 <= p79)))) AND (E (F (((1 <= p50) AND (1 <= p88) AND (1 <= p66) AND (1 <= p79)))) AND ((((p2 <= 0) OR (p107 <= 0)) OR (E (G (((p9 <= 0) OR (p23 <= 0) OR (p33 <= 0) OR (p57 <= 0) OR (p108 <= 0)))) OR ((1 <= p15) AND (1 <= p99)))) AND ((p105 <= 0) OR ((1 <= p35) AND (1 <= p47... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p15) AND (1 <= p99))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15) AND (1 <= p99))
lola: processed formula length: 27
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2 <= 0) OR (p107 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2 <= 0) OR (p107 <= 0))
lola: processed formula length: 27
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p105 <= 0) OR ((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p1) AND (1 <= p91)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p105 <= 0) OR ((1 <= p35) AND (1 <= p47) AND (1 <= p53) AND (1 <= p68) AND (1 <= p96)) OR ((1 <= p1) AND (1 <= p91)))
lola: processed formula length: 121
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p50) AND (1 <= p88) AND (1 <= p66) AND (1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p50) AND (1 <= p88) AND (1 <= p66) AND (1 <= p79))))
lola: processed formula length: 65
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p50) AND (1 <= p88) AND (1 <= p66) AND (1 <= p79))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p66) AND (1 <= p79))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p66) AND (1 <= p79)))
lola: processed formula length: 31
lola: 37 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 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p105) AND (1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(AX(((1 <= p105) AND (1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93))))
lola: processed formula length: 81
lola: 38 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: 87 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p2) U (A (X (((1 <= p38) AND (1 <= p67) AND (1 <= p95)))) OR E (F (((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((1 <= p2) U (AX(((1 <= p38) AND (1 <= p67) AND (1 <= p95))) OR EF(((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109)))))
lola: processed formula length: 129
lola: 39 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p18) AND (1 <= p34) AND (1 <= p46) AND (1 <= p49) AND ((1 <= p89) OR (1 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p18) AND (1 <= p34) AND (1 <= p46) AND (1 <= p49) AND ((1 <= p89) OR (1 <= p92)))))
lola: processed formula length: 97
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (G (((1 <= p69) AND (1 <= p90))))))))
lola: ========================================
lola: SUBTASK
lola: checking globally possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:589
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:746
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p69 <= 0) OR (p90 <= 0))
lola: processed formula length: 27
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 <= p69) AND (1 <= p90))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p69 <= 0) OR (p90 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: try reading problem file CTLFireability-6-1.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: state equation 0: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1513060 markings, 4848925 edges, 302612 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 2512501 markings, 8629152 edges, 199888 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 3359925 markings, 12028867 edges, 169485 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 4130364 markings, 15263807 edges, 154088 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 4845982 markings, 18356823 edges, 143124 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 5519070 markings, 21332590 edges, 134618 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 6158700 markings, 24218820 edges, 127926 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6774508 markings, 27048761 edges, 123162 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 7367576 markings, 29817518 edges, 118614 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7939897 markings, 32520132 edges, 114464 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 8493517 markings, 35182297 edges, 110724 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 9061727 markings, 37921138 edges, 113642 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 9615143 markings, 40636373 edges, 110683 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 10272742 markings, 43909417 edges, 131520 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 10932643 markings, 47240545 edges, 131980 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 11614977 markings, 50734864 edges, 136467 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 12277916 markings, 54137366 edges, 132588 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 12944084 markings, 57599330 edges, 133234 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 13592958 markings, 60919095 edges, 129775 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 14274194 markings, 64467774 edges, 136247 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 15015162 markings, 68430184 edges, 148194 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 15760918 markings, 72582686 edges, 149151 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 16192195 markings, 76266144 edges, 86255 markings/sec, 110 secs
lola: sara is running 115 secs || sara is running 115 secs || 16244395 markings, 78799217 edges, 10440 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 16305926 markings, 81356063 edges, 12306 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 16384038 markings, 83930265 edges, 15622 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 16477681 markings, 86565665 edges, 18729 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 16549304 markings, 88353258 edges, 14325 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 16638019 markings, 90331928 edges, 17743 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 16735417 markings, 92348644 edges, 19480 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 16894079 markings, 95164057 edges, 31732 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 17088230 markings, 98078026 edges, 38830 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not always possibly invariant.
lola: 17299248 markings, 100227768 edges
lola: ========================================
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p4 <= 0) AND ((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p4) OR ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80)))
lola: processed formula length: 73
lola: 40 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k: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 ((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p4) OR ((1 <= p36) AND (1 <= p48) AND (1 <= p54) AND (1 <= p80)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 1868069 markings, 4522675 edges, 373614 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 3415400 markings, 8895034 edges, 309466 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 4970416 markings, 13541544 edges, 311003 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 6468011 markings, 18382529 edges, 299519 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 8100314 markings, 23609637 edges, 326461 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 8805263 markings, 27768889 edges, 140990 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 8988163 markings, 30896317 edges, 36580 markings/sec, 30 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 9030919 markings, 31396593 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p69 <= 0) OR (p90 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AF(((p69 <= 0) OR (p90 <= 0))))
lola: processed formula length: 35
lola: 38 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: 93 markings, 181 edges
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p12) AND (1 <= p58) AND (1 <= p103) AND (1 <= p2)) R E (F (((p61 <= 0) OR (p64 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: processed formula: A(((1 <= p12) AND (1 <= p58) AND (1 <= p103) AND (1 <= p2)) R EF(((p61 <= 0) OR (p64 <= 0))))
lola: processed formula length: 94
lola: 38 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: 1211284 markings, 5107841 edges, 242257 markings/sec, 0 secs
lola: 2133992 markings, 9586659 edges, 184542 markings/sec, 5 secs
lola: 2943526 markings, 13717455 edges, 161907 markings/sec, 10 secs
lola: 3744495 markings, 17936687 edges, 160194 markings/sec, 15 secs
lola: 4515263 markings, 22126028 edges, 154154 markings/sec, 20 secs
lola: 5283996 markings, 26403959 edges, 153747 markings/sec, 25 secs
lola: 6063965 markings, 30810407 edges, 155994 markings/sec, 30 secs
lola: 6823111 markings, 35193493 edges, 151829 markings/sec, 35 secs
lola: 7561621 markings, 39500497 edges, 147702 markings/sec, 40 secs
lola: 8067031 markings, 42483005 edges, 101082 markings/sec, 45 secs
lola: 8533200 markings, 45258292 edges, 93234 markings/sec, 50 secs
lola: 8983843 markings, 47959989 edges, 90129 markings/sec, 55 secs
lola: 9564201 markings, 51478006 edges, 116072 markings/sec, 60 secs
lola: 10203734 markings, 55367796 edges, 127907 markings/sec, 65 secs
lola: 10860221 markings, 59387071 edges, 131297 markings/sec, 70 secs
lola: 11525242 markings, 63485133 edges, 133004 markings/sec, 75 secs
lola: 12178184 markings, 67538213 edges, 130588 markings/sec, 80 secs
lola: 12834558 markings, 71603684 edges, 131275 markings/sec, 85 secs
lola: 13477295 markings, 75605036 edges, 128547 markings/sec, 90 secs
lola: 14122466 markings, 79627316 edges, 129034 markings/sec, 95 secs
lola: 14766672 markings, 83646849 edges, 128841 markings/sec, 100 secs
lola: 15420184 markings, 87772738 edges, 130702 markings/sec, 105 secs
lola: 16078136 markings, 92029850 edges, 131590 markings/sec, 110 secs
lola: 16737735 markings, 96463963 edges, 131920 markings/sec, 115 secs
lola: 17311903 markings, 101019438 edges, 114834 markings/sec, 120 secs
lola: 17333640 markings, 103648539 edges, 4347 markings/sec, 125 secs
lola: 17345505 markings, 106154256 edges, 2373 markings/sec, 130 secs
lola: 17358397 markings, 108718569 edges, 2578 markings/sec, 135 secs
lola: 17370490 markings, 111313867 edges, 2419 markings/sec, 140 secs
lola: 17380298 markings, 113952608 edges, 1962 markings/sec, 145 secs
lola: 17388443 markings, 116669047 edges, 1629 markings/sec, 150 secs
lola: 17394783 markings, 119476127 edges, 1268 markings/sec, 155 secs
lola: 17399985 markings, 122398303 edges, 1040 markings/sec, 160 secs
lola: 17403372 markings, 125516610 edges, 677 markings/sec, 165 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 17403840 markings, 126909405 edges
lola: ========================================
lola: subprocess 10 will run for 525 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0)))) AND ((p2 <= 0) OR ((1 <= p46) AND (1 <= p49) AND (((1 <= p50) AND (1 <= p88)) OR ((1 <= p61) AND (1 <= p64))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG(((p36 <= 0) OR (p48 <= 0) OR (p54 <= 0) OR (p80 <= 0))) AND ((p2 <= 0) OR ((1 <= p46) AND (1 <= p49) AND (((1 <= p50) AND (1 <= p88)) OR ((1 <= p61) AND (1 <= p64)))))))
lola: processed formula length: 181
lola: 38 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: 1142930 markings, 5758983 edges, 228586 markings/sec, 0 secs
lola: 2068828 markings, 10978349 edges, 185180 markings/sec, 5 secs
lola: 2914450 markings, 15959253 edges, 169124 markings/sec, 10 secs
lola: 3700330 markings, 20711148 edges, 157176 markings/sec, 15 secs
lola: 4461271 markings, 25438913 edges, 152188 markings/sec, 20 secs
lola: 5200397 markings, 30093706 edges, 147825 markings/sec, 25 secs
lola: 5918250 markings, 34700773 edges, 143571 markings/sec, 30 secs
lola: 6615425 markings, 39225011 edges, 139435 markings/sec, 35 secs
lola: 7293471 markings, 43682255 edges, 135609 markings/sec, 40 secs
lola: 7960799 markings, 48112982 edges, 133466 markings/sec, 45 secs
lola: 8608620 markings, 52453293 edges, 129564 markings/sec, 50 secs
lola: 9244943 markings, 56779238 edges, 127265 markings/sec, 55 secs
lola: 9877877 markings, 61085763 edges, 126587 markings/sec, 60 secs
lola: 10502758 markings, 65368711 edges, 124976 markings/sec, 65 secs
lola: 11117615 markings, 69622654 edges, 122971 markings/sec, 70 secs
lola: 11725869 markings, 73867941 edges, 121651 markings/sec, 75 secs
lola: 12324609 markings, 78082141 edges, 119748 markings/sec, 80 secs
lola: 12928506 markings, 82332830 edges, 120779 markings/sec, 85 secs
lola: 13530867 markings, 86592978 edges, 120472 markings/sec, 90 secs
lola: 14143816 markings, 90916745 edges, 122590 markings/sec, 95 secs
lola: 14751703 markings, 95207514 edges, 121577 markings/sec, 100 secs
lola: 15359065 markings, 99545733 edges, 121472 markings/sec, 105 secs
lola: 15974628 markings, 104041267 edges, 123113 markings/sec, 110 secs
lola: 16597080 markings, 108685689 edges, 124490 markings/sec, 115 secs
lola: 17225455 markings, 113594846 edges, 125675 markings/sec, 120 secs
lola: 17392513 markings, 117042826 edges, 33412 markings/sec, 125 secs
lola: 17396152 markings, 119631303 edges, 728 markings/sec, 130 secs
lola: 17399462 markings, 122206465 edges, 662 markings/sec, 135 secs
lola: 17402561 markings, 124826217 edges, 620 markings/sec, 140 secs
lola: 17403973 markings, 127499426 edges, 282 markings/sec, 145 secs
lola: 17405004 markings, 130251724 edges, 206 markings/sec, 150 secs
lola: 17405542 markings, 133085195 edges, 108 markings/sec, 155 secs
lola: 17405833 markings, 135984845 edges, 58 markings/sec, 160 secs
lola: 17405974 markings, 139023993 edges, 28 markings/sec, 165 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17406024 markings, 141583814 edges
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (A (G ((1 <= p3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG(AF(AG((1 <= p3))))
lola: processed formula length: 21
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 87 markings, 182 edges
lola: ========================================
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0) OR (p9 <= 0) OR (p23 <= 0) OR (p33 <= 0) OR (p57 <= 0) OR (p108 <= 0) OR (p12 <= 0) OR (p58 <= 0) OR (p103 <= 0) OR (p17 <= 0) OR (p19 <= 0)) U A (G (((1 <= p82) OR ((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(((p35 <= 0) OR (p47 <= 0) OR (p53 <= 0) OR (p68 <= 0) OR (p96 <= 0) OR (p9 <= 0) OR (p23 <= 0) OR (p33 <= 0) OR (p57 <= 0) OR (p108 <= 0) OR (p12 <= 0) OR (p58 <= 0) OR (p103 <= 0) OR (p17 <= 0) OR (p19 <= 0)) U AG(((1 <= p82) OR ((1 <= p28) AND (1 <= p42) AND (1 <= p71) AND (1 <= p93)))))
lola: processed formula length: 307
lola: 38 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: 1352736 markings, 5838135 edges, 270547 markings/sec, 0 secs
lola: 2388120 markings, 10942399 edges, 207077 markings/sec, 5 secs
lola: 3316527 markings, 15759663 edges, 185681 markings/sec, 10 secs
lola: 4192740 markings, 20462058 edges, 175243 markings/sec, 15 secs
lola: 5026704 markings, 25064535 edges, 166793 markings/sec, 20 secs
lola: 5833201 markings, 29594154 edges, 161299 markings/sec, 25 secs
lola: 6616341 markings, 34074003 edges, 156628 markings/sec, 30 secs
lola: 7363097 markings, 38405375 edges, 149351 markings/sec, 35 secs
lola: 8095728 markings, 42712883 edges, 146526 markings/sec, 40 secs
lola: 8808124 markings, 46963862 edges, 142479 markings/sec, 45 secs
lola: 9508222 markings, 51185388 edges, 140020 markings/sec, 50 secs
lola: 10196621 markings, 55372504 edges, 137680 markings/sec, 55 secs
lola: 10874070 markings, 59537385 edges, 135490 markings/sec, 60 secs
lola: 11539720 markings, 63682157 edges, 133130 markings/sec, 65 secs
lola: 12191645 markings, 67786997 edges, 130385 markings/sec, 70 secs
lola: 12847903 markings, 71927522 edges, 131252 markings/sec, 75 secs
lola: 13505008 markings, 76092620 edges, 131421 markings/sec, 80 secs
lola: 14171550 markings, 80329890 edges, 133308 markings/sec, 85 secs
lola: 14838348 markings, 84576375 edges, 133360 markings/sec, 90 secs
lola: 15474689 markings, 88703806 edges, 127268 markings/sec, 95 secs
lola: 16136203 markings, 93140910 edges, 132303 markings/sec, 100 secs
lola: 16795453 markings, 97809901 edges, 131850 markings/sec, 105 secs
lola: 17382792 markings, 102656816 edges, 117468 markings/sec, 110 secs
lola: 17394571 markings, 105452577 edges, 2356 markings/sec, 115 secs
lola: 17397823 markings, 108090288 edges, 650 markings/sec, 120 secs
lola: 17400814 markings, 110723363 edges, 598 markings/sec, 125 secs
lola: 17403273 markings, 113408899 edges, 492 markings/sec, 130 secs
lola: 17404579 markings, 116160272 edges, 261 markings/sec, 135 secs
lola: 17405289 markings, 118981056 edges, 142 markings/sec, 140 secs
lola: 17405693 markings, 121879420 edges, 81 markings/sec, 145 secs
lola: 17405925 markings, 124877957 edges, 46 markings/sec, 150 secs
lola: 17406021 markings, 128128843 edges, 19 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 17406024 markings, 128888872 edges
lola: ========================================
lola: subprocess 13 will run for 940 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p17 <= 0) OR (p19 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: ((p17 <= 0) OR (p19 <= 0))
lola: processed formula length: 27
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p17) AND (1 <= p19))
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 /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 87 markings, 87 edges
lola: ========================================
lola: subprocess 14 will run for 1410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((p29 <= 0) OR (p39 <= 0) OR (p43 <= 0) OR (p55 <= 0) OR (p72 <= 0) OR (p86 <= 0)) AND (1 <= p7) AND (1 <= p24) AND (1 <= p31) AND (1 <= p74) AND (1 <= p106)) R (((p105 <= 0) OR (p0 <= 0) OR (p81 <= 0)) AND (p85 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((((p29 <= 0) OR (p39 <= 0) OR (p43 <= 0) OR (p55 <= 0) OR (p72 <= 0) OR (p86 <= 0)) AND (1 <= p7) AND (1 <= p24) AND (1 <= p31) AND (1 <= p74) AND (1 <= p106)) R (((p105 <= 0) OR (p0 <= 0) OR (p81 <= 0)) AND (p85 <= 0))))
lola: processed formula length: 232
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p105) AND (1 <= p0) AND (1 <= p81)) OR (1 <= p85))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 123 markings, 128 edges
lola: ========================================
lola: subprocess 15 will run for 2820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((p89 <= 0))))) AND ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))
lola: processed formula length: 257
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 17 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: 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 (F (E (G ((p89 <= 0))))) AND ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p13 <= 0) OR ((1 <= p0) AND (1 <= p81)) OR ((1 <= p11) AND (1 <= p57) AND (1 <= p76) AND (1 <= p109) AND ((p10 <= 0) OR (p13 <= 0) OR (p5 <= 0) OR (p20 <= 0) OR (p21 <= 0) OR (p27 <= 0) OR (p40 <= 0) OR (p51 <= 0) OR (p78 <= 0))))
lola: processed formula length: 257
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 17 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: ========================================
lola: ...considering subproblem: A (F (E (G ((p89 <= 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((p89 <= 0)))
lola: processed formula length: 18
lola: 38 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: 1426 markings, 3782 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes yes yes no no no no no yes no
lola:
preliminary result: no yes yes no no no yes yes yes no no no no no yes no
lola: ========================================
lola: memory consumption: 44172 KB
lola: time consumption: 750 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: 16118372 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16118120 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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, 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 r184-oct2-158987928400372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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