Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151500370.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is Philosophers-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151500370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.9K May 5 16:51 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 Philosophers-COL-000010-00
FORMULA_NAME Philosophers-COL-000010-01
FORMULA_NAME Philosophers-COL-000010-02
FORMULA_NAME Philosophers-COL-000010-03
FORMULA_NAME Philosophers-COL-000010-04
FORMULA_NAME Philosophers-COL-000010-05
FORMULA_NAME Philosophers-COL-000010-06
FORMULA_NAME Philosophers-COL-000010-07
FORMULA_NAME Philosophers-COL-000010-08
FORMULA_NAME Philosophers-COL-000010-09
FORMULA_NAME Philosophers-COL-000010-10
FORMULA_NAME Philosophers-COL-000010-11
FORMULA_NAME Philosophers-COL-000010-12
FORMULA_NAME Philosophers-COL-000010-13
FORMULA_NAME Philosophers-COL-000010-14
FORMULA_NAME Philosophers-COL-000010-15

=== Now, execution of the tool begins

BK_START 1621038683086

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 00:31:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-15 00:31:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 00:31:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-15 00:31:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 510 ms
[2021-05-15 00:31:25] [INFO ] sort/places :
Philo->Think,Fork,Catch1,Catch2,Eat,

[2021-05-15 00:31:25] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 13 ms.
[2021-05-15 00:31:25] [INFO ] Computed order based on color domains.
[2021-05-15 00:31:25] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions in 21 ms.
[2021-05-15 00:31:25] [INFO ] Unfolded HLPN properties in 1 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 671 resets, run finished after 317 ms. (steps per millisecond=315 ) properties seen :[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 50 rows 50 cols
[2021-05-15 00:31:25] [INFO ] Computed 20 place invariants in 5 ms
[2021-05-15 00:31:25] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-15 00:31:25] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-15 00:31:25] [INFO ] Flatten gal took : 50 ms
FORMULA Philosophers-COL-000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 00:31:25] [INFO ] Applying decomposition
[2021-05-15 00:31:25] [INFO ] Flatten gal took : 13 ms
[2021-05-15 00:31:25] [INFO ] Decomposing Gal with order
[2021-05-15 00:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 00:31:25] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-15 00:31:25] [INFO ] Flatten gal took : 39 ms
[2021-05-15 00:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2021-05-15 00:31:25] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-15 00:31:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ Philosophers-COL-000010 @ 3570 seconds

FORMULA Philosophers-COL-000010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ Philosophers-COL-000010

