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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 6.4K Mar 24 10:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 24 10:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 24 09:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Mar 24 09:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.6K Apr 8 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 29 06:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 29 06:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 24 07:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 24 07:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Mar 24 06:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 24 06:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 24 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Mar 24 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 90K 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-PT-0010-CTLFireability-00
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-01
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-02
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-03
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-04
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-05
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-06
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-07
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-08
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-09
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-10
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-11
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-12
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-13
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-14
FORMULA_NAME AirplaneLD-PT-0010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591372762123

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 15:59:25] [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 15:59:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 15:59:25] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2020-06-05 15:59:25] [INFO ] Transformed 89 places.
[2020-06-05 15:59:25] [INFO ] Transformed 88 transitions.
[2020-06-05 15:59:25] [INFO ] Found NUPN structural information;
[2020-06-05 15:59:25] [INFO ] Parsed PT model containing 89 places and 88 transitions in 151 ms.
Reduce places removed 32 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Incomplete random walk after 100000 steps, including 12535 resets, run finished after 693 ms. (steps per millisecond=144 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 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, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 88 rows 57 cols
[2020-06-05 15:59:26] [INFO ] Computed 3 place invariants in 12 ms
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-05 15:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using state equation in 97 ms returned unsat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-05 15:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using state equation in 60 ms returned unsat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned unsat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned unsat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-05 15:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 15:59:26] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-05 15:59:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 15:59:27] [INFO ] Flatten gal took : 79 ms
[2020-06-05 15:59:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-05 15:59:27] [INFO ] Flatten gal took : 27 ms
FORMULA AirplaneLD-PT-0010-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 15:59:27] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2020-06-05 15:59:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ AirplaneLD-PT-0010 @ 3570 seconds

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

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

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

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

FORMULA AirplaneLD-PT-0010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AirplaneLD-PT-0010-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

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

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

