Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r172-smll-158987827800404.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Referendum-PT-0015, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-158987827800404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 9.1K Apr 12 08:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 08:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 11 09:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 11 09:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 10 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 10 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 9 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 9 21:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 18K Mar 24 05:38 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591439346942

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 10:29:09] [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-06 10:29:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 10:29:09] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2020-06-06 10:29:09] [INFO ] Transformed 46 places.
[2020-06-06 10:29:09] [INFO ] Transformed 31 transitions.
[2020-06-06 10:29:09] [INFO ] Found NUPN structural information;
[2020-06-06 10:29:09] [INFO ] Parsed PT model containing 46 places and 31 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Finished random walk after 28 steps, including 1 resets, run visited all 31 properties in 3 ms. (steps per millisecond=9 )
[2020-06-06 10:29:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-06 10:29:10] [INFO ] Flatten gal took : 40 ms
[2020-06-06 10:29:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-06 10:29:10] [INFO ] Flatten gal took : 14 ms
FORMULA Referendum-PT-0015-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-06 10:29:10] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2020-06-06 10:29:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Referendum-PT-0015 @ 3570 seconds

FORMULA Referendum-PT-0015-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Referendum-PT-0015-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-PT-0015-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2755
rslt: Output for CTLFireability @ Referendum-PT-0015

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))",
"processed_size": 267,
"rewrites": 36
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 16
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 15,
"aneg": 0,
"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": "EX((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))))",
"processed_size": 247,
"rewrites": 35
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 15,
"adisj": 1,
"aneg": 1,
"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": "(((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)))",
"processed_size": 243,
"rewrites": 38
},
"result":
{
"edges": 65535,
"markings": 65536,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 15,
"problems": 15
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 15,
"adisj": 1,
"aneg": 0,
"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": "EX((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))",
"processed_size": 247,
"rewrites": 35
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 15,
"adisj": 2,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "EX((EG((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)))) AND ((p0 <= 0))))",
"processed_size": 269,
"rewrites": 36
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 143489070,
"markings": 14348907,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 312
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "EF((EX(((p15 <= 0))) AND EG(((p11 <= 0)))))",
"processed_size": 43,
"rewrites": 37
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 22,
"markings": 17,
"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": 344
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 382
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p9))",
"processed_size": 11,
"rewrites": 37
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 430
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p14))",
"processed_size": 12,
"rewrites": 37
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 491
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 16,
"aneg": 0,
"comp": 31,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 31,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))))))",
"processed_size": 513,
"rewrites": 35
},
"result":
{
"edges": 142997551,
"markings": 14316140,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 1
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 550
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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(EF(((1 <= p10)))))",
"processed_size": 24,
"rewrites": 37
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 157838013,
"markings": 14348908,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 16,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AF(((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))) AND AG((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))))))",
"processed_size": 501,
"rewrites": 36
},
"net":
{
"conflict_clusters": 46,
"singleton_clusters": 0
},
"result":
{
"edges": 143521841,
"markings": 14348908,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 975
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p9))) OR ((((1 <= p5)) OR ((1 <= p15))) AND ((p9 <= 0)))))",
"processed_size": 73,
"rewrites": 44
},
"result":
{
"edges": 19,
"markings": 19,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p9 <= 0))",
"processed_size": 11,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2926
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "(((p6 <= 0)) AND ((p2 <= 0)))",
"processed_size": 29,
"rewrites": 38
},
"result":
{
"edges": 55269871,
"markings": 6377296,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p0 <= 0))",
"processed_size": 11,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "((p0 <= 0))",
"processed_size": 11,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))",
"processed_size": 267,
"rewrites": 35
},
"result":
{
"edges": 142997551,
"markings": 14316140,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 31
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 16
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 80220,
"runtime": 815.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(X(**)) OR (A(G(**)) AND A(F(E(X(**)))))) : E(X(E(X(A(F(**)))))) : (A(G(*)) OR (E(X(**)) AND E(F(A(G(**)))))) : (** OR E(G(**))) : A(F((** AND A(G(*))))) : E(G(**)) : (E(X((E(G(**)) AND **))) AND E(X(**))) : A(G(E(F(**)))) : A(F(E(G(E(F(**)))))) : E(F((E(G(*)) AND *))) : E(G(E(F(**)))) : A(G(E(F(**)))) : E(F((E(X(*)) AND E(G(*))))) : (E(G(E(F(*)))) AND (** OR (A(X(*)) OR (** OR **)))) : (** AND E(F(A(G(**)))))"
},
"net":
{
"arcs": 76,
"conflict_clusters": 46,
"places": 46,
"places_significant": 31,
"singleton_clusters": 0,
"transitions": 31
},
"result":
{
"preliminary_value": "no no no no yes no no no no yes no no yes yes no ",
"value": "no no no no yes no no no no yes no no yes 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: 77/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 46
lola: finding significant places
lola: 46 places, 31 transitions, 31 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: A ((A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0))))) U E (X ((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))))))) : E (X (E (X (A (F (((1 <= p0)))))))) : (NOT(E (F (((1 <= p0))))) OR (E (X ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) AND E (F (A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))))))) : (((p0 <= 0)) OR E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))) : A (F (((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))) AND NOT(E (F ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))))))) : E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)))))) : (E (X ((E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) AND ((p0 <= 0))))) AND E (X ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)))))) : A (G (E (F (((1 <= p9)))))) : A (F (E (G (E (F (((1 <= p10)))))))) : NOT(A (G ((A (F (((1 <= p9)))) OR ((((1 <= p5)) OR ((1 <= p15))) AND ((p9 <= 0))))))) : E (G (E (F (((1 <= p14)))))) : A (G (E (F (((1 <= p14)))))) : NOT(A (G ((A (X (((1 <= p15)))) OR A (F (((1 <= p11)))))))) : (NOT(A (F (A (G (((1 <= p11))))))) AND (((((p15 <= 0)) OR NOT(E (X (((1 <= p13)))))) OR ((1 <= p2))) OR (((p3 <= 0)) AND ((p1 <= 0))))) : (((p9 <= 0)) AND E (F (A (G ((((1 <= p6)) OR ((1 <= p2))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:479
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: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: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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))))) OR (A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))
lola: processed formula length: 267
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p0 <= 0)))
lola: SUBRESULT
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))))
lola: processed formula length: 247
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X (A (F (((1 <= p0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(EX(AF(((1 <= p0)))))
lola: processed formula length: 23
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 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: 345 markings, 358 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((p0 <= 0)))) OR (E (X ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) AND E (F (A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G (((p0 <= 0))))
lola: processed formula length: 19
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)))))))
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: (((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)))
lola: processed formula length: 243
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: 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 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 0
lola: formula 0: (((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 15 literals and 15 conjunctive subformulas
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 15 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: write sara problem file to CTLFireability-3-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-1.sara.
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 65536 markings, 65535 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X ((E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) AND ((p0 <= 0))))) AND E (X ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))
lola: processed formula length: 247
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))) AND ((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX((EG((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)))) AND ((p0 <= 0))))
lola: processed formula length: 269
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 791979 markings, 6312391 edges, 158396 markings/sec, 0 secs
lola: 1511761 markings, 12894151 edges, 143956 markings/sec, 5 secs
lola: 2251797 markings, 19369055 edges, 148007 markings/sec, 10 secs
lola: 2917261 markings, 25611628 edges, 133093 markings/sec, 15 secs
lola: 3533417 markings, 31492687 edges, 123231 markings/sec, 20 secs
lola: 4164320 markings, 37805216 edges, 126181 markings/sec, 25 secs
lola: 4696661 markings, 43541217 edges, 106468 markings/sec, 30 secs
lola: 5357202 markings, 49461393 edges, 132108 markings/sec, 35 secs
lola: 5975050 markings, 55251850 edges, 123570 markings/sec, 40 secs
lola: 6578017 markings, 60999104 edges, 120593 markings/sec, 45 secs
lola: 7176360 markings, 66773180 edges, 119669 markings/sec, 50 secs
lola: 7705680 markings, 72332652 edges, 105864 markings/sec, 55 secs
lola: 8255682 markings, 77901228 edges, 110000 markings/sec, 60 secs
lola: 8849599 markings, 83590207 edges, 118783 markings/sec, 65 secs
lola: 9422331 markings, 89263939 edges, 114546 markings/sec, 70 secs
lola: 9949873 markings, 94903916 edges, 105508 markings/sec, 75 secs
lola: 10524321 markings, 100756513 edges, 114890 markings/sec, 80 secs
lola: 11047813 markings, 106059243 edges, 104698 markings/sec, 85 secs
lola: 11532355 markings, 111508453 edges, 96908 markings/sec, 90 secs
lola: 12081961 markings, 117101985 edges, 109921 markings/sec, 95 secs
lola: 12569201 markings, 122507237 edges, 97448 markings/sec, 100 secs
lola: 13063178 markings, 128013740 edges, 98795 markings/sec, 105 secs
lola: 13546436 markings, 133513125 edges, 96652 markings/sec, 110 secs
lola: 14001683 markings, 138924900 edges, 91049 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348907 markings, 143489070 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (X (((p15 <= 0)))) AND E (G (((p11 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((EX(((p15 <= 0))) AND EG(((p11 <= 0)))))
lola: processed formula length: 43
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 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: 17 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F (((p11 <= 0)))))) AND (((p15 <= 0)) OR (A (X (((p13 <= 0)))) OR (((1 <= p2)) OR (((p3 <= 0)) AND ((p1 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p2)) OR (((p3 <= 0)) AND ((p1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p2)) OR (((p3 <= 0)) AND ((p1 <= 0))))
lola: processed formula length: 46
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 3 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 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p11 <= 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: ((p11 <= 0))
lola: processed formula length: 12
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 /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: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p11 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: Reachability of the predicate is possibly preserved.
lola: 17 markings, 16 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p9))
lola: processed formula length: 11
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p9 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((1 <= p14))
lola: processed formula length: 12
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
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p14 <= 0))
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not live.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0) AND ((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9... (shortened)
lola: processed formula length: 513
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p0 <= 0) OR ((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 721994 markings, 5710240 edges, 144399 markings/sec, 0 secs || sara is running 0 secs
lola: 1359789 markings, 11363265 edges, 127559 markings/sec, 5 secs || sara is running 5 secs
lola: 1977909 markings, 16924000 edges, 123624 markings/sec, 10 secs || sara is running 10 secs
lola: 2568594 markings, 22358624 edges, 118137 markings/sec, 15 secs || sara is running 15 secs
lola: 3157886 markings, 27774478 edges, 117858 markings/sec, 20 secs || sara is running 20 secs
lola: 3713595 markings, 33151261 edges, 111142 markings/sec, 25 secs || sara is running 25 secs
lola: 4237157 markings, 38450931 edges, 104712 markings/sec, 30 secs || sara is running 30 secs
lola: 4711062 markings, 43688676 edges, 94781 markings/sec, 35 secs || sara is running 35 secs
lola: 5321200 markings, 49029362 edges, 122028 markings/sec, 40 secs || sara is running 40 secs
lola: 5865170 markings, 54209863 edges, 108794 markings/sec, 45 secs || sara is running 45 secs
lola: 6432255 markings, 59402437 edges, 113417 markings/sec, 50 secs || sara is running 50 secs
lola: 6958101 markings, 64523511 edges, 105169 markings/sec, 55 secs || sara is running 55 secs
lola: 7460674 markings, 69599061 edges, 100515 markings/sec, 60 secs || sara is running 60 secs
lola: 7907329 markings, 74578421 edges, 89331 markings/sec, 65 secs || sara is running 65 secs
lola: 8468543 markings, 79749594 edges, 112243 markings/sec, 70 secs || sara is running 70 secs
lola: 8998133 markings, 84871609 edges, 105918 markings/sec, 75 secs || sara is running 75 secs
lola: 9433161 markings, 89300850 edges, 87006 markings/sec, 80 secs || sara is running 80 secs
lola: 9906113 markings, 94318467 edges, 94590 markings/sec, 85 secs || sara is running 85 secs
lola: 10399400 markings, 99351729 edges, 98657 markings/sec, 90 secs || sara is running 90 secs
lola: 10900462 markings, 104414515 edges, 100212 markings/sec, 95 secs || sara is running 95 secs
lola: 11363679 markings, 109422437 edges, 92643 markings/sec, 100 secs || sara is running 100 secs
lola: 11857503 markings, 114607718 edges, 98765 markings/sec, 105 secs || sara is running 105 secs
lola: 12337984 markings, 119831769 edges, 96096 markings/sec, 110 secs || sara is running 110 secs
lola: 12806437 markings, 124925485 edges, 93691 markings/sec, 115 secs || sara is running 115 secs
lola: 13236284 markings, 129786748 edges, 85969 markings/sec, 120 secs || sara is running 120 secs
lola: 13664875 markings, 134745757 edges, 85718 markings/sec, 125 secs || sara is running 125 secs
lola: 14065060 markings, 139641510 edges, 80037 markings/sec, 130 secs || sara is running 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 14316140 markings, 142997551 edges
lola: subprocess 9 will run for 550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (E (F (((1 <= p10))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(EF(((1 <= p10)))))
lola: processed formula length: 24
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: ========================================
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: 725414 markings, 6405148 edges, 145083 markings/sec, 0 secs
lola: 1362610 markings, 12661145 edges, 127439 markings/sec, 5 secs
lola: 1957749 markings, 18778794 edges, 119028 markings/sec, 10 secs
lola: 2558345 markings, 24799364 edges, 120119 markings/sec, 15 secs
lola: 3150988 markings, 30812177 edges, 118529 markings/sec, 20 secs
lola: 3699690 markings, 36711994 edges, 109740 markings/sec, 25 secs
lola: 4242669 markings, 42542366 edges, 108596 markings/sec, 30 secs
lola: 4702133 markings, 48273004 edges, 91893 markings/sec, 35 secs
lola: 5293746 markings, 54122577 edges, 118323 markings/sec, 40 secs
lola: 5824753 markings, 59758945 edges, 106201 markings/sec, 45 secs
lola: 6410587 markings, 65618242 edges, 117167 markings/sec, 50 secs
lola: 6959329 markings, 71543659 edges, 109748 markings/sec, 55 secs
lola: 7472975 markings, 77042460 edges, 102729 markings/sec, 60 secs
lola: 7905475 markings, 82476959 edges, 86500 markings/sec, 65 secs
lola: 8466592 markings, 88222784 edges, 112223 markings/sec, 70 secs
lola: 9013014 markings, 94097344 edges, 109284 markings/sec, 75 secs
lola: 9559810 markings, 99967852 edges, 109359 markings/sec, 80 secs
lola: 10019151 markings, 105701389 edges, 91868 markings/sec, 85 secs
lola: 10548011 markings, 111556111 edges, 105772 markings/sec, 90 secs
lola: 11087888 markings, 117389796 edges, 107975 markings/sec, 95 secs
lola: 11543207 markings, 123119651 edges, 91064 markings/sec, 100 secs
lola: 12080356 markings, 128974321 edges, 107430 markings/sec, 105 secs
lola: 12549592 markings, 134767183 edges, 93847 markings/sec, 110 secs
lola: 13070809 markings, 140572205 edges, 104243 markings/sec, 115 secs
lola: 13510918 markings, 146238433 edges, 88022 markings/sec, 120 secs
lola: 13942684 markings, 151930527 edges, 86353 markings/sec, 125 secs
lola: 14330666 markings, 157515902 edges, 77596 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14348908 markings, 157838013 edges
lola: ========================================
lola: subprocess 10 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))) AND A (G ((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0))) AND AG((((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ... (shortened)
lola: processed formula length: 501
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 753596 markings, 5985246 edges, 150719 markings/sec, 0 secs
lola: 1446821 markings, 12244227 edges, 138645 markings/sec, 5 secs
lola: 2144745 markings, 18418081 edges, 139585 markings/sec, 10 secs
lola: 2788825 markings, 24465985 edges, 128816 markings/sec, 15 secs
lola: 3422761 markings, 30481239 edges, 126787 markings/sec, 20 secs
lola: 4041632 markings, 36504401 edges, 123774 markings/sec, 25 secs
lola: 4598985 markings, 42442069 edges, 111471 markings/sec, 30 secs
lola: 5194492 markings, 48045450 edges, 119101 markings/sec, 35 secs
lola: 5787137 markings, 53554601 edges, 118529 markings/sec, 40 secs
lola: 6388491 markings, 59074016 edges, 120271 markings/sec, 45 secs
lola: 6944518 markings, 64489315 edges, 111205 markings/sec, 50 secs
lola: 7477295 markings, 69888247 edges, 106555 markings/sec, 55 secs
lola: 7946751 markings, 75148056 edges, 93891 markings/sec, 60 secs
lola: 8508243 markings, 80279096 edges, 112298 markings/sec, 65 secs
lola: 9060208 markings, 85652952 edges, 110393 markings/sec, 70 secs
lola: 9588670 markings, 91005272 edges, 105692 markings/sec, 75 secs
lola: 10059575 markings, 96244023 edges, 94181 markings/sec, 80 secs
lola: 10603737 markings, 101609404 edges, 108832 markings/sec, 85 secs
lola: 11140556 markings, 107093484 edges, 107364 markings/sec, 90 secs
lola: 11657310 markings, 112718954 edges, 103351 markings/sec, 95 secs
lola: 12183693 markings, 118247968 edges, 105277 markings/sec, 100 secs
lola: 12695147 markings, 123889952 edges, 102291 markings/sec, 105 secs
lola: 13197173 markings, 129513477 edges, 100405 markings/sec, 110 secs
lola: 13684116 markings, 135107795 edges, 97389 markings/sec, 115 secs
lola: 14135762 markings, 140627714 edges, 90329 markings/sec, 120 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14348908 markings, 143521841 edges
lola: ========================================
lola: subprocess 11 will run for 760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((1 <= p14))))))
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: ((1 <= p14))
lola: processed formula length: 12
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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((1 <= p14))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-1.sara
lola: lola: state equation task get result started, id 0
state equation: calling and running sara
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p14 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-1.sara.
sara: place or transition ordering is non-deterministic
sara: try reading problem file CTLFireability-11-0.sara.

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 || 861451 markings, 6944623 edges, 172290 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1587411 markings, 13723721 edges, 145192 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2365485 markings, 20423092 edges, 155615 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3063376 markings, 26946717 edges, 139578 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3735599 markings, 33431466 edges, 134445 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4360394 markings, 39841987 edges, 124959 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 4984339 markings, 46206217 edges, 124789 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 5695127 markings, 52591497 edges, 142158 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 6370667 markings, 58883912 edges, 135108 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 7002617 markings, 65090850 edges, 126390 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 7606952 markings, 71252080 edges, 120867 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 8190797 markings, 77325230 edges, 116769 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 8838944 markings, 83503652 edges, 129629 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 9456426 markings, 89649928 edges, 123496 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 10015473 markings, 95681985 edges, 111809 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 10628806 markings, 101807119 edges, 122667 markings/sec, 75 secs
lola: sara is running 80 secs || sara is running 80 secs || 11219917 markings, 107913142 edges, 118222 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 11782069 markings, 113961659 edges, 112430 markings/sec, 85 secs
lola: sara is running 90 secs || sara is running 90 secs || 12347609 markings, 120045600 edges, 113108 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 12900145 markings, 126096346 edges, 110507 markings/sec, 95 secs
lola: sara is running 100 secs || sara is running 100 secs || 13428643 markings, 132105888 edges, 105700 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 13933935 markings, 138076734 edges, 101058 markings/sec, 105 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: Reachability of the predicate is not possibly preserved.
lola: 14348908 markings, 143489071 edges
lola: ========================================
lola: subprocess 12 will run for 975 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G (((p9 <= 0)))) AND ((((p5 <= 0)) AND ((p15 <= 0))) OR ((1 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:661
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:674
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p9))) OR ((((1 <= p5)) OR ((1 <= p15))) AND ((p9 <= 0)))))
lola: processed formula length: 73
lola: 44 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The existential single path CTL formula holds.
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 1463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p9 <= 0)) AND E (F (A (G ((((1 <= p6)) OR ((1 <= p2))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p9 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p9 <= 0))
lola: processed formula length: 11
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 2926 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((((1 <= p6)) OR ((1 <= p2)))))))
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: (((p6 <= 0)) AND ((p2 <= 0)))
lola: processed formula length: 29
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: 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 <= p6)) OR ((1 <= p2)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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: (((p6 <= 0)) AND ((p2 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-14-0.sara
lola: state equation: write sara problem file to CTLFireability-14-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

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

lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: sara is running 0 secs || sara is running 0 secs || 864849 markings, 6980470 edges, 172970 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 1577204 markings, 13603208 edges, 142471 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 2401817 markings, 20262309 edges, 164923 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 3093634 markings, 26585338 edges, 138363 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 3906093 markings, 33316255 edges, 162492 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 4620946 markings, 39722306 edges, 142971 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 5385993 markings, 46213457 edges, 153009 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 6099219 markings, 52437247 edges, 142645 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 6377296 markings, 55269871 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 2883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0)) OR E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0))
lola: processed formula length: 11
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0)) OR E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0))
lola: processed formula length: 11
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p1)) OR ((1 <= p2)) OR ((1 <= p3)) OR ((1 <= p4)) OR ((1 <= p5)) OR ((1 <= p6)) OR ((1 <= p7)) OR ((1 <= p8)) OR ((1 <= p9)) OR ((1 <= p10)) OR ((1 <= p11)) OR ((1 <= p12)) OR ((1 <= p13)) OR ((1 <= p14)) OR ((1 <= p15)) OR ((1 <= p0)))))
lola: processed formula length: 267
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p1 <= 0)) AND ((p2 <= 0)) AND ((p3 <= 0)) AND ((p4 <= 0)) AND ((p5 <= 0)) AND ((p6 <= 0)) AND ((p7 <= 0)) AND ((p8 <= 0)) AND ((p9 <= 0)) AND ((p10 <= 0)) AND ((p11 <= 0)) AND ((p12 <= 0)) AND ((p13 <= 0)) AND ((p14 <= 0)) AND ((p15 <= 0)) AND ((p0 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-16-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: 761878 markings, 6027730 edges, 152376 markings/sec, 0 secs || sara is running 0 secs
lola: 1428625 markings, 12027414 edges, 133349 markings/sec, 5 secs || sara is running 5 secs
lola: 2096480 markings, 17922426 edges, 133571 markings/sec, 10 secs || sara is running 10 secs
lola: 2707052 markings, 23691827 edges, 122114 markings/sec, 15 secs || sara is running 15 secs
lola: 3324593 markings, 29477959 edges, 123508 markings/sec, 20 secs || sara is running 20 secs
lola: 3917816 markings, 35216910 edges, 118645 markings/sec, 25 secs || sara is running 25 secs
lola: 4467951 markings, 40914919 edges, 110027 markings/sec, 30 secs || sara is running 30 secs
lola: 5041940 markings, 46592403 edges, 114798 markings/sec, 35 secs || sara is running 35 secs
lola: 5669199 markings, 52249967 edges, 125452 markings/sec, 40 secs || sara is running 40 secs
lola: 6274828 markings, 57862586 edges, 121126 markings/sec, 45 secs || sara is running 45 secs
lola: 6851729 markings, 63430495 edges, 115380 markings/sec, 50 secs || sara is running 50 secs
lola: 7396410 markings, 68945501 edges, 108936 markings/sec, 55 secs || sara is running 55 secs
lola: 7890734 markings, 74377402 edges, 98865 markings/sec, 60 secs || sara is running 60 secs
lola: 8490485 markings, 79955733 edges, 119950 markings/sec, 65 secs || sara is running 65 secs
lola: 9057286 markings, 85475098 edges, 113360 markings/sec, 70 secs || sara is running 70 secs
lola: 9597793 markings, 90954955 edges, 108101 markings/sec, 75 secs || sara is running 75 secs
lola: 10069926 markings, 96311381 edges, 94427 markings/sec, 80 secs || sara is running 80 secs
lola: 10651174 markings, 101880897 edges, 116250 markings/sec, 85 secs || sara is running 85 secs
lola: 11181447 markings, 107373244 edges, 106055 markings/sec, 90 secs || sara is running 90 secs
lola: 11684778 markings, 112812215 edges, 100666 markings/sec, 95 secs || sara is running 95 secs
lola: 12202750 markings, 118281970 edges, 103594 markings/sec, 100 secs || sara is running 100 secs
lola: 12694596 markings, 123706022 edges, 98369 markings/sec, 105 secs || sara is running 105 secs
lola: 13175250 markings, 129115700 edges, 96131 markings/sec, 110 secs || sara is running 110 secs
lola: 13644659 markings, 134510407 edges, 93882 markings/sec, 115 secs || sara is running 115 secs
lola: 14081674 markings, 139842296 edges, 87403 markings/sec, 120 secs || sara is running 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 14316140 markings, 142997551 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no no no yes no no yes yes no
lola:
preliminary result: no no no no yes no no no no yes no no yes yes no
lola: memory consumption: 80220 KB
lola: time consumption: 815 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0015"
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 Referendum-PT-0015, 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 r172-smll-158987827800404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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