Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r151-tall-162089151500369.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is Philosophers-COL-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r151-tall-162089151500369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.9K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621038662995

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-15 00:31:04] [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 00:31:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 00:31:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2021-05-15 00:31:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2021-05-15 00:31:05] [INFO ] sort/places :
Philo->Think,Fork,Catch1,Catch2,Eat,

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

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

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

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

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

FORMULA Philosophers-COL-000010-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA Philosophers-COL-000010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ Philosophers-COL-000010

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=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 00:31:06 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "(X (X (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 2)))) R (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))",
"processed_size": 311,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "X (X (G ((X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))",
"processed_size": 201,
"rewrites": 68
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))",
"processed_size": 151,
"rewrites": 68
},
"result":
{
"edges": 23,
"markings": 23,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 2))))",
"processed_size": 76,
"rewrites": 68
},
"result":
{
"edges": 55,
"markings": 36,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) U X (X (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) U (F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) OR X (F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))",
"processed_size": 454,
"rewrites": 68
},
"result":
{
"edges": 580,
"markings": 446,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 8
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "X (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))",
"processed_size": 252,
"rewrites": 68
},
"result":
{
"edges": 22584,
"markings": 10034,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "X ((((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U G (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0)))) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))",
"processed_size": 343,
"rewrites": 68
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"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": 891
},
"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": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "G (F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0)))",
"processed_size": 72,
"rewrites": 68
},
"result":
{
"edges": 9,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "F (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))",
"processed_size": 132,
"rewrites": 68
},
"result":
{
"edges": 11,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "F (G ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))",
"processed_size": 217,
"rewrites": 68
},
"result":
{
"edges": 233,
"markings": 101,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 30,
"visible_transitions": 0
},
"processed": "F (G ((F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))",
"processed_size": 262,
"rewrites": 68
},
"result":
{
"edges": 12,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 23120,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(X(F(*))) R (X(**) OR *)) : F(G((F(**) OR **))) : X(X(G((X(F(**)) AND **)))) : G(F(**)) : X(X(G((F(**) AND **)))) : F(G((F(**) AND (** OR **)))) : X(X(G(*))) : ((** U X(X(G(**)))) U (F(**) OR X(F(**)))) : X(F((** OR **))) : F(G(*)) : X(((** U G(**)) AND **))"
},
"net":
{
"arcs": 160,
"conflict_clusters": 11,
"places": 50,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 50
},
"result":
{
"preliminary_value": "no no no no no no no yes no no no ",
"value": "no no no no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 100/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 50
lola: finding significant places
lola: 50 places, 50 transitions, 30 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: NOT((X (G (X (G ((3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))) U (NOT(X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) AND (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))) : G (F (G ((F (((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))) : X (NOT(F (NOT(G (X ((X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))))) : G (F (((((0 <= 0) U ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) U NOT(G ((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)) U (p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0)))) : X (G (X ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))) : X (F (G (X (X (((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49))))))) : G (X (X (G (NOT(F (F ((3 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))))) : (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) U X (G (X ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) U (F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) OR F (X ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) : (F (X ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) OR F (X (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) U (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))) : (((3 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)) U NOT(G (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)))))) : X ((((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U G (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0)))) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:335
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:315
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: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:374
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:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 2)))) R (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (F ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 2)))) R (X ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 311
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((X (F ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))) AND (3 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))
lola: processed formula length: 201
lola: 68 rewrites
lola: closed formula file LTLCardinality.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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: processed formula length: 151
lola: 68 rewrites
lola: closed formula file LTLCardinality.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: 23 markings, 23 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 2))))
lola: processed formula length: 76
lola: 68 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: 36 markings, 55 edges
lola: ========================================
lola: subprocess 4 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) U X (X (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) U (F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) OR X (F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) U X (X (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29))))) U (F ((2 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39)) OR X (F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= p20 + p2... (shortened)
lola: processed formula length: 454
lola: 68 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 446 markings, 580 edges
lola: ========================================
lola: subprocess 5 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9) OR (p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))
lola: processed formula length: 252
lola: 68 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 10034 markings, 22584 edges
lola: ========================================
lola: subprocess 6 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U G (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0)))) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) U G (((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39) AND (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= 0)))) AND (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: processed formula length: 343
lola: 68 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 <= 0)))
lola: processed formula length: 72
lola: 68 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: 7 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
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 ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))
lola: processed formula length: 132
lola: 68 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: add low 49
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: 8 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)) AND ((1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49) OR (1 <= p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49)))))
lola: processed formula length: 217
lola: 68 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: 101 markings, 233 edges
lola: ========================================
lola: subprocess 10 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)) OR (p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39))))
lola: processed formula length: 262
lola: 68 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: 9 markings, 12 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no no
lola:
preliminary result: no no no no no no no yes no no no
lola: memory consumption: 23120 KB
lola: time consumption: 3 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="Philosophers-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 Philosophers-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 r151-tall-162089151500369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "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 ;