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.r178-tajo-158987882900812.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 DrinkVendingMachine-COL-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900812
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.8K Mar 31 07:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 30 00:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 30 00:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 28 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 22K Mar 24 05:37 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 DrinkVendingMachine-COL-02-CTLFireability-00
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-01
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-02
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-03
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-04
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-05
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-06
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-07
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-08
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-09
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-10
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-11
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-12
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-13
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-14
FORMULA_NAME DrinkVendingMachine-COL-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591243821610

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 04:10:23] [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-04 04:10:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 04:10:23] [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-04 04:10:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 581 ms
[2020-06-04 04:10:23] [INFO ] sort/places :
Options->theOptions,optionSlots,
Products->theProducts,productSlots,
Quality->ready,wait,

[2020-06-04 04:10:23] [INFO ] o3 symmetric to o1 in transition elaborate3
[2020-06-04 04:10:23] [INFO ] o1 symmetric to o2 in transition elaborate3
[2020-06-04 04:10:23] [INFO ] o1 symmetric to o2 in transition elaborate2
[2020-06-04 04:10:23] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 34 ms.
[2020-06-04 04:10:23] [INFO ] Computed order based on color domains.
[2020-06-04 04:10:23] [INFO ] Unfolded HLPN to a Petri net with 24 places and 52 transitions in 18 ms.
[2020-06-04 04:10:23] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 688 ms. (steps per millisecond=145 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 52 rows 24 cols
[2020-06-04 04:10:24] [INFO ] Computed 12 place invariants in 7 ms
[2020-06-04 04:10:24] [INFO ] [Real]Absence check using 12 positive place invariants in 17 ms returned unsat
[2020-06-04 04:10:24] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned unsat
[2020-06-04 04:10:24] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2020-06-04 04:10:24] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2020-06-04 04:10:25] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 04:10:25] [INFO ] Flatten gal took : 49 ms
[2020-06-04 04:10:25] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 04:10:25] [INFO ] Flatten gal took : 20 ms
FORMULA DrinkVendingMachine-COL-02-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 04:10:25] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2020-06-04 04:10:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ DrinkVendingMachine-COL-02 @ 3570 seconds