{
"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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 15 00:31:26 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 30,
"adisj": 3,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G (F ((F ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))) AND (X ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))) AND (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))))",
"processed_size": 971,
"rewrites": 305
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 40,
"adisj": 4,
"aneg": 4,
"comp": 80,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) R F ((((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0))) R (((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))) OR X ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))))))",
"processed_size": 1282,
"rewrites": 305
},
"result":
{
"edges": 69,
"markings": 53,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 2,
"aconj": 30,
"adisj": 3,
"aneg": 2,
"comp": 70,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 11,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(F ((F ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))) OR (X ((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p37)) OR ((1 <= p17) AND (1 <= p38)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32)))) OR (((1 <= p19) AND (1 <= p30)) OR (((1 <= p13) AND (1 <= p34)) OR (((1 <= p16) AND (1 <= p37)) OR (((1 <= p17) AND (1 <= p38)) OR (((1 <= p12) AND (1 <= p33)) OR (((1 <= p14) AND (1 <= p35)) OR (((1 <= p15) AND (1 <= p36)) OR (((1 <= p18) AND (1 <= p39)) OR (((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32)))))))))))))) U X (G (((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))))",
"processed_size": 1132,
"rewrites": 305
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (X (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))",
"processed_size": 319,
"rewrites": 305
},
"result":
{
"edges": 117,
"markings": 63,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 10,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))",
"processed_size": 317,
"rewrites": 322
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))",
"processed_size": 311,
"rewrites": 305
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"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": 1,
"adisj": 10,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))",
"processed_size": 307,
"rewrites": 305
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 11,
"adisj": 11,
"aneg": 0,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))))",
"processed_size": 633,
"rewrites": 305
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))",
"processed_size": 315,
"rewrites": 305
},
"result":
{
"edges": 210,
"markings": 89,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 1,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G (F ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))))",
"processed_size": 325,
"rewrites": 305
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))",
"processed_size": 311,
"rewrites": 305
},
"result":
{
"edges": 228,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 20,
"adisj": 1,
"aneg": 1,
"comp": 40,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 10,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "F ((F (G ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))) OR (((1 <= p19) AND (1 <= p30)) OR (((1 <= p13) AND (1 <= p34)) OR (((1 <= p16) AND (1 <= p37)) OR (((1 <= p17) AND (1 <= p38)) OR (((1 <= p12) AND (1 <= p33)) OR (((1 <= p14) AND (1 <= p35)) OR (((1 <= p15) AND (1 <= p36)) OR (((1 <= p18) AND (1 <= p39)) OR (((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32)))))))))))))",
"processed_size": 649,
"rewrites": 305
},
"result":
{
"edges": 44,
"markings": 24,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 13,
"adisj": 2,
"aneg": 3,
"comp": 50,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))) OR (G ((((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)) OR (((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))))) AND ((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))))",
"processed_size": 794,
"rewrites": 305
},
"result":
{
"edges": 4661,
"markings": 2013,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"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": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G (((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))",
"processed_size": 151,
"rewrites": 305
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))",
"processed_size": 311,
"rewrites": 305
},
"result":
{
"edges": 228,
"markings": 104,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 120088,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G(*) OR (G(*) AND *)))) : F((F(G(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) : G(F(*)) : G(F((F(**) AND (X(**) AND **)))) : G(**) : (* R F(((* R *) OR X(*)))) : (F((F(*) OR (X(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))) U X(G(*))) : X(X(G(**))) : (G(**) AND (G(**) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) : (F((X(F(*)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **))))))))))) AND (X(*) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **))))))))))) : F(G(**)) : ((X(**) U **) AND (G(**) OR **))"
},
"net":
{
"arcs": 160,
"conflict_clusters": 11,
"places": 50,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 50
},
"result":
{
"preliminary_value": "no no no no no no no no no no no no ",
"value": "no no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 100/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 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 LTLFireability.xml
lola: G (NOT(X (G (X ((F ((((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46)) AND (((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))))) U ((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))))))) : F (((((((((((NOT(G (F (X ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))) OR ((1 <= p19) AND (1 <= p30))) OR ((1 <= p13) AND (1 <= p34))) OR ((1 <= p16) AND (1 <= p37))) OR ((1 <= p17) AND (1 <= p38))) OR ((1 <= p12) AND (1 <= p33))) OR ((1 <= p14) AND (1 <= p35))) OR ((1 <= p15) AND (1 <= p36))) OR ((1 <= p18) AND (1 <= p39))) OR ((1 <= p10) AND (1 <= p31))) OR ((1 <= p11) AND (1 <= p32)))) : X (NOT(G (F (G ((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p37)) OR ((1 <= p17) AND (1 <= p38)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32)))))))) : F (X (G (X (G (F (((F ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))) AND X ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))))) AND (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))))))) : G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))) : NOT(((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28))) U G ((((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p37)) OR ((1 <= p17) AND (1 <= p38)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32))) U (((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))) AND X ((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p37)) OR ((1 <= p17) AND (1 <= p38)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32)))))))) : (F ((((((((((((NOT(G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))) OR X ((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16) AND (1 <= p37)) OR ((1 <= p17) AND (1 <= p38)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p14) AND (1 <= p35)) OR ((1 <= p15) AND (1 <= p36)) OR ((1 <= p18) AND (1 <= p39)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p11) AND (1 <= p32))))) OR ((1 <= p19) AND (1 <= p30))) OR ((1 <= p13) AND (1 <= p34))) OR ((1 <= p16) AND (1 <= p37))) OR ((1 <= p17) AND (1 <= p38))) OR ((1 <= p12) AND (1 <= p33))) OR ((1 <= p14) AND (1 <= p35))) OR ((1 <= p15) AND (1 <= p36))) OR ((1 <= p18) AND (1 <= p39))) OR ((1 <= p10) AND (1 <= p31))) OR ((1 <= p11) AND (1 <= p32)))) U G (X (NOT(F (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))))))) : X (G (X ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))) : (G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))) AND ((((((((((G (((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0))) OR ((1 <= p19) AND (1 <= p30))) OR ((1 <= p13) AND (1 <= p34))) OR ((1 <= p16) AND (1 <= p37))) OR ((1 <= p17) AND (1 <= p38))) OR ((1 <= p12) AND (1 <= p33))) OR ((1 <= p14) AND (1 <= p35))) OR ((1 <= p15) AND (1 <= p36))) OR ((1 <= p18) AND (1 <= p39))) OR ((1 <= p10) AND (1 <= p31))) OR ((1 <= p11) AND (1 <= p32)))) : (((((((((((F (((((((((((NOT(G (X ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))) OR ((1 <= p19) AND (1 <= p30))) OR ((1 <= p13) AND (1 <= p34))) OR ((1 <= p16) AND (1 <= p37))) OR ((1 <= p17) AND (1 <= p38))) OR ((1 <= p12) AND (1 <= p33))) OR ((1 <= p14) AND (1 <= p35))) OR ((1 <= p15) AND (1 <= p36))) OR ((1 <= p18) AND (1 <= p39))) OR ((1 <= p10) AND (1 <= p31))) OR ((1 <= p11) AND (1 <= p32)))) AND NOT(X ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))) AND ((p19 <= 0) OR (p30 <= 0))) AND ((p13 <= 0) OR (p34 <= 0))) AND ((p16 <= 0) OR (p37 <= 0))) AND ((p17 <= 0) OR (p38 <= 0))) AND ((p12 <= 0) OR (p33 <= 0))) AND ((p14 <= 0) OR (p35 <= 0))) AND ((p15 <= 0) OR (p36 <= 0))) AND ((p18 <= 0) OR (p39 <= 0))) AND ((p10 <= 0) OR (p31 <= 0))) AND ((p11 <= 0) OR (p32 <= 0))) : G (F (G (X (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))))) : ((X ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))) U (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))) AND (G ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))) OR (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))) AND (X ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR ((1 <= p19) AND (1 <= p29)) OR ((1 <= p13) AND (1 <= p23)) OR ((1 <= p17) AND (1 <= p27)) OR ((1 <= p10) AND (1 <= p20)) OR ((1 <= p12) AND (1 <= p22)) OR ((1 <= p14) AND (1 <= p24)) OR ((1 <= p16) AND (1 <= p26)) OR ((1 <= p18) AND (1 <= p28)))) AND (X ((((1 <= p11) AND (1 <= p21)) OR ((1 <= p15) AND (1 <= p25)) OR... (shortened)
lola: processed formula length: 971
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) R F ((((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR (p29 <= 0)) AND ((p13 <= 0) OR (p23 <= 0)) AND ((p17 <= 0) OR (p27 <= 0)) AND ((p10 <= 0) OR (p20 <= 0)) AND ((p12 <= 0) OR (p22 <= 0)) AND ((p14 <= 0) OR (p24 <= 0)) AND ((p16 <= 0) OR (p26 <= 0)) AND ((p18 <= 0) OR (p28 <= 0))) R F ((((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= ... (shortened)
lola: processed formula length: 1282
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 53 markings, 69 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))) OR (X ((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((F ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0)))) OR (X ((((1 <= p19) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p34)) OR ((1 <= p16)... (shortened)
lola: processed formula length: 1132
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18))))))
lola: processed formula length: 319
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 63 markings, 117 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (F ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))) OR (((1 <= p19) AND (1 <= p30)) OR (((1 <= p13) AND (1 <= p34)) OR (((1 <= p16)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p19 <= 0) OR (p30 <= 0)) AND (((p13 <= 0) OR (p34 <= 0)) AND (((p16 <= 0) OR (p37 <= 0)) AND (((p17 <= 0) OR (p38 <= 0)) AND (((p12 <= 0) OR (p33 <= 0)) AND (((p14 <= 0) OR (p35 <= 0)) AND (((p15 <= 0) OR (p36 <= 0)) AND (((p18 <= 0) OR (p39 <= 0)) AND (((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: (((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))
lola: processed formula length: 317
lola: 322 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 20 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))
lola: processed formula length: 311
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))) U (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p7 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p19 <= 0)) AND ((p6 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p18 <= 0)) AND ((p0 <= 0) OR (p10 <= 0)) AND ((p1 <= 0) OR (p11 <= 0)) AND ((p2 <= 0) OR (p12 <= 0)) AND ((p3 <= 0) OR (p13 <= 0)) AND ((p4 <= 0) OR (p14 <= 0)) AND ((p5 <= 0) OR (p15 <= 0)))
lola: processed formula length: 307
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 20 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND (((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AN... (shortened)
lola: processed formula length: 633
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((1 <= p3) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p19)) OR ((1 <= p1) AND (1 <= p10)) OR ((1 <= p5) AND (1 <= p14)) OR ((1 <= p2) AND (1 <= p11)) OR ((1 <= p4) AND (1 <= p13)) OR ((1 <= p6) AND (1 <= p15)) OR ((1 <= p7) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p18)))))
lola: processed formula length: 315
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 43
lola: add low 41
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 89 markings, 210 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p19 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p34 <= 0)) AND ((p16 <= 0) OR (p37 <= 0)) AND ((p17 <= 0) OR (p38 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p14 <= 0) OR (p35 <= 0)) AND ((p15 <= 0) OR (p36 <= 0)) AND ((p18 <= 0) OR (p39 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)))))
lola: processed formula length: 325
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))
lola: processed formula length: 311
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 104 markings, 228 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))) OR (((1 <= p19) AND (1 <= p30)) OR (((1 <= p13) AND (1 <= p34)) OR (((1 <= p16) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((p3 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p19 <= 0)) AND ((p1 <= 0) OR (p10 <= 0)) AND ((p5 <= 0) OR (p14 <= 0)) AND ((p2 <= 0) OR (p11 <= 0)) AND ((p4 <= 0) OR (p13 <= 0)) AND ((p6 <= 0) OR (p15 <= 0)) AND ((p7 <= 0) OR (p16 <= 0)) AND ((p8 <= 0) OR (p17 <= 0)) AND ((p9 <= 0) OR (p18 <= 0))))) OR (((1 <= p19) AND (1 <= p30)) OR (((1 <= p13) AND (1 <= p34)) OR (((1 <= p16) ... (shortened)
lola: processed formula length: 649
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 44 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))) OR (G ((((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)) OR (((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p49) OR (1 <= p48) OR (1 <= p41) OR (1 <= p40) OR (1 <= p43) OR (1 <= p42) OR (1 <= p45) OR (1 <= p44) OR (1 <= p47) OR (1 <= p46))) OR (G ((((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)) OR (((p11 <= 0) OR (p21 <= 0)) AND ((p15 <= 0) OR (p25 <= 0)) AND ((p19 <= 0) OR ... (shortened)
lola: processed formula length: 794
lola: 305 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 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 deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 19
lola: add low 48
lola: add low 39
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2013 markings, 4661 edges
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15)))) AND (G (((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p49 <= 0) AND (p48 <= 0) AND (p41 <= 0) AND (p40 <= 0) AND (p43 <= 0) AND (p42 <= 0) AND (p45 <= 0) AND (p44 <= 0) AND (p47 <= 0) AND (p46 <= 0)))
lola: processed formula length: 151
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p7) AND (1 <= p17)) OR ((1 <= p9) AND (1 <= p19)) OR ((1 <= p6) AND (1 <= p16)) OR ((1 <= p8) AND (1 <= p18)) OR ((1 <= p0) AND (1 <= p10)) OR ((1 <= p1) AND (1 <= p11)) OR ((1 <= p2) AND (1 <= p12)) OR ((1 <= p3) AND (1 <= p13)) OR ((1 <= p4) AND (1 <= p14)) OR ((1 <= p5) AND (1 <= p15))))
lola: processed formula length: 311
lola: 305 rewrites
lola: closed formula file LTLFireability.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 deletion algorithm (--stubborn=deletion)
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 net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 104 markings, 228 edges
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 no no no no
lola:
preliminary result: no no no no no no no no no no no no
lola: memory consumption: 120088 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="Philosophers-COL-000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is Philosophers-COL-000010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r151-tall-162089151500370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;