Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 4.1K Mar 24 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 24 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 24 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 24 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 24 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 24 06:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 24 06:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 41K 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 AirplaneLD-COL-0020-CTLFireability-00
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-01
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-02
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-03
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-04
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-05
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-06
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-07
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-08
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-09
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-10
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-11
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-12
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-13
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-14
FORMULA_NAME AirplaneLD-COL-0020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591326094530

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 03:01:37] [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-05 03:01:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 03:01:37] [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-05 03:01:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1140 ms
[2020-06-05 03:01:38] [INFO ] sort/places :
Speed->SpeedPossibleVal,Speed_Left_Wheel,Speed_Right_Wheel,
Signal->Plane_On_Ground_Signal_no,
Dot->stp5,stp4,stp3,stp2,stp1,P5,P4,P3,P2,P6,P1,
Weight->WeightPossibleVal,Weight_Right_Wheel,Weight_Left_Wheel,
Altitude->AltitudePossibleVal,TheAltitude,

[2020-06-05 03:01:38] [INFO ] Detected 3 constant HL places corresponding to 62 PT places.
[2020-06-05 03:01:38] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 159 PT places and 252.0 transition bindings in 36 ms.
[2020-06-05 03:01:38] [INFO ] Computed order based on color domains.
[2020-06-05 03:01:38] [INFO ] Unfolded HLPN to a Petri net with 159 places and 168 transitions in 15 ms.
[2020-06-05 03:01:38] [INFO ] Unfolded HLPN properties in 1 ms.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 39 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 03:01:38] [INFO ] Reduced 1 identical enabling conditions.
Reduce places removed 62 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 72 ms.
Incomplete random walk after 100000 steps, including 12554 resets, run finished after 813 ms. (steps per millisecond=123 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0]
// Phase 1: matrix 168 rows 97 cols
[2020-06-05 03:01:39] [INFO ] Computed 3 place invariants in 13 ms
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned unsat
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 03:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using state equation in 105 ms returned unsat
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned unsat
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 03:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2020-06-05 03:01:40] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-05 03:01:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 03:01:40] [INFO ] Flatten gal took : 119 ms
[2020-06-05 03:01:40] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 03:01:40] [INFO ] Flatten gal took : 48 ms
FORMULA AirplaneLD-COL-0020-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0020-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 03:01:40] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 11 ms.
[2020-06-05 03:01:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AirplaneLD-COL-0020 @ 3570 seconds

FORMULA AirplaneLD-COL-0020-CTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA AirplaneLD-COL-0020-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0020-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3555
rslt: Output for CTLFireability @ AirplaneLD-COL-0020

{
"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": "Fri Jun 5 03:01:41 2020
",
"timelimit": 3570
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "AX(EG(((p8 <= 0) OR (p11 <= 0))))",
"processed_size": 34,
"rewrites": 37
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 70786,
"markings": 36709,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 9,
"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": 10,
"visible_transitions": 0
},
"processed": "A (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0)))))",
"processed_size": 284,
"rewrites": 37
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EX(((1 <= p8) AND (1 <= p11) AND (1 <= p0)))",
"processed_size": 44,
"rewrites": 36
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 3,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A(A((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75))) U (1 <= p3)) U AX(((1 <= p8) AND (1 <= p12))))",
"processed_size": 389,
"rewrites": 38
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 7,
"markings": 4,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "EX(AX((1 <= p4)))",
"processed_size": 17,
"rewrites": 37
},
"net":
{
"conflict_clusters": 13,
"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": 4,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": "DEADLOCK",
"processed_size": 8,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p8 <= 0) OR (p11 <= 0))",
"processed_size": 26,
"rewrites": 38
},
"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": 4
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 22,
"adisj": 2,
"aneg": 0,
"comp": 44,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "E (((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56))) U (((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75)))))",
"processed_size": 685,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 11
},
"type": "existential_until",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 19,
"adisj": 1,
"aneg": 0,
"comp": 38,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 38,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "AX((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p26))))",
"processed_size": 590,
"rewrites": 36
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"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": "((p0 <= 0) OR ((p4 <= 0) AND ((p10 <= 0) OR (p14 <= 0))))",
"processed_size": 59,
"rewrites": 39
},
"result":
{
"edges": 1214674,
"markings": 303139,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"stateequation":
{
"literals": 5,
"problems": 3
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 3,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 11,
"adisj": 1,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EG((E(((1 <= p8) AND (1 <= p12)) U (1 <= p4)) OR (EF(((1 <= p8) AND (1 <= p12))) AND ((1 <= p10) AND ((1 <= p13) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))))",
"processed_size": 398,
"rewrites": 38
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 1257795,
"markings": 289296,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 2,
"E": 1,
"F": 0,
"G": 2,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 18,
"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": 20,
"visible_transitions": 0
},
"processed": "A(EG((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0)))) U AG((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)))))",
"processed_size": 566,
"rewrites": 38
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 1477122,
"markings": 308303,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1778
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 9,
"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": 10,
"visible_transitions": 0
},
"processed": "A (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)))))",
"processed_size": 284,
"rewrites": 37
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 18,
"problems": 9
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 22,
"adisj": 1,
"aneg": 1,
"comp": 44,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "(((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND ((p7 <= 0) OR (p47 <= 0)) AND ((p7 <= 0) OR (p46 <= 0)) AND ((p7 <= 0) OR (p45 <= 0)) AND ((p7 <= 0) OR (p52 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p54 <= 0)) AND ((p7 <= 0) OR (p53 <= 0)) AND ((p8 <= 0) OR (p11 <= 0)))",
"processed_size": 679,
"rewrites": 38
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 65
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 44,
"problems": 22
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3557
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 33,
"adisj": 14,
"aneg": 4,
"comp": 88,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 88,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "((((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56))) AND ((p8 <= 0) OR (p11 <= 0) OR (((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0))))) OR ((p0 <= 0) AND ((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND ((p7 <= 0) OR (p47 <= 0)) AND ((p7 <= 0) OR (p46 <= 0)) AND ((p7 <= 0) OR (p45 <= 0)) AND ((p7 <= 0) OR (p52 <= 0)) AND ((p7 <= 0) OR (p51 <= 0)) AND ((p7 <= 0) OR (p50 <= 0)) AND ((p7 <= 0) OR (p49 <= 0)) AND ((p7 <= 0) OR (p54 <= 0)) AND ((p7 <= 0) OR (p53 <= 0)))) R (F ((p2 <= 0)) OR ((p10 <= 0) OR (p13 <= 0))))",
"processed_size": 1371,
"rewrites": 48
},
"result":
{
"edges": 528144,
"markings": 415045,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "existential single path",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 107596,
"runtime": 15.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(E(G(*)) AND A((* R *))) : E(G(**)) : (A(X(E(G(**)))) OR (** AND E(F(**)))) : E(G((E((** U **)) OR (E(F(**)) AND (** AND (** AND **)))))) : A(X(A(G(E(F(**)))))) : E(F(A(G(**)))) : E(F(A(G(**)))) : (A(F(**)) OR A(G(**))) : (E(X(**)) OR A(G(**))) : A((A((** U **)) U A(X(**)))) : E((** U (E(G(**)) AND (** AND **)))) : (E(X(A(X(**)))) AND (E(F(**)) OR (A(G(**)) OR (E(X(*)) OR (** OR **))))) : A((E(G(**)) U A(G(**)))) : (DEADLOCK OR (A(X(**)) OR (E((** U **)) OR (** OR (A((** U **)) AND A(F(**)))))))"
},
"net":
{
"arcs": 470,
"conflict_clusters": 13,
"places": 97,
"places_significant": 94,
"singleton_clusters": 0,
"transitions": 168
},
"result":
{
"preliminary_value": "no no yes no no no no no no no no no yes no ",
"value": "no no yes no no no no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 265/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3104
lola: finding significant places
lola: 97 places, 168 transitions, 94 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: (NOT(A (F ((p4 <= 0)))) AND NOT(E (((((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p46)) OR ((1 <= p7) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p52)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))) U ((1 <= p10) AND (1 <= p14)))))) : E (G (((1 <= p3) OR (1 <= p1)))) : (A (X (E (G (((p8 <= 0) OR (p11 <= 0)))))) OR (((1 <= p10) AND (1 <= p13)) AND E (F ((((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75))) AND (1 <= p4)) OR (1 <= p2) OR ((1 <= p8) AND (1 <= p11))))))) : E (G ((E ((((1 <= p8) AND (1 <= p12)) U (1 <= p4))) OR (((E (F (((1 <= p8) AND (1 <= p12)))) AND (1 <= p10)) AND (1 <= p13)) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))) : A (X (A (G (E (F ((1 <= p0))))))) : E (F (A (G (((1 <= p0) AND ((1 <= p4) OR ((1 <= p10) AND (1 <= p14)))))))) : E (F (A (G (((1 <= p0) OR ((1 <= p10) AND (1 <= p14))))))) : (A (F ((((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p46)) OR ((1 <= p7) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p52)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53)) OR ((1 <= p8) AND (1 <= p11))))) OR A (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)))))) : (E (X (((1 <= p8) AND (1 <= p11) AND (1 <= p0)))) OR A (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0)))))) : A ((A (((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75))) U (1 <= p3))) U A (X (((1 <= p8) AND (1 <= p12)))))) : E (((((((p6 <= 0) OR (p63 <= 0)) AND ((p6 <= 0) OR (p62 <= 0)) AND ((p6 <= 0) OR (p64 <= 0)) AND ((p6 <= 0) OR (p59 <= 0)) AND ((p6 <= 0) OR (p58 <= 0)) AND ((p6 <= 0) OR (p74 <= 0)) AND ((p6 <= 0) OR (p61 <= 0)) AND ((p6 <= 0) OR (p60 <= 0)) AND ((p6 <= 0) OR (p55 <= 0)) AND ((p6 <= 0) OR (p57 <= 0)) AND ((p6 <= 0) OR (p56 <= 0))) OR ((1 <= p8) AND (1 <= p11) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))) AND ((1 <= p0) OR ((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p46)) OR ((1 <= p7) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p52)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53)))) U ((E (G ((1 <= p2))) AND (1 <= p10)) AND (1 <= p13)))) : (E (X (A (X ((1 <= p4))))) AND (((((E (F ((1 <= p1))) OR A (G ((1 <= p1)))) OR E (G ((1 <= 0)))) OR NOT(A (X ((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75))))))) OR ((1 <= p8) AND (1 <= p11))) OR ((1 <= p10) AND (1 <= p13)))) : A ((E (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0))))) U A (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0))))))) : ((((A (X ((1 <= 0))) OR A (X ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p26)))))) OR E (((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56))) U (((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75)))))) OR E (((1 <= 0) U ((1 <= p8) AND (1 <= p11))))) OR (A (((((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p46)) OR ((1 <= p7) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p52)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))) U (1 <= p3))) AND A (F (((1 <= p8) AND (1 <= p11))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G (((p8 <= 0) OR (p11 <= 0)))))) OR (((1 <= p10) AND (1 <= p13)) AND E (F ((((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND (1 <= p13))
lola: processed formula length: 27
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((p8 <= 0) OR (p11 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EG(((p8 <= 0) OR (p11 <= 0))))
lola: processed formula length: 34
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 36709 markings, 70786 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (E (F ((1 <= p0)))))))
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:812
lola: processed formula: AX(AG(EF((1 <= p0))))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 30 markings, 54 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (((1 <= p8) AND (1 <= p11) AND (1 <= p0)))) OR A (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0)))))
lola: processed formula length: 284
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k: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: formula 0: (((1 <= p6) AND (1 <= p67)) OR ((1 <= p6) AND (1 <= p66)) OR ((1 <= p6) AND (1 <= p69)) OR ((1 <= p6) AND (1 <= p68)) OR ((1 <= p6) AND (1 <= p65)) OR ((1 <= p6) AND (1 <= p71)) OR ((1 <= p6) AND (1 <= p70)) OR ((1 <= p6) AND (1 <= p73)) OR ((1 <= p6) AND (1 <= p72)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p8) AND (1 <= p11) AND (1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((1 <= p8) AND (1 <= p11) AND (1 <= p0)))
lola: processed formula length: 44
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75))) U (1 <= p3))) U A (X (((1 <= p8) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(A((((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75))) U (1 <= p3)) U AX(((1 <= p8) AND (1 <= p12))))
lola: processed formula length: 389
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((1 <= p4))))) AND (E (F ((1 <= p1))) OR (A (G ((1 <= p1))) OR (E (X ((((p5 <= 0) OR (p84 <= 0)) AND ((p5 <= 0) OR (p83 <= 0)) AND ((p5 <= 0) OR (p82 <= 0)) AND ((p5 <= 0) OR (p81 <= 0)) AND ((p5 <= 0) OR (p80 <= 0)) AND ((p5 <= 0) OR (p79 <= 0)) AND ((p5 <= 0) OR (p78 <= 0)) AND ((p5 <= 0) OR (p94 <= 0)) AND ((p5 <= 0) OR (p77 <= 0)) AND ((p5 <= 0) OR (p76 <= 0)) AND ((p5 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p8) AND (1 <= p11)) OR ((1 <= p10) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: (((1 <= p8) AND (1 <= p11)) OR ((1 <= p10) AND (1 <= p13)))
lola: processed formula length: 59
lola: 36 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 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p1)))
lola: processed formula length: 17
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p1 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p1)))
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 <= p1)))
lola: processed formula length: 17
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AX((1 <= p4)))
lola: processed formula length: 17
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK OR (A (X ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p8) AND (1 <= p11))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p8) AND (1 <= p11))
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 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 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p8) AND (1 <= p11))))
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: ((p8 <= 0) OR (p11 <= 0))
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: formula 0: ((1 <= p8) AND (1 <= p11))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56))) U (((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56))) U (((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p8... (shortened)
lola: processed formula length: 685
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: formula 0: (((1 <= p5) AND (1 <= p84)) OR ((1 <= p5) AND (1 <= p83)) OR ((1 <= p5) AND (1 <= p82)) OR ((1 <= p5) AND (1 <= p81)) OR ((1 <= p5) AND (1 <= p80)) OR ((1 <= p5) AND (1 <= p79)) OR ((1 <= p5) AND (1 <= p78)) OR ((1 <= p5) AND (1 <= p94)) OR ((1 <= p5) AND (1 <= p77)) OR ((1 <= p5) AND (1 <= p76)) OR ((1 <= p5) AND (1 <= p75)))
lola: state equation task get result unparse finished id 0
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p24... (shortened)
lola: processed formula length: 590
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p3) OR (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p3) OR (1 <= p1))))
lola: processed formula length: 33
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p3 <= 0) AND (p1 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-6-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 38485 markings, 39244 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p0) OR ((1 <= p10) AND (1 <= p14)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) AND ((p10 <= 0) OR (p14 <= 0)))
lola: processed formula length: 43
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) OR ((1 <= p10) AND (1 <= p14)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p0 <= 0) AND ((p10 <= 0) OR (p14 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-7-0.sara
lola: lola: state equation: write sara problem file to CTLFireability-7-1.sara
state equation: calling and running sara
sara: try reading problem file CTLFireability-7-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-7-1.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: state equation 1: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 293623 markings, 861680 edges
lola: ========================================
lola: subprocess 8 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p0) AND ((1 <= p4) OR ((1 <= p10) AND (1 <= p14))))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p0 <= 0) OR ((p4 <= 0) AND ((p10 <= 0) OR (p14 <= 0))))
lola: processed formula length: 59
lola: 39 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p0) AND ((1 <= p4) OR ((1 <= p10) AND (1 <= p14))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((p0 <= 0) OR ((p4 <= 0) AND ((p10 <= 0) OR (p14 <= 0))))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-8-0.sara
lola: state equation: write sara problem file to CTLFireability-8-1.sara
lola: state equation: calling and running sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-8-1.sara.
sara: try reading problem file CTLFireability-8-0.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic
lola: state equation 1: solution produced

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 303139 markings, 1214674 edges
lola: ========================================
lola: subprocess 9 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((((1 <= p8) AND (1 <= p12)) U (1 <= p4))) OR (E (F (((1 <= p8) AND (1 <= p12)))) AND ((1 <= p10) AND ((1 <= p13) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((E(((1 <= p8) AND (1 <= p12)) U (1 <= p4)) OR (EF(((1 <= p8) AND (1 <= p12))) AND ((1 <= p10) AND ((1 <= p13) AND (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87))))))))
lola: processed formula length: 398
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 289296 markings, 1257795 edges
lola: ========================================
lola: subprocess 10 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0))))) U A (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A(EG((((p6 <= 0) OR (p67 <= 0)) AND ((p6 <= 0) OR (p66 <= 0)) AND ((p6 <= 0) OR (p69 <= 0)) AND ((p6 <= 0) OR (p68 <= 0)) AND ((p6 <= 0) OR (p65 <= 0)) AND ((p6 <= 0) OR (p71 <= 0)) AND ((p6 <= 0) OR (p70 <= 0)) AND ((p6 <= 0) OR (p73 <= 0)) AND ((p6 <= 0) OR (p72 <= 0)))) U AG((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p9... (shortened)
lola: processed formula length: 566
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: 308303 markings, 1477122 edges
lola: ========================================
lola: subprocess 11 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= p4))) AND A (((((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= p4)))
lola: processed formula length: 17
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p4 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 32843 markings, 32842 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p5 <= 0) OR (p86 <= 0)) AND ((p5 <= 0) OR (p85 <= 0)) AND ((p5 <= 0) OR (p93 <= 0)) AND ((p5 <= 0) OR (p92 <= 0)) AND ((p5 <= 0) OR (p91 <= 0)) AND ((p5 <= 0) OR (p90 <= 0)) AND ((p5 <= 0) OR (p89 <= 0)) AND ((p5 <= 0) OR (p88 <= 0)) AND ((p5 <= 0) OR (p87 <= 0)))))
lola: processed formula length: 284
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p5) AND (1 <= p86)) OR ((1 <= p5) AND (1 <= p85)) OR ((1 <= p5) AND (1 <= p93)) OR ((1 <= p5) AND (1 <= p92)) OR ((1 <= p5) AND (1 <= p91)) OR ((1 <= p5) AND (1 <= p90)) OR ((1 <= p5) AND (1 <= p89)) OR ((1 <= p5) AND (1 <= p88)) OR ((1 <= p5) AND (1 <= p87)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 18 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 13 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p7 <= 0) OR (p36 <= 0)) AND ((p7 <= 0) OR (p35 <= 0)) AND ((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p37 <= 0)) AND ((p7 <= 0) OR (p44 <= 0)) AND ((p7 <= 0) OR (p43 <= 0)) AND ((p7 <= 0) OR (p42 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p7 <= 0) OR (p48 <= 0)) AND ((p7 <= 0) OR (p47 <= 0)) ... (shortened)
lola: processed formula length: 679
lola: 38 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (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: formula 0: (((1 <= p7) AND (1 <= p36)) OR ((1 <= p7) AND (1 <= p35)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p37)) OR ((1 <= p7) AND (1 <= p44)) OR ((1 <= p7) AND (1 <= p43)) OR ((1 <= p7) AND (1 <= p42)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p7) AND (1 <= p48)) OR ((1 <= p7) AND (1 <= p47)) OR ((1 <= p7) AND (1 <= p46)) OR ((1 <= p7) AND (1 <= p45)) OR ((1 <= p7) AND (1 <= p52)) OR ((1 <= p7) AND (1 <= p51)) OR ((1 <= p7) AND (1 <= p50)) OR ((1 <= p7) AND (1 <= p49)) OR ((1 <= p7) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53)) OR ((1 <= p8) AND (1 <= p11)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 44 literals and 22 conjunctive subformulas
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 13 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((((p6 <= 0) OR (p63 <= 0)) AND ((p6 <= 0) OR (p62 <= 0)) AND ((p6 <= 0) OR (p64 <= 0)) AND ((p6 <= 0) OR (p59 <= 0)) AND ((p6 <= 0) OR (p58 <= 0)) AND ((p6 <= 0) OR (p74 <= 0)) AND ((p6 <= 0) OR (p61 <= 0)) AND ((p6 <= 0) OR (p60 <= 0)) AND ((p6 <= 0) OR (p55 <= 0)) AND ((p6 <= 0) OR (p57 <= 0)) AND ((p6 <= 0) OR (p56 <= 0))) OR ((1 <= p8) AND (1 <= p11) AND (((1 <= p5) AND (1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking an existential CTL formula with single witness path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:658
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:662
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:666
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:668
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((((1 <= p6) AND (1 <= p63)) OR ((1 <= p6) AND (1 <= p62)) OR ((1 <= p6) AND (1 <= p64)) OR ((1 <= p6) AND (1 <= p59)) OR ((1 <= p6) AND (1 <= p58)) OR ((1 <= p6) AND (1 <= p74)) OR ((1 <= p6) AND (1 <= p61)) OR ((1 <= p6) AND (1 <= p60)) OR ((1 <= p6) AND (1 <= p55)) OR ((1 <= p6) AND (1 <= p57)) OR ((1 <= p6) AND (1 <= p56))) AND ((p8 <= 0) OR (p11 <= 0) OR (((p5 <= 0) OR (p86 <= ... (shortened)
lola: processed formula length: 1371
lola: 48 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: no
lola: produced by: LTL model checker
lola: The existential single path CTL formula does not hold.
lola: 415045 markings, 528144 edges
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no no yes no
lola:
preliminary result: no no yes no no no no no no no no no yes no
lola: ========================================
lola: memory consumption: 107596 KB
lola: time consumption: 15 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="AirplaneLD-COL-0020"
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 AirplaneLD-COL-0020, 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 r166-smll-158987787300180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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