fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r322-tall-162132128000157
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for TwoPhaseLocking-PT-nC00500vN

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16256.000 3600000.00 735791.00 18424.60 ?FFTFFTFFFFFFFFT normal

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.r322-tall-162132128000157.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 TwoPhaseLocking-PT-nC00500vN, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128000157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.6K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00500vN-00
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-01
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-02
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-03
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-04
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-05
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-06
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-07
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-08
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-09
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-10
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-11
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-12
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-13
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-14
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-15

=== Now, execution of the tool begins

BK_START 1621448439998

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 18:20:41] [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-19 18:20:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 18:20:41] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-19 18:20:41] [INFO ] Transformed 8 places.
[2021-05-19 18:20:41] [INFO ] Transformed 6 transitions.
[2021-05-19 18:20:41] [INFO ] Parsed PT model containing 8 places and 6 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100002 steps, including 0 resets, run finished after 102 ms. (steps per millisecond=980 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0]
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 18:20:41] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 18:20:41] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned unsat
[2021-05-19 18:20:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 18:20:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-19 18:20:41] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
[2021-05-19 18:20:42] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2021-05-19 18:20:42] [INFO ] Flatten gal took : 19 ms
FORMULA TwoPhaseLocking-PT-nC00500vN-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 18:20:42] [INFO ] Flatten gal took : 3 ms
[2021-05-19 18:20:42] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 18:20:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ TwoPhaseLocking-PT-nC00500vN @ 3570 seconds

FORMULA TwoPhaseLocking-PT-nC00500vN-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00500vN-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2819
rslt: Output for LTLCardinality @ TwoPhaseLocking-PT-nC00500vN

