Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871200012.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Philosophers-COL-000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871200012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 9.9K Apr 27 15:14 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 Philosophers-COL-000010-CTLFireability-00
FORMULA_NAME Philosophers-COL-000010-CTLFireability-01
FORMULA_NAME Philosophers-COL-000010-CTLFireability-02
FORMULA_NAME Philosophers-COL-000010-CTLFireability-03
FORMULA_NAME Philosophers-COL-000010-CTLFireability-04
FORMULA_NAME Philosophers-COL-000010-CTLFireability-05
FORMULA_NAME Philosophers-COL-000010-CTLFireability-06
FORMULA_NAME Philosophers-COL-000010-CTLFireability-07
FORMULA_NAME Philosophers-COL-000010-CTLFireability-08
FORMULA_NAME Philosophers-COL-000010-CTLFireability-09
FORMULA_NAME Philosophers-COL-000010-CTLFireability-10
FORMULA_NAME Philosophers-COL-000010-CTLFireability-11
FORMULA_NAME Philosophers-COL-000010-CTLFireability-12
FORMULA_NAME Philosophers-COL-000010-CTLFireability-13
FORMULA_NAME Philosophers-COL-000010-CTLFireability-14
FORMULA_NAME Philosophers-COL-000010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591124239920

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 18:57:21] [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-02 18:57:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 18:57:21] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 18:57:22] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2020-06-02 18:57:22] [INFO ] sort/places :
Philo->think,fork,catch1,catch2,eat,

[2020-06-02 18:57:22] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 14 ms.
[2020-06-02 18:57:22] [INFO ] Computed order based on color domains.
[2020-06-02 18:57:22] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 7 ms.
[2020-06-02 18:57:22] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Finished random walk after 77 steps, including 1 resets, run visited all 15 properties in 5 ms. (steps per millisecond=15 )
[2020-06-02 18:57:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 18:57:22] [INFO ] Flatten gal took : 35 ms
[2020-06-02 18:57:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 18:57:22] [INFO ] Flatten gal took : 16 ms
FORMULA Philosophers-COL-000010-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 18:57:22] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2020-06-02 18:57:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ Philosophers-COL-000010 @ 3570 seconds

FORMULA Philosophers-COL-000010-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for CTLFireability @ Philosophers-COL-000010

