fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r221-tajo-159033502000145
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for ShieldPPPt-PT-001B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10107.320 1359974.00 1413482.00 202.20 FFFTTTFFFTTFTTFF normal

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.r221-tajo-159033502000145.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 ShieldPPPt-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r221-tajo-159033502000145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.3K May 14 01:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 01:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.7K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 19K May 12 20:42 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 ShieldPPPt-PT-001B-00
FORMULA_NAME ShieldPPPt-PT-001B-01
FORMULA_NAME ShieldPPPt-PT-001B-02
FORMULA_NAME ShieldPPPt-PT-001B-03
FORMULA_NAME ShieldPPPt-PT-001B-04
FORMULA_NAME ShieldPPPt-PT-001B-05
FORMULA_NAME ShieldPPPt-PT-001B-06
FORMULA_NAME ShieldPPPt-PT-001B-07
FORMULA_NAME ShieldPPPt-PT-001B-08
FORMULA_NAME ShieldPPPt-PT-001B-09
FORMULA_NAME ShieldPPPt-PT-001B-10
FORMULA_NAME ShieldPPPt-PT-001B-11
FORMULA_NAME ShieldPPPt-PT-001B-12
FORMULA_NAME ShieldPPPt-PT-001B-13
FORMULA_NAME ShieldPPPt-PT-001B-14
FORMULA_NAME ShieldPPPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1590894684470

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldPPPt-PT-001B @ 3570 seconds

FORMULA ShieldPPPt-PT-001B-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-001B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2210
rslt: Output for LTLCardinality @ ShieldPPPt-PT-001B

