Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r165-oct2-158972938900023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RefineWMG-PT-025026, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-oct2-158972938900023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 3.5K Apr 12 10:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 10:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 12:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 12:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 56K Mar 24 05:38 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 RefineWMG-PT-025026-00
FORMULA_NAME RefineWMG-PT-025026-01
FORMULA_NAME RefineWMG-PT-025026-02
FORMULA_NAME RefineWMG-PT-025026-03
FORMULA_NAME RefineWMG-PT-025026-04
FORMULA_NAME RefineWMG-PT-025026-05
FORMULA_NAME RefineWMG-PT-025026-06
FORMULA_NAME RefineWMG-PT-025026-07
FORMULA_NAME RefineWMG-PT-025026-08
FORMULA_NAME RefineWMG-PT-025026-09
FORMULA_NAME RefineWMG-PT-025026-10
FORMULA_NAME RefineWMG-PT-025026-11
FORMULA_NAME RefineWMG-PT-025026-12
FORMULA_NAME RefineWMG-PT-025026-13
FORMULA_NAME RefineWMG-PT-025026-14
FORMULA_NAME RefineWMG-PT-025026-15

=== Now, execution of the tool begins

BK_START 1590263514893

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RefineWMG-PT-025026 @ 3570 seconds

FORMULA RefineWMG-PT-025026-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-025026-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2760
rslt: Output for LTLCardinality @ RefineWMG-PT-025026

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 23 19:51: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": "FALSE",
"processed_size": 5,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 290
},
"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 ((p26 + 1 <= p59)))",
"processed_size": 24,
"rewrites": 137
},
"result":
{
"edges": 26,
"markings": 27,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 316
},
"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": "(p93 + 1 <= p74)",
"processed_size": 16,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F ((p92 <= p35)) OR (G ((3 <= p46)) OR (((3 <= p46) AND (3 <= p11)) AND X (F ((3 <= p11)))))))",
"processed_size": 98,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"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": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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 (X (((p3 + 1 <= p41) OR F ((p31 + 1 <= p25)))))",
"processed_size": 49,
"rewrites": 135
},
"result":
{
"edges": 27,
"markings": 27,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 681
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (((p27 + 1 <= p68) AND G (F ((p122 <= p109))))))",
"processed_size": 53,
"rewrites": 135
},
"result":
{
"edges": 1664,
"markings": 1064,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 851
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"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": 5,
"visible_transitions": 0
},
"processed": "A ((((2 <= p62) AND (p62 <= 1)) OR F (G (((p124 <= p64) OR (G ((p40 <= p79)) AND F ((p124 <= p64))))))))",
"processed_size": 104,
"rewrites": 135
},
"result":
{
"edges": 48359,
"markings": 29767,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "A (F ((F ((2 <= p8)) OR ((p3 <= p34) U (p7 <= p74)))))",
"processed_size": 54,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 1
},
"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": 3189
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p86 + 1 <= p55)",
"processed_size": 16,
"rewrites": 135
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23080,
"runtime": 786.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G(*))) : (* AND (A((F(*) OR G(*))) AND A((F(*) OR G((* AND (F(*) OR G(*)))))))) : A(F(G((F(G(**)) AND G(F(**)))))) : A(F((* AND G(F(**))))) : A((** OR F(G((** OR (G(**) AND F(**))))))) : A((* OR X(X(X(X(F((** AND G(**))))))))) : A(F((F(**) OR (** U **)))) : A(X(X((F(*) OR G(*))))) : FALSE : (A(G(*)) AND A(X(X(G(*))))) : (** AND A(X(F((** OR **))))) : A(F(**)) : (A(X(**)) AND A(F(G(*)))) : A(X((G(**) OR G((F(**) AND X(F(**))))))) : A((F(**) OR (G(**) OR (** AND X(F(*)))))) : A(X((* OR F(*))))"
},
"net":
{
"arcs": 308,
"conflict_clusters": 78,
"places": 129,
"places_significant": 77,
"singleton_clusters": 0,
"transitions": 103
},
"result":
{
"preliminary_value": "unknown no unknown no no yes yes yes no no no no no unknown yes no ",
"value": "unknown no unknown no no yes yes yes no no no no no unknown yes 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: 232/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 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: A (NOT(F (((G (F ((0 <= p45))) AND ((p45 + 1 <= 0) U X ((0 <= p45)))) U X ((p69 <= p82)))))) : A (NOT((G ((3 <= p79)) U (G ((2 <= p11)) U (p55 <= p86))))) : A (F (G ((F (X (X (G ((p62 <= p13))))) AND G (F (((1 <= p88) OR (p59 <= p31)))))))) : A (F (NOT(((p68 <= p27) OR X (X (F (NOT(X (G (F ((p122 <= p109)))))))))))) : A ((((2 <= p62) AND (p62 <= 1)) OR G (F (G ((G ((p40 <= p79)) U (p124 <= p64))))))) : A (NOT(((3 <= p62) AND X (X (NOT(F (X (X (((p20 <= p121) AND G ((3 <= p62)))))))))))) : A (F ((F ((2 <= p8)) OR ((p3 <= p34) U ((p7 <= p74) OR NOT(X (F (X ((0 <= p69)))))))))) : A (NOT(X (X ((G ((p99 <= p10)) AND F ((3 <= p45))))))) : A (NOT(X (F (())))) : A (NOT(F ((F ((p59 <= p26)) OR X (X ((3 <= p81))))))) : A (((p93 + 1 <= p74) AND F ((X ((2 <= p60)) OR X (((p74 <= p93) OR ((p37 <= p25) AND (2 <= p60)))))))) : A (F ((F ((F ((p90 <= p7)) OR X ((p90 <= p62)))) U F ((2 <= p65))))) : A (X (((p83 <= p17) AND G (F (NOT(((G ((p13 <= p97)) U (p83 <= p17)) U F ((p45 <= p123))))))))) : A ((X (((0 <= p59) AND G ((p21 <= p79)))) OR G (X ((F ((p105 <= pterce)) AND X (F ((p113 <= p120)))))))) : A (((F ((p92 <= p35)) OR G ((3 <= p46))) OR (((3 <= p46) AND (3 <= p11)) AND F (NOT(X ((p11 <= 2))))))) : A (NOT(X (((p41 <= p3) AND G ((p25 <= p31))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:315
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:142
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:121
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: 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: 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 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p62 <= 2) OR X (X (X (X (F (((p20 <= p121) AND G ((3 <= p62))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p62 <= 2) OR X (X (X (X (F (((p20 <= p121) AND G ((3 <= p62))))))))))
lola: processed formula length: 74
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: 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((p10 + 1 <= p99)) OR G ((p45 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((p10 + 1 <= p99)) OR G ((p45 <= 2))))))
lola: processed formula length: 52
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 380 markings, 728 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p82 + 1 <= p69))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p82 + 1 <= p69))))
lola: processed formula length: 28
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: 3554542 markings, 5400142 edges, 710908 markings/sec, 0 secs
lola: 7068153 markings, 10738113 edges, 702722 markings/sec, 5 secs
lola: 10590599 markings, 16089540 edges, 704489 markings/sec, 10 secs
lola: 14145064 markings, 21489566 edges, 710893 markings/sec, 15 secs
lola: 17702222 markings, 26893716 edges, 711432 markings/sec, 20 secs
lola: 21143168 markings, 32121319 edges, 688189 markings/sec, 25 secs
lola: 24528879 markings, 37264996 edges, 677142 markings/sec, 30 secs
lola: 27885799 markings, 42364934 edges, 671384 markings/sec, 35 secs
lola: 31383597 markings, 47678893 edges, 699560 markings/sec, 40 secs
lola: 34888603 markings, 53003810 edges, 701001 markings/sec, 45 secs
lola: 38392730 markings, 58327369 edges, 700825 markings/sec, 50 secs
lola: 41910749 markings, 63672052 edges, 703604 markings/sec, 55 secs
lola: 45426595 markings, 69013445 edges, 703169 markings/sec, 60 secs
lola: 48838593 markings, 74197058 edges, 682400 markings/sec, 65 secs
lola: 52216749 markings, 79329263 edges, 675631 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p26 + 1 <= p59))) AND A (X (X (G ((p81 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p26 + 1 <= p59)))
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 ((p26 + 1 <= p59)))
lola: processed formula length: 24
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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: (p59 <= p26)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: 27 markings, 26 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p93 + 1 <= p74) AND A (X (F (((2 <= p60) OR ((p74 <= p93) OR ((p37 <= p25) AND (2 <= p60))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p93 + 1 <= p74)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p93 + 1 <= p74)
lola: processed formula length: 16
lola: 135 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p83 <= p17))) AND A (F (G ((p123 + 1 <= p45)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p123 + 1 <= p45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p123 + 1 <= p45))))
lola: processed formula length: 29
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 100
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 9 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p21 <= p79)) OR G ((F ((p105 <= pterce)) AND X (F ((p113 <= p120))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p21 <= p79)) OR G ((F ((p105 <= pterce)) AND X (F ((p113 <= p120))))))))
lola: processed formula length: 83
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: 3537528 markings, 5371772 edges, 707506 markings/sec, 0 secs
lola: 7101203 markings, 10783286 edges, 712735 markings/sec, 5 secs
lola: 10677642 markings, 16214164 edges, 715288 markings/sec, 10 secs
lola: 14342064 markings, 21778672 edges, 732884 markings/sec, 15 secs
lola: 17916884 markings, 27207103 edges, 714964 markings/sec, 20 secs
lola: 21369618 markings, 32450156 edges, 690547 markings/sec, 25 secs
lola: 24723757 markings, 37543479 edges, 670828 markings/sec, 30 secs
lola: 28006675 markings, 42528645 edges, 656584 markings/sec, 35 secs
lola: 31544355 markings, 47900685 edges, 707536 markings/sec, 40 secs
lola: 35057924 markings, 53236095 edges, 702714 markings/sec, 45 secs
lola: 38587679 markings, 58596104 edges, 705951 markings/sec, 50 secs
lola: 42140564 markings, 63991241 edges, 710577 markings/sec, 55 secs
lola: 45611319 markings, 69261615 edges, 694151 markings/sec, 60 secs
lola: 49004212 markings, 74413812 edges, 678579 markings/sec, 65 secs
lola: 52368731 markings, 79522904 edges, 672904 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p92 <= p35)) OR (G ((3 <= p46)) OR (((3 <= p46) AND (3 <= p11)) AND X (F ((3 <= p11)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p92 <= p35)) OR (G ((3 <= p46)) OR (((3 <= p46) AND (3 <= p11)) AND X (F ((3 <= p11)))))))
lola: processed formula length: 98
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p3 + 1 <= p41) OR F ((p31 + 1 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p3 + 1 <= p41) OR F ((p31 + 1 <= p25)))))
lola: processed formula length: 49
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p65)))
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: (p65 <= 1)
lola: processed formula length: 10
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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7 markings, 7 edges
lola: ========================================
lola: subprocess 11 will run for 681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p27 + 1 <= p68) AND G (F ((p122 <= p109))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((p27 + 1 <= p68) AND G (F ((p122 <= p109))))))
lola: processed formula length: 53
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: 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: 1064 markings, 1664 edges
lola: ========================================
lola: subprocess 12 will run for 851 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p62) AND (p62 <= 1)) OR F (G (((p124 <= p64) OR (G ((p40 <= p79)) AND F ((p124 <= p64))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p62) AND (p62 <= 1)) OR F (G (((p124 <= p64) OR (G ((p40 <= p79)) AND F ((p124 <= p64))))))))
lola: processed formula length: 104
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 29767 markings, 48359 edges
lola: ========================================
lola: subprocess 13 will run for 1134 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (G ((p62 <= p13))) AND G (F (((1 <= p88) OR (p59 <= p31))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (G ((p62 <= p13))) AND G (F (((1 <= p88) OR (p59 <= p31))))))))
lola: processed formula length: 76
lola: 135 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: 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: 2627182 markings, 4989486 edges, 525436 markings/sec, 0 secs
lola: 5307703 markings, 9814174 edges, 536104 markings/sec, 5 secs
lola: 7989266 markings, 14551107 edges, 536313 markings/sec, 10 secs
lola: 10636012 markings, 19271253 edges, 529349 markings/sec, 15 secs
lola: 13244363 markings, 24008480 edges, 521670 markings/sec, 20 secs
lola: 15871665 markings, 28730275 edges, 525460 markings/sec, 25 secs
lola: 18494965 markings, 33393821 edges, 524660 markings/sec, 30 secs
lola: 21157950 markings, 38176816 edges, 532597 markings/sec, 35 secs
lola: 23830394 markings, 42922434 edges, 534489 markings/sec, 40 secs
lola: 26457312 markings, 47681661 edges, 525384 markings/sec, 45 secs
lola: 29117532 markings, 52452981 edges, 532044 markings/sec, 50 secs
lola: 31743104 markings, 57151332 edges, 525114 markings/sec, 55 secs
lola: 34390538 markings, 61855326 edges, 529487 markings/sec, 60 secs
lola: 36990415 markings, 66509895 edges, 519975 markings/sec, 65 secs
lola: 39556069 markings, 71097831 edges, 513131 markings/sec, 70 secs
lola: 42053288 markings, 75642909 edges, 499444 markings/sec, 75 secs
lola: 44652548 markings, 80298694 edges, 519852 markings/sec, 80 secs
lola: 47250650 markings, 84909584 edges, 519620 markings/sec, 85 secs
lola: 49899625 markings, 89593310 edges, 529795 markings/sec, 90 secs
lola: 52480706 markings, 94254491 edges, 516216 markings/sec, 95 secs
lola: 55085470 markings, 98914671 edges, 520953 markings/sec, 100 secs
lola: 57691664 markings, 103547263 edges, 521239 markings/sec, 105 secs
lola: 60261554 markings, 108051089 edges, 513978 markings/sec, 110 secs
lola: 62845086 markings, 112645973 edges, 516706 markings/sec, 115 secs
lola: 65433463 markings, 117225152 edges, 517675 markings/sec, 120 secs
lola: 68076735 markings, 121904733 edges, 528654 markings/sec, 125 secs
lola: 70711001 markings, 126574771 edges, 526853 markings/sec, 130 secs
lola: 73324192 markings, 131315040 edges, 522638 markings/sec, 135 secs
lola: 75923087 markings, 135972375 edges, 519779 markings/sec, 140 secs
lola: 78519131 markings, 140603972 edges, 519209 markings/sec, 145 secs
lola: 81170965 markings, 145210687 edges, 530367 markings/sec, 150 secs
lola: 83825215 markings, 149978307 edges, 530850 markings/sec, 155 secs
lola: 86505510 markings, 154848030 edges, 536059 markings/sec, 160 secs
lola: 89239424 markings, 159727499 edges, 546783 markings/sec, 165 secs
lola: 91890885 markings, 164493101 edges, 530292 markings/sec, 170 secs
lola: 94538275 markings, 169179310 edges, 529478 markings/sec, 175 secs
lola: 97153248 markings, 173857476 edges, 522995 markings/sec, 180 secs
lola: 99650596 markings, 178317144 edges, 499470 markings/sec, 185 secs
lola: 102308415 markings, 183107733 edges, 531564 markings/sec, 190 secs
lola: 104868371 markings, 187608177 edges, 511991 markings/sec, 195 secs
lola: 107448727 markings, 192194082 edges, 516071 markings/sec, 200 secs
lola: 110067330 markings, 196828260 edges, 523721 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((2 <= p8)) OR ((p3 <= p34) U (p7 <= p74)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((2 <= p8)) OR ((p3 <= p34) U (p7 <= p74)))))
lola: processed formula length: 54
lola: 135 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 1 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: 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 15 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p86 + 1 <= p55) AND (A ((F ((p11 <= 1)) OR G ((p86 + 1 <= p55)))) AND A ((F ((p79 <= 2)) OR G (((p86 + 1 <= p55) AND (F ((p11 <= 1)) OR G ((p86 + 1 <= p55)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p86 + 1 <= p55)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p86 + 1 <= p55)
lola: processed formula length: 16
lola: 135 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: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G ((p82 + 1 <= p69))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p82 + 1 <= p69))))
lola: processed formula length: 28
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: 3638936 markings, 5528342 edges, 727787 markings/sec, 0 secs
lola: 7227584 markings, 10980335 edges, 717730 markings/sec, 5 secs
lola: 10872705 markings, 16518108 edges, 729024 markings/sec, 10 secs
lola: 14558035 markings, 22116978 edges, 737066 markings/sec, 15 secs
lola: 18083191 markings, 27472508 edges, 705031 markings/sec, 20 secs
lola: 21594869 markings, 32807552 edges, 702336 markings/sec, 25 secs
lola: 25071617 markings, 38089542 edges, 695350 markings/sec, 30 secs
lola: 28494183 markings, 43289215 edges, 684513 markings/sec, 35 secs
lola: 32129016 markings, 48811359 edges, 726967 markings/sec, 40 secs
lola: 35750605 markings, 54313381 edges, 724318 markings/sec, 45 secs
lola: 39362159 markings, 59800173 edges, 722311 markings/sec, 50 secs
lola: 42927830 markings, 65217233 edges, 713134 markings/sec, 55 secs
lola: 46477790 markings, 70610447 edges, 709992 markings/sec, 60 secs
lola: 49948678 markings, 75883530 edges, 694178 markings/sec, 65 secs
lola: 53212223 markings, 80841609 edges, 652709 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p21 <= p79)) OR G ((F ((p105 <= pterce)) AND X (F ((p113 <= p120))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G ((p21 <= p79)) OR G ((F ((p105 <= pterce)) AND X (F ((p113 <= p120))))))))
lola: processed formula length: 83
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: 3514695 markings, 5337090 edges, 702939 markings/sec, 0 secs
lola: 6970154 markings, 10584271 edges, 691092 markings/sec, 5 secs
lola: 10456216 markings, 15877931 edges, 697212 markings/sec, 10 secs
lola: 13958910 markings, 21196832 edges, 700539 markings/sec, 15 secs
lola: 17418646 markings, 26450522 edges, 691947 markings/sec, 20 secs
lola: 20806688 markings, 31595329 edges, 677608 markings/sec, 25 secs
lola: 24058466 markings, 36533207 edges, 650356 markings/sec, 30 secs
lola: 27426298 markings, 41647333 edges, 673566 markings/sec, 35 secs
lola: 30890627 markings, 46907988 edges, 692866 markings/sec, 40 secs
lola: 34337042 markings, 52141420 edges, 689283 markings/sec, 45 secs
lola: 37804794 markings, 57407291 edges, 693550 markings/sec, 50 secs
lola: 41242200 markings, 62627053 edges, 687481 markings/sec, 55 secs
lola: 44624119 markings, 67762546 edges, 676384 markings/sec, 60 secs
lola: 47972335 markings, 72846890 edges, 669643 markings/sec, 65 secs
lola: 51253189 markings, 77828953 edges, 656171 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (G ((p62 <= p13))) AND G (F (((1 <= p88) OR (p59 <= p31))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (G ((p62 <= p13))) AND G (F (((1 <= p88) OR (p59 <= p31))))))))
lola: processed formula length: 76
lola: 135 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: 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: 1964245 markings, 3725145 edges, 392849 markings/sec, 0 secs
lola: 4466825 markings, 8380568 edges, 500516 markings/sec, 5 secs
lola: 7133457 markings, 12962827 edges, 533326 markings/sec, 10 secs
lola: 9682994 markings, 17608264 edges, 509907 markings/sec, 15 secs
lola: 12236386 markings, 22185458 edges, 510678 markings/sec, 20 secs
lola: 14766148 markings, 26722516 edges, 505952 markings/sec, 25 secs
lola: 17317908 markings, 31329178 edges, 510352 markings/sec, 30 secs
lola: 19868468 markings, 35895538 edges, 510112 markings/sec, 35 secs
lola: 22415502 markings, 40374757 edges, 509407 markings/sec, 40 secs
lola: 24938415 markings, 44970389 edges, 504583 markings/sec, 45 secs
lola: 27468274 markings, 49493214 edges, 505972 markings/sec, 50 secs
lola: 29988920 markings, 54015572 edges, 504129 markings/sec, 55 secs
lola: 32528306 markings, 58577430 edges, 507877 markings/sec, 60 secs
lola: 35094791 markings, 63077357 edges, 513297 markings/sec, 65 secs
lola: 37611483 markings, 67623564 edges, 503338 markings/sec, 70 secs
lola: 40126138 markings, 72142940 edges, 502931 markings/sec, 75 secs
lola: 42656739 markings, 76716267 edges, 506120 markings/sec, 80 secs
lola: 45169859 markings, 81247151 edges, 502624 markings/sec, 85 secs
lola: 47687070 markings, 85697820 edges, 503442 markings/sec, 90 secs
lola: 50260143 markings, 90269134 edges, 514615 markings/sec, 95 secs
lola: 52769602 markings, 94772830 edges, 501892 markings/sec, 100 secs
lola: 55302986 markings, 99289037 edges, 506677 markings/sec, 105 secs
lola: 57832275 markings, 103786050 edges, 505858 markings/sec, 110 secs
lola: 60344236 markings, 108192394 edges, 502392 markings/sec, 115 secs
lola: 62903168 markings, 112743894 edges, 511786 markings/sec, 120 secs
lola: 65408403 markings, 117175975 edges, 501047 markings/sec, 125 secs
lola: 67929399 markings, 121650259 edges, 504199 markings/sec, 130 secs
lola: 70455507 markings, 126111829 edges, 505222 markings/sec, 135 secs
lola: 72959870 markings, 130654201 edges, 500873 markings/sec, 140 secs
lola: 75487174 markings, 135186512 edges, 505461 markings/sec, 145 secs
lola: 77976423 markings, 139611058 edges, 497850 markings/sec, 150 secs
lola: 80520391 markings, 144093143 edges, 508794 markings/sec, 155 secs
lola: 83023953 markings, 148546074 edges, 500712 markings/sec, 160 secs
lola: 85562745 markings, 153150391 edges, 507758 markings/sec, 165 secs
lola: 88053359 markings, 157613010 edges, 498123 markings/sec, 170 secs
lola: 90608348 markings, 162180709 edges, 510998 markings/sec, 175 secs
lola: 93079482 markings, 166628219 edges, 494227 markings/sec, 180 secs
lola: 95528456 markings, 170959609 edges, 489795 markings/sec, 185 secs
lola: 97978148 markings, 175311364 edges, 489938 markings/sec, 190 secs
lola: 100458836 markings, 179769711 edges, 496138 markings/sec, 195 secs
lola: 102902216 markings, 184156913 edges, 488676 markings/sec, 200 secs
lola: 105430957 markings, 188621331 edges, 505748 markings/sec, 205 secs
lola: 107944368 markings, 193093258 edges, 502682 markings/sec, 210 secs
lola: 110529642 markings, 197659668 edges, 517055 markings/sec, 215 secs
lola: 112257437 markings, 200763548 edges, 345559 markings/sec, 220 secs
lola: 112257454 markings, 200763583 edges, 3 markings/sec, 225 secs
lola: 112304376 markings, 200847492 edges, 9384 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown no unknown no no yes yes yes no no no no no unknown yes no
lola:
preliminary result: unknown no unknown no no yes yes yes no no no no no unknown yes no
lola: memory consumption: 23080 KB
lola: time consumption: 786 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590264325054

--------------------
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="RefineWMG-PT-025026"
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 RefineWMG-PT-025026, 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 r165-oct2-158972938900023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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