{
"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": "Tue Jun 2 18:57:22 2020
",
"timelimit": 3570
},
"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": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))",
"processed_size": 315,
"rewrites": 13
},
"result":
{
"edges": 10,
"markings": 11,
"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"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))",
"processed_size": 147,
"rewrites": 14
},
"result":
{
"edges": 17002,
"markings": 3680,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))",
"processed_size": 147,
"rewrites": 14
},
"result":
{
"edges": 17002,
"markings": 3680,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 10
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))",
"processed_size": 307,
"rewrites": 15
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))",
"processed_size": 307,
"rewrites": 15
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 10
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 11,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))",
"processed_size": 459,
"rewrites": 14
},
"result":
{
"edges": 75940,
"markings": 14103,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 50
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10250,
"problems": 1034
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "AF(EG(((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))",
"processed_size": 155,
"rewrites": 13
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 153,
"markings": 92,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "EF(AG(AF(((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))",
"processed_size": 159,
"rewrites": 14
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 758925,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 11,
"adisj": 11,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "EG(E((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))))",
"processed_size": 624,
"rewrites": 13
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 97,
"markings": 43,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 31,
"adisj": 13,
"aneg": 0,
"comp": 90,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 90,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "E(EF((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))) U (AG((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))) AND ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)) OR (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0))))))",
"processed_size": 1414,
"rewrites": 14
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 628014,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 11,
"aneg": 2,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((F ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))) OR (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))))",
"processed_size": 628,
"rewrites": 21
},
"result":
{
"edges": 100341,
"markings": 41630,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"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": 1188
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 2,
"aneg": 1,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) OR (((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))))",
"processed_size": 641,
"rewrites": 15
},
"result":
{
"edges": 266641,
"markings": 57293,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 20480,
"problems": 2048
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 2,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) OR ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))",
"processed_size": 471,
"rewrites": 15
},
"result":
{
"edges": 360390,
"markings": 59028,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 10250,
"problems": 1025
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 21,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))) OR (((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0))) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))",
"processed_size": 941,
"rewrites": 11
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 2,
"aneg": 0,
"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": 30,
"visible_transitions": 0
},
"processed": "EF((AG(((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))) AND EG((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))",
"processed_size": 473,
"rewrites": 14
},
"net":
{
"conflict_clusters": 11,
"singleton_clusters": 0
},
"result":
{
"edges": 562241,
"markings": 59049,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 123112,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(A(G(A(F(**)))))) : A(F(**)) : A(F(**)) : E(F((E(G(**)) AND **))) : A(F(E(G(**)))) : (A((* R *)) AND A(G(**))) : A(G(**)) : E(G(E((** U **)))) : A(G(A(F(**)))) : A(F(**)) : (E(F(A(G(**)))) OR E(F(A(G(**))))) : E((E(F(**)) U (A(G(**)) AND **))) : A(G(**)) : A(G(A(F(**)))) : (A(G(E(F(**)))) AND (E(F((A(G(**)) AND E(G(**))))) AND **))"
},
"net":
{
"arcs": 160,
"conflict_clusters": 11,
"places": 50,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 50
},
"result":
{
"preliminary_value": "no no no yes no no no yes no yes no no no no no ",
"value": "no no no yes no no no yes no yes no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 100/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: E (F (A (G (A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))))) : A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))) : A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))) : E (F ((E (G ((((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0))))) AND (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))) : A (F (E (G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))) : (NOT(E (((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) U ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND (((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p37)) OR ((1 <= p17) AND (1 <= p38)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32))))))) AND A (G (A (G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))))) : A (G (A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))) : E (G (E (((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))))) : A (G (A (F ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))) : A (F (A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46) OR (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))))))) : E (F ((A (G (((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND (((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))))) OR A (G (((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))))) : E ((E (F ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))) U (A (G ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))))) AND ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)) OR (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0))))))) : A (G (E (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))))) : A (G (E (G (A (F ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))))))) : ((A (G (E (F ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))))))) AND E (F ((A (G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))) AND E (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))))) AND ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))) OR (((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0))) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))
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 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))
lola: processed formula length: 315
lola: 13 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: (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= ... (shortened)
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 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= ... (shortened)
lola: processed formula length: 625
lola: 13 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation task get result unparse finished++ id 0
lola: 11 markings, 10 edges
lola: formula 0: (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)) AND ((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))
lola: processed formula length: 147
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-2-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3680 markings, 17002 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))
lola: processed formula length: 147
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3680 markings, 17002 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))
lola: processed formula length: 307
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur from all states.
lola: formula 0: (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all states
lola: rewrite Frontend/Parser/formula_rewrite.k:599
lola: rewrite Frontend/Parser/formula_rewrite.k:634
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))
lola: processed formula length: 307
lola: 15 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
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: The predicate does not eventually occur from all states.
lola: state equation task get result unparse finished++ id 1
lola: 11 markings, 10 edges
lola: formula 1: (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46) OR (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ... (shortened)
lola: processed formula length: 459
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46) OR (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10250 literals and 1034 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 14103 markings, 75940 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG(((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))
lola: processed formula length: 155
lola: 13 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 92 markings, 153 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (A (F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(AG(AF(((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))))
lola: processed formula length: 159
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 758925 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))) U (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <=... (shortened)
lola: processed formula length: 624
lola: 13 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: 43 markings, 97 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))) U (A (G ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(EF((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))) U (AG((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND... (shortened)
lola: processed formula length: 1414
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 628014 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0))))) AND (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1)... (shortened)
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:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
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 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))) OR (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p1... (shortened)
lola: processed formula length: 628
lola: 21 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: 41630 markings, 100341 edges
lola: ========================================
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND (((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND (((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ... (shortened)
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: ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) OR (((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) ... (shortened)
lola: processed formula length: 641
lola: 15 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: state equation task get result unparse finished++ id 1
lola: formula 0: ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND (((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))))
lola: formula 1: ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) OR (((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 400 literals and 100 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 20480 literals and 2048 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-12-1.sara

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 57293 markings, 266641 edges
lola: ========================================
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <... (shortened)
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: ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) OR ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (... (shortened)
lola: processed formula length: 471
lola: 15 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: state equation task get result unparse finished++ id 1
lola: formula 0: ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) AND ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))
lola: formula 1: ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) OR ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 300 literals and 100 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 10250 literals and 1025 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-13-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-13-1.sara.

lola: state equation 0: solution produced
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 59028 markings, 360390 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) R ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= ... (shortened)
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 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)) OR ((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= ... (shortened)
lola: processed formula length: 625
lola: 13 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)) AND ((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))))))) AND (E (F ((A (G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))) OR (((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: ========================================
lola: processed formula: ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))) OR (((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <... (shortened)
lola: processed formula length: 941
lola: 11 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 60 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)))) AND E (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AG(((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))) AND EG((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <... (shortened)
lola: processed formula length: 473
lola: 14 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 59049 markings, 562241 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no yes no no no yes no yes no no no no no
lola:
preliminary result: no no no yes no no no yes no yes no no no no no
lola: ========================================
lola: ========================================
lola: memory consumption: 123112 KB
lola: time consumption: 6 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="Philosophers-COL-000010"
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 Philosophers-COL-000010, 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 r176-tajo-158987871200012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 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 ;