FORMULA DrinkVendingMachine-COL-02-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-COL-02-CTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-COL-02-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DrinkVendingMachine-COL-02-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA DrinkVendingMachine-COL-02-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ DrinkVendingMachine-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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 04:10:25 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 17,
"adisj": 5,
"aneg": 0,
"comp": 62,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 62,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AX((AX(((1 <= p18) OR (1 <= p19))) OR (AG(((1 <= p22) OR (1 <= p23))) OR (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)))))))",
"processed_size": 971,
"rewrites": 24
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 31,
"markings": 28,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 12,
"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": 6,
"visible_transitions": 0
},
"processed": "AX((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))))",
"processed_size": 625,
"rewrites": 22
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 13,
"adisj": 4,
"aneg": 0,
"comp": 48,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 48,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "G ((((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) OR F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))))",
"processed_size": 738,
"rewrites": 23
},
"result":
{
"edges": 7522,
"markings": 1087,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "E (F (((p22 <= 0) AND (p23 <= 0) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))))",
"processed_size": 275,
"rewrites": 22
},
"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": 160,
"problems": 32
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 8,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))",
"processed_size": 373,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 0)))))",
"processed_size": 629,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 40,
"problems": 12
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))",
"processed_size": 489,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "A (G ((((1 <= p14) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p14) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((p22 <= 0) AND (p23 <= 0) AND (p18 <= 0) AND (p19 <= 0)))))",
"processed_size": 563,
"rewrites": 23
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p18 <= 0) AND (p19 <= 0))",
"processed_size": 27,
"rewrites": 22
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 8,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))",
"processed_size": 373,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 8,
"adisj": 1,
"aneg": 0,
"comp": 24,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 24,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))",
"processed_size": 373,
"rewrites": 24
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 46
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 0)))))",
"processed_size": 629,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))",
"processed_size": 489,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 102564,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((A(X(**)) OR (A(G(**)) OR **)))) : TRUE : E(F(**)) : (A(F(**)) AND A(G(**))) : (A(G(*)) OR (** OR ((A(F(*)) AND (** AND **)) OR **))) : (A(G((** OR A(F(**))))) OR A(X(**)))"
},
"net":
{
"arcs": 280,
"conflict_clusters": 13,
"places": 24,
"places_significant": 12,
"singleton_clusters": 0,
"transitions": 52
},
"result":
{
"preliminary_value": "yes yes yes no no yes ",
"value": "yes yes yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 76/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24
lola: finding significant places
lola: 24 places, 52 transitions, 12 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p21)
lola: LP says that atomic proposition is always false: (3 <= p20)
lola: A (X (((A (X (((1 <= p18) OR (1 <= p19)))) OR A (G (((1 <= p22) OR (1 <= p23))))) OR (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))))))) : E ((NOT(A (X (((1 <= p18) OR (1 <= p19))))) U E (G ((0 <= 0))))) : E (((0 <= 0) U ((p22 <= 0) AND (p23 <= 0) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))) : (A (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (((1 <= p14) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p14) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))))) AND A (G ((((1 <= p14) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p14) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((p22 <= 0) AND (p23 <= 0) AND (p18 <= 0) AND (p19 <= 0)))))) : (((NOT(E (F ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)))))) OR (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))) OR ((NOT(E (G ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))))) AND (p18 <= 0)) AND (p19 <= 0))) OR ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))) : (A (G ((((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))) OR ((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) OR A (F (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7))))))) OR A (X ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (X (((1 <= p18) OR (1 <= p19)))) OR (A (G (((1 <= p22) OR (1 <= p23)))) OR (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p21))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((AX(((1 <= p18) OR (1 <= p19))) OR (AG(((1 <= p22) OR (1 <= p23))) OR (((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p18) OR (1 <= p19) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <=... (shortened)
lola: processed formula length: 971
lola: 24 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28 markings, 31 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= ... (shortened)
lola: processed formula length: 625
lola: 22 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
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 ((((((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)) AND (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) O... (shortened)
lola: processed formula length: 738
lola: 23 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 universal single path CTL formula holds.
lola: 1087 markings, 7522 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 <= 0) AND (p23 <= 0) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))))
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 (((p22 <= 0) AND (p23 <= 0) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))))
lola: processed formula length: 275
lola: 22 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: ((p22 <= 0) AND (p23 <= 0) AND (((1 <= p9) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p16)) OR ((1 <= p9) AND (1 <= p17)) OR ((1 <= p8) AND (1 <= p17))) AND ((1 <= p0) OR (1 <= p1) OR (1 <= p2) OR (1 <= p3) OR (1 <= p4) OR (1 <= p5) OR (1 <= p6) OR (1 <= p7)))
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 160 literals and 32 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p18 <= 0) AND (p19 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p18 <= 0) AND (p19 <= 0))
lola: processed formula length: 27
lola: 22 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))
lola: processed formula length: 373
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 24 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 7 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p2... (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:788
lola: processed formula: A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p2... (shortened)
lola: processed formula length: 629
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 12 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= ... (shortened)
lola: processed formula length: 489
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 32 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p0 <= 0) AND (p1 <= 0) AND (p2 <= 0) AND (p3 <= 0) AND (p4 <= 0) AND (p5 <= 0) AND (p6 <= 0) AND (p7 <= 0) AND (((1 <= p14) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p14) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p14) 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 <= p14) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p14) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p16) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (2 <= p20) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p17) AND (1 <= p20) AND (2 <= p21)) OR ((1 <= p14) AND (1 <=... (shortened)
lola: processed formula length: 563
lola: 23 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: state equation task get result unparse finished++ id 0
lola: result: no
lola: produced by: state space
lola: formula 0: (((p14 <= 0) OR (p17 <= 0) OR (p20 <= 1) OR (p21 <= 0)) AND ((p14 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 1)) AND ((p15 <= 0) OR (p16 <= 0) OR (p20 <= 1) OR (p21 <= 0)) AND ((p15 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 1)) AND ((p15 <= 0) OR (p17 <= 0) OR (p20 <= 1) OR (p21 <= 0)) AND ((p15 <= 0) OR (p17 <= 0) OR (p20 <= 0) OR (p21 <= 1)) AND ((p14 <= 0) OR (p16 <= 0) OR (p20 <= 1) OR (p21 <= 0)) AND ((p14 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 1)) AND ((1 <= p22) OR (1 <= p23) OR (1 <= p18) OR (1 <= p19)))
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p18 <= 0) AND (p19 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p18 <= 0) AND (p19 <= 0))
lola: processed formula length: 27
lola: 22 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))
lola: processed formula length: 373
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 24 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))))
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:788
lola: processed formula: (((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21)))
lola: processed formula length: 373
lola: 24 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
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: (((p11 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p16 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p10 <= 0) OR (p17 <= 0) OR (p20 <= 0)) AND ((p11 <= 0) OR (p17 <= 0) OR (p21 <= 0)) AND ((p11 <= 0) OR (p16 <= 0) OR (p21 <= 0)))
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p2... (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:788
lola: processed formula: A (G ((((p12 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p12 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p21 <= 1)) AND ((p13 <= 0) OR (p17 <= 0) OR (p20 <= 1)) AND ((p12 <= 0) OR (p16 <= 0) OR (p20 <= 0) OR (p21 <= 0)) AND ((p13 <= 0) OR (p16 <= 0) OR (p2... (shortened)
lola: processed formula length: 629
lola: 23 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p12) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p17) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p16) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p21)) OR ((1 <= p13) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p13) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)) OR ((1 <= p12) AND (1 <= p16) AND (2 <= p20)) OR ((1 <= p12) AND (1 <= p17) AND (1 <= p20) AND (1 <= p21)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 40 literals and 12 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p11) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p16) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p10) AND (1 <= p17) AND (1 <= p20)) OR ((1 <= p11) AND (1 <= p17) AND (1 <= p21)) OR ((1 <= p11) AND (1 <= p16) AND (1 <= p21))) AND ((1 <= p0) OR (1 <= ... (shortened)
lola: processed formula length: 489
lola: 21 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 32 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes
lola:
preliminary result: yes yes yes no no yes
lola: memory consumption: 102564 KB
lola: time consumption: 4 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="DrinkVendingMachine-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 DrinkVendingMachine-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 r178-tajo-158987882900812"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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