{
"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": "Sun May 31 03:11:24 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "FALSE",
"processed_size": 5,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((X ((G ((p66 + 1 <= p46)) AND X (F ((p65 <= p72))))) U (p80 <= p75)))",
"processed_size": 72,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 2,
"visible_transitions": 0
},
"processed": "A (((p26 + 1 <= p39) R X (X (G ((p26 + 1 <= p39))))))",
"processed_size": 53,
"rewrites": 105
},
"result":
{
"edges": 42,
"markings": 42,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (X ((F (((p64 <= p33) AND X (X ((p0 + 1 <= p5))))) OR ((p70 <= p16) AND F ((1 <= p23))))))",
"processed_size": 92,
"rewrites": 105
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 332
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (F ((p55 <= 0))))",
"processed_size": 22,
"rewrites": 105
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 369
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((p68 <= p37) OR X (TRUE)))",
"processed_size": 30,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 415
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (F (((p60 <= p27) OR F (G ((p32 <= p61)))))))",
"processed_size": 50,
"rewrites": 105
},
"result":
{
"edges": 3883404,
"markings": 1044353,
"produced_by": "LTL model checker",
"value": true
},
"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": 474
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (F ((p32 <= p61))))",
"processed_size": 24,
"rewrites": 105
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"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 <= p75)",
"processed_size": 10,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 554
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "A (G ((p57 + 1 <= p44)))",
"processed_size": 24,
"rewrites": 107
},
"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": 664
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"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": "A (G (((p22 + 1 <= p16) AND ((p44 + 1 <= p75)))))",
"processed_size": 49,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 831
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p58 <= p4)",
"processed_size": 11,
"rewrites": 107
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1108
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p15 <= p33))))",
"processed_size": 24,
"rewrites": 105
},
"result":
{
"edges": 1108,
"markings": 1051,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"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": 1662
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (F (((((p78 <= p42) AND G ((p39 <= p6))) U G ((p28 <= p69))) OR F ((p28 <= p69))))))",
"processed_size": 89,
"rewrites": 105
},
"result":
{
"edges": 1394624,
"markings": 180599,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 14,
"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": 3322
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3322
},
"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": "(p37 <= p32)",
"processed_size": 12,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (((F ((p45 + 1 <= p58)) U G ((p58 <= p45))) OR (F (G ((p58 <= p45))) AND F (G (((p58 <= p45) OR X (TRUE))))))))",
"processed_size": 116,
"rewrites": 105
},
"result":
{
"edges": 650577720,
"markings": 71616249,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 12
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"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": "(p37 <= p32)",
"processed_size": 12,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p32 + 1 <= p37))))",
"processed_size": 28,
"rewrites": 105
},
"result":
{
"edges": 56,
"markings": 55,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"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": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 25440,
"runtime": 1360.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** AND (A(F(**)) AND A(X(G((F(**) AND ((** AND X(**)) OR **))))))) : A(F(G(**))) : (** AND A(F(G(*)))) : A(X(((F(*) U G(**)) OR (F(G(**)) AND F(G((** OR X(TRUE)))))))) : A((X((G(*) AND X(F(**)))) U **)) : A(X(**)) : A(G(F((((** AND G(**)) U G(**)) OR F(**))))) : A((* R X(X(G(*))))) : A(X((F((** AND X(X(*)))) OR (** AND F(**))))) : A(F(**)) : A(X(F(**))) : A(G(*)) : A((** OR X(TRUE))) : (A(G(F((** OR F(G(**)))))) AND A(X(F(**)))) : FALSE : A(G(*))"
},
"net":
{
"arcs": 184,
"conflict_clusters": 67,
"places": 81,
"places_significant": 69,
"singleton_clusters": 0,
"transitions": 74
},
"result":
{
"preliminary_value": "no no no yes yes yes no no no yes yes no yes yes no no ",
"value": "no no no yes yes yes no no no yes yes no yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 155/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 81
lola: finding significant places
lola: 81 places, 74 transitions, 69 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 false: (3 <= p32)
lola: LP says that atomic proposition is always false: (2 <= p35)
lola: LP says that atomic proposition is always false: (3 <= p62)
lola: LP says that atomic proposition is always false: (2 <= p0)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p47)
lola: LP says that atomic proposition is always false: (2 <= p47)
lola: LP says that atomic proposition is always false: (2 <= p47)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (3 <= p25)
lola: LP says that atomic proposition is always false: (2 <= p53)
lola: LP says that atomic proposition is always false: (2 <= p53)
lola: A ((((1 <= p75) AND F ((p47 <= p20))) AND G (X ((((1 <= p75) AND X ((p55 <= p61))) U (p55 <= p61)))))) : A (F ((G ((p15 <= p33)) AND (F (((p33 + 1 <= p15) AND F (((1 <= p8) U F ((p56 <= p57)))))) U (0 <= p26))))) : A (((p37 <= p32) AND G (NOT(((p32 <= 2) AND X (X (F (G (((p35 <= 1) U (p37 <= p32))))))))))) : A (X ((F (G (((p58 <= p45) OR X (X ((0 <= p35)))))) U (NOT(G ((p58 <= p45))) U G ((p58 <= p45)))))) : A (((NOT(X (F ((p46 <= p66)))) AND F (X (X ((p65 <= p72))))) U (p80 <= p75))) : A ((NOT(F ((0 <= p10))) U ((3 <= p62) OR X ((p2 <= p64))))) : A (X (G (X (X (F (((((p78 <= p42) AND G ((p39 <= p6))) U G ((p28 <= p69))) OR F ((p28 <= p69))))))))) : A (NOT(((p39 <= p26) U X (F (X ((p39 <= p26))))))) : A (X ((F (((p64 <= p33) AND NOT(X (X ((p5 <= p0)))))) OR ((p70 <= p16) AND F ((1 <= p23)))))) : A (F (((2 <= p0) OR ((p73 <= p25) U (p4 + 1 <= p58))))) : A (X (NOT((G ((2 <= p16)) OR NOT(F ((p55 <= 0))))))) : A (G (NOT(F (((p16 <= p22) OR ((p75 <= p44))))))) : A ((((p68 <= p37) OR G ((F ((2 <= p47)) U (2 <= p47)))) OR G (((2 <= p47) U X ((0 <= p52)))))) : A ((G (F (((p60 <= p27) OR F (G ((p32 <= p61)))))) AND ((2 <= p10) U F (((2 <= p10) U X ((p32 <= p61))))))) : A (X (F (NOT(G (NOT(G (X ((3 <= p25))))))))) : A (G (NOT(F (((2 <= p53) OR ((2 <= p53) U F ((p44 <= p57))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
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: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((F ((p45 + 1 <= p58)) U G ((p58 <= p45))) OR (F (G ((p58 <= p45))) AND F (G (((p58 <= p45) OR X (TRUE))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((F ((p45 + 1 <= p58)) U G ((p58 <= p45))) OR (F (G ((p58 <= p45))) AND F (G (((p58 <= p45) OR X (TRUE))))))))
lola: processed formula length: 116
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 1240721 markings, 3578819 edges, 248144 markings/sec, 0 secs
lola: 2111756 markings, 6473733 edges, 174207 markings/sec, 5 secs
lola: 2908873 markings, 9278229 edges, 159423 markings/sec, 10 secs
lola: 3690863 markings, 12172309 edges, 156398 markings/sec, 15 secs
lola: 4389323 markings, 14875147 edges, 139692 markings/sec, 20 secs
lola: 5076888 markings, 17614334 edges, 137513 markings/sec, 25 secs
lola: 5688791 markings, 20174353 edges, 122381 markings/sec, 30 secs
lola: 6269459 markings, 22669752 edges, 116134 markings/sec, 35 secs
lola: 6876139 markings, 25325901 edges, 121336 markings/sec, 40 secs
lola: 7440947 markings, 27915014 edges, 112962 markings/sec, 45 secs
lola: 8010076 markings, 30575600 edges, 113826 markings/sec, 50 secs
lola: 8533461 markings, 33110487 edges, 104677 markings/sec, 55 secs
lola: 9058547 markings, 35732394 edges, 105017 markings/sec, 60 secs
lola: 9586471 markings, 38443413 edges, 105585 markings/sec, 65 secs
lola: 10127399 markings, 41299167 edges, 108186 markings/sec, 70 secs
lola: 10666941 markings, 44227515 edges, 107908 markings/sec, 75 secs
lola: 11210809 markings, 47197313 edges, 108774 markings/sec, 80 secs
lola: 11746254 markings, 50180808 edges, 107089 markings/sec, 85 secs
lola: 12290771 markings, 53338222 edges, 108903 markings/sec, 90 secs
lola: 12841772 markings, 56683442 edges, 110200 markings/sec, 95 secs
lola: 13389715 markings, 60008601 edges, 109589 markings/sec, 100 secs
lola: 13891477 markings, 63097273 edges, 100352 markings/sec, 105 secs
lola: 14398355 markings, 66266923 edges, 101376 markings/sec, 110 secs
lola: 14999724 markings, 69960253 edges, 120274 markings/sec, 115 secs
lola: 15515995 markings, 73489304 edges, 103254 markings/sec, 120 secs
lola: 15627806 markings, 75650467 edges, 22362 markings/sec, 125 secs
lola: 15657327 markings, 77557989 edges, 5904 markings/sec, 130 secs
lola: 15678490 markings, 79344131 edges, 4233 markings/sec, 135 secs
lola: 15684952 markings, 81028184 edges, 1292 markings/sec, 140 secs
lola: 15691990 markings, 82700129 edges, 1408 markings/sec, 145 secs
lola: 15695237 markings, 84373973 edges, 649 markings/sec, 150 secs
lola: 15698096 markings, 86101056 edges, 572 markings/sec, 155 secs
lola: 15701520 markings, 87888370 edges, 685 markings/sec, 160 secs
lola: 15702708 markings, 89568581 edges, 238 markings/sec, 165 secs
lola: 15703736 markings, 91307069 edges, 206 markings/sec, 170 secs
lola: 15704222 markings, 93054948 edges, 97 markings/sec, 175 secs
lola: 15704464 markings, 95100321 edges, 48 markings/sec, 180 secs
lola: 16149318 markings, 98284595 edges, 88971 markings/sec, 185 secs
lola: 16725668 markings, 101523457 edges, 115270 markings/sec, 190 secs
lola: 17215137 markings, 104552029 edges, 97894 markings/sec, 195 secs
lola: 17700180 markings, 107701854 edges, 97009 markings/sec, 200 secs
lola: 18144506 markings, 110711034 edges, 88865 markings/sec, 205 secs
lola: 18574260 markings, 113689239 edges, 85951 markings/sec, 210 secs
lola: 18988505 markings, 116659789 edges, 82849 markings/sec, 215 secs
lola: 19405455 markings, 119734313 edges, 83390 markings/sec, 220 secs
lola: 19791580 markings, 122631722 edges, 77225 markings/sec, 225 secs
lola: 20161371 markings, 125483837 edges, 73958 markings/sec, 230 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no unknown
lola: memory consumption: 2975124 KB
lola: time consumption: 242 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((G ((p66 + 1 <= p46)) AND X (F ((p65 <= p72))))) U (p80 <= p75)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((G ((p66 + 1 <= p46)) AND X (F ((p65 <= p72))))) U (p80 <= p75)))
lola: processed formula length: 72
lola: 105 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: 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 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p2 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p2 <= p64)))
lola: processed formula length: 19
lola: 105 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p26 + 1 <= p39) R X (X (G ((p26 + 1 <= p39))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p26 + 1 <= p39) R X (X (G ((p26 + 1 <= p39))))))
lola: processed formula length: 53
lola: 105 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: 42 markings, 42 edges
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F (((p64 <= p33) AND X (X ((p0 + 1 <= p5))))) OR ((p70 <= p16) AND F ((1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F (((p64 <= p33) AND X (X ((p0 + 1 <= p5))))) OR ((p70 <= p16) AND F ((1 <= p23))))))
lola: processed formula length: 92
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 42 markings, 42 edges
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p55 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p55 <= 0))))
lola: processed formula length: 22
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p68 <= p37) OR X (TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p68 <= p37) OR X (TRUE)))
lola: processed formula length: 30
lola: 105 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 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((p60 <= p27) OR F (G ((p32 <= p61))))))) AND A (X (F ((p32 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p60 <= p27) OR F (G ((p32 <= p61)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p60 <= p27) OR F (G ((p32 <= p61)))))))
lola: processed formula length: 50
lola: 105 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: ========================================
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: 1044353 markings, 3883404 edges
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p32 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p32 <= p61))))
lola: processed formula length: 24
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p75) AND (A (F ((p47 <= p20))) AND A (X (G ((F ((p55 <= p61)) AND (((1 <= p75) AND X ((p55 <= p61))) OR (p55 <= p61))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p75)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p75)
lola: processed formula length: 10
lola: 105 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p57 + 1 <= p44)))
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:788
lola: processed formula: A (G ((p57 + 1 <= p44)))
lola: processed formula length: 24
lola: 107 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p44 <= p57)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-10-0.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p22 + 1 <= p16) AND ((p44 + 1 <= p75)))))
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:788
lola: processed formula: A (G (((p22 + 1 <= p16) AND ((p44 + 1 <= p75)))))
lola: processed formula length: 49
lola: 107 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p16 <= p22) OR ((p75 <= p44)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p4 + 1 <= p58)))
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: (p58 <= p4)
lola: processed formula length: 11
lola: 107 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p15 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p15 <= p33))))
lola: processed formula length: 24
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 9
lola: add low 10
lola: add low 11
lola: add low 70
lola: add low 35
lola: add low 69
lola: add low 32
lola: add low 57
lola: add low 59
lola: add low 72
lola: add low 12
lola: add low 36
lola: add low 37
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: 1051 markings, 1108 edges
lola: ========================================
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((((p78 <= p42) AND G ((p39 <= p6))) U G ((p28 <= p69))) OR F ((p28 <= p69))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((((p78 <= p42) AND G ((p39 <= p6))) U G ((p28 <= p69))) OR F ((p28 <= p69))))))
lola: processed formula length: 89
lola: 105 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: 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: 180599 markings, 1394624 edges
lola: ========================================
lola: subprocess 15 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p37 <= p32) AND A (F (G ((p32 + 1 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p37 <= p32)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p37 <= p32)
lola: processed formula length: 12
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (((F ((p45 + 1 <= p58)) U G ((p58 <= p45))) OR (F (G ((p58 <= p45))) AND F (G (((p58 <= p45) OR X (TRUE))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((F ((p45 + 1 <= p58)) U G ((p58 <= p45))) OR (F (G ((p58 <= p45))) AND F (G (((p58 <= p45) OR X (TRUE))))))))
lola: processed formula length: 116
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 1213753 markings, 3496073 edges, 242751 markings/sec, 0 secs
lola: 2081798 markings, 6374462 edges, 173609 markings/sec, 5 secs
lola: 2871398 markings, 9142799 edges, 157920 markings/sec, 10 secs
lola: 3622138 markings, 11913261 edges, 150148 markings/sec, 15 secs
lola: 4339867 markings, 14678542 edges, 143546 markings/sec, 20 secs
lola: 5028106 markings, 17408730 edges, 137648 markings/sec, 25 secs
lola: 5693776 markings, 20195249 edges, 133134 markings/sec, 30 secs
lola: 6364486 markings, 23083106 edges, 134142 markings/sec, 35 secs
lola: 7059248 markings, 26152414 edges, 138952 markings/sec, 40 secs
lola: 7748115 markings, 29333474 edges, 137773 markings/sec, 45 secs
lola: 8427943 markings, 32591866 edges, 135966 markings/sec, 50 secs
lola: 9098723 markings, 35943792 edges, 134156 markings/sec, 55 secs
lola: 9740772 markings, 39248685 edges, 128410 markings/sec, 60 secs
lola: 10354572 markings, 42511818 edges, 122760 markings/sec, 65 secs
lola: 10943725 markings, 45733982 edges, 117831 markings/sec, 70 secs
lola: 11518344 markings, 48896588 edges, 114924 markings/sec, 75 secs
lola: 12068867 markings, 52037589 edges, 110105 markings/sec, 80 secs
lola: 12598540 markings, 55198909 edges, 105935 markings/sec, 85 secs
lola: 13164316 markings, 58648921 edges, 113155 markings/sec, 90 secs
lola: 13722380 markings, 62061042 edges, 111613 markings/sec, 95 secs
lola: 14290288 markings, 65593466 edges, 113582 markings/sec, 100 secs
lola: 14893630 markings, 69313357 edges, 120668 markings/sec, 105 secs
lola: 15444974 markings, 72908199 edges, 110269 markings/sec, 110 secs
lola: 15625159 markings, 75480887 edges, 36037 markings/sec, 115 secs
lola: 15664188 markings, 77771291 edges, 7806 markings/sec, 120 secs
lola: 15681048 markings, 79953557 edges, 3372 markings/sec, 125 secs
lola: 15685955 markings, 81601265 edges, 981 markings/sec, 130 secs
lola: 15694678 markings, 83943503 edges, 1745 markings/sec, 135 secs
lola: 15697795 markings, 85783031 edges, 623 markings/sec, 140 secs
lola: 15700767 markings, 87321557 edges, 594 markings/sec, 145 secs
lola: 15702279 markings, 88845237 edges, 302 markings/sec, 150 secs
lola: 15703139 markings, 90407365 edges, 172 markings/sec, 155 secs
lola: 15703942 markings, 92020379 edges, 161 markings/sec, 160 secs
lola: 15704434 markings, 94595948 edges, 98 markings/sec, 165 secs
lola: 16158233 markings, 98330375 edges, 90760 markings/sec, 170 secs
lola: 16860774 markings, 102335263 edges, 140508 markings/sec, 175 secs
lola: 17421733 markings, 105874338 edges, 112192 markings/sec, 180 secs
lola: 17948430 markings, 109376754 edges, 105339 markings/sec, 185 secs
lola: 18453376 markings, 112841148 edges, 100989 markings/sec, 190 secs
lola: 18967051 markings, 116504188 edges, 102735 markings/sec, 195 secs
lola: 19467775 markings, 120204198 edges, 100145 markings/sec, 200 secs
lola: 19960646 markings, 123920183 edges, 98574 markings/sec, 205 secs
lola: 20438836 markings, 127648895 edges, 95638 markings/sec, 210 secs
lola: 20872488 markings, 131064062 edges, 86730 markings/sec, 215 secs
lola: 21305972 markings, 134631424 edges, 86697 markings/sec, 220 secs
lola: 21749372 markings, 138357087 edges, 88680 markings/sec, 225 secs
lola: 22184579 markings, 142112045 edges, 87041 markings/sec, 230 secs
lola: 22616359 markings, 145856042 edges, 86356 markings/sec, 235 secs
lola: 23041585 markings, 149630035 edges, 85045 markings/sec, 240 secs
lola: 23410803 markings, 153024793 edges, 73844 markings/sec, 245 secs
lola: 23770905 markings, 156358537 edges, 72020 markings/sec, 250 secs
lola: 24150476 markings, 159961645 edges, 75914 markings/sec, 255 secs
lola: 24524544 markings, 163597273 edges, 74814 markings/sec, 260 secs
lola: 24914799 markings, 167467076 edges, 78051 markings/sec, 265 secs
lola: 25300249 markings, 171394266 edges, 77090 markings/sec, 270 secs
lola: 25677767 markings, 175285253 edges, 75504 markings/sec, 275 secs
lola: 26058261 markings, 179300495 edges, 76099 markings/sec, 280 secs
lola: 26437775 markings, 183373993 edges, 75903 markings/sec, 285 secs
lola: 26768967 markings, 186997761 edges, 66238 markings/sec, 290 secs
lola: 27061328 markings, 190211093 edges, 58472 markings/sec, 295 secs
lola: 27346713 markings, 193341408 edges, 57077 markings/sec, 300 secs
lola: 27621635 markings, 196396316 edges, 54984 markings/sec, 305 secs
lola: 27900720 markings, 199529661 edges, 55817 markings/sec, 310 secs
lola: 28179328 markings, 202773130 edges, 55722 markings/sec, 315 secs
lola: 28456583 markings, 206076709 edges, 55451 markings/sec, 320 secs
lola: 28737337 markings, 209499057 edges, 56151 markings/sec, 325 secs
lola: 29018545 markings, 212921199 edges, 56242 markings/sec, 330 secs
lola: 29295464 markings, 216290544 edges, 55384 markings/sec, 335 secs
lola: 29583851 markings, 219820513 edges, 57677 markings/sec, 340 secs
lola: 29924282 markings, 223998640 edges, 68086 markings/sec, 345 secs
lola: 30275039 markings, 228419765 edges, 70151 markings/sec, 350 secs
lola: 30633617 markings, 232831505 edges, 71716 markings/sec, 355 secs
lola: 30992488 markings, 237249351 edges, 71774 markings/sec, 360 secs
lola: 31354399 markings, 241780113 edges, 72382 markings/sec, 365 secs
lola: 31596962 markings, 245833401 edges, 48513 markings/sec, 370 secs
lola: 31651900 markings, 248986752 edges, 10988 markings/sec, 375 secs
lola: 31678686 markings, 252016624 edges, 5357 markings/sec, 380 secs
lola: 31698850 markings, 255016827 edges, 4033 markings/sec, 385 secs
lola: 31706377 markings, 258042349 edges, 1505 markings/sec, 390 secs
lola: 31710266 markings, 261098074 edges, 778 markings/sec, 395 secs
lola: 31717341 markings, 264161329 edges, 1415 markings/sec, 400 secs
lola: 31720021 markings, 267258568 edges, 536 markings/sec, 405 secs
lola: 31722596 markings, 270361831 edges, 515 markings/sec, 410 secs
lola: 31725674 markings, 273528445 edges, 616 markings/sec, 415 secs
lola: 31726839 markings, 276727241 edges, 233 markings/sec, 420 secs
lola: 31727559 markings, 279734877 edges, 144 markings/sec, 425 secs
lola: 31728098 markings, 281959398 edges, 108 markings/sec, 430 secs
lola: 31728395 markings, 284126307 edges, 59 markings/sec, 435 secs
lola: 31728554 markings, 286334209 edges, 32 markings/sec, 440 secs
lola: 31728615 markings, 288668919 edges, 12 markings/sec, 445 secs
lola: 32181754 markings, 290856396 edges, 90628 markings/sec, 450 secs
lola: 32771793 markings, 292630320 edges, 118008 markings/sec, 455 secs
lola: 33299453 markings, 294322518 edges, 105532 markings/sec, 460 secs
lola: 33802801 markings, 296012179 edges, 100670 markings/sec, 465 secs
lola: 34290914 markings, 297690612 edges, 97623 markings/sec, 470 secs
lola: 34756366 markings, 299361363 edges, 93090 markings/sec, 475 secs
lola: 35208394 markings, 301027599 edges, 90406 markings/sec, 480 secs
lola: 35649040 markings, 302690862 edges, 88129 markings/sec, 485 secs
lola: 36085516 markings, 304387447 edges, 87295 markings/sec, 490 secs
lola: 36513203 markings, 306098115 edges, 85537 markings/sec, 495 secs
lola: 36934223 markings, 307824926 edges, 84204 markings/sec, 500 secs
lola: 37343330 markings, 309534231 edges, 81821 markings/sec, 505 secs
lola: 37745668 markings, 311258001 edges, 80468 markings/sec, 510 secs
lola: 38144459 markings, 312982340 edges, 79758 markings/sec, 515 secs
lola: 38542380 markings, 314737195 edges, 79584 markings/sec, 520 secs
lola: 38930566 markings, 316484742 edges, 77637 markings/sec, 525 secs
lola: 39317075 markings, 318256870 edges, 77302 markings/sec, 530 secs
lola: 39699134 markings, 320065143 edges, 76412 markings/sec, 535 secs
lola: 40077372 markings, 321891235 edges, 75648 markings/sec, 540 secs
lola: 40456064 markings, 323743502 edges, 75738 markings/sec, 545 secs
lola: 40833433 markings, 325620321 edges, 75474 markings/sec, 550 secs
lola: 41204602 markings, 327520798 edges, 74234 markings/sec, 555 secs
lola: 41575332 markings, 329458150 edges, 74146 markings/sec, 560 secs
lola: 41938002 markings, 331388722 edges, 72534 markings/sec, 565 secs
lola: 42280774 markings, 333254131 edges, 68554 markings/sec, 570 secs
lola: 42622616 markings, 335108725 edges, 68368 markings/sec, 575 secs
lola: 42976585 markings, 337067185 edges, 70794 markings/sec, 580 secs
lola: 43322374 markings, 339013421 edges, 69158 markings/sec, 585 secs
lola: 43664646 markings, 340958391 edges, 68454 markings/sec, 590 secs
lola: 44016566 markings, 342998966 edges, 70384 markings/sec, 595 secs
lola: 44376257 markings, 345124777 edges, 71938 markings/sec, 600 secs
lola: 44753925 markings, 347457885 edges, 75534 markings/sec, 605 secs
lola: 45158097 markings, 349902683 edges, 80834 markings/sec, 610 secs
lola: 45526430 markings, 352187129 edges, 73667 markings/sec, 615 secs
lola: 45918379 markings, 354618884 edges, 78390 markings/sec, 620 secs
lola: 46330937 markings, 357184265 edges, 82512 markings/sec, 625 secs
lola: 46766500 markings, 359861428 edges, 87113 markings/sec, 630 secs
lola: 47184592 markings, 362615254 edges, 83618 markings/sec, 635 secs
lola: 47331582 markings, 364345046 edges, 29398 markings/sec, 640 secs
lola: 47357189 markings, 365653306 edges, 5121 markings/sec, 645 secs
lola: 47391294 markings, 366980111 edges, 6821 markings/sec, 650 secs
lola: 47403265 markings, 368229376 edges, 2394 markings/sec, 655 secs
lola: 47409244 markings, 369455954 edges, 1196 markings/sec, 660 secs
lola: 47417236 markings, 370672594 edges, 1598 markings/sec, 665 secs
lola: 47420262 markings, 371871727 edges, 605 markings/sec, 670 secs
lola: 47423238 markings, 373077571 edges, 595 markings/sec, 675 secs
lola: 47425614 markings, 374286667 edges, 475 markings/sec, 680 secs
lola: 47427401 markings, 375512421 edges, 357 markings/sec, 685 secs
lola: 47428919 markings, 376741062 edges, 304 markings/sec, 690 secs
lola: 47430701 markings, 377991686 edges, 356 markings/sec, 695 secs
lola: 47431532 markings, 379240287 edges, 166 markings/sec, 700 secs
lola: 47432155 markings, 380501085 edges, 125 markings/sec, 705 secs
lola: 47432660 markings, 381774565 edges, 101 markings/sec, 710 secs
lola: 47433210 markings, 383079454 edges, 110 markings/sec, 715 secs
lola: 47433392 markings, 384424263 edges, 36 markings/sec, 720 secs
lola: 47590148 markings, 386404184 edges, 31351 markings/sec, 725 secs
lola: 48111208 markings, 389345914 edges, 104212 markings/sec, 730 secs
lola: 48576279 markings, 392190664 edges, 93014 markings/sec, 735 secs
lola: 49015619 markings, 395031922 edges, 87868 markings/sec, 740 secs
lola: 49443406 markings, 397889550 edges, 85557 markings/sec, 745 secs
lola: 49885109 markings, 400902346 edges, 88341 markings/sec, 750 secs
lola: 50307923 markings, 403922051 edges, 84563 markings/sec, 755 secs
lola: 50728749 markings, 406991705 edges, 84165 markings/sec, 760 secs
lola: 51136520 markings, 410045685 edges, 81554 markings/sec, 765 secs
lola: 51543753 markings, 413148034 edges, 81447 markings/sec, 770 secs
lola: 51938099 markings, 416278498 edges, 78869 markings/sec, 775 secs
lola: 52318356 markings, 419310995 edges, 76051 markings/sec, 780 secs
lola: 52698470 markings, 422455250 edges, 76023 markings/sec, 785 secs
lola: 53075301 markings, 425616554 edges, 75366 markings/sec, 790 secs
lola: 53446920 markings, 428796576 edges, 74324 markings/sec, 795 secs
lola: 53814275 markings, 431975329 edges, 73471 markings/sec, 800 secs
lola: 54177064 markings, 435167338 edges, 72558 markings/sec, 805 secs
lola: 54530472 markings, 438330189 edges, 70682 markings/sec, 810 secs
lola: 54870204 markings, 441411884 edges, 67946 markings/sec, 815 secs
lola: 55192612 markings, 444425620 edges, 64482 markings/sec, 820 secs
lola: 55508823 markings, 447460184 edges, 63242 markings/sec, 825 secs
lola: 55841663 markings, 450671752 edges, 66568 markings/sec, 830 secs
lola: 56181494 markings, 453995789 edges, 67966 markings/sec, 835 secs
lola: 56516342 markings, 457336644 edges, 66970 markings/sec, 840 secs
lola: 56846368 markings, 460697490 edges, 66005 markings/sec, 845 secs
lola: 57173662 markings, 464095138 edges, 65459 markings/sec, 850 secs
lola: 57494937 markings, 467497892 edges, 64255 markings/sec, 855 secs
lola: 57814444 markings, 470937008 edges, 63901 markings/sec, 860 secs
lola: 58129324 markings, 474388243 edges, 62976 markings/sec, 865 secs
lola: 58448810 markings, 477871373 edges, 63897 markings/sec, 870 secs
lola: 58762903 markings, 481365061 edges, 62819 markings/sec, 875 secs
lola: 59072663 markings, 484848962 edges, 61952 markings/sec, 880 secs
lola: 59384438 markings, 488396291 edges, 62355 markings/sec, 885 secs
lola: 59694865 markings, 492007001 edges, 62085 markings/sec, 890 secs
lola: 59999214 markings, 495586463 edges, 60870 markings/sec, 895 secs
lola: 60304343 markings, 499286544 edges, 61026 markings/sec, 900 secs
lola: 60608685 markings, 503053886 edges, 60868 markings/sec, 905 secs
lola: 60909525 markings, 506680281 edges, 60168 markings/sec, 910 secs
lola: 61207475 markings, 510402427 edges, 59590 markings/sec, 915 secs
lola: 61516454 markings, 514240060 edges, 61796 markings/sec, 920 secs
lola: 61837568 markings, 518237533 edges, 64223 markings/sec, 925 secs
lola: 62168085 markings, 522297847 edges, 66103 markings/sec, 930 secs
lola: 62502655 markings, 526412257 edges, 66914 markings/sec, 935 secs
lola: 62831471 markings, 530641889 edges, 65763 markings/sec, 940 secs
lola: 63004326 markings, 534007940 edges, 34571 markings/sec, 945 secs
lola: 63057503 markings, 536690953 edges, 10635 markings/sec, 950 secs
lola: 63086433 markings, 539217546 edges, 5786 markings/sec, 955 secs
lola: 63105480 markings, 541675688 edges, 3809 markings/sec, 960 secs
lola: 63111887 markings, 544072520 edges, 1281 markings/sec, 965 secs
lola: 63115384 markings, 546469556 edges, 699 markings/sec, 970 secs
lola: 63123625 markings, 548894453 edges, 1648 markings/sec, 975 secs
lola: 63125783 markings, 551311129 edges, 432 markings/sec, 980 secs
lola: 63128905 markings, 553750722 edges, 624 markings/sec, 985 secs
lola: 63131220 markings, 556208120 edges, 463 markings/sec, 990 secs
lola: 63132572 markings, 558561672 edges, 270 markings/sec, 995 secs
lola: 63134085 markings, 560907676 edges, 303 markings/sec, 1000 secs
lola: 63135558 markings, 563289027 edges, 295 markings/sec, 1005 secs
lola: 63136238 markings, 565886396 edges, 136 markings/sec, 1010 secs
lola: 63136824 markings, 568563699 edges, 117 markings/sec, 1015 secs
lola: 63137549 markings, 571318662 edges, 145 markings/sec, 1020 secs
lola: 63137814 markings, 574189392 edges, 53 markings/sec, 1025 secs
lola: 63137862 markings, 577133745 edges, 10 markings/sec, 1030 secs
lola: 63457718 markings, 581028979 edges, 63971 markings/sec, 1035 secs
lola: 64047980 markings, 585059302 edges, 118052 markings/sec, 1040 secs
lola: 64440258 markings, 588890071 edges, 78456 markings/sec, 1045 secs
lola: 65036989 markings, 593063050 edges, 119346 markings/sec, 1050 secs
lola: 65493113 markings, 597614276 edges, 91225 markings/sec, 1055 secs
lola: 66100642 markings, 602010461 edges, 121506 markings/sec, 1060 secs
lola: 66587182 markings, 606938491 edges, 97308 markings/sec, 1065 secs
lola: 67231322 markings, 612092571 edges, 128828 markings/sec, 1070 secs
lola: 67862855 markings, 616919251 edges, 126307 markings/sec, 1075 secs
lola: 68368588 markings, 622155232 edges, 101147 markings/sec, 1080 secs
lola: 69053522 markings, 627676345 edges, 136987 markings/sec, 1085 secs
lola: 69727319 markings, 632870947 edges, 134759 markings/sec, 1090 secs
lola: 70309760 markings, 638280123 edges, 116488 markings/sec, 1095 secs
lola: 70873462 markings, 643482772 edges, 112740 markings/sec, 1100 secs
lola: 71371979 markings, 648494874 edges, 99703 markings/sec, 1105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 71616249 markings, 650577720 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p37 <= p32) AND A (F (G ((p32 + 1 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p37 <= p32)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p37 <= p32)
lola: processed formula length: 12
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (G ((p32 + 1 <= p37))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p32 + 1 <= p37))))
lola: processed formula length: 28
lola: 105 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: 55 markings, 56 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: lola: ========================================RESULT

lola:
SUMMARY: no no no yes yes yes no no no yes yes no yes yes no no
lola:
preliminary result: no no no yes yes yes no no no yes yes no yes yes no no
lola: memory consumption: 25440 KB
lola: time consumption: 1360 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590896044444

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

grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory

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="ShieldPPPt-PT-001B"
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 ShieldPPPt-PT-001B, 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 r221-tajo-159033502000145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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