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.r227-tall-162098230700005.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 SharedMemory-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-tall-162098230700005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 380K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 11:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 11:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 12K May 5 16:52 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 SharedMemory-COL-000010-00
FORMULA_NAME SharedMemory-COL-000010-01
FORMULA_NAME SharedMemory-COL-000010-02
FORMULA_NAME SharedMemory-COL-000010-03
FORMULA_NAME SharedMemory-COL-000010-04
FORMULA_NAME SharedMemory-COL-000010-05
FORMULA_NAME SharedMemory-COL-000010-06
FORMULA_NAME SharedMemory-COL-000010-07
FORMULA_NAME SharedMemory-COL-000010-08
FORMULA_NAME SharedMemory-COL-000010-09
FORMULA_NAME SharedMemory-COL-000010-10
FORMULA_NAME SharedMemory-COL-000010-11
FORMULA_NAME SharedMemory-COL-000010-12
FORMULA_NAME SharedMemory-COL-000010-13
FORMULA_NAME SharedMemory-COL-000010-14
FORMULA_NAME SharedMemory-COL-000010-15

=== Now, execution of the tool begins

BK_START 1621103793079

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 18:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-15 18:36:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 18:36:34] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-15 18:36:35] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 532 ms
[2021-05-15 18:36:35] [INFO ] sort/places :
P->OwnMemAcc,Queue,Memory,Active,
Dot->Ext_Bus,
PxP->Ext_Mem_Acc,

[2021-05-15 18:36:35] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 22 ms.
[2021-05-15 18:36:35] [INFO ] Computed order based on color domains.
[2021-05-15 18:36:35] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions in 20 ms.
[2021-05-15 18:36:35] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 53 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 873 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1]
// Phase 1: matrix 210 rows 131 cols
[2021-05-15 18:36:36] [INFO ] Computed 21 place invariants in 10 ms
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned unsat
[2021-05-15 18:36:36] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 19 simplifications.
[2021-05-15 18:36:36] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-15 18:36:36] [INFO ] Flatten gal took : 50 ms
FORMULA SharedMemory-COL-000010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 18:36:36] [INFO ] Applying decomposition
[2021-05-15 18:36:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-15 18:36:36] [INFO ] Flatten gal took : 23 ms
[2021-05-15 18:36:36] [INFO ] Decomposing Gal with order
[2021-05-15 18:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 18:36:36] [INFO ] Removed a total of 498 redundant transitions.
[2021-05-15 18:36:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-15 18:36:37] [INFO ] Flatten gal took : 63 ms
[2021-05-15 18:36:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-15 18:36:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SharedMemory-COL-000010-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 18:36:37] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-15 18:36:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SharedMemory-COL-000010 @ 3570 seconds

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

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

