Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 13K 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 CSRepetitions-COL-02-CTLFireability-00
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-01
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-02
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-03
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-04
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-05
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-06
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-07
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-08
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-09
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-10
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-11
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-12
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-13
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-14
FORMULA_NAME CSRepetitions-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591168021071

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 07:07:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 07:07:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 07:07:02] [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-03 07:07:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 456 ms
[2020-06-03 07:07:03] [INFO ] sort/places :
Server->serverWaiting,
Computation->serverAnwering,
Dot->requestBufferSlots,
Client->clientSending,requestBuffer,clientWaiting,

[2020-06-03 07:07:03] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 23 PT places and 28.0 transition bindings in 12 ms.
[2020-06-03 07:07:03] [INFO ] Computed order based on color domains.
[2020-06-03 07:07:03] [INFO ] Unfolded HLPN to a Petri net with 23 places and 28 transitions in 4 ms.
[2020-06-03 07:07:03] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Finished random walk after 45 steps, including 2 resets, run visited all 26 properties in 3 ms. (steps per millisecond=15 )
[2020-06-03 07:07:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 07:07:03] [INFO ] Flatten gal took : 21 ms
[2020-06-03 07:07:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 07:07:03] [INFO ] Flatten gal took : 7 ms
FORMULA CSRepetitions-COL-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-02-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 07:07:03] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2020-06-03 07:07:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ CSRepetitions-COL-02 @ 3570 seconds