FORMULA AirplaneLD-PT-0010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ AirplaneLD-PT-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 15:59:28 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 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49)))",
"processed_size": 125,
"rewrites": 97
},
"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": 1,
"adisj": 1,
"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": "(((p22 <= 0)))",
"processed_size": 14,
"rewrites": 99
},
"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": 1,
"adisj": 1,
"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 ((((p43 <= 0)))))",
"processed_size": 22,
"rewrites": 98
},
"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": "((p48 <= 0) OR (p56 <= 0))",
"processed_size": 27,
"rewrites": 97
},
"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": 1,
"adisj": 1,
"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((((p0 <= 0))))",
"processed_size": 17,
"rewrites": 98
},
"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": 2,
"adisj": 2,
"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 <= p46)))) AND AG((((1 <= p22))))))",
"processed_size": 47,
"rewrites": 100
},
"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": 17,
"adisj": 9,
"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 <= p47) AND (1 <= p56)) OR ((1 <= p11))) OR ((1 <= p25) AND (1 <= p54)) OR ((1 <= p31) AND (1 <= p54)) OR ((1 <= p24) AND (1 <= p54)) OR ((1 <= p29) AND (1 <= p54)) OR ((1 <= p26) AND (1 <= p54)) OR ((1 <= p27) AND (1 <= p54)) OR ((1 <= p30) AND (1 <= p54)) OR ((1 <= p28) AND (1 <= p54)) OR ((1 <= p23) AND (1 <= p54)) OR ((1 <= p11) AND ((p0 <= 0))) OR (((p1 <= 0) OR (p53 <= 0)) AND ((p4 <= 0) OR (p53 <= 0)) AND ((p10 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p53 <= 0)) AND ((p2 <= 0) OR (p53 <= 0)) AND ((p3 <= 0) OR (p53 <= 0)) AND (((1 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49)))))",
"processed_size": 677,
"rewrites": 118
},
"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((((p19 <= 0) OR (p49 <= 0)) AND ((p20 <= 0) OR (p49 <= 0)) AND ((p18 <= 0) OR (p49 <= 0)) AND ((p17 <= 0) OR (p49 <= 0)))))",
"processed_size": 133,
"rewrites": 99
},
"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": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "AX((((1 <= p36) AND (1 <= p54)) OR ((1 <= p44) AND (1 <= p55)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))))",
"processed_size": 128,
"rewrites": 98
},
"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": 1,
"E": 2,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EF((AX(((1 <= p8) AND (1 <= p53))) AND EX(((1 <= p17) AND (1 <= p49)))))",
"processed_size": 72,
"rewrites": 100
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 183664,
"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": 3,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((((1 <= p22)) OR ((1 <= p11))) AND (((1 <= p22)) OR ((1 <= p11))))",
"processed_size": 69,
"rewrites": 98
},
"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": 1,
"F": 0,
"G": 1,
"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": "E (G (((1 <= p6) AND (1 <= p53))))",
"processed_size": 34,
"rewrites": 98
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 22
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": "A ((((p22 <= 0)) R ((p11 <= 0))))",
"processed_size": 33,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EU",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "universal_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "AX(((1 <= p48) AND (1 <= p56)))",
"processed_size": 31,
"rewrites": 98
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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 <= p9) AND (1 <= p53))",
"processed_size": 26,
"rewrites": 97
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AF((((1 <= p40) AND (1 <= p54)) AND EX(((p45 <= 0) OR (p55 <= 0)))))",
"processed_size": 69,
"rewrites": 99
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"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 <= p1) AND (1 <= p53)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p10) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p2) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p53)))))",
"processed_size": 192,
"rewrites": 98
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 713
},
"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": "((p44 <= 0) OR (p55 <= 0))",
"processed_size": 27,
"rewrites": 100
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "EG((((p23 <= 0) OR (p54 <= 0)) OR AG(((p11 <= 0)))))",
"processed_size": 53,
"rewrites": 99
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "CTL model checker",
"value": true
},
"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": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 12,
"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 <= p44) AND (1 <= p55)) U (((1 <= p11)))) OR (((p36 <= 0) OR (p54 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p54 <= 0)) AND ((p32 <= 0) OR (p54 <= 0)) AND ((p39 <= 0) OR (p54 <= 0)) AND ((p34 <= 0) OR (p54 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p35 <= 0) OR (p54 <= 0)) AND ((p40 <= 0) OR (p54 <= 0)) AND ((p38 <= 0) OR (p54 <= 0)) AND ((p37 <= 0) OR (p54 <= 0)))))",
"processed_size": 406,
"rewrites": 99
},
"net":
{
"conflict_clusters": 13,
"singleton_clusters": 0
},
"result":
{
"edges": 21,
"markings": 11,
"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": 14,
"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 <= p0)) U ((1 <= p22))) U (EG(((1 <= p45) AND (1 <= p55))) AND (((1 <= p36) AND (1 <= p54)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p54)) OR ((1 <= p32) AND (1 <= p54)) OR ((1 <= p39) AND (1 <= p54)) OR ((1 <= p34) AND (1 <= p54)) OR ((1 <= p33) AND (1 <= p54)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p40) AND (1 <= p54)) OR ((1 <= p38) AND (1 <= p54)) OR ((1 <= p37) AND (1 <= p54)))))",
"processed_size": 422,
"rewrites": 100
},
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(((p40 <= 0) OR (p54 <= 0)) AND ((p43 <= 0)))",
"processed_size": 46,
"rewrites": 100
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "state space /EGEF",
"value": true
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "possible_preservation_of_reachability",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 98204,
"runtime": 4.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(**)) : A(G(**)) : (A(X(**)) OR E(F((A(X(**)) AND E(X(**)))))) : E(G((* OR A(G(*))))) : (A(G(**)) OR (A(X(**)) OR (A((* R *)) OR (E(G(**)) AND (** AND **))))) : (A(X(E(F(**)))) OR **) : A(F((* AND E(X(*))))) : E(G(E(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 no no no yes ",
"value": "no yes yes no no yes yes yes no no yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p49 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p0 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: A (F (((1 <= p44) AND (1 <= p55)))) : (E (((1 <= 0) U (((1 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49))))) OR NOT(A (X (A (F ((((1 <= p22))))))))) : E (G ((E ((((1 <= p44) AND (1 <= p55)) U (((1 <= p11))))) OR (((p36 <= 0) OR (p54 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p54 <= 0)) AND ((p32 <= 0) OR (p54 <= 0)) AND ((p39 <= 0) OR (p54 <= 0)) AND ((p34 <= 0) OR (p54 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p35 <= 0) OR (p54 <= 0)) AND ((p40 <= 0) OR (p54 <= 0)) AND ((p38 <= 0) OR (p54 <= 0)) AND ((p37 <= 0) OR (p54 <= 0)))))) : (E (F ((A (X ((((1 <= p46))))) AND A (G ((((1 <= p22)))))))) OR (((p48 <= 0) OR (p56 <= 0)) AND (NOT(E (X ((((1 <= p0)))))) OR NOT(A (F ((((1 <= p43))))))))) : E ((A ((((1 <= p0)) U ((1 <= p22)))) U (E (G (((1 <= p45) AND (1 <= p55)))) AND (((1 <= p36) AND (1 <= p54)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p54)) OR ((1 <= p32) AND (1 <= p54)) OR ((1 <= p39) AND (1 <= p54)) OR ((1 <= p34) AND (1 <= p54)) OR ((1 <= p33) AND (1 <= p54)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p40) AND (1 <= p54)) OR ((1 <= p38) AND (1 <= p54)) OR ((1 <= p37) AND (1 <= p54)))))) : (E (X (A (G ((((p19 <= 0) OR (p49 <= 0)) AND ((p20 <= 0) OR (p49 <= 0)) AND ((p18 <= 0) OR (p49 <= 0)) AND ((p17 <= 0) OR (p49 <= 0))))))) AND (((((((((((A (((1 <= 0) U (((1 <= p47) AND (1 <= p56)) OR ((1 <= p11))))) OR ((1 <= p25) AND (1 <= p54))) OR ((1 <= p31) AND (1 <= p54))) OR ((1 <= p24) AND (1 <= p54))) OR ((1 <= p29) AND (1 <= p54))) OR ((1 <= p26) AND (1 <= p54))) OR ((1 <= p27) AND (1 <= p54))) OR ((1 <= p30) AND (1 <= p54))) OR ((1 <= p28) AND (1 <= p54))) OR ((1 <= p23) AND (1 <= p54))) OR ((1 <= p11) AND ((p0 <= 0)))) OR (((p1 <= 0) OR (p53 <= 0)) AND ((p4 <= 0) OR (p53 <= 0)) AND ((p10 <= 0) OR (p53 <= 0)) AND ((p5 <= 0) OR (p53 <= 0)) AND ((p2 <= 0) OR (p53 <= 0)) AND ((p3 <= 0) OR (p53 <= 0)) AND (((1 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49)))))) : E (F ((((1 <= p1) AND (1 <= p53)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p10) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p2) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p53))))) : A (F (E (F (((1 <= p37) AND (1 <= p54)))))) : A (G (A (G (((p31 <= 0) OR (p54 <= 0)))))) : (A (X ((((1 <= p36) AND (1 <= p54)) OR ((1 <= p44) AND (1 <= p55)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))))) OR E (F ((A (X (((1 <= p8) AND (1 <= p53)))) AND E (X (((1 <= p17) AND (1 <= p49)))))))) : NOT(A (F ((((1 <= p23) AND (1 <= p54)) AND E (F (((1 <= p11)))))))) : (((A (G (((1 <= p0)))) OR A (X (((1 <= p48) AND (1 <= p56))))) OR NOT(E ((((1 <= p22)) U ((1 <= p11)))))) OR ((E (G (((1 <= p6) AND (1 <= p53)))) AND (((1 <= p22)) OR ((1 <= p11)))) AND (((1 <= p22)) OR ((1 <= p11))))) : (A (X (E (F (((1 <= p11)))))) OR ((1 <= p9) AND (1 <= p53))) : NOT(E (G ((((p40 <= 0) OR (p54 <= 0)) OR A (X (((1 <= p45) AND (1 <= p55)))))))) : E (G (NOT(A (G ((((1 <= p40) AND (1 <= p54)) OR ((1 <= p43))))))))
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:449
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49))) OR E (X (E (G ((((p22 <= 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 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= p19) AND (1 <= p49)) OR ((1 <= p20) AND (1 <= p49)) OR ((1 <= p18) AND (1 <= p49)) OR ((1 <= p17) AND (1 <= p49)))
lola: processed formula length: 125
lola: 97 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 ((((p22 <= 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: (((p22 <= 0)))
lola: processed formula length: 14
lola: 99 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: (((p22 <= 0)))
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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 <= p46))))) AND A (G ((((1 <= p22)))))))) OR (((p48 <= 0) OR (p56 <= 0)) AND (A (X ((((p0 <= 0))))) OR E (G ((((p43 <= 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 ((((p43 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((p43 <= 0)))))
lola: processed formula length: 22
lola: 98 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 <= p43)))
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: ((p48 <= 0) OR (p56 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p48 <= 0) OR (p56 <= 0))
lola: processed formula length: 27
lola: 97 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 ((((p0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((p0 <= 0))))
lola: processed formula length: 17
lola: 98 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 <= p46))))) AND A (G ((((1 <= p22))))))))
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 <= p46)))) AND AG((((1 <= p22))))))
lola: processed formula length: 47
lola: 100 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 ((((p19 <= 0) OR (p49 <= 0)) AND ((p20 <= 0) OR (p49 <= 0)) AND ((p18 <= 0) OR (p49 <= 0)) AND ((p17 <= 0) OR (p49 <= 0))))))) AND ((((1 <= p47) AND (1 <= p56)) OR ((1 <= p11))) OR (((1 <= p25) AND (1 <= p54)) OR (((1 <= p31) AND (1 <= p54)) OR (((1 <= p24) AND (1 <= p54)) OR (((1 <= p29) AND (1 <= p54)) OR (((1 <= p26) AND (1 <= p54)) OR (((1 <= p27) AND (1 <= p54)) OR (((1 <= p3... (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 <= p47) AND (1 <= p56)) OR ((1 <= p11))) OR (((1 <= p25) AND (1 <= p54)) OR (((1 <= p31) AND (1 <= p54)) OR (((1 <= p24) AND (1 <= p54)) OR (((1 <= p29) AND (1 <= p54)) OR (((1 <= p26) AND (1 <= p54)) OR (((1 <= p27) AND (1 <= p54)) OR (((1 <= p30) AND (1 <= p54)) OR (((1 <= p28) AND (1 <= p54)) OR (((1 <= p23) AND (1 <= p54)) OR (((1 <= p11) AND ((p0 <= 0))) OR (((p1 <= 0) OR (p53 <= 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 <= p47) AND (1 <= p56)) OR ((1 <= p11))) OR ((1 <= p25) AND (1 <= p54)) OR ((1 <= p31) AND (1 <= p54)) OR ((1 <= p24) AND (1 <= p54)) OR ((1 <= p29) AND (1 <= p54)) OR ((1 <= p26) AND (1 <= p54)) OR ((1 <= p27) AND (1 <= p54)) OR ((1 <= p30) AND (1 <= p54)) OR ((1 <= p28) AND (1 <= p54)) OR ((1 <= p23) AND (1 <= p54)) OR ((1 <= p11) AND ((p0 <= 0))) OR (((p1 <= 0) OR (p53 <= 0)) AND ((p4 <... (shortened)
lola: processed formula length: 677
lola: 118 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 ((((p19 <= 0) OR (p49 <= 0)) AND ((p20 <= 0) OR (p49 <= 0)) AND ((p18 <= 0) OR (p49 <= 0)) AND ((p17 <= 0) OR (p49 <= 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((((p19 <= 0) OR (p49 <= 0)) AND ((p20 <= 0) OR (p49 <= 0)) AND ((p18 <= 0) OR (p49 <= 0)) AND ((p17 <= 0) OR (p49 <= 0)))))
lola: processed formula length: 133
lola: 99 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: (A (X ((((1 <= p36) AND (1 <= p54)) OR ((1 <= p44) AND (1 <= p55)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))))) OR E (F ((A (X (((1 <= p8) AND (1 <= p53)))) AND E (X (((1 <= p17) AND (1 <= p49))))))))
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: A (X ((((1 <= p36) AND (1 <= p54)) OR ((1 <= p44) AND (1 <= p55)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p36) AND (1 <= p54)) OR ((1 <= p44) AND (1 <= p55)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p7) AND (1 <= p53))))
lola: processed formula length: 128
lola: 98 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 <= p8) AND (1 <= p53)))) AND E (X (((1 <= p17) AND (1 <= p49)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: processed formula: EF((AX(((1 <= p8) AND (1 <= p53))) AND EX(((1 <= p17) AND (1 <= p49)))))
lola: processed formula length: 72
lola: 100 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43463 markings, 183664 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (((1 <= p0)))) OR (A (X (((1 <= p48) AND (1 <= p56)))) OR (A ((((p22 <= 0)) R ((p11 <= 0)))) OR (E (G (((1 <= p6) AND (1 <= p53)))) AND ((((1 <= p22)) OR ((1 <= p11))) AND (((1 <= p22)) OR ((1 <= p11))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((1 <= p0))))
lola: processed formula length: 19
lola: 99 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p0 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p22)) OR ((1 <= p11))) AND (((1 <= p22)) OR ((1 <= p11))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((((1 <= p22)) OR ((1 <= p11))) AND (((1 <= p22)) OR ((1 <= p11))))
lola: processed formula length: 69
lola: 98 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 4 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: E (G (((1 <= p6) AND (1 <= p53))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((1 <= p6) AND (1 <= p53))))
lola: processed formula length: 34
lola: 98 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p6 <= 0) OR (p53 <= 0))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 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 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p22 <= 0)) R ((p11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:619
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:693
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A ((((p22 <= 0)) R ((p11 <= 0))))
lola: processed formula length: 33
lola: 102 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: 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 <= p11))
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 /EU
lola: Predicate Phi does not release Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p48) AND (1 <= p56))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p48) AND (1 <= p56)))
lola: processed formula length: 31
lola: 98 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F (((1 <= p11)))))) OR ((1 <= p9) AND (1 <= p53)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p9) AND (1 <= p53))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p9) AND (1 <= p53))
lola: processed formula length: 26
lola: 97 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EF(((1 <= p11))))
lola: processed formula length: 20
lola: 99 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3976 markings, 13129 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p40) AND (1 <= p54)) AND E (X (((p45 <= 0) OR (p55 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF((((1 <= p40) AND (1 <= p54)) AND EX(((p45 <= 0) OR (p55 <= 0)))))
lola: processed formula length: 69
lola: 99 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p37) AND (1 <= p54))))
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 <= p37) AND (1 <= p54))))
lola: processed formula length: 35
lola: 98 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 <= p37) AND (1 <= p54))
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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p31 <= 0) OR (p54 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p31 <= 0) OR (p54 <= 0))))
lola: processed formula length: 35
lola: 99 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p31) AND (1 <= p54))
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
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1) AND (1 <= p53)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p10) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p2) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p53)))))
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 <= p53)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p10) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p2) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p53)))))
lola: processed formula length: 192
lola: 98 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 <= p53)) OR ((1 <= p4) AND (1 <= p53)) OR ((1 <= p10) AND (1 <= p53)) OR ((1 <= p5) AND (1 <= p53)) OR ((1 <= p2) AND (1 <= p53)) OR ((1 <= p3) AND (1 <= p53)))
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 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p44) AND (1 <= p55))))
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: ((p44 <= 0) OR (p55 <= 0))
lola: processed formula length: 27
lola: 100 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 8 edges
lola: formula 0: ((1 <= p44) AND (1 <= p55))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((p23 <= 0) OR (p54 <= 0)) OR A (G (((p11 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((((p23 <= 0) OR (p54 <= 0)) OR AG(((p11 <= 0)))))
lola: processed formula length: 53
lola: 99 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, 10 edges
lola: ========================================
lola: subprocess 12 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E ((((1 <= p44) AND (1 <= p55)) U (((1 <= p11))))) OR (((p36 <= 0) OR (p54 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p54 <= 0)) AND ((p32 <= 0) OR (p54 <= 0)) AND ((p39 <= 0) OR (p54 <= 0)) AND ((p34 <= 0) OR (p54 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p35 <= 0) OR (p54 <= 0)) AND ((p40 <= 0) OR (p54 <= 0)) AND ((p38 <= 0) OR (p54 <= 0)) AND ((p37 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((E(((1 <= p44) AND (1 <= p55)) U (((1 <= p11)))) OR (((p36 <= 0) OR (p54 <= 0)) AND ((p41 <= 0) OR (p54 <= 0)) AND ((p42 <= 0) OR (p54 <= 0)) AND ((p32 <= 0) OR (p54 <= 0)) AND ((p39 <= 0) OR (p54 <= 0)) AND ((p34 <= 0) OR (p54 <= 0)) AND ((p33 <= 0) OR (p54 <= 0)) AND ((p35 <= 0) OR (p54 <= 0)) AND ((p40 <= 0) OR (p54 <= 0)) AND ((p38 <= 0) OR (p54 <= 0)) AND ((p37 <= 0) OR (p54 <= ... (shortened)
lola: processed formula length: 406
lola: 99 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 13 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A ((((1 <= p0)) U ((1 <= p22)))) U (E (G (((1 <= p45) AND (1 <= p55)))) AND (((1 <= p36) AND (1 <= p54)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p54)) OR ((1 <= p32) AND (1 <= p54)) OR ((1 <= p39) AND (1 <= p54)) OR ((1 <= p34) AND (1 <= p54)) OR ((1 <= p33) AND (1 <= p54)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p40) AND (1 <= p54)) OR ((1 <= p38) AND (1 <= p54)) OR ... (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 <= p0)) U ((1 <= p22))) U (EG(((1 <= p45) AND (1 <= p55))) AND (((1 <= p36) AND (1 <= p54)) OR ((1 <= p41) AND (1 <= p54)) OR ((1 <= p42) AND (1 <= p54)) OR ((1 <= p32) AND (1 <= p54)) OR ((1 <= p39) AND (1 <= p54)) OR ((1 <= p34) AND (1 <= p54)) OR ((1 <= p33) AND (1 <= p54)) OR ((1 <= p35) AND (1 <= p54)) OR ((1 <= p40) AND (1 <= p54)) OR ((1 <= p38) AND (1 <= p54)) OR ((1 <= p... (shortened)
lola: processed formula length: 422
lola: 100 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 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((((p40 <= 0) OR (p54 <= 0)) AND ((p43 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:593
lola: rewrite Frontend/Parser/formula_rewrite.k:628
lola: rewrite Frontend/Parser/formula_rewrite.k:731
lola: processed formula: (((p40 <= 0) OR (p54 <= 0)) AND ((p43 <= 0)))
lola: processed formula length: 46
lola: 100 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 /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (((p40 <= 0) OR (p54 <= 0)) AND ((p43 <= 0)))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation task get result unparse finished++ id 0
lola: Reachability of the predicate is possibly preserved.
lola: 11 markings, 10 edges
lola: formula 0: (((1 <= p40) AND (1 <= p54)) OR ((1 <= p43)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes no no yes no no no yes
lola:
preliminary result: no yes yes no no yes yes yes no no yes no no no yes
lola: ========================================
lola: memory consumption: 98204 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-PT-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-PT-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-158987787400244"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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