FORMULA SharedMemory-COL-000010-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SharedMemory-COL-000010-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SharedMemory-COL-000010-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA SharedMemory-COL-000010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3562
rslt: Output for LTLCardinality @ SharedMemory-COL-000010

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 15 18:36:38 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "X (G ((G (((((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1)) R (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2)) AND G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))",
"processed_size": 482,
"rewrites": 69
},
"result":
{
"edges": 976,
"markings": 637,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 120,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 110,
"visible_transitions": 0
},
"processed": "X (X (F ((F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))",
"processed_size": 763,
"rewrites": 69
},
"result":
{
"edges": 24,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((X (F ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1))))",
"processed_size": 150,
"rewrites": 69
},
"result":
{
"edges": 3379680,
"markings": 685845,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "F ((F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)) OR (p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))",
"processed_size": 156,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 3,
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p130))",
"processed_size": 71,
"rewrites": 69
},
"result":
{
"edges": 5,
"markings": 5,
"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": 712
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))",
"processed_size": 181,
"rewrites": 69
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X (F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))",
"processed_size": 79,
"rewrites": 69
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 110,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "X (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36) U (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))",
"processed_size": 703,
"rewrites": 69
},
"result":
{
"edges": 20,
"markings": 21,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130)))",
"processed_size": 65,
"rewrites": 69
},
"result":
{
"edges": 1610,
"markings": 1064,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 180,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 90,
"visible_transitions": 0
},
"processed": "G (F ((G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)) AND (1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))",
"processed_size": 1167,
"rewrites": 69
},
"result":
{
"edges": 12,
"markings": 12,
"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": 3562
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))",
"processed_size": 131,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))",
"processed_size": 71,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))",
"processed_size": 131,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)",
"processed_size": 54,
"rewrites": 71
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 20
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))",
"processed_size": 71,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24192,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G((G(((* R *) AND G(*))) AND *))) : X(X(F((F(**) AND **)))) : X((X(F(**)) OR G(**))) : (X(**) AND F((F(**) OR **))) : G(F((G(**) AND *))) : (X(F(*)) OR **) : (F(**) OR (G(**) OR (F(**) AND (** AND **)))) : G(F(**)) : (X((** U **)) OR G(F((G(*) OR (X(X(**)) AND *)))))"
},
"net":
{
"arcs": 800,
"conflict_clusters": 101,
"places": 131,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 210
},
"result":
{
"preliminary_value": "no no yes no no yes no no yes ",
"value": "no no yes no no yes no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 341/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 131
lola: finding significant places
lola: 131 places, 210 transitions, 110 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 LTLCardinality.xml
lola: X (NOT(F ((F (((((3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) OR (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) U (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR F ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))))) : F ((NOT(G (X ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))) U X (X ((F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))))) : NOT(X ((NOT(X (F ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))) AND NOT(G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1)))))) : (X ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p130)) AND F ((F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)) OR (p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))) : G (X (G (NOT(G ((NOT(G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= 0))))))) : (NOT(G (X ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p130)))) OR ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))) : ((F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR ((((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36) U F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) AND (p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : X (F (G (X (X (((0 <= 0) U (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130))))))) : (X (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36) U (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))) OR NOT(G (F (G ((X (NOT(X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130)))) U (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p80 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p79 + p76 + p77 + p78 + p75 + p66 + p57 + p48 + p84 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 ((G (((((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1)) R (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2)) AND G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1)) R (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 2)) AND G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p1... (shortened)
lola: processed formula length: 482
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 637 markings, 976 edges
lola: ========================================
lola: subprocess 1 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((F ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p6... (shortened)
lola: processed formula length: 763
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 2 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 1))))
lola: processed formula length: 150
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 685054 markings, 3343030 edges, 137011 markings/sec, 0 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: 685845 markings, 3379680 edges
lola: ========================================
lola: subprocess 3 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p130)) AND F ((F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)) OR (p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)) OR (p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)) OR (p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))
lola: processed formula length: 156
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 1 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p130))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p130))
lola: processed formula length: 71
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))) OR ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) AND (1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36))
lola: processed formula length: 181
lola: 69 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p130 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p39 + p38 + p37 + p36)))
lola: processed formula length: 79
lola: 69 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 +... (shortened)
lola: processed formula length: 703
lola: 69 rewrites
lola: closed formula file LTLCardinality.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: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p130)))
lola: processed formula length: 65
lola: 69 rewrites
lola: closed formula file LTLCardinality.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: 1064 markings, 1610 edges
lola: ========================================
lola: subprocess 7 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p88 + p87 + p86 + p85 + p83 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p82 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p81 + p58 + p59 + p60 + p61 + p62 + p63 + ... (shortened)
lola: processed formula length: 1167
lola: 69 rewrites
lola: closed formula file LTLCardinality.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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 8 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: processed formula length: 131
lola: 70 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))
lola: processed formula length: 71
lola: 69 rewrites
lola: closed formula file LTLCardinality.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: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) OR (G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) OR (F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) AND ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: processed formula: ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (p130 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
lola: processed formula length: 131
lola: 70 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))
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: (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)
lola: processed formula length: 54
lola: 71 rewrites
lola: closed formula file LTLCardinality.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: 3 markings, 3 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p130 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))
lola: processed formula length: 71
lola: 69 rewrites
lola: closed formula file LTLCardinality.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: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes no no yes
lola:
preliminary result: no no yes no no yes no no yes
lola: memory consumption: 24192 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="SharedMemory-COL-000010"
export BK_EXAMINATION="LTLCardinality"
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 SharedMemory-COL-000010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r227-tall-162098230700005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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