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.r132-tall-162075428500330.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 LamportFastMutEx-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428500330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 51K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 285K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 476K 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.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.9K Apr 26 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 26 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 26 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 26 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Mar 27 06:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 27 06:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 25 07:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 25 07:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 114K 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 LamportFastMutEx-PT-4-00
FORMULA_NAME LamportFastMutEx-PT-4-01
FORMULA_NAME LamportFastMutEx-PT-4-02
FORMULA_NAME LamportFastMutEx-PT-4-03
FORMULA_NAME LamportFastMutEx-PT-4-04
FORMULA_NAME LamportFastMutEx-PT-4-05
FORMULA_NAME LamportFastMutEx-PT-4-06
FORMULA_NAME LamportFastMutEx-PT-4-07
FORMULA_NAME LamportFastMutEx-PT-4-08
FORMULA_NAME LamportFastMutEx-PT-4-09
FORMULA_NAME LamportFastMutEx-PT-4-10
FORMULA_NAME LamportFastMutEx-PT-4-11
FORMULA_NAME LamportFastMutEx-PT-4-12
FORMULA_NAME LamportFastMutEx-PT-4-13
FORMULA_NAME LamportFastMutEx-PT-4-14
FORMULA_NAME LamportFastMutEx-PT-4-15

=== Now, execution of the tool begins

