Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r120-csrt-158961292500087.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is NoC3x3-PT-2A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292500087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 127K Mar 24 05:37 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 NoC3x3-PT-2A-00
FORMULA_NAME NoC3x3-PT-2A-01
FORMULA_NAME NoC3x3-PT-2A-02
FORMULA_NAME NoC3x3-PT-2A-03
FORMULA_NAME NoC3x3-PT-2A-04
FORMULA_NAME NoC3x3-PT-2A-05
FORMULA_NAME NoC3x3-PT-2A-06
FORMULA_NAME NoC3x3-PT-2A-07
FORMULA_NAME NoC3x3-PT-2A-08
FORMULA_NAME NoC3x3-PT-2A-09
FORMULA_NAME NoC3x3-PT-2A-10
FORMULA_NAME NoC3x3-PT-2A-11
FORMULA_NAME NoC3x3-PT-2A-12
FORMULA_NAME NoC3x3-PT-2A-13
FORMULA_NAME NoC3x3-PT-2A-14
FORMULA_NAME NoC3x3-PT-2A-15

=== Now, execution of the tool begins

BK_START 1590339894091

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ NoC3x3-PT-2A @ 3570 seconds

FORMULA NoC3x3-PT-2A-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-2A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2722
rslt: Output for LTLCardinality @ NoC3x3-PT-2A

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 24 17:04:54 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": "TRUE",
"processed_size": 4,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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": 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": "TRUE",
"processed_size": 4,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"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": "A (((p51 <= p29) U X ((p158 + 1 <= p116))))",
"processed_size": 43,
"rewrites": 135
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"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 ((X (TRUE) OR G (F ((p121 <= p260)))))",
"processed_size": 40,
"rewrites": 135
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((X (X ((p61 + 1 <= p352))) OR G ((X (X (G ((p61 + 1 <= p352)))) R (p203 <= 0)))))",
"processed_size": 84,
"rewrites": 135
},
"result":
{
"edges": 1223070,
"markings": 465737,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 451
},
"exit":
{
"localtimelimitreached": false
},
"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 ((p261 <= p273))))",
"processed_size": 26,
"rewrites": 135
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 526
},
"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 ((p158 <= p226))))",
"processed_size": 26,
"rewrites": 135
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 631
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "A (X (((p106 + 1 <= p21) U ((p21 <= p106) AND G ((p65 <= p176))))))",
"processed_size": 67,
"rewrites": 135
},
"result":
{
"edges": 33,
"markings": 33,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"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": 789
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 789
},
"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 ((p294 + 1 <= p21)))",
"processed_size": 25,
"rewrites": 135
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1053
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"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": 4,
"visible_transitions": 0
},
"processed": "A ((F (((p332 + 1 <= p338) AND F ((p294 + 1 <= p21)))) OR X (G ((p294 + 1 <= p21)))))",
"processed_size": 85,
"rewrites": 135
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1053
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= p339)))",
"processed_size": 19,
"rewrites": 137
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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": 1579
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 5,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((G ((1 <= p253)) OR (G (F (((p157 <= p229) OR (F ((p157 <= p229)) AND F (G ((p253 <= 0))))))) AND F (G ((1 <= p253)))))))",
"processed_size": 127,
"rewrites": 135
},
"result":
{
"edges": 7860919,
"markings": 4094295,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"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": 3125
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3125
},
"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": "(p107 <= p69)",
"processed_size": 13,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"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": "(p107 <= p69)",
"processed_size": 13,
"rewrites": 135
},
"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": 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": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((p133 <= p160) U (p270 <= p337)))",
"processed_size": 37,
"rewrites": 139
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until"
}
}
],
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24856,
"runtime": 848.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((** U (** AND G(**))))) : TRUE : FALSE : A(X(X(G((F((** OR (F(**) OR X(**)))) AND (** OR (** OR (F(**) OR X(**))))))))) : FALSE : A((** U X(**))) : A((X(TRUE) OR G(F(**)))) : A((X(X(*)) OR G((X(X(G(*))) R *)))) : TRUE : A(X(F(**))) : A(X(F(**))) : A(G(**)) : TRUE : A(G((G(**) OR (G(F((** OR (F(**) AND F(G(*)))))) AND F(G(**)))))) : (A(X(**)) AND A((F((* AND F(*))) OR X(G(**))))) : (** AND A((** U **)))"
},
"net":
{
"arcs": 1697,
"conflict_clusters": 94,
"places": 361,
"places_significant": 234,
"singleton_clusters": 0,
"transitions": 428
},
"result":
{
"preliminary_value": "no yes no unknown no no yes no yes yes yes no yes no yes yes ",
"value": "no yes no unknown no no yes no yes yes yes no yes no yes yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 789/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 361
lola: finding significant places
lola: 361 places, 428 transitions, 234 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p126 <= p349)
lola: LP says that atomic proposition is always false: (2 <= p216)
lola: LP says that atomic proposition is always false: (2 <= p94)
lola: LP says that atomic proposition is always false: (2 <= p94)
lola: LP says that atomic proposition is always false: (3 <= p92)
lola: LP says that atomic proposition is always false: (2 <= p217)
lola: A (X (((p106 + 1 <= p21) U ((p21 <= p106) AND G ((p65 <= p176)))))) : A (F (G ((p126 <= p349)))) : A (G (X (F (NOT((NOT(X ((2 <= p216))) OR X (NOT(G ((p36 + 1 <= p197)))))))))) : A (X (X (G (((p327 <= p314) U (((p327 <= p314) OR F ((p164 <= p321))) OR X ((p327 <= p314)))))))) : A (G (NOT(F (G ((NOT(X ((0 <= p230))) U ((0 <= p338) U F (((0 <= p230) OR F ((0 <= p230))))))))))) : A (((() AND G ((0 <= p169))) OR ((p51 <= p29) U X ((p158 + 1 <= p116))))) : A ((X ((0 <= p205)) OR X (G (X (F (G (F ((p121 <= p260))))))))) : A ((NOT(X (X ((p352 <= p61)))) OR G (NOT((F (X (X ((p352 <= p61)))) U (1 <= p203)))))) : A ((X (G ((p94 <= 1))) U NOT((((p257 <= p93) OR (p140 + 1 <= p36)) AND ((p181 <= p244) U (2 <= p94)))))) : A (F (X ((F (X ((p321 <= p169))) U F (((X ((p321 <= p169)) OR X ((0 <= p43))) U (p261 <= p273))))))) : A (F (X (((((p189 <= p250) U G ((p231 + 1 <= 0))) U NOT(X (G ((p189 <= p250))))) U F ((p158 <= p226)))))) : A (G ((1 <= p339))) : A (F (NOT(((X (G ((3 <= p92))) U (p147 + 1 <= p99)) U F (X ((2 <= p217))))))) : A (G ((G (F (NOT(G (NOT((F (NOT(F ((1 <= p253)))) U (p157 <= p229))))))) U G ((1 <= p253))))) : A (NOT((G (((p338 <= p332) OR G ((p21 <= p294)))) U NOT(X ((p294 + 1 <= p21)))))) : A (((p107 <= p69) AND ((p133 <= p160) U (p270 <= p337))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 1 will run for 237 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: 135 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 2 will run for 254 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: 135 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p51 <= p29) U X ((p158 + 1 <= p116))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p51 <= p29) U X ((p158 + 1 <= p116))))
lola: processed formula length: 43
lola: 135 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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) OR G (F ((p121 <= p260)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) OR G (F ((p121 <= p260)))))
lola: processed formula length: 40
lola: 135 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p61 + 1 <= p352))) OR G ((X (X (G ((p61 + 1 <= p352)))) R (p203 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p61 + 1 <= p352))) OR G ((X (X (G ((p61 + 1 <= p352)))) R (p203 <= 0)))))
lola: processed formula length: 84
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 465737 markings, 1223070 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((F (((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))) AND ((p327 <= p314) OR ((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F (((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))) AND ((p327 <= p314) OR ((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))))))))
lola: processed formula length: 171
lola: 135 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: 765159 markings, 2019404 edges, 153032 markings/sec, 0 secs
lola: 1589928 markings, 4020121 edges, 164954 markings/sec, 5 secs
lola: 2389747 markings, 5963323 edges, 159964 markings/sec, 10 secs
lola: 3137006 markings, 7849089 edges, 149452 markings/sec, 15 secs
lola: 3880886 markings, 9690918 edges, 148776 markings/sec, 20 secs
lola: 4560011 markings, 11421478 edges, 135825 markings/sec, 25 secs
lola: 5220426 markings, 13156465 edges, 132083 markings/sec, 30 secs
lola: 5869210 markings, 14877411 edges, 129757 markings/sec, 35 secs
lola: 6557949 markings, 16609290 edges, 137748 markings/sec, 40 secs
lola: 7230368 markings, 18227930 edges, 134484 markings/sec, 45 secs
lola: 7855127 markings, 19789533 edges, 124952 markings/sec, 50 secs
lola: 8498647 markings, 21393689 edges, 128704 markings/sec, 55 secs
lola: 9190745 markings, 23089033 edges, 138420 markings/sec, 60 secs
lola: 9829457 markings, 24700863 edges, 127742 markings/sec, 65 secs
lola: 10531173 markings, 26411685 edges, 140343 markings/sec, 70 secs
lola: 11244003 markings, 28160946 edges, 142566 markings/sec, 75 secs
lola: 11952945 markings, 29902727 edges, 141788 markings/sec, 80 secs
lola: 12687443 markings, 31718316 edges, 146900 markings/sec, 85 secs
lola: 13377514 markings, 33518993 edges, 138014 markings/sec, 90 secs
lola: 14125889 markings, 35341907 edges, 149675 markings/sec, 95 secs
lola: 14797158 markings, 37041183 edges, 134254 markings/sec, 100 secs
lola: 15450505 markings, 38685838 edges, 130669 markings/sec, 105 secs
lola: 16101125 markings, 40318672 edges, 130124 markings/sec, 110 secs
lola: 16777467 markings, 42049374 edges, 135268 markings/sec, 115 secs
lola: 17443045 markings, 43694502 edges, 133116 markings/sec, 120 secs
lola: 18114009 markings, 45389891 edges, 134193 markings/sec, 125 secs
lola: 18741924 markings, 46986628 edges, 125583 markings/sec, 130 secs
lola: 19500386 markings, 48843596 edges, 151692 markings/sec, 135 secs
lola: 20286422 markings, 50771609 edges, 157207 markings/sec, 140 secs
lola: 21022529 markings, 52592073 edges, 147221 markings/sec, 145 secs
lola: 21783109 markings, 54508581 edges, 152116 markings/sec, 150 secs
lola: 22561802 markings, 56405843 edges, 155739 markings/sec, 155 secs
lola: 23312825 markings, 58345829 edges, 150205 markings/sec, 160 secs
lola: 24013222 markings, 60196887 edges, 140079 markings/sec, 165 secs
lola: 24668871 markings, 61946469 edges, 131130 markings/sec, 170 secs
lola: 25405389 markings, 63796188 edges, 147304 markings/sec, 175 secs
lola: 26185514 markings, 65679986 edges, 156025 markings/sec, 180 secs
lola: 26927989 markings, 67506226 edges, 148495 markings/sec, 185 secs
lola: 27654987 markings, 69325830 edges, 145400 markings/sec, 190 secs
lola: 28364651 markings, 71172404 edges, 141933 markings/sec, 195 secs
lola: 29059811 markings, 72961349 edges, 139032 markings/sec, 200 secs
lola: 29763086 markings, 74734752 edges, 140655 markings/sec, 205 secs
lola: 30486699 markings, 76563338 edges, 144723 markings/sec, 210 secs
lola: 31209112 markings, 78351086 edges, 144483 markings/sec, 215 secs
lola: 31933924 markings, 80141487 edges, 144962 markings/sec, 220 secs
lola: 32659395 markings, 81906382 edges, 145094 markings/sec, 225 secs
lola: 33339436 markings, 83657751 edges, 136008 markings/sec, 230 secs
lola: 34021907 markings, 85377303 edges, 136494 markings/sec, 235 secs
lola: 34730306 markings, 87133269 edges, 141680 markings/sec, 240 secs
lola: 35455553 markings, 88906721 edges, 145049 markings/sec, 245 secs
lola: 36194457 markings, 90677331 edges, 147781 markings/sec, 250 secs
lola: 36922176 markings, 92434710 edges, 145544 markings/sec, 255 secs
lola: 37617050 markings, 94158564 edges, 138975 markings/sec, 260 secs
lola: 38266518 markings, 95866204 edges, 129894 markings/sec, 265 secs
lola: 38909325 markings, 97526914 edges, 128561 markings/sec, 270 secs
lola: 39539995 markings, 99246055 edges, 126134 markings/sec, 275 secs
lola: 40231511 markings, 101018686 edges, 138303 markings/sec, 280 secs
lola: 40888943 markings, 102760000 edges, 131486 markings/sec, 285 secs
lola: 41564197 markings, 104488123 edges, 135051 markings/sec, 290 secs
lola: 42291070 markings, 106238449 edges, 145375 markings/sec, 295 secs
lola: 43020175 markings, 107999999 edges, 145821 markings/sec, 300 secs
lola: 43712153 markings, 109703072 edges, 138396 markings/sec, 305 secs
lola: 44380230 markings, 111367771 edges, 133615 markings/sec, 310 secs
lola: 45053632 markings, 113117134 edges, 134680 markings/sec, 315 secs
lola: 45735223 markings, 114800005 edges, 136318 markings/sec, 320 secs
lola: 46423439 markings, 116521768 edges, 137643 markings/sec, 325 secs
lola: 47067344 markings, 118186370 edges, 128781 markings/sec, 330 secs
lola: 47707745 markings, 119833551 edges, 128080 markings/sec, 335 secs
lola: 48398250 markings, 121517103 edges, 138101 markings/sec, 340 secs
lola: 49092000 markings, 123205654 edges, 138750 markings/sec, 345 secs
lola: 49808123 markings, 124925723 edges, 143225 markings/sec, 350 secs
lola: 50519583 markings, 126687910 edges, 142292 markings/sec, 355 secs
lola: 51199911 markings, 128374921 edges, 136066 markings/sec, 360 secs
lola: 51854982 markings, 130035442 edges, 131014 markings/sec, 365 secs
lola: 52513279 markings, 131713046 edges, 131659 markings/sec, 370 secs
lola: 53200672 markings, 133414864 edges, 137479 markings/sec, 375 secs
lola: 53912412 markings, 135142602 edges, 142348 markings/sec, 380 secs
lola: 54590493 markings, 136802103 edges, 135616 markings/sec, 385 secs
lola: 55093797 markings, 138010084 edges, 100661 markings/sec, 390 secs
lola: 55265439 markings, 138430070 edges, 34328 markings/sec, 395 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 451 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p261 <= p273))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p261 <= p273))))
lola: processed formula length: 26
lola: 135 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 10 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p158 <= p226))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p158 <= p226))))
lola: processed formula length: 26
lola: 135 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 11 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p106 + 1 <= p21) U ((p21 <= p106) AND G ((p65 <= p176))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p106 + 1 <= p21) U ((p21 <= p106) AND G ((p65 <= p176))))))
lola: processed formula length: 67
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p294 + 1 <= p21))) AND A ((F (((p332 + 1 <= p338) AND F ((p294 + 1 <= p21)))) OR X (G ((p294 + 1 <= p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p294 + 1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p294 + 1 <= p21)))
lola: processed formula length: 25
lola: 135 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 13 will run for 1053 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (((p332 + 1 <= p338) AND F ((p294 + 1 <= p21)))) OR X (G ((p294 + 1 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (((p332 + 1 <= p338) AND F ((p294 + 1 <= p21)))) OR X (G ((p294 + 1 <= p21)))))
lola: processed formula length: 85
lola: 135 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 13 will run for 1053 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p339)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((1 <= p339)))
lola: processed formula length: 19
lola: 137 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: ========================================
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p339 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: subprocess 14 will run for 1579 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((1 <= p253)) OR (G (F (((p157 <= p229) OR (F ((p157 <= p229)) AND F (G ((p253 <= 0))))))) AND F (G ((1 <= p253)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((1 <= p253)) OR (G (F (((p157 <= p229) OR (F ((p157 <= p229)) AND F (G ((p253 <= 0))))))) AND F (G ((1 <= p253)))))))
lola: processed formula length: 127
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 16 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: state equation: write sara problem file to LTLCardinality-13-0.sara
lola: ========================================
lola: 425486 markings, 812420 edges, 85097 markings/sec, 0 secs
lola: 948426 markings, 1778275 edges, 104588 markings/sec, 5 secs
lola: 1615116 markings, 3078019 edges, 133338 markings/sec, 10 secs
lola: 2285795 markings, 4373106 edges, 134136 markings/sec, 15 secs
lola: 2947028 markings, 5640352 edges, 132247 markings/sec, 20 secs
lola: 3603614 markings, 6909124 edges, 131317 markings/sec, 25 secs
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: 4094295 markings, 7860919 edges
lola: ========================================
lola: subprocess 15 will run for 3125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p107 <= p69) AND A (((p133 <= p160) U (p270 <= p337))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3125 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p107 <= p69)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p107 <= p69)
lola: processed formula length: 13
lola: 135 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 (X (G ((F (((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))) AND ((p327 <= p314) OR ((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F (((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))) AND ((p327 <= p314) OR ((p327 <= p314) OR (F ((p164 <= p321)) OR X ((p327 <= p314))))))))))
lola: processed formula length: 171
lola: 135 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: 797018 markings, 2097905 edges, 159404 markings/sec, 0 secs
lola: 1627998 markings, 4112188 edges, 166196 markings/sec, 5 secs
lola: 2424612 markings, 6053902 edges, 159323 markings/sec, 10 secs
lola: 3171756 markings, 7933506 edges, 149429 markings/sec, 15 secs
lola: 3951230 markings, 9866660 edges, 155895 markings/sec, 20 secs
lola: 4705015 markings, 11800589 edges, 150757 markings/sec, 25 secs
lola: 5413313 markings, 13657469 edges, 141660 markings/sec, 30 secs
lola: 6123571 markings, 15510489 edges, 142052 markings/sec, 35 secs
lola: 6866975 markings, 17340120 edges, 148681 markings/sec, 40 secs
lola: 7577488 markings, 19114686 edges, 142103 markings/sec, 45 secs
lola: 8292969 markings, 20870141 edges, 143096 markings/sec, 50 secs
lola: 9009659 markings, 22641218 edges, 143338 markings/sec, 55 secs
lola: 9694284 markings, 24379245 edges, 136925 markings/sec, 60 secs
lola: 10409118 markings, 26102379 edges, 142967 markings/sec, 65 secs
lola: 11069521 markings, 27738368 edges, 132081 markings/sec, 70 secs
lola: 11769558 markings, 29465102 edges, 140007 markings/sec, 75 secs
lola: 12488462 markings, 31220070 edges, 143781 markings/sec, 80 secs
lola: 13197207 markings, 33050366 edges, 141749 markings/sec, 85 secs
lola: 13925170 markings, 34849066 edges, 145593 markings/sec, 90 secs
lola: 14649952 markings, 36653183 edges, 144956 markings/sec, 95 secs
lola: 15321536 markings, 38381643 edges, 134317 markings/sec, 100 secs
lola: 16030375 markings, 40133122 edges, 141768 markings/sec, 105 secs
lola: 16712853 markings, 41896064 edges, 136496 markings/sec, 110 secs
lola: 17437158 markings, 43680065 edges, 144861 markings/sec, 115 secs
lola: 18135176 markings, 45446163 edges, 139604 markings/sec, 120 secs
lola: 18864405 markings, 47285694 edges, 145846 markings/sec, 125 secs
lola: 19674890 markings, 49284275 edges, 162097 markings/sec, 130 secs
lola: 20462633 markings, 51208297 edges, 157549 markings/sec, 135 secs
lola: 21243426 markings, 53155993 edges, 156159 markings/sec, 140 secs
lola: 22002580 markings, 55041683 edges, 151831 markings/sec, 145 secs
lola: 22754418 markings, 56913390 edges, 150368 markings/sec, 150 secs
lola: 23480238 markings, 58800954 edges, 145164 markings/sec, 155 secs
lola: 24154086 markings, 60575431 edges, 134770 markings/sec, 160 secs
lola: 24841263 markings, 62403107 edges, 137435 markings/sec, 165 secs
lola: 25577807 markings, 64214433 edges, 147309 markings/sec, 170 secs
lola: 26357070 markings, 66085524 edges, 155853 markings/sec, 175 secs
lola: 27090429 markings, 67899074 edges, 146672 markings/sec, 180 secs
lola: 27793880 markings, 69706636 edges, 140690 markings/sec, 185 secs
lola: 28499295 markings, 71529585 edges, 141083 markings/sec, 190 secs
lola: 29186625 markings, 73271050 edges, 137466 markings/sec, 195 secs
lola: 29866208 markings, 75013733 edges, 135917 markings/sec, 200 secs
lola: 30598953 markings, 76845293 edges, 146549 markings/sec, 205 secs
lola: 31314817 markings, 78627821 edges, 143173 markings/sec, 210 secs
lola: 32041706 markings, 80403061 edges, 145378 markings/sec, 215 secs
lola: 32733855 markings, 82093626 edges, 138430 markings/sec, 220 secs
lola: 33363682 markings, 83717808 edges, 125965 markings/sec, 225 secs
lola: 34023720 markings, 85382175 edges, 132008 markings/sec, 230 secs
lola: 34737870 markings, 87150763 edges, 142830 markings/sec, 235 secs
lola: 35467404 markings, 88936892 edges, 145907 markings/sec, 240 secs
lola: 36212694 markings, 90722928 edges, 149058 markings/sec, 245 secs
lola: 36882202 markings, 92344877 edges, 133902 markings/sec, 250 secs
lola: 37527271 markings, 93920020 edges, 129014 markings/sec, 255 secs
lola: 38103614 markings, 95445315 edges, 115269 markings/sec, 260 secs
lola: 38667781 markings, 96899625 edges, 112833 markings/sec, 265 secs
lola: 39236181 markings, 98409225 edges, 113680 markings/sec, 270 secs
lola: 39783046 markings, 99890970 edges, 109373 markings/sec, 275 secs
lola: 40426006 markings, 101535800 edges, 128592 markings/sec, 280 secs
lola: 41023651 markings, 103095459 edges, 119529 markings/sec, 285 secs
lola: 41628387 markings, 104642449 edges, 120947 markings/sec, 290 secs
lola: 42325949 markings, 106323414 edges, 139512 markings/sec, 295 secs
lola: 43027510 markings, 108018011 edges, 140312 markings/sec, 300 secs
lola: 43703850 markings, 109682970 edges, 135268 markings/sec, 305 secs
lola: 44365518 markings, 111331011 edges, 132334 markings/sec, 310 secs
lola: 45017374 markings, 113021273 edges, 130371 markings/sec, 315 secs
lola: 45692260 markings, 114696916 edges, 134977 markings/sec, 320 secs
lola: 46382045 markings, 116422176 edges, 137957 markings/sec, 325 secs
lola: 47036624 markings, 118100692 edges, 130916 markings/sec, 330 secs
lola: 47682491 markings, 119770176 edges, 129173 markings/sec, 335 secs
lola: 48404810 markings, 121532589 edges, 144464 markings/sec, 340 secs
lola: 49057256 markings, 123119311 edges, 130489 markings/sec, 345 secs
lola: 49713372 markings, 124700096 edges, 131223 markings/sec, 350 secs
lola: 50348817 markings, 126271720 edges, 127089 markings/sec, 355 secs
lola: 50980754 markings, 127824039 edges, 126387 markings/sec, 360 secs
lola: 51615860 markings, 129406237 edges, 127021 markings/sec, 365 secs
lola: 52185870 markings, 130914552 edges, 114002 markings/sec, 370 secs
lola: 52895074 markings, 132643288 edges, 141841 markings/sec, 375 secs
lola: 53592139 markings, 134356003 edges, 139413 markings/sec, 380 secs
lola: 54265475 markings, 135989877 edges, 134667 markings/sec, 385 secs
lola: 54911100 markings, 137564897 edges, 129125 markings/sec, 390 secs
lola: 55217251 markings, 138311378 edges, 61230 markings/sec, 395 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((p107 <= p69) AND A (((p133 <= p160) U (p270 <= p337))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p107 <= p69)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p107 <= p69)
lola: processed formula length: 13
lola: 135 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 (((p133 <= p160) U (p270 <= p337)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((p133 <= p160) U (p270 <= p337)))
lola: processed formula length: 37
lola: 139 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 /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown no no yes no yes yes yes no yes no yes yes
lola:
preliminary result: no yes no unknown no no yes no yes yes yes no yes no yes yes
lola: memory consumption: 24856 KB
lola: time consumption: 848 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590340742923

--------------------
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="NoC3x3-PT-2A"
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 NoC3x3-PT-2A, 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 r120-csrt-158961292500087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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