Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600236.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PhilosophersDyn-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 87K Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591137031485

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:30:33] [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-02 22:30:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:30:33] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-02 22:30:33] [INFO ] Transformed 30 places.
[2020-06-02 22:30:33] [INFO ] Transformed 84 transitions.
[2020-06-02 22:30:33] [INFO ] Parsed PT model containing 30 places and 84 transitions in 82 ms.
[2020-06-02 22:30:33] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:30:33] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:30:33] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:30:33] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Incomplete random walk after 100000 steps, including 14313 resets, run finished after 347 ms. (steps per millisecond=288 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1]
[2020-06-02 22:30:33] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-06-02 22:30:33] [INFO ] Computed 11 place invariants in 4 ms
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned unsat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-02 22:30:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-02 22:30:33] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2020-06-02 22:30:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:30:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:33] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2020-06-02 22:30:33] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 9 ms.
[2020-06-02 22:30:33] [INFO ] Added : 36 causal constraints over 8 iterations in 100 ms. Result :sat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 11 ms returned sat
[2020-06-02 22:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:33] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Added 36 Read/Feed constraints in 4 ms returned sat
[2020-06-02 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-06-02 22:30:34] [INFO ] Deduced a trap composed of 14 places in 33 ms
[2020-06-02 22:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2020-06-02 22:30:34] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2020-06-02 22:30:34] [INFO ] Added : 42 causal constraints over 9 iterations in 108 ms. Result :sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-06-02 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2020-06-02 22:30:34] [INFO ] Added : 36 causal constraints over 8 iterations in 84 ms. Result :sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Added 36 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 8 ms.
[2020-06-02 22:30:34] [INFO ] Added : 33 causal constraints over 7 iterations in 75 ms. Result :sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2020-06-02 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 22:30:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] Computed and/alt/rep : 78/1419/54 causal constraints in 6 ms.
[2020-06-02 22:30:34] [INFO ] Added : 29 causal constraints over 6 iterations in 59 ms. Result :sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:30:34] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
[2020-06-02 22:30:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 22:30:34] [INFO ] Flatten gal took : 40 ms
[2020-06-02 22:30:34] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2020-06-02 22:30:34] [INFO ] Flatten gal took : 14 ms
FORMULA PhilosophersDyn-PT-03-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:30:34] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2020-06-02 22:30:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ PhilosophersDyn-PT-03 @ 3570 seconds

FORMULA PhilosophersDyn-PT-03-CTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-CTLFireability-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for CTLFireability @ PhilosophersDyn-PT-03