BK_START 1620931747043

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 18:49:08] [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-13 18:49:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 18:49:08] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-13 18:49:08] [INFO ] Transformed 135 places.
[2021-05-13 18:49:08] [INFO ] Transformed 230 transitions.
[2021-05-13 18:49:08] [INFO ] Found NUPN structural information;
[2021-05-13 18:49:08] [INFO ] Completing missing partition info from NUPN : creating a component with [P_start_1_0, P_start_1_1, P_start_1_2, P_start_1_3, P_start_1_4, P_b_0_false, P_b_0_true, P_b_1_false, P_b_1_true, P_b_2_false, P_b_2_true, P_b_3_false, P_b_3_true, P_b_4_false, P_b_4_true, P_setx_3_0, P_setx_3_1, P_setx_3_2, P_setx_3_3, P_setx_3_4, P_setbi_5_0, P_setbi_5_1, P_setbi_5_2, P_setbi_5_3, P_setbi_5_4, P_ify0_4_0, P_ify0_4_1, P_ify0_4_2, P_ify0_4_3, P_ify0_4_4, P_sety_9_0, P_sety_9_1, P_sety_9_2, P_sety_9_3, P_sety_9_4, P_ifxi_10_0, P_ifxi_10_1, P_ifxi_10_2, P_ifxi_10_3, P_ifxi_10_4, P_setbi_11_0, P_setbi_11_1, P_setbi_11_2, P_setbi_11_3, P_setbi_11_4, P_fordo_12_0, P_fordo_12_1, P_fordo_12_2, P_fordo_12_3, P_fordo_12_4, P_wait_0_0, P_wait_0_1, P_wait_0_2, P_wait_0_3, P_wait_0_4, P_wait_1_0, P_wait_1_1, P_wait_1_2, P_wait_1_3, P_wait_1_4, P_wait_2_0, P_wait_2_1, P_wait_2_2, P_wait_2_3, P_wait_2_4, P_wait_3_0, P_wait_3_1, P_wait_3_2, P_wait_3_3, P_wait_3_4, P_wait_4_0, P_wait_4_1, P_wait_4_2, P_wait_4_3, P_wait_4_4, P_await_13_0, P_await_13_1, P_await_13_2, P_await_13_3, P_await_13_4, P_done_0_0, P_done_0_1, P_done_0_2, P_done_0_3, P_done_0_4, P_done_1_0, P_done_1_1, P_done_1_2, P_done_1_3, P_done_1_4, P_done_2_0, P_done_2_1, P_done_2_2, P_done_2_3, P_done_2_4, P_done_3_0, P_done_3_1, P_done_3_2, P_done_3_3, P_done_3_4, P_done_4_0, P_done_4_1, P_done_4_2, P_done_4_3, P_done_4_4, P_ifyi_15_0, P_ifyi_15_1, P_ifyi_15_2, P_ifyi_15_3, P_ifyi_15_4, P_awaity_0, P_awaity_1, P_awaity_2, P_awaity_3, P_awaity_4, P_CS_21_0, P_CS_21_1, P_CS_21_2, P_CS_21_3, P_CS_21_4, P_setbi_24_0, P_setbi_24_1, P_setbi_24_2, P_setbi_24_3, P_setbi_24_4]
[2021-05-13 18:49:08] [INFO ] Parsed PT model containing 135 places and 230 transitions in 97 ms.
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 50 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 327 ms. (steps per millisecond=305 ) properties seen :[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, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1]
[2021-05-13 18:49:09] [INFO ] Flow matrix only has 144 transitions (discarded 36 similar events)
// Phase 1: matrix 144 rows 102 cols
[2021-05-13 18:49:09] [INFO ] Computed 26 place invariants in 7 ms
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using 26 positive place invariants in 17 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-13 18:49:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2021-05-13 18:49:09] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:49:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:49:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 17 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:09] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:49:09] [INFO ] Deduced a trap composed of 8 places in 54 ms
[2021-05-13 18:49:09] [INFO ] Deduced a trap composed of 8 places in 26 ms
[2021-05-13 18:49:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 96 ms
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Real]Added 48 Read/Feed constraints in 14 ms returned sat
[2021-05-13 18:49:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:49:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 11 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:09] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 8 ms returned sat
[2021-05-13 18:49:09] [INFO ] Deduced a trap composed of 8 places in 12 ms
[2021-05-13 18:49:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:49:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:49:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:09] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2021-05-13 18:49:09] [INFO ] Deduced a trap composed of 10 places in 37 ms
[2021-05-13 18:49:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2021-05-13 18:49:09] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2021-05-13 18:49:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:10] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-13 18:49:10] [INFO ] [Real]Added 48 Read/Feed constraints in 5 ms returned sat
[2021-05-13 18:49:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 18:49:10] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2021-05-13 18:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 18:49:10] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-13 18:49:10] [INFO ] [Nat]Added 48 Read/Feed constraints in 20 ms returned sat
[2021-05-13 18:49:10] [INFO ] Deduced a trap composed of 8 places in 31 ms
[2021-05-13 18:49:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2021-05-13 18:49:10] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-13 18:49:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-13 18:49:10] [INFO ] Flatten gal took : 103 ms
FORMULA LamportFastMutEx-PT-4-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-4-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:49:10] [INFO ] Applying decomposition
[2021-05-13 18:49:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 18:49:10] [INFO ] Flatten gal took : 31 ms
[2021-05-13 18:49:10] [INFO ] Decomposing Gal with order
[2021-05-13 18:49:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 18:49:10] [INFO ] Removed a total of 162 redundant transitions.
[2021-05-13 18:49:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 18:49:10] [INFO ] Flatten gal took : 63 ms
[2021-05-13 18:49:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 6 ms.
[2021-05-13 18:49:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA LamportFastMutEx-PT-4-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 18:49:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2021-05-13 18:49:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ LamportFastMutEx-PT-4 @ 3570 seconds

FORMULA LamportFastMutEx-PT-4-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-4-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3552
rslt: Output for LTLFireability @ LamportFastMutEx-PT-4

{
"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": "Thu May 13 18:49:11 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 25,
"adisj": 18,
"aneg": 0,
"comp": 96,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 96,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "X (G ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))) AND F ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68)))))))",
"processed_size": 1535,
"rewrites": 224
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 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": 20,
"adisj": 0,
"aneg": 0,
"comp": 56,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 56,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 32,
"visible_transitions": 0
},
"processed": "(((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)))",
"processed_size": 858,
"rewrites": 261
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 16,
"adisj": 1,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87)))))",
"processed_size": 513,
"rewrites": 224
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"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": 2,
"U": 0,
"X": 0,
"aconj": 36,
"adisj": 2,
"aneg": 2,
"comp": 72,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 72,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 17,
"visible_transitions": 0
},
"processed": "G ((G ((((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0)) AND ((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))))",
"processed_size": 1140,
"rewrites": 224
},
"result":
{
"edges": 230,
"markings": 176,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 16,
"aneg": 0,
"comp": 32,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 32,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0))))",
"processed_size": 497,
"rewrites": 224
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p9 <= 0) OR (p37 <= 0))))",
"processed_size": 34,
"rewrites": 224
},
"result":
{
"edges": 98,
"markings": 86,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((1 <= p9) AND (1 <= p91)))",
"processed_size": 30,
"rewrites": 224
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"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": 3,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 1,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p9 <= 0) OR (p32 <= 0)) AND ((p9 <= 0) OR (p33 <= 0)) AND ((p9 <= 0) OR (p30 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))",
"processed_size": 121,
"rewrites": 226
},
"result":
{
"edges": 32,
"markings": 16,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 72
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77))) OR (((p13 <= 0)) OR ((p33 <= 0)))))",
"processed_size": 116,
"rewrites": 224
},
"result":
{
"edges": 5060250,
"markings": 1528043,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1776
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 44,
"adisj": 3,
"aneg": 3,
"comp": 100,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "G (F (((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p25 <= 0))) AND G (((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))) R (((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p23 <= 0)) AND ((p8 <= 0) OR (p24 <= 0)) AND ((p8 <= 0) OR (p25 <= 0)) AND ((p8 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p23 <= 0)) AND ((p4 <= 0) OR (p24 <= 0)) AND ((p4 <= 0) OR (p25 <= 0))))))))",
"processed_size": 1563,
"rewrites": 224
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 3553
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 21,
"adisj": 5,
"aneg": 0,
"comp": 60,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 60,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 29,
"visible_transitions": 0
},
"processed": "F ((G (F ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))))",
"processed_size": 944,
"rewrites": 224
},
"result":
{
"edges": 76356,
"markings": 27992,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 205068,
"runtime": 18.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(((** U **) AND F(**)))) : F(**) : (X(F(**)) OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR (** OR **)))))))))))))))))))) : G(F((* AND G((* R *))))) : F((G(F(**)) OR G(**))) : (X(**) OR (G((G(*) OR *)) AND X(F(**)))) : G((F(**) OR (** OR **))) : F(**) : (F(G(*)) OR X(**))"
},
"net":
{
"arcs": 768,
"conflict_clusters": 7,
"places": 102,
"places_significant": 76,
"singleton_clusters": 0,
"transitions": 180
},
"result":
{
"preliminary_value": "no yes no no no yes yes no no ",
"value": "no yes no no no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 282/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 180 transitions, 76 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: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p63 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p73 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p31 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p74 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: G (X ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p30 <= 0)) AND ((p11 <= 0) OR (p32 <= 0)) AND ((p11 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p30 <= 0)) AND ((p13 <= 0) OR (p33 <= 0)) AND ((p11 <= 0) OR (p31 <= 0)) AND ((p13 <= 0) OR (p32 <= 0)) AND ((p12 <= 0) OR (p33 <= 0)) AND ((p12 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p30 <= 0)) AND ((p12 <= 0) OR (p31 <= 0)))) AND F (((((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31))) U F ((((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67)) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69)) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67)) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68)) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66)) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66)) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))))))))) : F ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31)))) : ((((((((((((((((((((F (X ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p87)) OR ((1 <= p9) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p86)) OR ((1 <= p13) AND (1 <= p87))))) OR ((1 <= p18) AND (1 <= p56) AND (1 <= p67))) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69))) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69))) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68))) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67))) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66))) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68))) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66))) OR ((1 <= p20) AND (1 <= p57) AND (1 <= p67))) OR ((1 <= p20) AND (1 <= p65) AND (1 <= p69))) OR ((1 <= p14) AND (1 <= p54) AND (1 <= p67))) OR ((1 <= p14) AND (1 <= p58) AND (1 <= p68))) OR ((1 <= p14) AND (1 <= p50) AND (1 <= p66))) OR ((1 <= p14) AND (1 <= p62) AND (1 <= p69))) OR ((1 <= p16) AND (1 <= p51) AND (1 <= p66))) OR ((1 <= p18) AND (1 <= p60) AND (1 <= p68))) OR ((1 <= p15) AND (1 <= p42))) OR ((1 <= p21) AND (1 <= p45))) OR ((1 <= p17) AND (1 <= p43))) OR ((1 <= p19) AND (1 <= p44))) : G (F (X ((NOT(X ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))) AND X (G (NOT(((((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77)) OR ((1 <= p68) AND (1 <= p78) AND (1 <= p79) AND (1 <= p80) AND (1 <= p81)) OR ((1 <= p69) AND (1 <= p82) AND (1 <= p83) AND (1 <= p84) AND (1 <= p85)) OR ((1 <= p66) AND (1 <= p70) AND (1 <= p71) AND (1 <= p72) AND (1 <= p73))) U (((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25))))))))))) : F ((((F ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31)))) OR (((p9 <= 0) OR (p91 <= 0)) AND ((p9 <= 0) OR (p92 <= 0)) AND ((p9 <= 0) OR (p93 <= 0)) AND ((p9 <= 0) OR (p90 <= 0)))) U G (F (X ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AND (1 <= p25)) OR ((1 <= p5) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p22)) OR ((1 <= p6) AND (1 <= p23)) OR ((1 <= p6) AND (1 <= p24)) OR ((1 <= p6) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p24)) OR ((1 <= p7) AND (1 <= p25)) OR ((1 <= p7) AND (1 <= p22)) OR ((1 <= p7) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p23)) OR ((1 <= p8) AND (1 <= p24)) OR ((1 <= p8) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p23)) OR ((1 <= p4) AND (1 <= p24)) OR ((1 <= p4) AND (1 <= p25)))))) : (NOT(F ((((((1 <= p5) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p41))) U F ((((1 <= p5) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p40)) OR ((1 <= p8) AND (1 <= p41))))) AND (((1 <= p6) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p38)) OR ((1 <= p4) AND (1 <= p39)) OR ((1 <= p4) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p41)) OR ((1 <= p8) AND (1 <= p39)) OR ((1 <= p6) AND (1 <= p38)) OR ((1 <= p8) AND (1 <= p40)) OR ((1 <= p4) AND (1 <= p38)) OR ((1 <= p6) AND (1 <= p40)) OR ((1 <= p7) AND (1 <= p38)) OR ((1 <= p7) AND (1 <= p39)) OR ((1 <= p5) AND (1 <= p40)) OR ((1 <= p5) AND (1 <= p41)) OR ((1 <= p5) AND (1 <= p39)) OR ((1 <= p7) AND (1 <= p41)) OR ((1 <= p10) AND (1 <= p31)) OR ((1 <= p10) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p33)) OR ((1 <= p13) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p30)) OR ((1 <= p11) AND (1 <= p32)) OR ((1 <= p11) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p30)) OR ((1 <= p13) AND (1 <= p33)) OR ((1 <= p11) AND (1 <= p31)) OR ((1 <= p13) AND (1 <= p32)) OR ((1 <= p12) AND (1 <= p33)) OR ((1 <= p12) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p32)) OR ((1 <= p10) AND (1 <= p30)) OR ((1 <= p12) AND (1 <= p31)))))) U X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0)) AND ((p5 <= 0) OR (p41 <= 0)) AND ((p5 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p41 <= 0))))) : G (((F (((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77))) OR ((p13 <= 0))) OR ((p33 <= 0)))) : F ((((1 <= p10) AND (1 <= p95)) U ((1 <= p5) AND (1 <= p23)))) : (F (G (F (NOT(F (((1 <= p9) AND (1 <= p37))))))) OR X (((1 <= p9) AND (1 <= p91))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k: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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((((1 <= p14) AND (1 <= p42)) OR ((1 <= p18) AND (1 <= p44)) OR ((1 <= p15) AND (1 <= p42)) OR ((1 <= p16) AND (1 <= p43)) OR ((1 <= p21) AND (1 <= p45)) OR ((1 <= p17) AND (1 <= p43)) OR ((1 <= p19) AND (1 <= p44)) OR ((1 <= p20) AND (1 <= p45))) U (((p10 <= 0) OR (p31 <= 0)) AND ((p10 <= 0) OR (p32 <= 0)) AND ((p10 <= 0) OR (p33 <= 0)) AND ((p13 <= 0) OR (p31 <= 0)) AND ((p13 <... (shortened)
lola: processed formula length: 1535
lola: 224 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR (((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR (((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR (((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR (((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR (((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR (((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR (((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR (((1 <= p20) AND (1 <= p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: rewrite Frontend/Parser/formula_rewrite.k:798
lola: processed formula: (((1 <= p18) AND (1 <= p56) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p64) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p63) AND (1 <= p69)) OR ((1 <= p16) AND (1 <= p59) AND (1 <= p68)) OR ((1 <= p16) AND (1 <= p55) AND (1 <= p67)) OR ((1 <= p18) AND (1 <= p52) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p61) AND (1 <= p68)) OR ((1 <= p20) AND (1 <= p53) AND (1 <= p66)) OR ((1 <= p20) AND (1 <= p57) AND ... (shortened)
lola: processed formula length: 858
lola: 261 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 56 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 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((1 <= p11) AND (1 <= p86)) OR ((1 <= p11) AND (1 <= p88)) OR ((1 <= p9) AND (1 <= p89)) OR ((1 <= p9) AND (1 <= p88)) OR ((1 <= p11) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p89)) OR ((1 <= p12) AND (1 <= p87)) OR ((1 <= p12) AND (1 <= p86)) OR ((1 <= p10) AND (1 <= p89)) OR ((1 <= p10) AND (1 <= p87)) OR ((1 <= p10) AND (1 <= p88)) OR ((1 <= p13) AND (1 <= p88)) OR ((1 <= p9) ... (shortened)
lola: processed formula length: 513
lola: 224 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: 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((p5 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p39 <= 0)) AND ((p7 <= 0) OR (p40 <= 0)) AND ((p8 <= 0) OR (p41 <= 0)))) OR (((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p3... (shortened)
lola: processed formula length: 1140
lola: 224 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: 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: 176 markings, 230 edges
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p6 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p38 <= 0)) AND ((p4 <= 0) OR (p39 <= 0)) AND ((p4 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p41 <= 0)) AND ((p8 <= 0) OR (p39 <= 0)) AND ((p6 <= 0) OR (p38 <= 0)) AND ((p8 <= 0) OR (p40 <= 0)) AND ((p4 <= 0) OR (p38 <= 0)) AND ((p6 <= 0) OR (p40 <= 0)) AND ((p7 <= 0) OR (p38 <= 0)) AND ((p7 <= 0) OR (p39 <= 0)) AND ((p5 <= 0) OR (p40 <= 0... (shortened)
lola: processed formula length: 497
lola: 224 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((p9 <= 0) OR (p37 <= 0)))) OR X (((1 <= p9) AND (1 <= p91))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p9 <= 0) OR (p37 <= 0))))
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 (((p9 <= 0) OR (p37 <= 0))))
lola: processed formula length: 34
lola: 224 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: 86 markings, 98 edges
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p9) AND (1 <= p91)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p9) AND (1 <= p91)))
lola: processed formula length: 30
lola: 224 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p5) AND (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p5 <= 0) OR (p23 <= 0))
lola: processed formula length: 26
lola: 226 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p9) AND (1 <= p32)) OR ((1 <= p9) AND (1 <= p33)) OR ((1 <= p9) AND (1 <= p30)) OR ((1 <= p9) AND (1 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (((p9 <= 0) OR (p32 <= 0)) AND ((p9 <= 0) OR (p33 <= 0)) AND ((p9 <= 0) OR (p30 <= 0)) AND ((p9 <= 0) OR (p31 <= 0)))
lola: processed formula length: 121
lola: 226 rewrites
lola: closed formula file LTLFireability.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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 16 markings, 32 edges
lola: ========================================
lola: subprocess 6 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77))) OR (((p13 <= 0)) OR ((p33 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p67) AND (1 <= p74) AND (1 <= p75) AND (1 <= p76) AND (1 <= p77))) OR (((p13 <= 0)) OR ((p33 <= 0)))))
lola: processed formula length: 116
lola: 224 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: 605617 markings, 1902085 edges, 121123 markings/sec, 0 secs
lola: 1239719 markings, 3986439 edges, 126820 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1528043 markings, 5060250 edges
lola: ========================================
lola: subprocess 7 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((((p4 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p24 <= 0)) AND ((p5 <= 0) OR (p25 <= 0)) AND ((p5 <= 0) OR (p22 <= 0)) AND ((p5 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p22 <= 0)) AND ((p6 <= 0) OR (p23 <= 0)) AND ((p6 <= 0) OR (p24 <= 0)) AND ((p6 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p24 <= 0)) AND ((p7 <= 0) OR (p25 <= 0)) AND ((p7 <= 0) OR (p22 <= 0)) AND ((p7 <= 0) OR (p23 ... (shortened)
lola: processed formula length: 1563
lola: 224 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: 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, 9 edges
lola: ========================================
lola: subprocess 8 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (F ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AN... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (F ((((p67 <= 0) OR (p74 <= 0) OR (p75 <= 0) OR (p76 <= 0) OR (p77 <= 0)) AND ((p68 <= 0) OR (p78 <= 0) OR (p79 <= 0) OR (p80 <= 0) OR (p81 <= 0)) AND ((p69 <= 0) OR (p82 <= 0) OR (p83 <= 0) OR (p84 <= 0) OR (p85 <= 0)) AND ((p66 <= 0) OR (p70 <= 0) OR (p71 <= 0) OR (p72 <= 0) OR (p73 <= 0))))) OR G ((((1 <= p4) AND (1 <= p22)) OR ((1 <= p5) AND (1 <= p24)) OR ((1 <= p5) AN... (shortened)
lola: processed formula length: 944
lola: 224 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: 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: 27992 markings, 76356 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes yes no no
lola:
preliminary result: no yes no no no yes yes no no
lola: memory consumption: 205068 KB
lola: time consumption: 18 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="LamportFastMutEx-PT-4"
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 LamportFastMutEx-PT-4, 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 r132-tall-162075428500330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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