{
"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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 18:20:43 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p5 + 1 <= p3)",
"processed_size": 14,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X (G ((p5 + 1 <= p3))) OR G ((p3 <= 1))))",
"processed_size": 45,
"rewrites": 78
},
"result":
{
"edges": 1003,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p1)",
"processed_size": 9,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (X ((1 <= p1)))",
"processed_size": 17,
"rewrites": 78
},
"result":
{
"edges": 1004,
"markings": 1004,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p0 + 1 <= p7)",
"processed_size": 14,
"rewrites": 78
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p0 <= p2) U X ((p3 + 1 <= p7)))",
"processed_size": 33,
"rewrites": 78
},
"result":
{
"edges": 1003,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X ((p6 <= p2)) AND F (G ((G ((p2 + 1 <= p6)) AND (p5 + 1 <= p2))))))",
"processed_size": 72,
"rewrites": 78
},
"result":
{
"edges": 1006,
"markings": 1006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(X ((G ((X (X ((p3 <= 2))) OR (1 <= p2))) AND (p0 + 1 <= p5))) U (p0 <= p4))",
"processed_size": 76,
"rewrites": 78
},
"result":
{
"edges": 1003,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((F ((p7 <= 1)) AND X ((1 <= p5)))))",
"processed_size": 41,
"rewrites": 78
},
"result":
{
"edges": 1010,
"markings": 1009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p4 <= p6)))",
"processed_size": 18,
"rewrites": 78
},
"result":
{
"edges": 1003,
"markings": 1003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"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": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((F ((2 <= p1)) OR (2 <= p1)) AND (p1 + 1 <= p7))))",
"processed_size": 57,
"rewrites": 78
},
"result":
{
"edges": 1013,
"markings": 1011,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1090
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((p1 <= p6)) OR (1 <= p4)))",
"processed_size": 33,
"rewrites": 78
},
"result":
{
"edges": 255,
"markings": 255,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3271
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 80
},
"result":
{
"edges": 1009,
"markings": 1009,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 80
},
"result":
{
"edges": 1009,
"markings": 1009,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "((p3 <= p6) U (2 <= p2))",
"processed_size": 24,
"rewrites": 78
},
"result":
{
"edges": 1007,
"markings": 1007,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3560,
"runtime": 751.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(**) OR (X(G((F(**) AND (** OR **)))) OR **))) : (X((X(G(**)) OR G(**))) OR **) : F(G(((F(**) OR *) AND *))) : (X(X(X(X(F(*))))) AND (X(X(**)) OR **)) : ((** U X(**)) OR **) : G((F(**) OR **)) : F((X(**) AND F(G((G(*) AND **))))) : (X((G((X(X(*)) OR **)) AND **)) U **) : F(G((F(**) AND X(**)))) : (G(*) AND F(**)) : ((** U **) OR (G(*) AND F(**))) : X(G(*))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "unknown no no no no no no no no no no no ",
"value": "unknown no no no no no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 14/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 256
lola: finding significant places
lola: 8 places, 6 transitions, 5 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: G ((((F ((1 <= p1)) U F ((p1 <= p7))) OR X (G (((p7 <= p0) U (p1 <= 1))))) OR (1 <= p1))) : ((NOT(X (F (NOT(X ((p5 + 1 <= p3)))))) OR NOT(F (NOT(X ((p3 <= 1)))))) OR (p5 + 1 <= p3)) : G (X (F (NOT(X (G ((F ((NOT(F ((2 <= p1))) AND (p1 <= 1))) OR F ((p7 <= p1))))))))) : (X (X (X (NOT(G (X (((2 <= p6) OR (p3 <= p0)))))))) AND (X (X ((1 <= p1))) OR (1 <= p1))) : (((p0 <= p2) U X ((p3 + 1 <= p7))) OR (p0 + 1 <= p7)) : G ((F (NOT(G (NOT(F ((p1 <= p6)))))) OR (1 <= p4))) : F ((X ((p6 <= p2)) AND NOT(X (NOT(G (F (G ((NOT(F ((p6 <= p2))) AND (p5 + 1 <= p2)))))))))) : (X ((G ((X (NOT(X ((3 <= p3)))) OR (1 <= p2))) AND (p0 + 1 <= p5))) U (p0 <= p4)) : F (G (X (X ((((2 <= p7) U F ((p7 <= 1))) AND X ((1 <= p5))))))) : (NOT(F ((p5 <= p0))) AND F ((3 <= p1))) : (NOT((X (X (G ((p3 <= p6)))) U F ((p3 <= p6)))) U ((p3 <= p6) U (2 <= p2))) : NOT(X (F ((p6 + 1 <= p4))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:380
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:297
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p1 <= p7)) OR (X (G ((F ((p1 <= 1)) AND ((p7 <= p0) OR (p1 <= 1))))) OR (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p1 <= p7)) OR (X (G ((F ((p1 <= 1)) AND ((p7 <= p0) OR (p1 <= 1))))) OR (1 <= p1))))
lola: processed formula length: 92
lola: 78 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: 2169418 markings, 6733630 edges, 433884 markings/sec, 0 secs
lola: 3977787 markings, 12525439 edges, 361674 markings/sec, 5 secs
lola: 5709144 markings, 18114998 edges, 346271 markings/sec, 10 secs
lola: 7394823 markings, 23572768 edges, 337136 markings/sec, 15 secs
lola: 9024936 markings, 28883821 edges, 326023 markings/sec, 20 secs
lola: 10632678 markings, 34132632 edges, 321548 markings/sec, 25 secs
lola: 12211001 markings, 39295353 edges, 315665 markings/sec, 30 secs
lola: 13772395 markings, 44402778 edges, 312279 markings/sec, 35 secs
lola: 15296093 markings, 49406859 edges, 304740 markings/sec, 40 secs
lola: 16809539 markings, 54382344 edges, 302689 markings/sec, 45 secs
lola: 18311909 markings, 59328053 edges, 300474 markings/sec, 50 secs
lola: 19808983 markings, 64253137 edges, 299415 markings/sec, 55 secs
lola: 21305678 markings, 69183565 edges, 299339 markings/sec, 60 secs
lola: 22799494 markings, 74114321 edges, 298763 markings/sec, 65 secs
lola: 24266922 markings, 78961899 edges, 293486 markings/sec, 70 secs
lola: 25731883 markings, 83804497 edges, 292992 markings/sec, 75 secs
lola: 27185714 markings, 88608012 edges, 290766 markings/sec, 80 secs
lola: 28632011 markings, 93387361 edges, 289259 markings/sec, 85 secs
lola: 30067121 markings, 98141420 edges, 287022 markings/sec, 90 secs
lola: 31498224 markings, 102879370 edges, 286221 markings/sec, 95 secs
lola: 32918382 markings, 107586724 edges, 284032 markings/sec, 100 secs
lola: 34337139 markings, 112292752 edges, 283751 markings/sec, 105 secs
lola: 35749328 markings, 116978978 edges, 282438 markings/sec, 110 secs
lola: 37146169 markings, 121619967 edges, 279368 markings/sec, 115 secs
lola: 38544582 markings, 126263509 edges, 279683 markings/sec, 120 secs
lola: 39948201 markings, 130919160 edges, 280724 markings/sec, 125 secs
lola: 41342124 markings, 135550779 edges, 278785 markings/sec, 130 secs
lola: 42734717 markings, 140175850 edges, 278519 markings/sec, 135 secs
lola: 44122228 markings, 144786460 edges, 277502 markings/sec, 140 secs
lola: 45496191 markings, 149355551 edges, 274793 markings/sec, 145 secs
lola: 46868243 markings, 153924306 edges, 274410 markings/sec, 150 secs
lola: 48249184 markings, 158519946 edges, 276188 markings/sec, 155 secs
lola: 49618542 markings, 163078198 edges, 273872 markings/sec, 160 secs
lola: 50990779 markings, 167647658 edges, 274447 markings/sec, 165 secs
lola: 52354460 markings, 172191793 edges, 272736 markings/sec, 170 secs
lola: 53720658 markings, 176739579 edges, 273240 markings/sec, 175 secs
lola: 55072722 markings, 181249937 edges, 270413 markings/sec, 180 secs
lola: 56425985 markings, 185758328 edges, 270653 markings/sec, 185 secs
lola: 57764019 markings, 190226552 edges, 267607 markings/sec, 190 secs
lola: 59111075 markings, 194719522 edges, 269411 markings/sec, 195 secs
lola: 60466279 markings, 199237836 edges, 271041 markings/sec, 200 secs
lola: 61807176 markings, 203712059 edges, 268179 markings/sec, 205 secs
lola: 63159406 markings, 208218081 edges, 270446 markings/sec, 210 secs
lola: 64488270 markings, 212662668 edges, 265773 markings/sec, 215 secs
lola: 65820234 markings, 217110014 edges, 266393 markings/sec, 220 secs
lola: 67146881 markings, 221546105 edges, 265329 markings/sec, 225 secs
lola: 68465591 markings, 225959924 edges, 263742 markings/sec, 230 secs
lola: 69806166 markings, 230435776 edges, 268115 markings/sec, 235 secs
lola: 71108938 markings, 234790475 edges, 260554 markings/sec, 240 secs
lola: 72429966 markings, 239207721 edges, 264206 markings/sec, 245 secs
lola: 73754482 markings, 243636454 edges, 264903 markings/sec, 250 secs
lola: 75073720 markings, 248041491 edges, 263848 markings/sec, 255 secs
lola: 76384965 markings, 252426914 edges, 262249 markings/sec, 260 secs
lola: 77693465 markings, 256801145 edges, 261700 markings/sec, 265 secs
lola: 78995927 markings, 261163356 edges, 260492 markings/sec, 270 secs
lola: 80317552 markings, 265578319 edges, 264325 markings/sec, 275 secs
lola: 81613541 markings, 269919268 edges, 259198 markings/sec, 280 secs
lola: 82916865 markings, 274285888 edges, 260665 markings/sec, 285 secs
lola: 84226437 markings, 278664679 edges, 261914 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X (G ((p5 + 1 <= p3))) OR G ((p3 <= 1)))) OR (p5 + 1 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 + 1 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 + 1 <= p3)
lola: processed formula length: 14
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p5 + 1 <= p3))) OR G ((p3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p5 + 1 <= p3))) OR G ((p3 <= 1))))
lola: processed formula length: 45
lola: 78 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: 1003 markings, 1003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (F (((p6 <= 1) AND (p0 + 1 <= p3))))))) AND (X (X ((1 <= p1))) OR (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p1)
lola: processed formula length: 9
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((1 <= p1)))
lola: processed formula length: 17
lola: 78 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: 1004 markings, 1004 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 <= p2) U X ((p3 + 1 <= p7))) OR (p0 + 1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + 1 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + 1 <= p7)
lola: processed formula length: 14
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= p2) U X ((p3 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p0 <= p2) U X ((p3 + 1 <= p7)))
lola: processed formula length: 33
lola: 78 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: 1003 markings, 1003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p6 <= p2)) AND F (G ((G ((p2 + 1 <= p6)) AND (p5 + 1 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p6 <= p2)) AND F (G ((G ((p2 + 1 <= p6)) AND (p5 + 1 <= p2))))))
lola: processed formula length: 72
lola: 78 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: 1006 markings, 1006 edges
lola: ========================================
lola: subprocess 5 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G ((X (X ((p3 <= 2))) OR (1 <= p2))) AND (p0 + 1 <= p5))) U (p0 <= p4))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((G ((X (X ((p3 <= 2))) OR (1 <= p2))) AND (p0 + 1 <= p5))) U (p0 <= p4))
lola: processed formula length: 76
lola: 78 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: 1003 markings, 1003 edges
lola: ========================================
lola: subprocess 6 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p7 <= 1)) AND X ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p7 <= 1)) AND X ((1 <= p5)))))
lola: processed formula length: 41
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1009 markings, 1010 edges
lola: ========================================
lola: subprocess 7 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p4 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p4 <= p6)))
lola: processed formula length: 18
lola: 78 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1003 markings, 1003 edges
lola: ========================================
lola: subprocess 8 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((F ((2 <= p1)) OR (2 <= p1)) AND (p1 + 1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((F ((2 <= p1)) OR (2 <= p1)) AND (p1 + 1 <= p7))))
lola: processed formula length: 57
lola: 78 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: 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: 1011 markings, 1013 edges
lola: ========================================
lola: subprocess 9 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((p1 <= p6)) OR (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p1 <= p6)) OR (1 <= p4)))
lola: processed formula length: 33
lola: 78 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: 255 markings, 255 edges
lola: ========================================
lola: subprocess 10 will run for 1635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((p0 + 1 <= p5)) AND F ((3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1 <= 2)
lola: processed formula length: 9
lola: 80 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, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 3271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p3 <= p6) U (2 <= p2)) OR (G ((p6 + 1 <= p3)) AND F ((2 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 1)
lola: processed formula length: 9
lola: 80 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: 1009 markings, 1009 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((p1 <= p7)) OR (X (G ((F ((p1 <= 1)) AND ((p7 <= p0) OR (p1 <= 1))))) OR (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((p1 <= p7)) OR (X (G ((F ((p1 <= 1)) AND ((p7 <= p0) OR (p1 <= 1))))) OR (1 <= p1))))
lola: processed formula length: 92
lola: 78 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: 2188814 markings, 6793860 edges, 437763 markings/sec, 0 secs
lola: 4020313 markings, 12662146 edges, 366300 markings/sec, 5 secs
lola: 5751189 markings, 18248476 edges, 346175 markings/sec, 10 secs
lola: 7433128 markings, 23697968 edges, 336388 markings/sec, 15 secs
lola: 9057301 markings, 28989694 edges, 324835 markings/sec, 20 secs
lola: 10658804 markings, 34217436 edges, 320301 markings/sec, 25 secs
lola: 12236382 markings, 39378405 edges, 315516 markings/sec, 30 secs
lola: 13805117 markings, 44509961 edges, 313747 markings/sec, 35 secs
lola: 15342540 markings, 49559132 edges, 307485 markings/sec, 40 secs
lola: 16871599 markings, 54585401 edges, 305812 markings/sec, 45 secs
lola: 18383381 markings, 59560857 edges, 302356 markings/sec, 50 secs
lola: 19882793 markings, 64497858 edges, 299882 markings/sec, 55 secs
lola: 21376895 markings, 69419572 edges, 298820 markings/sec, 60 secs
lola: 22858759 markings, 74308657 edges, 296373 markings/sec, 65 secs
lola: 24333538 markings, 79182069 edges, 294956 markings/sec, 70 secs
lola: 25802478 markings, 84037047 edges, 293788 markings/sec, 75 secs
lola: 27260920 markings, 88856559 edges, 291688 markings/sec, 80 secs
lola: 28719654 markings, 93676436 edges, 291747 markings/sec, 85 secs
lola: 30156033 markings, 98437738 edges, 287276 markings/sec, 90 secs
lola: 31592238 markings, 103192567 edges, 287241 markings/sec, 95 secs
lola: 33022668 markings, 107931698 edges, 286086 markings/sec, 100 secs
lola: 34444463 markings, 112647827 edges, 284359 markings/sec, 105 secs
lola: 35864344 markings, 117359421 edges, 283976 markings/sec, 110 secs
lola: 37267758 markings, 122023163 edges, 280683 markings/sec, 115 secs
lola: 38672884 markings, 126689436 edges, 281025 markings/sec, 120 secs
lola: 40081453 markings, 131361163 edges, 281714 markings/sec, 125 secs
lola: 41483472 markings, 136020008 edges, 280404 markings/sec, 130 secs
lola: 42885100 markings, 140678034 edges, 280326 markings/sec, 135 secs
lola: 44280175 markings, 145312764 edges, 279015 markings/sec, 140 secs
lola: 45676383 markings, 149953722 edges, 279242 markings/sec, 145 secs
lola: 47054920 markings, 154545697 edges, 275707 markings/sec, 150 secs
lola: 48434557 markings, 159136124 edges, 275927 markings/sec, 155 secs
lola: 49803337 markings, 163692530 edges, 273756 markings/sec, 160 secs
lola: 51187190 markings, 168300091 edges, 276771 markings/sec, 165 secs
lola: 52553410 markings, 172856523 edges, 273244 markings/sec, 170 secs
lola: 53917017 markings, 177393737 edges, 272721 markings/sec, 175 secs
lola: 55259273 markings, 181873622 edges, 268451 markings/sec, 180 secs
lola: 56610276 markings, 186369903 edges, 270201 markings/sec, 185 secs
lola: 57937680 markings, 190806467 edges, 265481 markings/sec, 190 secs
lola: 59294421 markings, 195329838 edges, 271348 markings/sec, 195 secs
lola: 60651061 markings, 199855339 edges, 271328 markings/sec, 200 secs
lola: 61993909 markings, 204337407 edges, 268570 markings/sec, 205 secs
lola: 63336882 markings, 208810607 edges, 268595 markings/sec, 210 secs
lola: 64669570 markings, 213268321 edges, 266538 markings/sec, 215 secs
lola: 66001358 markings, 217715874 edges, 266358 markings/sec, 220 secs
lola: 67330667 markings, 222161895 edges, 265862 markings/sec, 225 secs
lola: 68651282 markings, 226580247 edges, 264123 markings/sec, 230 secs
lola: 69989515 markings, 231049333 edges, 267647 markings/sec, 235 secs
lola: 71315747 markings, 235484225 edges, 265246 markings/sec, 240 secs
lola: 72644417 markings, 239924921 edges, 265734 markings/sec, 245 secs
lola: 73986719 markings, 244411359 edges, 268460 markings/sec, 250 secs
lola: 75316767 markings, 248855778 edges, 266010 markings/sec, 255 secs
lola: 76634267 markings, 253262840 edges, 263500 markings/sec, 260 secs
lola: 77967204 markings, 257717433 edges, 266587 markings/sec, 265 secs
lola: 79278515 markings, 262109752 edges, 262262 markings/sec, 270 secs
lola: 80609356 markings, 266556324 edges, 266168 markings/sec, 275 secs
lola: 81898126 markings, 270872029 edges, 257754 markings/sec, 280 secs
lola: 83205976 markings, 275252917 edges, 261570 markings/sec, 285 secs
lola: 84521320 markings, 279653866 edges, 263069 markings/sec, 290 secs
lola: 85817180 markings, 283993506 edges, 259172 markings/sec, 295 secs
lola: 87114927 markings, 288339173 edges, 259549 markings/sec, 300 secs
lola: 88410049 markings, 292677910 edges, 259024 markings/sec, 305 secs
lola: 89706040 markings, 297012886 edges, 259198 markings/sec, 310 secs
lola: 90983407 markings, 301293749 edges, 255473 markings/sec, 315 secs
lola: 92237226 markings, 305494417 edges, 250764 markings/sec, 320 secs
lola: 93379782 markings, 309322714 edges, 228511 markings/sec, 325 secs
lola: 94315756 markings, 312461849 edges, 187195 markings/sec, 330 secs
lola: 95489367 markings, 316383815 edges, 234722 markings/sec, 335 secs
lola: 96434343 markings, 319553437 edges, 188995 markings/sec, 340 secs
lola: 97402199 markings, 322800326 edges, 193571 markings/sec, 345 secs
lola: 98489595 markings, 326448624 edges, 217479 markings/sec, 350 secs
lola: 99503092 markings, 329843291 edges, 202699 markings/sec, 355 secs
lola: 100595507 markings, 333498975 edges, 218483 markings/sec, 360 secs
lola: 101767598 markings, 337434697 edges, 234418 markings/sec, 365 secs
lola: 102836649 markings, 341019951 edges, 213810 markings/sec, 370 secs
lola: 103461050 markings, 343118106 edges, 124880 markings/sec, 375 secs
lola: 104513997 markings, 346644254 edges, 210589 markings/sec, 380 secs
lola: 105315882 markings, 349336132 edges, 160377 markings/sec, 385 secs
lola: 106310742 markings, 352669989 edges, 198972 markings/sec, 390 secs
lola: 107384221 markings, 356273947 edges, 214696 markings/sec, 395 secs
lola: 108563552 markings, 360231736 edges, 235866 markings/sec, 400 secs
lola: 109767266 markings, 364274783 edges, 240743 markings/sec, 405 secs
lola: 110583557 markings, 367009212 edges, 163258 markings/sec, 410 secs
lola: 111795690 markings, 371082238 edges, 242427 markings/sec, 415 secs
lola: 112593205 markings, 373750516 edges, 159503 markings/sec, 420 secs
lola: 113649641 markings, 377302434 edges, 211287 markings/sec, 425 secs
lola: 114676234 markings, 380750192 edges, 205319 markings/sec, 430 secs
lola: 115494686 markings, 383498782 edges, 163690 markings/sec, 435 secs
lola: 115507295 markings, 383541427 edges, 2522 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (((p3 <= p6) U (2 <= p2)) OR (G ((p6 + 1 <= p3)) AND F ((2 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((2 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 1)
lola: processed formula length: 9
lola: 80 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: 1009 markings, 1009 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p3 <= p6) U (2 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p3 <= p6) U (2 <= p2))
lola: processed formula length: 24
lola: 78 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: 1007 markings, 1007 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no no no no no no no no no no no
lola:
preliminary result: unknown no no no no no no no no no no no
lola: memory consumption: 3560 KB
lola: time consumption: 751 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="TwoPhaseLocking-PT-nC00500vN"
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 TwoPhaseLocking-PT-nC00500vN, 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 r322-tall-162132128000157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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