Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 31K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590263451854

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhilosophersDyn-COL-03 @ 3570 seconds

FORMULA PhilosophersDyn-COL-03-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA PhilosophersDyn-COL-03-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-COL-03-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-COL-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA PhilosophersDyn-COL-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-03-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2873
rslt: Output for LTLCardinality @ PhilosophersDyn-COL-03

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (X ((G ((p0 + p1 + p2 <= 0)) OR (X (TRUE) OR (F ((p3 + p4 + p5 <= p24 + p25 + p26)) AND X (G ((p3 + p4 + p5 <= p24 + p25 + p26))))))))",
"processed_size": 136,
"rewrites": 64
},
"result":
{
"edges": 60,
"markings": 52,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 13
},
"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": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 33,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A ((G (F ((G ((p27 + p28 + p29 + 1 <= p3 + p4 + p5)) OR ((p3 + p4 + p5 + 1 <= p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) AND (p27 + p28 + p29 + 1 <= p3 + p4 + p5))))) OR ((1 <= p24 + p25 + p26) AND X (F ((p27 + p28 + p29 + 1 <= p3 + p4 + p5))))))",
"processed_size": 256,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (X (G (((p6 + p7 + p8 <= 2) OR X (G ((1 <= p27 + p28 + p29)))))))",
"processed_size": 67,
"rewrites": 64
},
"result":
{
"edges": 85,
"markings": 61,
"produced_by": "LTL model checker",
"value": false
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (X (F ((((p0 + p1 + p2 + 1 <= p24 + p25 + p26) AND (3 <= p24 + p25 + p26)) AND X (G ((2 <= p27 + p28 + p29)))))))",
"processed_size": 115,
"rewrites": 64
},
"result":
{
"edges": 9,
"markings": 8,
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 21,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "A (X (F (((p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= 0) OR G (((p24 + p25 + p26 + 1 <= p27 + p28 + p29) AND G (F ((p27 + p28 + p29 <= p24 + p25 + p26)))))))))",
"processed_size": 171,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (((X ((2 <= p9 + p10 + p11)) U (p3 + p4 + p5 <= 1)) U (2 <= p9 + p10 + p11)))",
"processed_size": 79,
"rewrites": 64
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(p9 + p10 + p11 <= 2)",
"processed_size": 21,
"rewrites": 66
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 81
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G ((p3 + p4 + p5 <= 1))))",
"processed_size": 31,
"rewrites": 64
},
"result":
{
"edges": 20,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 15,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A ((X (G ((p27 + p28 + p29 <= p23 + p22 + p21))) U ((2 <= p6 + p7 + p8) OR (p27 + p28 + p29 <= p23 + p22 + p21))))",
"processed_size": 115,
"rewrites": 64
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"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": 1,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((2 <= p0 + p1 + p2)))",
"processed_size": 27,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F ((1 <= p0 + p1 + p2))))",
"processed_size": 31,
"rewrites": 64
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"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": 1610
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p24 + p25 + p26)))",
"processed_size": 30,
"rewrites": 66
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F ((p23 + p22 + p21 <= 1))))",
"processed_size": 34,
"rewrites": 64
},
"result":
{
"edges": 84,
"markings": 59,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 82276,
"runtime": 697.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((G(*) OR (X(TRUE) OR (F(**) AND X(G(**))))))) : A((G(F((G(*) OR (* AND *)))) OR (** AND X(F(*))))) : (A(G(**)) AND A(G(**))) : A(X(G((** OR X(G(**)))))) : A(X(F((** AND X(G(**)))))) : A(X(TRUE)) : A(X(F((** OR G((** AND G(F(**)))))))) : A(F(**)) : A(((X(**) U **) U **)) : A(G(**)) : (A(F(G((((** U **) U X(**)) AND X(**))))) AND A(F(**))) : A(G(F(**))) : (A(G(F(**))) AND A(G((** OR ((** U **) OR **))))) : (A(F(G(*))) AND A(G((** OR ((F(**) AND F(G((** OR X(**))))) OR X(G(*))))))) : A(((G(*) R *) U (** U **))) : A((X(G(**)) U **))"
},
"net":
{
"arcs": 570,
"conflict_clusters": 1,
"places": 30,
"places_significant": 22,
"singleton_clusters": 0,
"transitions": 84
},
"result":
{
"preliminary_value": "yes no no no no yes no no yes no no no no no unknown yes ",
"value": "yes no no no no yes no no yes no no no no no unknown 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 High-Level net
lola: Places: 30, Transitions: 84
lola: @ trans Leave
lola: @ trans Initialize
lola: @ trans Join
lola: @ trans Eat
lola: @ trans TakeRight
lola: @ trans TakeLeft
lola: @ trans SearchForks
lola: finished unfolding
lola: finished parsing
lola: closed net file model.pnml
lola: 114/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 84 transitions, 22 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: LP says that atomic proposition is always true: (p27 + p28 + p29 <= p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18)
lola: A (X (((NOT(F ((1 <= p0 + p1 + p2))) OR F (X ((p27 + p28 + p29 <= p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18)))) OR (F ((p3 + p4 + p5 <= p24 + p25 + p26)) AND G (X ((p3 + p4 + p5 <= p24 + p25 + p26))))))) : A ((G (F (NOT(G (((p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= p3 + p4 + p5) U (p3 + p4 + p5 <= p27 + p28 + p29)))))) OR ((1 <= p24 + p25 + p26) AND NOT(X (G ((p3 + p4 + p5 <= p27 + p28 + p29))))))) : A (G (((1 <= p24 + p25 + p26) AND G ((1 <= p24 + p25 + p26))))) : A (X (G (((p6 + p7 + p8 <= 2) OR X (G ((1 <= p27 + p28 + p29))))))) : A (X ((F ((p3 + p4 + p5 <= p24 + p25 + p26)) U F ((((p0 + p1 + p2 + 1 <= p24 + p25 + p26) AND (3 <= p24 + p25 + p26)) AND G (X ((2 <= p27 + p28 + p29)))))))) : A (F (X (X (G (X (X ((0 <= p9 + p10 + p11)))))))) : A (X (F (((p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= 0) OR G (((p24 + p25 + p26 + 1 <= p27 + p28 + p29) AND G (((0 <= p23 + p22 + p21) U (p27 + p28 + p29 <= p24 + p25 + p26))))))))) : A (F ((X ((2 <= p3 + p4 + p5)) U F (((2 <= p3 + p4 + p5) AND (3 <= p3 + p4 + p5)))))) : A (((X ((2 <= p9 + p10 + p11)) U (p3 + p4 + p5 <= 1)) U (2 <= p9 + p10 + p11))) : A (G ((2 <= p0 + p1 + p2))) : A ((X (F (G (((((1 <= p6 + p7 + p8) U (p23 + p22 + p21 <= p9 + p10 + p11)) U X ((p3 + p4 + p5 <= p9 + p10 + p11))) AND X ((1 <= p6 + p7 + p8)))))) AND F ((3 <= p9 + p10 + p11)))) : A (G ((X (X ((0 <= p9 + p10 + p11))) U F ((1 <= p0 + p1 + p2))))) : A (G ((((p6 + p7 + p8 <= p23 + p22 + p21) OR ((p6 + p7 + p8 <= p23 + p22 + p21) U (p0 + p1 + p2 <= 2))) U (p23 + p22 + p21 <= 1)))) : A (G (((F (X (G (((p6 + p7 + p8 <= p9 + p10 + p11) OR X ((p6 + p7 + p8 <= p9 + p10 + p11)))))) U (p3 + p4 + p5 <= p24 + p25 + p26)) U NOT(X (F ((2 <= p3 + p4 + p5))))))) : A ((NOT((F (((p24 + p25 + p26 <= p3 + p4 + p5) AND (3 <= p0 + p1 + p2))) U (3 <= p9 + p10 + p11))) U ((3 <= p9 + p10 + p11) U (p9 + p10 + p11 + 1 <= p23 + p22 + p21)))) : A (((X ((p0 + p1 + p2 + 1 <= 0)) OR X (G ((p27 + p28 + p29 <= p23 + p22 + p21)))) U ((2 <= p6 + p7 + p8) OR (p27 + p28 + p29 <= p23 + p22 + p21))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p0 + p1 + p2 <= 0)) OR (X (TRUE) OR (F ((p3 + p4 + p5 <= p24 + p25 + p26)) AND X (G ((p3 + p4 + p5 <= p24 + p25 + p26))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p0 + p1 + p2 <= 0)) OR (X (TRUE) OR (F ((p3 + p4 + p5 <= p24 + p25 + p26)) AND X (G ((p3 + p4 + p5 <= p24 + p25 + p26))))))))
lola: processed formula length: 136
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 52 markings, 60 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((G ((p27 + p28 + p29 + 1 <= p3 + p4 + p5)) OR ((p3 + p4 + p5 + 1 <= p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) AND (p27 + p28 + p29 + 1 <= p3 + p4 + p5))))) OR ((1 <= p24 + p25 + p26) AND X (F ((p27 + p28 + p29 + 1 <= p3 + p4 + p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((G ((p27 + p28 + p29 + 1 <= p3 + p4 + p5)) OR ((p3 + p4 + p5 + 1 <= p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18) AND (p27 + p28 + p29 + 1 <= p3 + p4 + p5))))) OR ((1 <= p24 + p25 + p26) AND X (F ((p27 + p28 + p29 + 1 <= p3 + p4 + p5))))))
lola: processed formula length: 256
lola: 64 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p6 + p7 + p8 <= 2) OR X (G ((1 <= p27 + p28 + p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p6 + p7 + p8 <= 2) OR X (G ((1 <= p27 + p28 + p29)))))))
lola: processed formula length: 67
lola: 64 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: 61 markings, 85 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((((p0 + p1 + p2 + 1 <= p24 + p25 + p26) AND (3 <= p24 + p25 + p26)) AND X (G ((2 <= p27 + p28 + p29)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((((p0 + p1 + p2 + 1 <= p24 + p25 + p26) AND (3 <= p24 + p25 + p26)) AND X (G ((2 <= p27 + p28 + p29)))))))
lola: processed formula length: 115
lola: 64 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 64 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= 0) OR G (((p24 + p25 + p26 + 1 <= p27 + p28 + p29) AND G (F ((p27 + p28 + p29 <= p24 + p25 + p26)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((p12 + p13 + p14 + p15 + p16 + p17 + p20 + p19 + p18 <= 0) OR G (((p24 + p25 + p26 + 1 <= p27 + p28 + p29) AND G (F ((p27 + p28 + p29 <= p24 + p25 + p26)))))))))
lola: processed formula length: 171
lola: 64 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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X ((2 <= p9 + p10 + p11)) U (p3 + p4 + p5 <= 1)) U (2 <= p9 + p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X ((2 <= p9 + p10 + p11)) U (p3 + p4 + p5 <= 1)) U (2 <= p9 + p10 + p11)))
lola: processed formula length: 79
lola: 64 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G (((((1 <= p6 + p7 + p8) U (p23 + p22 + p21 <= p9 + p10 + p11)) U X ((p3 + p4 + p5 <= p9 + p10 + p11))) AND X ((1 <= p6 + p7 + p8)))))) AND A (F ((3 <= p9 + p10 + p11))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p9 + p10 + p11)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p9 + p10 + p11 <= 2)
lola: processed formula length: 21
lola: 66 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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p3 + p4 + p5 <= 1)))) AND A (G (((p3 + p4 + p5 <= p24 + p25 + p26) OR ((F ((p3 + p4 + p5 <= p24 + p25 + p26)) AND F (G (((p6 + p7 + p8 <= p9 + p10 + p11) OR X ((p6 + p7 + p8 <= p9 + p10 + p11)))))) OR X (G ((p3 + p4 + p5 <= 1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p3 + p4 + p5 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p3 + p4 + p5 <= 1))))
lola: processed formula length: 31
lola: 64 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: 16 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p27 + p28 + p29 <= p23 + p22 + p21))) U ((2 <= p6 + p7 + p8) OR (p27 + p28 + p29 <= p23 + p22 + p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((p27 + p28 + p29 <= p23 + p22 + p21))) U ((2 <= p6 + p7 + p8) OR (p27 + p28 + p29 <= p23 + p22 + p21))))
lola: processed formula length: 115
lola: 64 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p0 + p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((2 <= p0 + p1 + p2)))
lola: processed formula length: 27
lola: 66 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p0 + p1 + p2 <= 1)
lola: state equation task get result unparse finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p3 + p4 + p5) AND (3 <= p3 + p4 + p5))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p3 + p4 + p5 <= 1) OR (p3 + p4 + p5 <= 2))
lola: processed formula length: 45
lola: 66 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p0 + p1 + p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p0 + p1 + p2))))
lola: processed formula length: 31
lola: 64 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, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((G (((p3 + p4 + p5 + 1 <= p24 + p25 + p26) OR (p0 + p1 + p2 <= 2))) R (p9 + p10 + p11 <= 2)) U ((3 <= p9 + p10 + p11) U (p9 + p10 + p11 + 1 <= p23 + p22 + p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((G (((p3 + p4 + p5 + 1 <= p24 + p25 + p26) OR (p0 + p1 + p2 <= 2))) R (p9 + p10 + p11 <= 2)) U ((3 <= p9 + p10 + p11) U (p9 + p10 + p11 + 1 <= p23 + p22 + p21))))
lola: processed formula length: 167
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 1969659 markings, 7463177 edges, 393932 markings/sec, 0 secs
lola: 3928468 markings, 14918084 edges, 391762 markings/sec, 5 secs
lola: 5719644 markings, 21739296 edges, 358235 markings/sec, 10 secs
lola: 7416247 markings, 28193985 edges, 339321 markings/sec, 15 secs
lola: 9074612 markings, 34506961 edges, 331673 markings/sec, 20 secs
lola: 10791337 markings, 41043178 edges, 343345 markings/sec, 25 secs
lola: 12639280 markings, 48098752 edges, 369589 markings/sec, 30 secs
lola: 14510891 markings, 55212727 edges, 374322 markings/sec, 35 secs
lola: 16365441 markings, 62276873 edges, 370910 markings/sec, 40 secs
lola: 18200519 markings, 69268259 edges, 367016 markings/sec, 45 secs
lola: 20008343 markings, 76175889 edges, 361565 markings/sec, 50 secs
lola: 21881052 markings, 83315022 edges, 374542 markings/sec, 55 secs
lola: 23548205 markings, 89663611 edges, 333431 markings/sec, 60 secs
lola: 25202829 markings, 95960092 edges, 330925 markings/sec, 65 secs
lola: 27036136 markings, 102961194 edges, 366661 markings/sec, 70 secs
lola: 28857284 markings, 109872517 edges, 364230 markings/sec, 75 secs
lola: 30667504 markings, 116773831 edges, 362044 markings/sec, 80 secs
lola: 32311202 markings, 123065646 edges, 328740 markings/sec, 85 secs
lola: 33975313 markings, 129378650 edges, 332822 markings/sec, 90 secs
lola: 35659264 markings, 135807151 edges, 336790 markings/sec, 95 secs
lola: 37321642 markings, 142165178 edges, 332476 markings/sec, 100 secs
lola: 38966849 markings, 148421910 edges, 329041 markings/sec, 105 secs
lola: 40722970 markings, 155126467 edges, 351224 markings/sec, 110 secs
lola: 42479382 markings, 161789795 edges, 351282 markings/sec, 115 secs
lola: 44225375 markings, 168444221 edges, 349199 markings/sec, 120 secs
lola: 45942403 markings, 175018663 edges, 343406 markings/sec, 125 secs
lola: 47756823 markings, 181936001 edges, 362884 markings/sec, 130 secs
lola: 49544765 markings, 188719148 edges, 357588 markings/sec, 135 secs
lola: 51325631 markings, 195514441 edges, 356173 markings/sec, 140 secs
lola: 53086024 markings, 202217286 edges, 352079 markings/sec, 145 secs
lola: 54841220 markings, 208942312 edges, 351039 markings/sec, 150 secs
lola: 56611183 markings, 215655259 edges, 353993 markings/sec, 155 secs
lola: 58347714 markings, 222277361 edges, 347306 markings/sec, 160 secs
lola: 60078842 markings, 228911800 edges, 346226 markings/sec, 165 secs
lola: 61803665 markings, 235460845 edges, 344965 markings/sec, 170 secs
lola: 63548504 markings, 242138394 edges, 348968 markings/sec, 175 secs
lola: 65316076 markings, 248835971 edges, 353514 markings/sec, 180 secs
lola: 67045240 markings, 255439779 edges, 345833 markings/sec, 185 secs
lola: 68789456 markings, 262087169 edges, 348843 markings/sec, 190 secs
lola: 70498487 markings, 268635578 edges, 341806 markings/sec, 195 secs
lola: 72226531 markings, 275176476 edges, 345609 markings/sec, 200 secs
lola: 73944152 markings, 281770325 edges, 343524 markings/sec, 205 secs
lola: 75665091 markings, 288287613 edges, 344188 markings/sec, 210 secs
lola: 77363133 markings, 294760949 edges, 339608 markings/sec, 215 secs
lola: 79043916 markings, 301212985 edges, 336157 markings/sec, 220 secs
lola: 80735530 markings, 307632415 edges, 338323 markings/sec, 225 secs
lola: 82473091 markings, 314236413 edges, 347512 markings/sec, 230 secs
lola: 84258046 markings, 321050060 edges, 356991 markings/sec, 235 secs
lola: 86037015 markings, 327820267 edges, 355794 markings/sec, 240 secs
lola: 87806161 markings, 334576022 edges, 353829 markings/sec, 245 secs
lola: 89558764 markings, 341296171 edges, 350521 markings/sec, 250 secs
lola: 91316671 markings, 347959575 edges, 351581 markings/sec, 255 secs
lola: 93070912 markings, 354647366 edges, 350848 markings/sec, 260 secs
lola: 94808058 markings, 361309913 edges, 347429 markings/sec, 265 secs
lola: 96542284 markings, 367920721 edges, 346845 markings/sec, 270 secs
lola: 98269672 markings, 374484216 edges, 345478 markings/sec, 275 secs
lola: 99999885 markings, 381052921 edges, 346043 markings/sec, 280 secs
lola: 101699897 markings, 387553382 edges, 340002 markings/sec, 285 secs
lola: 103393271 markings, 393997241 edges, 338675 markings/sec, 290 secs
lola: 105155118 markings, 400721631 edges, 352369 markings/sec, 295 secs
lola: 106712092 markings, 406698386 edges, 311395 markings/sec, 300 secs
lola: 108324788 markings, 412838253 edges, 322539 markings/sec, 305 secs
lola: 110046872 markings, 419395575 edges, 344417 markings/sec, 310 secs
lola: 111761789 markings, 425902701 edges, 342983 markings/sec, 315 secs
lola: 113461868 markings, 432374361 edges, 340016 markings/sec, 320 secs
lola: 115138193 markings, 438769015 edges, 335265 markings/sec, 325 secs
lola: 116868055 markings, 445365317 edges, 345972 markings/sec, 330 secs
lola: 118566525 markings, 451840858 edges, 339694 markings/sec, 335 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((1 <= p24 + p25 + p26))) AND A (G ((1 <= p24 + p25 + p26))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p24 + p25 + p26)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p24 + p25 + p26)))
lola: processed formula length: 30
lola: 66 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)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p24 + p25 + p26 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((p23 + p22 + p21 <= 1)))) AND A (G (((p6 + p7 + p8 <= p23 + p22 + p21) OR (((p6 + p7 + p8 <= p23 + p22 + p21) U (p0 + p1 + p2 <= 2)) OR (p23 + p22 + p21 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p23 + p22 + p21 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p23 + p22 + p21 <= 1))))
lola: processed formula length: 34
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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: 59 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((G (((p3 + p4 + p5 + 1 <= p24 + p25 + p26) OR (p0 + p1 + p2 <= 2))) R (p9 + p10 + p11 <= 2)) U ((3 <= p9 + p10 + p11) U (p9 + p10 + p11 + 1 <= p23 + p22 + p21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((G (((p3 + p4 + p5 + 1 <= p24 + p25 + p26) OR (p0 + p1 + p2 <= 2))) R (p9 + p10 + p11 <= 2)) U ((3 <= p9 + p10 + p11) U (p9 + p10 + p11 + 1 <= p23 + p22 + p21))))
lola: processed formula length: 167
lola: 64 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 1734137 markings, 6569522 edges, 346827 markings/sec, 0 secs
lola: 3527259 markings, 13396669 edges, 358624 markings/sec, 5 secs
lola: 5268590 markings, 20014918 edges, 348266 markings/sec, 10 secs
lola: 7191379 markings, 27347536 edges, 384558 markings/sec, 15 secs
lola: 9078617 markings, 34524507 edges, 377448 markings/sec, 20 secs
lola: 10818672 markings, 41154879 edges, 348011 markings/sec, 25 secs
lola: 12685306 markings, 48256166 edges, 373327 markings/sec, 30 secs
lola: 14520071 markings, 55262191 edges, 366953 markings/sec, 35 secs
lola: 16341033 markings, 62204949 edges, 364192 markings/sec, 40 secs
lola: 18150270 markings, 69084480 edges, 361847 markings/sec, 45 secs
lola: 19931558 markings, 75884422 edges, 356258 markings/sec, 50 secs
lola: 21774107 markings, 82888426 edges, 368510 markings/sec, 55 secs
lola: 23599535 markings, 89839771 edges, 365086 markings/sec, 60 secs
lola: 25394653 markings, 96704321 edges, 359024 markings/sec, 65 secs
lola: 27204268 markings, 103600642 edges, 361923 markings/sec, 70 secs
lola: 28994211 markings, 110424643 edges, 357989 markings/sec, 75 secs
lola: 30779239 markings, 117205282 edges, 357006 markings/sec, 80 secs
lola: 32557290 markings, 123973840 edges, 355610 markings/sec, 85 secs
lola: 34336934 markings, 130785202 edges, 355929 markings/sec, 90 secs
lola: 36109180 markings, 137523925 edges, 354449 markings/sec, 95 secs
lola: 37852462 markings, 144186480 edges, 348656 markings/sec, 100 secs
lola: 39606081 markings, 150869701 edges, 350724 markings/sec, 105 secs
lola: 41355210 markings, 157516699 edges, 349826 markings/sec, 110 secs
lola: 43092509 markings, 164125607 edges, 347460 markings/sec, 115 secs
lola: 44811993 markings, 170680529 edges, 343897 markings/sec, 120 secs
lola: 46544118 markings, 177313520 edges, 346425 markings/sec, 125 secs
lola: 48212736 markings, 183645447 edges, 333724 markings/sec, 130 secs
lola: 49961603 markings, 190312407 edges, 349773 markings/sec, 135 secs
lola: 51719810 markings, 197009921 edges, 351641 markings/sec, 140 secs
lola: 53357768 markings, 203253270 edges, 327592 markings/sec, 145 secs
lola: 55101467 markings, 209935975 edges, 348740 markings/sec, 150 secs
lola: 56839943 markings, 216565146 edges, 347695 markings/sec, 155 secs
lola: 58561962 markings, 223126269 edges, 344404 markings/sec, 160 secs
lola: 60281300 markings, 229654944 edges, 343868 markings/sec, 165 secs
lola: 61983457 markings, 236151057 edges, 340431 markings/sec, 170 secs
lola: 63728146 markings, 242787197 edges, 348938 markings/sec, 175 secs
lola: 65465518 markings, 249418973 edges, 347474 markings/sec, 180 secs
lola: 67185173 markings, 255961437 edges, 343931 markings/sec, 185 secs
lola: 68908416 markings, 262531072 edges, 344649 markings/sec, 190 secs
lola: 70605127 markings, 269015484 edges, 339342 markings/sec, 195 secs
lola: 72299076 markings, 275493437 edges, 338790 markings/sec, 200 secs
lola: 74019018 markings, 282026802 edges, 343988 markings/sec, 205 secs
lola: 75616355 markings, 288143859 edges, 319467 markings/sec, 210 secs
lola: 77315856 markings, 294623058 edges, 339900 markings/sec, 215 secs
lola: 79008976 markings, 301069014 edges, 338624 markings/sec, 220 secs
lola: 80585981 markings, 307074207 edges, 315401 markings/sec, 225 secs
lola: 82196879 markings, 313229827 edges, 322180 markings/sec, 230 secs
lola: 83957726 markings, 319942546 edges, 352169 markings/sec, 235 secs
lola: 85724757 markings, 326641030 edges, 353406 markings/sec, 240 secs
lola: 87475441 markings, 333306943 edges, 350137 markings/sec, 245 secs
lola: 89024360 markings, 339219318 edges, 309784 markings/sec, 250 secs
lola: 90586203 markings, 345217341 edges, 312369 markings/sec, 255 secs
lola: 92250023 markings, 351555980 edges, 332764 markings/sec, 260 secs
lola: 93996065 markings, 358211708 edges, 349208 markings/sec, 265 secs
lola: 95725444 markings, 364788867 edges, 345876 markings/sec, 270 secs
lola: 97420739 markings, 371271506 edges, 339059 markings/sec, 275 secs
lola: 99138743 markings, 377792565 edges, 343601 markings/sec, 280 secs
lola: 100841687 markings, 384266482 edges, 340589 markings/sec, 285 secs
lola: 102519206 markings, 390701213 edges, 335504 markings/sec, 290 secs
lola: 104238241 markings, 397218924 edges, 343807 markings/sec, 295 secs
lola: 105953527 markings, 403803486 edges, 343057 markings/sec, 300 secs
lola: 107675190 markings, 410317970 edges, 344333 markings/sec, 305 secs
lola: 109364374 markings, 416770458 edges, 337837 markings/sec, 310 secs
lola: 111070495 markings, 423262779 edges, 341224 markings/sec, 315 secs
lola: 112753129 markings, 429678475 edges, 336527 markings/sec, 320 secs
lola: 114414088 markings, 436025854 edges, 332192 markings/sec, 325 secs
lola: 116111252 markings, 442475001 edges, 339433 markings/sec, 330 secs
lola: 117805902 markings, 448939725 edges, 338930 markings/sec, 335 secs
lola: 118860025 markings, 453000566 edges, 210825 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no yes no no no no no unknown yes
lola:
preliminary result: yes no no no no yes no no yes no no no no no unknown yes
lola: memory consumption: 82276 KB
lola: time consumption: 697 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590264148183

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is PhilosophersDyn-COL-03, 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 r135-tajo-158961408800049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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