{
"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": "Tue Jun 2 22:30:35 2020
",
"timelimit": 3570
},
"child":
[

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

{
"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": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))",
"processed_size": 91,
"rewrites": 37
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AX((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))",
"processed_size": 413,
"rewrites": 35
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 13,
"adisj": 2,
"aneg": 0,
"comp": 33,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "EG(EX(((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) AND (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))))",
"processed_size": 515,
"rewrites": 36
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 27,
"adisj": 1,
"aneg": 0,
"comp": 99,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 99,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "AX((((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p25)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR ((1 <= p8) AND (2 <= p14) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p19) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p28)) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p28)) OR ((2 <= p4) AND (1 <= p8) AND (1 <= p16)) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p29)) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p29)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p14) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p25) AND (1 <= p29))))",
"processed_size": 1510,
"rewrites": 35
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 12,
"adisj": 1,
"aneg": 1,
"comp": 33,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))",
"processed_size": 503,
"rewrites": 37
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 78
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 33,
"problems": 12
},
"type": "invariance_from_all_successors",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 27,
"aneg": 2,
"comp": 102,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 102,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25))) R (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))",
"processed_size": 1551,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 78
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 24,
"problems": 8
},
"type": "existential_release",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 12,
"adisj": 2,
"aneg": 0,
"comp": 36,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "AF(((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR (p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND EX((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19))))))",
"processed_size": 565,
"rewrites": 36
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 7,
"markings": 8,
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 13,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "((((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p29))) AND ((p14 <= 1) OR (p15 <= 0) OR (p29 <= 0) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29))))",
"processed_size": 199,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 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": "(p25 <= 0)",
"processed_size": 10,
"rewrites": 34
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "EX(((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)))",
"processed_size": 60,
"rewrites": 35
},
"net":
{
"conflict_clusters": 1,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": true
},
"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": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "E (G (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 1))))",
"processed_size": 48,
"rewrites": 35
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 50
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (G (((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0))))",
"processed_size": 49,
"rewrites": 35
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 44
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))",
"processed_size": 91,
"rewrites": 37
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 3
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))",
"processed_size": 409,
"rewrites": 37
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 27,
"problems": 9
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 78,
"adisj": 6,
"aneg": 0,
"comp": 267,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 267,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "(F (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25))) AND (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))) U ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) AND (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR (((1 <= p3) OR (1 <= p7) OR (1 <= p10)) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))",
"processed_size": 4074,
"rewrites": 36
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "universal single path",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))",
"processed_size": 409,
"rewrites": 37
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 27,
"problems": 9
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 9,
"adisj": 1,
"aneg": 1,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "(((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))",
"processed_size": 409,
"rewrites": 37
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 27,
"problems": 9
},
"type": "eventual_occurrence",
"workflow": "stateequation"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "E (G ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))",
"processed_size": 463,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"type": "possible_preservation",
"workflow": "stateequation"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 190780,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((A(F(**)) U **)) : (E(G(**)) OR (E(F(**)) AND (A(F(**)) AND (** AND **)))) : (E((* R *)) OR A(F((** AND E(X(**)))))) : (E(G(E(X(**)))) OR (A(F(**)) OR A(X(**)))) : (A(X(A(F(**)))) AND A(X(**))) : A(F(**)) : A(F(**)) : DEADLOCK : ((A(G(**)) OR (** OR (** OR (** OR (** OR (** AND E(X(**)))))))) AND (E(X(*)) OR **)) : E(G(*)) : E(G(**))"
},
"net":
{
"arcs": 534,
"conflict_clusters": 1,
"places": 30,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no no no no no no no yes yes yes ",
"value": "no no no no no no no no yes yes 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: 111/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 81 transitions, 19 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLFireability.xml
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: A ((A (F (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25))) AND (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))) U ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) AND (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR (((1 <= p3) OR (1 <= p7) OR (1 <= p10)) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))) : (E (G ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) OR (((E (F ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29))))) AND A (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0))))) AND ((((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0))) OR (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p19 <= 0)))))) : (NOT(A (((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0))) U (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))))) OR A (F (((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR (p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND E (X ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19))))))))) : ((E (G (E (X (((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) AND (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))))) OR A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))) OR A (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) : A (X ((A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) AND (((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p25)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR ((1 <= p8) AND (2 <= p14) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p19) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p25) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p12) AND (1 <= p19) AND (1 <= p29)) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p28)) OR ((1 <= p6) AND (2 <= p12) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p28)) OR ((2 <= p4) AND (1 <= p8) AND (1 <= p16)) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p28)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p14) AND (1 <= p27) AND (1 <= p29)) OR ((2 <= p14) AND (1 <= p15) AND (1 <= p29)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p29)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p28)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p14) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p14) AND (1 <= p25) AND (1 <= p29)))))) : A (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) : A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12))))) : A (X ((((E (G ((1 <= 0))) AND (1 <= p4)) AND (1 <= p24)) AND ((p8 <= 0) OR (p12 <= 0) OR (p19 <= 0))))) : ((((((E (G (A (G (((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p29)))))) OR (p7 <= 0)) OR (p12 <= 0)) OR (p19 <= 0)) OR (p25 <= 0)) OR (((2 <= p4) AND (1 <= p16) AND (1 <= p29) AND (1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) AND E (X (((1 <= p16) AND (1 <= p18) AND (1 <= p23)))))) AND (NOT(A (X (((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25))))) OR ((((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p29))) AND ((p14 <= 1) OR (p15 <= 0) OR (p29 <= 0) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) : NOT(A ((((p14 <= 1) OR (p15 <= 0) OR (p28 <= 0)) U A (F (((1 <= p6) AND (1 <= p8) AND (2 <= p12))))))) : E (G (((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k: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:551
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:476
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X (((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))
lola: processed formula length: 91
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND ... (shortened)
lola: processed formula length: 413
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) ... (shortened)
lola: processed formula length: 515
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p25)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR ((1 <= p8) AND (2 <= p14) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR ((2 <= p4) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p4) AND (1 <= p8) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p8) AND (1 <= p12) AND (1 <= p14) AND (1 <= p25)) OR ((2 <= p4) AND (1 <= p16) AND (1 <= p28)) OR ((1 <= p8) AND (2 <= p14) AND (1 <= p15)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p8) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p8) AND (2 <= p12)) OR ((2 <= p4) AND (1 ... (shortened)
lola: processed formula length: 1510
lola: 35 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR ... (shortened)
lola: processed formula length: 503
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: formula 0: (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))
lola: The predicate does not eventually occur from all successors.
lola: 5 markings, 4 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 33 literals and 12 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:576
lola: rewrite Frontend/Parser/formula_rewrite.k:736
lola: rewrite Frontend/Parser/formula_rewrite.k:696
lola: processed formula: E (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND ... (shortened)
lola: processed formula length: 1551
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: 0
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: state equation task get result unparse finished++ id 0
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: formula 0: (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))
lola: 0 markings, 0 edges
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR (p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND E (X ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AN... (shortened)
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 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)) OR (p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND EX((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <... (shortened)
lola: processed formula length: 565
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G (((1 <= p12) AND (1 <= p14) AND (1 <= p17) AND (1 <= p29)))) OR ((p7 <= 0) OR ((p12 <= 0) OR ((p19 <= 0) OR ((p25 <= 0) OR (((2 <= p4) AND (1 <= p16) AND (1 <= p29) AND (1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) AND E (X (((1 <= p16) AND (1 <= p18) AND (1 <= p23)))))))))) AND (E (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)))) OR ((((1 <= p14) AND (1 <= p15) AND (... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p29))) AND ((p14 <= 1) OR (p15 <= 0) OR (p29 <= 0) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p12) AND (1 <= p29))) AND ((p14 <= 1) OR (p15 <= 0) OR (p29 <= 0) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29))))
lola: processed formula length: 199
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 13 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p25 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p25 <= 0)
lola: processed formula length: 10
lola: 34 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 1 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 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: processed formula: EX(((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)))
lola: processed formula length: 60
lola: 35 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p6 <= 0) OR (p8 <= 0) OR (p12 <= 1))))
lola: processed formula length: 48
lola: 35 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 <= p6) AND (1 <= p8) AND (2 <= p12))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G (((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0))))
lola: processed formula length: 49
lola: 35 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 5 markings, 4 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p5) AND (1 <= p14) AND (1 <= p22))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p4 <= 0) OR (p24 <= 0)) AND ((p14 <= 0) OR (p20 <= 0)) AND ((p1 <= 0) OR (p12 <= 0)))
lola: processed formula length: 91
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p4) AND (1 <= p24)) OR ((1 <= p14) AND (1 <= p20)) OR ((1 <= p1) AND (1 <= p12)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p1... (shortened)
lola: processed formula length: 409
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a universal CTL formula with single counterexample path (use LTL...)
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: rewrite Frontend/Parser/formula_rewrite.k:679
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND... (shortened)
lola: processed formula length: 4074
lola: 36 rewrites
lola: closed formula file CTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The universal single path CTL formula does not hold.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p1... (shortened)
lola: processed formula length: 409
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate does not eventually occur.
lola: 7 markings, 6 edges
lola: formula 0: (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p1... (shortened)
lola: processed formula length: 409
lola: 37 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: formula 0: (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))
lola: The predicate does not eventually occur.
lola: state equation task get result unparse finished id 0
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) OR ((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) ... (shortened)
lola: processed formula length: 463
lola: 35 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: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: formula 0: (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)) AND ((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes yes yes
lola:
preliminary result: no no no no no no no no yes yes yes
lola: memory consumption: 190780 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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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 r176-tajo-158987871600236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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