FORMULA CSRepetitions-COL-02-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CSRepetitions-COL-02-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CSRepetitions-COL-02-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ CSRepetitions-COL-02

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 37,
"adisj": 4,
"aneg": 0,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 6,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "AG((AX((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR (AF((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))) OR (((1 <= p0) AND (1 <= p4)) OR (((1 <= p0) AND (1 <= p1)) OR (((1 <= p0) AND (1 <= p3)) OR (((1 <= p0) AND (1 <= p2)) OR ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))))))",
"processed_size": 1127,
"rewrites": 49
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 103,
"markings": 64,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "(((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))",
"processed_size": 177,
"rewrites": 49
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 128,
"problems": 16
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 8,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "A (X (A ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) U (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))",
"processed_size": 315,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space / EXER",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until_from_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))))",
"processed_size": 309,
"rewrites": 47
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 96,
"problems": 32
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"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": 12,
"visible_transitions": 0
},
"processed": "(((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))",
"processed_size": 245,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 9,
"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": 16,
"visible_transitions": 0
},
"processed": "((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))))",
"processed_size": 303,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 8,
"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": 12,
"visible_transitions": 0
},
"processed": "AX((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))",
"processed_size": 249,
"rewrites": 47
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"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": 12,
"visible_transitions": 0
},
"processed": "(((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))",
"processed_size": 245,
"rewrites": 49
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 16
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 25,
"adisj": 3,
"aneg": 0,
"comp": 52,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 52,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 22,
"visible_transitions": 0
},
"processed": "E((AF((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))) U AX((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))))",
"processed_size": 809,
"rewrites": 49
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"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": 12,
"visible_transitions": 0
},
"processed": "(((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))",
"processed_size": 245,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"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": 12,
"visible_transitions": 0
},
"processed": "(((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))",
"processed_size": 245,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 1,
"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": 12,
"visible_transitions": 0
},
"processed": "(((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))",
"processed_size": 245,
"rewrites": 49
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 24
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 16,
"problems": 8
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 13,
"adisj": 3,
"aneg": 0,
"comp": 28,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 28,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))",
"processed_size": 431,
"rewrites": 49
},
"result":
{
"edges": 24,
"markings": 21,
"produced_by": "tscc_search",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "liveness",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 20,
"adisj": 20,
"aneg": 0,
"comp": 68,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 68,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "E((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND ((((p5 <= 0) OR (p10 <= 0)) AND ((p8 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p9 <= 0)) AND ((p6 <= 0) OR (p9 <= 0)) AND ((p8 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p10 <= 0))) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))))) U AF(((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))))",
"processed_size": 1052,
"rewrites": 48
},
"net":
{
"conflict_clusters": 6,
"singleton_clusters": 0
},
"result":
{
"edges": 9,
"markings": 9,
"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": 3567
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"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": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))",
"processed_size": 241,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 0,
"aneg": 0,
"comp": 16,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 16,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))",
"processed_size": 234,
"rewrites": 59
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))",
"processed_size": 53,
"rewrites": 46
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))",
"processed_size": 57,
"rewrites": 50
},
"result":
{
"edges": 186,
"markings": 98,
"produced_by": "state space /EFEG",
"value": false
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "eventual_occurrence_from_all_states",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 101112,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((A(X(**)) OR (A(F(**)) OR (** OR (** OR (** OR (** OR **)))))))) : A(F(**)) : (A(G(E(F(**)))) OR A(X(A((** U **))))) : A(F(**)) : E(X(A(G(E(F(**)))))) : (A(F(**)) OR (E(F(**)) AND (A(X(**)) AND (E(F(**)) AND **)))) : A(X(A(F(**)))) : E(((A(F(**)) OR **) U A(X(**)))) : A(G(E(F(**)))) : E((** U A(F(**)))) : A(F(**)) : ((A(G(A(F(**)))) OR (** AND (A(G(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))) AND (E(F(**)) OR (E((** U **)) AND **)))"
},
"net":
{
"arcs": 92,
"conflict_clusters": 6,
"places": 23,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 28
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no ",
"value": "no no no no no no no 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: 51/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (G (((((((A (X ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR A (F ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))))) OR ((1 <= p0) AND (1 <= p4))) OR ((1 <= p0) AND (1 <= p1))) OR ((1 <= p0) AND (1 <= p3))) OR ((1 <= p0) AND (1 <= p2))) OR ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))))) : A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) : (A (G (E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) OR A (X (A ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) U (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))) : A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) : E (X (A (G (E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))))))) : (A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (((E (F ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))))) AND A (X ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))) AND E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))) AND ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))))) : A (X (A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))))) : E (((A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))) U A (X ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))))) : A (G (E (F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))))))) : E (((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND ((((p5 <= 0) OR (p10 <= 0)) AND ((p8 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p9 <= 0)) AND ((p6 <= 0) OR (p9 <= 0)) AND ((p8 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p10 <= 0)) AND ((p6 <= 0) OR (p10 <= 0))) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))))) U A (F (((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))) : A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) : ((A (G (A (F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) OR (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND ((((((((A (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR ((1 <= p5) AND (1 <= p10))) OR ((1 <= p8) AND (1 <= p10))) OR ((1 <= p5) AND (1 <= p9))) OR ((1 <= p6) AND (1 <= p9))) OR ((1 <= p8) AND (1 <= p9))) OR ((1 <= p7) AND (1 <= p9))) OR ((1 <= p7) AND (1 <= p10))) OR ((1 <= p6) AND (1 <= p10))))) AND (E (F ((((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR ((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))) OR (E ((((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)) U ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)))) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (A (F ((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: processed formula: AG((AX((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR (AF((((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (... (shortened)
lola: processed formula length: 1127
lola: 49 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: 64 markings, 103 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) OR A (X (A ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) U (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (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 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: processed formula length: 177
lola: 49 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 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 0
lola: state equation task get result unparse finished++ id 1
lola: formula 0: (((p0 <= 0) OR (p4 <= 0)) AND ((p0 <= 0) OR (p1 <= 0)) AND ((p0 <= 0) OR (p3 <= 0)) AND ((p0 <= 0) OR (p2 <= 0)) AND (p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: formula 1: (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)) OR (1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 12 literals and 8 conjunctive subformulas
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 128 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-0.sara
lola: state equation: write sara problem file to CTLFireability-1.sara
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 13 markings, 13 edges
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-1.sara.
sara: try reading problem file CTLFireability-0.sara.
sara: error: :141: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
sara: error: :141: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) U (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking universal until from successors
lola: rewrite Frontend/Parser/formula_rewrite.k:577
lola: rewrite Frontend/Parser/formula_rewrite.k:756
lola: rewrite Frontend/Parser/formula_rewrite.k:691
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (X (A ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) U (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))
lola: processed formula length: 315
lola: 51 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: lola: ========================================
using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EXER)
lola: state space: using reachability graph (EXER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 1
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EXER
lola: Predicate Phi does not hild until Predicate Psi on all paths from successors.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))))))
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:807
lola: processed formula: EX(AG(EF((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))))))
lola: processed formula length: 129
lola: 49 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: 15 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (E (F ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))))
lola: processed formula length: 125
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation task get result unparse finished++ id 0
lola: The predicate is reachable.
lola: formula 0: (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2)))
lola: 2 markings, 1 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))))
lola: processed formula length: 309
lola: 47 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10))))
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 96 literals and 32 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))
lola: processed formula length: 245
lola: 49 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: formula 0: (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))
lola: 9 markings, 8 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to CTLFireability-5-0.sara
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0))))
lola: processed formula length: 303
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 20 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 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))
lola: processed formula length: 249
lola: 47 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 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))
lola: processed formula length: 245
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
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 /EXEG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur from all successors.
lola: formula 0: (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))
lola: 8 markings, 7 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((AF((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))) OR ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0) AND (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <=... (shortened)
lola: processed formula length: 809
lola: 49 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))
lola: processed formula length: 245
lola: 49 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))
lola: The predicate does not eventually occur.
lola: state equation task get result unparse finished id 0
lola: 9 markings, 8 edges
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))
lola: processed formula length: 245
lola: 49 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: formula 0: (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))
lola: 9 markings, 8 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p2 <= 0) OR (p17 <= 0)) AND ((p1 <= 0) OR (p16 <= 0)) AND ((p1 <= 0) OR (p15 <= 0)) AND ((p4 <= 0) OR (p21 <= 0)) AND ((p4 <= 0) OR (p22 <= 0)) AND ((p2 <= 0) OR (p18 <= 0)) AND ((p3 <= 0) OR (p20 <= 0)) AND ((p3 <= 0) OR (p19 <= 0)))
lola: processed formula length: 245
lola: 49 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished id 0
lola: The predicate does not eventually occur.
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND ... (shortened)
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 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14) OR ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))) AND (((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) O... (shortened)
lola: processed formula length: 431
lola: 49 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: SUBRESULT
lola: result: no
lola: produced by: tscc_search
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: The predicate is not live.
lola: 21 markings, 24 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND ((((p5 <= 0) OR (p10 <= 0)) AND ((p8 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p9 <= 0)) AND ((p6 <= 0) OR (p9 <= 0)) AND ((p8 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p10 <= 0)) AND ((... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E((((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8) OR ((1 <= p0) AND (1 <= p4)) OR ((1 <= p0) AND (1 <= p1)) OR ((1 <= p0) AND (1 <= p3)) OR ((1 <= p0) AND (1 <= p2))) AND ((((p5 <= 0) OR (p10 <= 0)) AND ((p8 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p9 <= 0)) AND ((p6 <= 0) OR (p9 <= 0)) AND ((p8 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p9 <= 0)) AND ((p7 <= 0) OR (p10 <= 0)) AND ((p6... (shortened)
lola: processed formula length: 1052
lola: 48 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (A (F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14)))))) OR (((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8)) AND (A (G ((((1 <= p2) AND (1 <= p17)) OR ((1 <= p1) AND (1 <= p16)) OR ((1 <= p1) AND (1 <= p15)) OR ((1 <= p4) AND (1 <= p21)) OR ((1 <= p4) AND (1 <= p22)) OR ((1 <= p2) AND (1 <= p18)) OR ((1 <= p3) AND (1 <= p20)) OR ((1 <= p3) AND (1 <= p19))))) OR (((1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))
lola: processed formula length: 241
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 16 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: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p5) AND (1 <= p10)) OR (((1 <= p8) AND (1 <= p10)) OR (((1 <= p5) AND (1 <= p9)) OR (((1 <= p6) AND (1 <= p9)) OR (((1 <= p8) AND (1 <= p9)) OR (((1 <= p7) AND (1 <= p9)) OR (((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p5) AND (1 <= p10)) OR ((1 <= p8) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p9)) OR ((1 <= p6) AND (1 <= p9)) OR ((1 <= p8) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p9)) OR ((1 <= p7) AND (1 <= p10)) OR ((1 <= p6) AND (1 <= p10)))
lola: processed formula length: 234
lola: 59 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 16 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p5) OR (1 <= p6) OR (1 <= p7) OR (1 <= p8))
lola: processed formula length: 53
lola: 46 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))))))
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: ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: processed formula length: 57
lola: 50 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 unparse finished++ id 0
lola: formula 0: ((1 <= p11) OR (1 <= p12) OR (1 <= p13) OR (1 <= p14))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation task get result started, id 1
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
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: The predicate does not eventually occur from all states.
lola: 98 markings, 186 edges
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p11 <= 0) AND (p12 <= 0) AND (p13 <= 0) AND (p14 <= 0))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no
lola: memory consumption: 101112 KB
lola: time consumption: 3 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="CSRepetitions-COL-02"
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 CSRepetitions-COL-02, 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 r182-oct2-158987914100612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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