fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r166-smll-158987787300172
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for AirplaneLD-COL-0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15747.270 3600000.00 20961.00 484.00 FTFTFFTTTFFTTTFF normal

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-158987787300172.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-0010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787300172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.6K Mar 24 10:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 24 10:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 24 09:20 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.1K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 24 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 24 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 06:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 24 06:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 40K 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-0010-CTLFireability-00
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-01
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-02
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-03
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-04
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-05
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-06
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-07
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-08
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-09
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-10
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-11
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-12
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-13
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-14
FORMULA_NAME AirplaneLD-COL-0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591325928212

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:58:51] [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 02:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:58:51] [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 02:58:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 886 ms
[2020-06-05 02:58:52] [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 02:58:52] [INFO ] Detected 3 constant HL places corresponding to 32 PT places.
[2020-06-05 02:58:52] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 89 PT places and 132.0 transition bindings in 44 ms.
[2020-06-05 02:58:52] [INFO ] Computed order based on color domains.
[2020-06-05 02:58:52] [INFO ] Unfolded HLPN to a Petri net with 89 places and 88 transitions in 8 ms.
[2020-06-05 02:58:52] [INFO ] Unfolded HLPN properties in 1 ms.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 19 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 1 identical enabling conditions.
[2020-06-05 02:58:52] [INFO ] Reduced 9 identical enabling conditions.
Reduce places removed 32 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 51 ms.
Incomplete random walk after 100000 steps, including 12535 resets, run finished after 524 ms. (steps per millisecond=190 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1]
// Phase 1: matrix 88 rows 57 cols
[2020-06-05 02:58:53] [INFO ] Computed 3 place invariants in 8 ms
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 02:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using state equation in 84 ms returned unsat
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 02:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using state equation in 76 ms returned unsat
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned unsat
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 02:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:58:53] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2020-06-05 02:58:53] [INFO ] Computed and/alt/rep : 44/236/44 causal constraints in 18 ms.
[2020-06-05 02:58:53] [INFO ] Added : 2 causal constraints over 1 iterations in 64 ms. Result :sat
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-05 02:58:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 02:58:53] [INFO ] Flatten gal took : 82 ms
[2020-06-05 02:58:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 02:58:53] [INFO ] Flatten gal took : 44 ms
FORMULA AirplaneLD-COL-0010-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 02:58:54] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 10 ms.
[2020-06-05 02:58:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AirplaneLD-COL-0010 @ 3570 seconds

FORMULA AirplaneLD-COL-0010-CTLFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0010-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0010-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0010-CTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0010-CTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-COL-0010-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA AirplaneLD-COL-0010-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA AirplaneLD-COL-0010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for CTLFireability @ AirplaneLD-COL-0010

{
"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 02:58:55 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50)))",
"processed_size": 121,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 90
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "state space /EXEG",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 0
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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 ((p3 <= 0)))",
"processed_size": 17,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 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": "((p10 <= 0) OR (p14 <= 0))",
"processed_size": 27,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX((p1 <= 0))",
"processed_size": 13,
"rewrites": 89
},
"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"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 16,
"adisj": 8,
"aneg": 0,
"comp": 43,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 43,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 26,
"visible_transitions": 0
},
"processed": "((((1 <= p10) AND (1 <= p13)) OR (1 <= p0)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15)) OR ((p1 <= 0) AND (1 <= p0)) OR (((p6 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p6 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p44 <= 0)) AND (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50)))))",
"processed_size": 657,
"rewrites": 109
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "EX(AG((((p5 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p51 <= 0)) AND ((p5 <= 0) OR (p50 <= 0)))))",
"processed_size": 129,
"rewrites": 90
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 60058,
"markings": 15269,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"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 (F ((p3 <= 0)))",
"processed_size": 17,
"rewrites": 89
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p5 <= 0) OR (p50 <= 0))",
"processed_size": 26,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p5 <= 0) OR (p51 <= 0))",
"processed_size": 26,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p5 <= 0) OR (p52 <= 0))",
"processed_size": 26,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"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": 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": "((p5 <= 0) OR (p53 <= 0))",
"processed_size": 26,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 13,
"adisj": 2,
"aneg": 0,
"comp": 26,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EF(A((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))) U (((1 <= p6) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p43)) OR ((1 <= p6) AND (1 <= p42)))))",
"processed_size": 407,
"rewrites": 90
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 23,
"markings": 12,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 8,
"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": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p6) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p44)))))",
"processed_size": 191,
"rewrites": 89
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 6
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 1,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)))))",
"processed_size": 346,
"rewrites": 89
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 11
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 18,
"adisj": 1,
"aneg": 0,
"comp": 35,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 35,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p54)) OR ((1 <= p5) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p46)) OR ((1 <= p5) AND (1 <= p45))))))",
"processed_size": 548,
"rewrites": 89
},
"result":
{
"edges": 11,
"markings": 12,
"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": 51,
"problems": 17
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"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": 91
},
"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": 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 (p12 <= 0))",
"processed_size": 26,
"rewrites": 91
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"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": "AF(EG((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15)))))",
"processed_size": 284,
"rewrites": 90
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 11,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 11,
"aneg": 0,
"comp": 25,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 25,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "EG((E(((1 <= p8) AND (1 <= p11)) U (1 <= p0)) OR (((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0)))))",
"processed_size": 389,
"rewrites": 90
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 11,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"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": "EF(EG(AF((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))))))",
"processed_size": 288,
"rewrites": 91
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 322197,
"markings": 43463,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 7,
"adisj": 13,
"aneg": 0,
"comp": 34,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 34,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "EG((EG((((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0)))) OR ((1 <= p2) AND ((p4 <= 0) OR ((1 <= p10) AND (1 <= p13) AND (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50))))))))",
"processed_size": 537,
"rewrites": 90
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 58,
"markings": 20,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 2,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 0,
"comp": 26,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 26,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 16,
"visible_transitions": 0
},
"processed": "E(A((1 <= p1) U (1 <= p2)) U (EG(((1 <= p8) AND (1 <= p12))) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)))))",
"processed_size": 405,
"rewrites": 91
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 147521,
"markings": 43239,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"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 <= p14))",
"processed_size": 27,
"rewrites": 88
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": "AF(EG((((1 <= p8) AND (1 <= p11)) OR (1 <= p0))))",
"processed_size": 50,
"rewrites": 90
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 59245,
"markings": 43462,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 72160,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(**)) : (** OR E(X(E(G(*))))) : E(G((E((** U **)) OR **))) : (E(F((A(X(**)) AND A(G(**))))) OR (** AND (A(X(*)) OR E(G(*))))) : E((A((** U **)) U (E(G(**)) AND **))) : (E(X(A(G(**)))) AND (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) : E(F(**)) : E(F(**)) : E(F(E(G(A(F(**)))))) : A(F(E(G(**)))) : (E(F(A((** U **)))) AND (** AND (** AND (** AND (** AND (E(F(*)) OR E(X(*)))))))) : E(F(**)) : E(G((E(G(**)) OR **))) : (A(F(E(G(**)))) OR **) : A(F(**))"
},
"net":
{
"arcs": 245,
"conflict_clusters": 13,
"places": 57,
"places_significant": 54,
"singleton_clusters": 0,
"transitions": 88
},
"result":
{
"preliminary_value": "no yes yes no no yes yes yes no no yes yes yes no no ",
"value": "no yes yes no no yes yes yes no no yes yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 145/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1824
lola: finding significant places
lola: 57 places, 88 transitions, 54 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: A (F (((1 <= p8) AND (1 <= p11)))) : (E (((1 <= 0) U (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50))))) OR NOT(A (X (A (F ((1 <= p2))))))) : E (G ((E ((((1 <= p8) AND (1 <= p11)) U (1 <= p0))) OR (((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0)))))) : (E (F ((A (X ((1 <= p4))) AND A (G ((1 <= p2)))))) OR (((p10 <= 0) OR (p14 <= 0)) AND (NOT(E (X ((1 <= p1)))) OR NOT(A (F ((1 <= p3))))))) : E ((A (((1 <= p1) U (1 <= p2))) U (E (G (((1 <= p8) AND (1 <= p12)))) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)))))) : (E (X (A (G ((((p5 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p51 <= 0)) AND ((p5 <= 0) OR (p50 <= 0))))))) AND (((((((((((A (((1 <= 0) U (((1 <= p10) AND (1 <= p13)) OR (1 <= p0)))) OR ((1 <= p7) AND (1 <= p20))) OR ((1 <= p7) AND (1 <= p19))) OR ((1 <= p7) AND (1 <= p18))) OR ((1 <= p7) AND (1 <= p17))) OR ((1 <= p7) AND (1 <= p23))) OR ((1 <= p7) AND (1 <= p22))) OR ((1 <= p7) AND (1 <= p21))) OR ((1 <= p7) AND (1 <= p16))) OR ((1 <= p7) AND (1 <= p15))) OR ((p1 <= 0) AND (1 <= p0))) OR (((p6 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p35 <= 0)) AND ((p6 <= 0) OR (p37 <= 0)) AND ((p6 <= 0) OR (p36 <= 0)) AND ((p6 <= 0) OR (p44 <= 0)) AND (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50)))))) : E (F ((((1 <= p6) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p44))))) : E (((((1 <= p8) AND (1 <= p11)) OR ((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29))) U E (F ((((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29))))))) : E (F (E (G (A (F ((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))))))))) : A (F (E (G ((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))))))) : (((((E (F (A (((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))) U (((1 <= p6) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p43)) OR ((1 <= p6) AND (1 <= p42))))))) AND ((p5 <= 0) OR (p53 <= 0))) AND ((p5 <= 0) OR (p52 <= 0))) AND ((p5 <= 0) OR (p51 <= 0))) AND ((p5 <= 0) OR (p50 <= 0))) AND (NOT(A (G ((1 <= p3)))) OR NOT(A (X ((1 <= p0)))))) : E (F (A (F (((1 <= p1) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p54)) OR ((1 <= p5) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p46)) OR ((1 <= p5) AND (1 <= p45)))))))) : E (G ((E (G ((((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0))))) OR ((1 <= p2) AND ((p4 <= 0) OR ((1 <= p10) AND (1 <= p13) AND (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50))))))))) : (A (F (E (G ((((1 <= p8) AND (1 <= p11)) OR (1 <= p0)))))) OR ((1 <= p10) AND (1 <= p14))) : A (F (((1 <= p8) AND (1 <= p12))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:473
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:455
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50))) OR E (X (E (G ((p2 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p5) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p52)) OR ((1 <= p5) AND (1 <= p51)) OR ((1 <= p5) AND (1 <= p50)))
lola: processed formula length: 121
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 8 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2 <= 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: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((A (X ((1 <= p4))) AND A (G ((1 <= p2)))))) OR (((p10 <= 0) OR (p14 <= 0)) AND (A (X ((p1 <= 0))) OR E (G ((p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((p3 <= 0)))
lola: processed formula length: 17
lola: 89 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: (1 <= p3)
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 / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 <= 0) OR (p14 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 <= 0) OR (p14 <= 0))
lola: processed formula length: 27
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((p1 <= 0))
lola: processed formula length: 13
lola: 89 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((1 <= p4))) AND A (G ((1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX((1 <= p4)) AND AG((1 <= p2))))
lola: processed formula length: 37
lola: 91 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: 43463 markings, 189776 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G ((((p5 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p51 <= 0)) AND ((p5 <= 0) OR (p50 <= 0))))))) AND ((((1 <= p10) AND (1 <= p13)) OR (1 <= p0)) OR (((1 <= p7) AND (1 <= p20)) OR (((1 <= p7) AND (1 <= p19)) OR (((1 <= p7) AND (1 <= p18)) OR (((1 <= p7) AND (1 <= p17)) OR (((1 <= p7) AND (1 <= p23)) OR (((1 <= p7) AND (1 <= p22)) OR (((1 <= p7) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p10) AND (1 <= p13)) OR (1 <= p0)) OR (((1 <= p7) AND (1 <= p20)) OR (((1 <= p7) AND (1 <= p19)) OR (((1 <= p7) AND (1 <= p18)) OR (((1 <= p7) AND (1 <= p17)) OR (((1 <= p7) AND (1 <= p23)) OR (((1 <= p7) AND (1 <= p22)) OR (((1 <= p7) AND (1 <= p21)) OR (((1 <= p7) AND (1 <= p16)) OR (((1 <= p7) AND (1 <= p15)) OR (((p1 <= 0) AND (1 <= p0)) OR (((p6 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: ((((1 <= p10) AND (1 <= p13)) OR (1 <= p0)) OR ((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15)) OR ((p1 <= 0) AND (1 <= p0)) OR (((p6 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <... (shortened)
lola: processed formula length: 657
lola: 109 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 43 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((((p5 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p51 <= 0)) AND ((p5 <= 0) OR (p50 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(AG((((p5 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p52 <= 0)) AND ((p5 <= 0) OR (p51 <= 0)) AND ((p5 <= 0) OR (p50 <= 0)))))
lola: processed formula length: 129
lola: 90 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: 15269 markings, 60058 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))) U (((1 <= p6) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p43)) OR ((1 <= p6) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p3 <= 0)))
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 ((p3 <= 0)))
lola: processed formula length: 17
lola: 89 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: (p3 <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) OR (p50 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 0) OR (p50 <= 0))
lola: processed formula length: 26
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) OR (p51 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 0) OR (p51 <= 0))
lola: processed formula length: 26
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) OR (p52 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 0) OR (p52 <= 0))
lola: processed formula length: 26
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= 0) OR (p53 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 <= 0) OR (p53 <= 0))
lola: processed formula length: 26
lola: 88 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))) U (((1 <= p6) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p43)) OR ((1 <= p6) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(A((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))) U (((1 <= p6) AND (1 <= p41)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p6) AND (1 <= p43)) OR ((1 <= p6) AND (1 <= p... (shortened)
lola: processed formula length: 407
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p6) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p44)))))
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 <= p6) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p44)))))
lola: processed formula length: 191
lola: 89 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 <= p6) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p35)) OR ((1 <= p6) AND (1 <= p37)) OR ((1 <= p6) AND (1 <= p36)) OR ((1 <= p6) AND (1 <= p44)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)))))
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 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)))))
lola: processed formula length: 346
lola: 89 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: formula 0: (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p54)) OR ((1 <=... (shortened)
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) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p54)) OR ((1 <=... (shortened)
lola: processed formula length: 548
lola: 89 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) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29)) OR ((1 <= p5) AND (1 <= p54)) OR ((1 <= p5) AND (1 <= p49)) OR ((1 <= p5) AND (1 <= p48)) OR ((1 <= p5) AND (1 <= p47)) OR ((1 <= p5) AND (1 <= p46)) OR ((1 <= p5) AND (1 <= p45))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 51 literals and 17 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to CTLFireability-6-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 7 will run for 445 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: 91 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: sara: try reading problem file CTLFireability-6-0.sara.
========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p8) AND (1 <= p12))))
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 (p12 <= 0))
lola: processed formula length: 26
lola: 91 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: ((1 <= p8) AND (1 <= p12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15)))))
lola: processed formula length: 284
lola: 90 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).
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 21 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((((1 <= p8) AND (1 <= p11)) U (1 <= p0))) OR (((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((E(((1 <= p8) AND (1 <= p11)) U (1 <= p0)) OR (((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0)))))
lola: processed formula length: 389
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11 markings, 21 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (A (F ((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15)))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF(EG(AF((((1 <= p7) AND (1 <= p20)) OR ((1 <= p7) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p18)) OR ((1 <= p7) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p21)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p7) AND (1 <= p15))))))
lola: processed formula length: 288
lola: 91 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: 43463 markings, 322197 edges
lola: ========================================
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G ((((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0))))) OR ((1 <= p2) AND ((p4 <= 0) OR ((1 <= p10) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG((((p7 <= 0) OR (p34 <= 0)) AND ((p7 <= 0) OR (p33 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p28 <= 0)) AND ((p7 <= 0) OR (p27 <= 0)) AND ((p7 <= 0) OR (p26 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p32 <= 0)) AND ((p7 <= 0) OR (p31 <= 0)) AND ((p7 <= 0) OR (p30 <= 0)) AND ((p7 <= 0) OR (p29 <= 0)))) OR ((1 <= p2) AND ((p4 <= 0) OR ((1 <= p10) AND (1 <... (shortened)
lola: processed formula length: 537
lola: 90 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 20 markings, 58 edges
lola: ========================================
lola: subprocess 13 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (((1 <= p1) U (1 <= p2))) U (E (G (((1 <= p8) AND (1 <= p12)))) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: processed formula: E(A((1 <= p1) U (1 <= p2)) U (EG(((1 <= p8) AND (1 <= p12))) AND (((1 <= p7) AND (1 <= p34)) OR ((1 <= p7) AND (1 <= p33)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p28)) OR ((1 <= p7) AND (1 <= p27)) OR ((1 <= p7) AND (1 <= p26)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p32)) OR ((1 <= p7) AND (1 <= p31)) OR ((1 <= p7) AND (1 <= p30)) OR ((1 <= p7) AND (1 <= p29... (shortened)
lola: processed formula length: 405
lola: 91 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: 43239 markings, 147521 edges
lola: ========================================
lola: subprocess 14 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((1 <= p8) AND (1 <= p11)) OR (1 <= p0)))))) OR ((1 <= p10) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND (1 <= p14))
lola: processed formula length: 27
lola: 88 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (F (E (G ((((1 <= p8) AND (1 <= p11)) OR (1 <= p0)))))) OR ((1 <= p10) AND (1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) AND (1 <= p14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p10) AND (1 <= p14))
lola: processed formula length: 27
lola: 88 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: ========================================
lola: ...considering subproblem: A (F (E (G ((((1 <= p8) AND (1 <= p11)) OR (1 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(EG((((1 <= p8) AND (1 <= p11)) OR (1 <= p0))))
lola: processed formula length: 50
lola: 90 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: 43462 markings, 59245 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes no no yes yes yes no no
lola:
preliminary result: no yes yes no no yes yes yes no no yes yes yes no no
lola: ========================================
lola: memory consumption: 72160 KB
lola: time consumption: 5 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-0010"
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-0010, 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-158987787300172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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