Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r090-smll-158922999300023.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is FMS-PT-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r090-smll-158922999300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.1K Apr 1 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 1 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 1 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 06:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 1 13:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 1 13:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-10000-00
FORMULA_NAME FMS-PT-10000-01
FORMULA_NAME FMS-PT-10000-02
FORMULA_NAME FMS-PT-10000-03
FORMULA_NAME FMS-PT-10000-04
FORMULA_NAME FMS-PT-10000-05
FORMULA_NAME FMS-PT-10000-06
FORMULA_NAME FMS-PT-10000-07
FORMULA_NAME FMS-PT-10000-08
FORMULA_NAME FMS-PT-10000-09
FORMULA_NAME FMS-PT-10000-10
FORMULA_NAME FMS-PT-10000-11
FORMULA_NAME FMS-PT-10000-12
FORMULA_NAME FMS-PT-10000-13
FORMULA_NAME FMS-PT-10000-14
FORMULA_NAME FMS-PT-10000-15

=== Now, execution of the tool begins

BK_START 1589541306852

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ FMS-PT-10000 @ 3570 seconds

FORMULA FMS-PT-10000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-05 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-10000-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2590
rslt: Output for LTLCardinality @ FMS-PT-10000

{
"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": "Fri May 15 11:15:06 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 279
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (F ((P12s <= P1)))))",
"processed_size": 28,
"rewrites": 115
},
"result":
{
"edges": 15,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 304
},
"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": "(P2wP1 <= 0)",
"processed_size": 12,
"rewrites": 115
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"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 ((P12wM3 + 1 <= P2d)))",
"processed_size": 27,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 335
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F (((P3 <= M2) AND G ((1 <= M2))))))",
"processed_size": 42,
"rewrites": 115
},
"result":
{
"edges": 150009,
"markings": 120010,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 372
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((G (F ((P2wP1 <= P12))) OR X (F (((P2wP1 <= P12) OR G ((P3M2 <= 2)))))))",
"processed_size": 75,
"rewrites": 115
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 419
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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 ((X (X (X (G ((P3s <= 0))))) U (3 <= P1wP2))))",
"processed_size": 51,
"rewrites": 115
},
"result":
{
"edges": 9,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 608
},
"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": "(3 <= P1M1)",
"processed_size": 11,
"rewrites": 117
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 760
},
"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": "(P2d <= 0)",
"processed_size": 10,
"rewrites": 117
},
"result":
{
"edges": 50004,
"markings": 50004,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 1013
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((P3 <= P12wM3))))",
"processed_size": 26,
"rewrites": 115
},
"result":
{
"edges": 40004,
"markings": 40004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3040
},
"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 (G (F ((P2wM2 + 1 <= P2s))))",
"processed_size": 30,
"rewrites": 115
},
"result":
{
"edges": 40004,
"markings": 40004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 21596,
"runtime": 980.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(F(**))) : (A(G(F((** AND G(**))))) AND A(X(G((* OR G(*)))))) : A(G(F(*))) : A((G(F(**)) OR X(F((** OR G(*)))))) : A(X((X(X(X(G(*)))) U **))) : A(X(X(X(G(**))))) : A(F(**)) : A(X(X(F(**)))) : (A(X(*)) AND (A(G(*)) AND (* AND A((F(*) OR G(*)))))) : FALSE : A(F(**)) : FALSE : FALSE : A(G(F((** OR (G(**) OR (X(**) AND G(**))))))) : A(F((** AND (** OR (G(F(**)) AND F(**)))))) : A(X(X(G(**))))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no no no yes no unknown yes yes no no no no no unknown no unknown ",
"value": "no no no yes no unknown yes yes no no no no no unknown no unknown "
},
"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: 42/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: LP says that atomic proposition is always false: (2 <= P2M2)
lola: A (X (G ((X (G (X ((P12M3 <= P1)))) U F ((F ((M1 <= P1M1)) U X ((P3 <= P12wM3)))))))) : A (G ((F (((P3 <= M2) AND G ((1 <= M2)))) AND NOT(F ((X ((2 <= P1s)) AND F (X ((1 <= M2))))))))) : A ((X (NOT(G ((P2s <= P2wM2)))) U F (NOT(X (F (G ((P2s <= P2wM2)))))))) : A ((F (G (F ((P2wP1 <= P12)))) OR F (X (F (((P2wP1 <= P12) OR NOT(F ((3 <= P3M2))))))))) : A (X ((X (G (X (((0 <= P2s) AND NOT(X ((1 <= P3s))))))) U (3 <= P1wP2)))) : A (X (G (X (X ((((P12s <= P2M2) OR (P12 <= P1wM1)))))))) : A (F ((P1M1 <= 2))) : A (F (X (F ((G ((0 <= P1d)) AND F (X ((P12s <= P1)))))))) : A (NOT(((X ((1 <= P2wP1)) OR F ((P2d <= P12wM3))) OR (G ((P2d <= P12wM3)) U (1 <= P2wP1))))) : A (F ((((2 <= P2M2) U X (X ((P2M2 <= 1)))) AND (G ((0 <= P12M3)) U X ((2 <= P2M2)))))) : A (F ((((1 <= P1wP2) OR (G ((P1wP2 <= 0)) U (1 <= P2wM2))) U (1 <= P2d)))) : A (NOT(((F ((1 <= P2M2)) U (0 <= P1)) U G (F (()))))) : A (NOT((X (F (X ((0 <= P12s)))) U (X ((0 <= P12s)) OR NOT(G (NOT(G ((0 <= P12s))))))))) : A (G (F ((((P12 <= P2s) OR G ((P12 <= P2s))) OR (X ((3 <= P2wM2)) AND G ((M1 <= P2wM2))))))) : A (F (((P2M2 + 1 <= P2s) U ((2 <= P12s) AND (X (G (F ((3 <= P3s)))) U (2 <= P12s)))))) : A (((G ((0 <= P12M3)) OR F ((P1 <= P1d))) AND X (X (G ((P1wM1 <= M3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:536
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:142
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
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:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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: 115 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 115 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: 115 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: A (X (X (X (G ((((P12s <= P2M2) OR (P12 <= P1wM1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((((P12s <= P2M2) OR (P12 <= P1wM1))))))))
lola: processed formula length: 57
lola: 115 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: 3179431 markings, 5829271 edges, 635886 markings/sec, 0 secs
lola: 6294068 markings, 11543752 edges, 622927 markings/sec, 5 secs
lola: 9396253 markings, 17224451 edges, 620437 markings/sec, 10 secs
lola: 12450913 markings, 22820718 edges, 610932 markings/sec, 15 secs
lola: 15438875 markings, 28306203 edges, 597592 markings/sec, 20 secs
lola: 18491142 markings, 33900429 edges, 610453 markings/sec, 25 secs
lola: 21497037 markings, 39411919 edges, 601179 markings/sec, 30 secs
lola: 24469175 markings, 44864874 edges, 594428 markings/sec, 35 secs
lola: 27458997 markings, 50339052 edges, 597964 markings/sec, 40 secs
lola: 30409750 markings, 55755568 edges, 590151 markings/sec, 45 secs
lola: 33347837 markings, 61140420 edges, 587617 markings/sec, 50 secs
lola: 35302453 markings, 64720688 edges, 390923 markings/sec, 55 secs
lola: 37163418 markings, 68131559 edges, 372193 markings/sec, 60 secs
lola: 39026716 markings, 71544765 edges, 372660 markings/sec, 65 secs
lola: 40869274 markings, 74924455 edges, 368512 markings/sec, 70 secs
lola: 42724014 markings, 78323750 edges, 370948 markings/sec, 75 secs
lola: 44530385 markings, 81636313 edges, 361274 markings/sec, 80 secs
lola: 46338089 markings, 84951539 edges, 361541 markings/sec, 85 secs
lola: 48170951 markings, 88316351 edges, 366572 markings/sec, 90 secs
lola: 49976083 markings, 91623583 edges, 361026 markings/sec, 95 secs
lola: 51770166 markings, 94913940 edges, 358817 markings/sec, 100 secs
lola: 53580080 markings, 98227400 edges, 361983 markings/sec, 105 secs
lola: 55375171 markings, 101522400 edges, 359018 markings/sec, 110 secs
lola: 57188441 markings, 104841157 edges, 362654 markings/sec, 115 secs
lola: 59031186 markings, 108225581 edges, 368549 markings/sec, 120 secs
lola: 60848966 markings, 111551843 edges, 363556 markings/sec, 125 secs
lola: 62660929 markings, 114875588 edges, 362393 markings/sec, 130 secs
lola: 64447768 markings, 118149087 edges, 357368 markings/sec, 135 secs
lola: 66243280 markings, 121439967 edges, 359102 markings/sec, 140 secs
lola: 68078034 markings, 124801567 edges, 366951 markings/sec, 145 secs
lola: 69877448 markings, 128099879 edges, 359883 markings/sec, 150 secs
lola: 71671021 markings, 131387438 edges, 358715 markings/sec, 155 secs
lola: 73489556 markings, 134729699 edges, 363707 markings/sec, 160 secs
lola: 75259905 markings, 137972279 edges, 354070 markings/sec, 165 secs
lola: 77018569 markings, 141191790 edges, 351733 markings/sec, 170 secs
lola: 78853434 markings, 144558977 edges, 366973 markings/sec, 175 secs
lola: 80723369 markings, 147988663 edges, 373987 markings/sec, 180 secs
lola: 82786443 markings, 151770755 edges, 412615 markings/sec, 185 secs
lola: 84807748 markings, 155473508 edges, 404261 markings/sec, 190 secs
lola: 86842542 markings, 159206397 edges, 406959 markings/sec, 195 secs
lola: 88884928 markings, 162950484 edges, 408477 markings/sec, 200 secs
lola: 89578145 markings, 164223665 edges, 138643 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P12s <= P1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P12s <= P1)))))
lola: processed formula length: 28
lola: 115 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: 13 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((P2wP1 <= 0))) AND (A (G ((P12wM3 + 1 <= P2d))) AND ((P2wP1 <= 0) AND A ((F ((P12wM3 + 1 <= P2d)) OR G ((P2wP1 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P2wP1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P2wP1 <= 0)
lola: processed formula length: 12
lola: 115 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: subprocess 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P12wM3 + 1 <= P2d)))
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 ((P12wM3 + 1 <= P2d)))
lola: processed formula length: 27
lola: 117 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: 0 markings, 0 edges
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: (P2d <= P12wM3)
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: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((P3 <= M2) AND G ((1 <= M2)))))) AND A (X (G (((P1s <= 1) OR G ((M2 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((P3 <= M2) AND G ((1 <= M2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P3 <= M2) AND G ((1 <= M2))))))
lola: processed formula length: 42
lola: 115 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: add low 9
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: 120010 markings, 150009 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((P2wP1 <= P12))) OR X (F (((P2wP1 <= P12) OR G ((P3M2 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((P2wP1 <= P12))) OR X (F (((P2wP1 <= P12) OR G ((P3M2 <= 2)))))))
lola: processed formula length: 75
lola: 115 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (X (X (G ((P3s <= 0))))) U (3 <= P1wP2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (X (X (G ((P3s <= 0))))) U (3 <= P1wP2))))
lola: processed formula length: 51
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((P12 <= P2s) OR (G ((P12 <= P2s)) OR (X ((3 <= P2wM2)) AND G ((M1 <= P2wM2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P12 <= P2s) OR (G ((P12 <= P2s)) OR (X ((3 <= P2wM2)) AND G ((M1 <= P2wM2))))))))
lola: processed formula length: 92
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 2734334 markings, 5010487 edges, 546867 markings/sec, 0 secs
lola: 5745926 markings, 10539092 edges, 602318 markings/sec, 5 secs
lola: 8769771 markings, 16078661 edges, 604769 markings/sec, 10 secs
lola: 11722622 markings, 21492036 edges, 590570 markings/sec, 15 secs
lola: 14627103 markings, 26820923 edges, 580896 markings/sec, 20 secs
lola: 17572091 markings, 32221212 edges, 588998 markings/sec, 25 secs
lola: 20481311 markings, 37550287 edges, 581844 markings/sec, 30 secs
lola: 23374193 markings, 42847553 edges, 578576 markings/sec, 35 secs
lola: 26267925 markings, 48161524 edges, 578746 markings/sec, 40 secs
lola: 29194271 markings, 53517020 edges, 585269 markings/sec, 45 secs
lola: 32065505 markings, 58783903 edges, 574247 markings/sec, 50 secs
lola: 34918305 markings, 64016558 edges, 570560 markings/sec, 55 secs
lola: 37843254 markings, 69378398 edges, 584990 markings/sec, 60 secs
lola: 40729186 markings, 74672869 edges, 577186 markings/sec, 65 secs
lola: 43571168 markings, 79877975 edges, 568396 markings/sec, 70 secs
lola: 46357845 markings, 84983811 edges, 557335 markings/sec, 75 secs
lola: 49182336 markings, 90164685 edges, 564898 markings/sec, 80 secs
lola: 51940164 markings, 95218910 edges, 551566 markings/sec, 85 secs
lola: 54713004 markings, 100310267 edges, 554568 markings/sec, 90 secs
lola: 57511468 markings, 105428594 edges, 559693 markings/sec, 95 secs
lola: 60343527 markings, 110626268 edges, 566412 markings/sec, 100 secs
lola: 63123604 markings, 115720889 edges, 556015 markings/sec, 105 secs
lola: 65882120 markings, 120778826 edges, 551703 markings/sec, 110 secs
lola: 68687199 markings, 125924406 edges, 561016 markings/sec, 115 secs
lola: 71440461 markings, 130967216 edges, 550652 markings/sec, 120 secs
lola: 74180199 markings, 135992975 edges, 547948 markings/sec, 125 secs
lola: 76896008 markings, 140965401 edges, 543162 markings/sec, 130 secs
lola: 79744338 markings, 146190697 edges, 569666 markings/sec, 135 secs
lola: 82552205 markings, 151345187 edges, 561573 markings/sec, 140 secs
lola: 85312266 markings, 156404995 edges, 552012 markings/sec, 145 secs
lola: 88078439 markings, 161474034 edges, 553235 markings/sec, 150 secs
lola: 89833902 markings, 164688817 edges, 351093 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 531 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((P1wM1 <= M3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((P1wM1 <= M3)))))
lola: processed formula length: 29
lola: 115 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: 3285466 markings, 6028249 edges, 657093 markings/sec, 0 secs
lola: 6479341 markings, 11879016 edges, 638775 markings/sec, 5 secs
lola: 9648528 markings, 17695108 edges, 633837 markings/sec, 10 secs
lola: 12766470 markings, 23409573 edges, 623588 markings/sec, 15 secs
lola: 15825611 markings, 29017045 edges, 611828 markings/sec, 20 secs
lola: 18957959 markings, 34757010 edges, 626470 markings/sec, 25 secs
lola: 22033584 markings, 40394960 edges, 615125 markings/sec, 30 secs
lola: 25110617 markings, 46029362 edges, 615407 markings/sec, 35 secs
lola: 28198057 markings, 51696646 edges, 617488 markings/sec, 40 secs
lola: 31267108 markings, 57321083 edges, 613810 markings/sec, 45 secs
lola: 34328299 markings, 62933161 edges, 612238 markings/sec, 50 secs
lola: 37415230 markings, 68588391 edges, 617386 markings/sec, 55 secs
lola: 40502775 markings, 74251495 edges, 617509 markings/sec, 60 secs
lola: 43535343 markings, 79807909 edges, 606514 markings/sec, 65 secs
lola: 46516709 markings, 85278762 edges, 596273 markings/sec, 70 secs
lola: 49538691 markings, 90815527 edges, 604396 markings/sec, 75 secs
lola: 52493557 markings, 96240931 edges, 590973 markings/sec, 80 secs
lola: 55430829 markings, 101625139 edges, 587454 markings/sec, 85 secs
lola: 58462288 markings, 107178726 edges, 606292 markings/sec, 90 secs
lola: 61458205 markings, 112670260 edges, 599183 markings/sec, 95 secs
lola: 64395126 markings, 118053808 edges, 587384 markings/sec, 100 secs
lola: 67390753 markings, 123544761 edges, 599125 markings/sec, 105 secs
lola: 70450399 markings, 129153748 edges, 611929 markings/sec, 110 secs
lola: 73472555 markings, 134688882 edges, 604431 markings/sec, 115 secs
lola: 76456739 markings, 140165828 edges, 596837 markings/sec, 120 secs
lola: 79626235 markings, 145974502 edges, 633899 markings/sec, 125 secs
lola: 82755799 markings, 151713319 edges, 625913 markings/sec, 130 secs
lola: 85791420 markings, 157282822 edges, 607124 markings/sec, 135 secs
lola: 88847766 markings, 162883305 edges, 611269 markings/sec, 140 secs
lola: 89600900 markings, 164262837 edges, 150627 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P1M1 <= 2)))
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: (3 <= P1M1)
lola: processed formula length: 11
lola: 117 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= P2d)))
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: (P2d <= 0)
lola: processed formula length: 10
lola: 117 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: 50004 markings, 50004 edges
lola: ========================================
lola: subprocess 13 will run for 1013 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((P3 <= P12wM3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((P3 <= P12wM3))))
lola: processed formula length: 26
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40004 markings, 40004 edges
lola: ========================================
lola: subprocess 14 will run for 1520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= P12s) AND ((2 <= P12s) OR (G (F ((3 <= P3s))) AND F ((2 <= P12s)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= P12s) AND ((2 <= P12s) OR (G (F ((3 <= P3s))) AND F ((2 <= P12s)))))))
lola: processed formula length: 83
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 50004 markings, 50004 edges
lola: ========================================
lola: subprocess 15 will run for 3040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((P2wM2 + 1 <= P2s))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((P2wM2 + 1 <= P2s))))
lola: processed formula length: 30
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40004 markings, 40004 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((((P12s <= P2M2) OR (P12 <= P1wM1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((((P12s <= P2M2) OR (P12 <= P1wM1))))))))
lola: processed formula length: 57
lola: 115 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: 3017931 markings, 5535557 edges, 603586 markings/sec, 0 secs
lola: 6319336 markings, 11588037 edges, 660281 markings/sec, 5 secs
lola: 9576417 markings, 17554838 edges, 651416 markings/sec, 10 secs
lola: 12782159 markings, 23433034 edges, 641148 markings/sec, 15 secs
lola: 15910202 markings, 29168807 edges, 625609 markings/sec, 20 secs
lola: 19106957 markings, 35026002 edges, 639351 markings/sec, 25 secs
lola: 22236225 markings, 40762776 edges, 625854 markings/sec, 30 secs
lola: 25364827 markings, 46503890 edges, 625720 markings/sec, 35 secs
lola: 28549539 markings, 52345272 edges, 636942 markings/sec, 40 secs
lola: 31698441 markings, 58113708 edges, 629780 markings/sec, 45 secs
lola: 34818204 markings, 63832922 edges, 623953 markings/sec, 50 secs
lola: 37998985 markings, 69664165 edges, 636156 markings/sec, 55 secs
lola: 41146613 markings, 75436384 edges, 629526 markings/sec, 60 secs
lola: 44253152 markings, 81122342 edges, 621308 markings/sec, 65 secs
lola: 47330430 markings, 86775155 edges, 615456 markings/sec, 70 secs
lola: 50386199 markings, 92374194 edges, 611154 markings/sec, 75 secs
lola: 53421154 markings, 97936963 edges, 606991 markings/sec, 80 secs
lola: 56435356 markings, 103456330 edges, 602840 markings/sec, 85 secs
lola: 59441469 markings, 108971237 edges, 601223 markings/sec, 90 secs
lola: 62313983 markings, 114232162 edges, 574503 markings/sec, 95 secs
lola: 65059805 markings, 119273101 edges, 549164 markings/sec, 100 secs
lola: 67901464 markings, 124480167 edges, 568332 markings/sec, 105 secs
lola: 70897777 markings, 129970574 edges, 599263 markings/sec, 110 secs
lola: 73866752 markings, 135416112 edges, 593795 markings/sec, 115 secs
lola: 76732160 markings, 140675803 edges, 573082 markings/sec, 120 secs
lola: 79799738 markings, 146295747 edges, 613516 markings/sec, 125 secs
lola: 82814523 markings, 151820759 edges, 602957 markings/sec, 130 secs
lola: 85752074 markings, 157205569 edges, 587510 markings/sec, 135 secs
lola: 88695296 markings, 162601718 edges, 588644 markings/sec, 140 secs
lola: 89575136 markings, 164220656 edges, 175968 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F (((P12 <= P2s) OR (G ((P12 <= P2s)) OR (X ((3 <= P2wM2)) AND G ((M1 <= P2wM2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((P12 <= P2s) OR (G ((P12 <= P2s)) OR (X ((3 <= P2wM2)) AND G ((M1 <= P2wM2))))))))
lola: processed formula length: 92
lola: 115 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 2762701 markings, 5065119 edges, 552540 markings/sec, 0 secs
lola: 5941800 markings, 10892999 edges, 635820 markings/sec, 5 secs
lola: 9097184 markings, 16676816 edges, 631077 markings/sec, 10 secs
lola: 12203369 markings, 22372760 edges, 621237 markings/sec, 15 secs
lola: 15216802 markings, 27895095 edges, 602687 markings/sec, 20 secs
lola: 18326264 markings, 33595349 edges, 621892 markings/sec, 25 secs
lola: 21376367 markings, 39190592 edges, 610021 markings/sec, 30 secs
lola: 24404047 markings, 44742062 edges, 605536 markings/sec, 35 secs
lola: 27455435 markings, 50330148 edges, 610278 markings/sec, 40 secs
lola: 30484339 markings, 55885623 edges, 605781 markings/sec, 45 secs
lola: 33507517 markings, 61425843 edges, 604636 markings/sec, 50 secs
lola: 36525145 markings, 66963292 edges, 603526 markings/sec, 55 secs
lola: 39594799 markings, 72592819 edges, 613931 markings/sec, 60 secs
lola: 42601198 markings, 78099068 edges, 601280 markings/sec, 65 secs
lola: 45546382 markings, 83498205 edges, 589037 markings/sec, 70 secs
lola: 48507914 markings, 88925490 edges, 592306 markings/sec, 75 secs
lola: 51388608 markings, 94206040 edges, 576139 markings/sec, 80 secs
lola: 54284123 markings, 99518515 edges, 579103 markings/sec, 85 secs
lola: 57202494 markings, 104869263 edges, 583674 markings/sec, 90 secs
lola: 60164803 markings, 110299482 edges, 592462 markings/sec, 95 secs
lola: 63058582 markings, 115605429 edges, 578756 markings/sec, 100 secs
lola: 65949275 markings, 120901950 edges, 578139 markings/sec, 105 secs
lola: 68890562 markings, 126294231 edges, 588257 markings/sec, 110 secs
lola: 71783010 markings, 131598839 edges, 578490 markings/sec, 115 secs
lola: 74656120 markings, 136864771 edges, 574622 markings/sec, 120 secs
lola: 77536385 markings, 142145011 edges, 576053 markings/sec, 125 secs
lola: 80517469 markings, 147613443 edges, 596217 markings/sec, 130 secs
lola: 83442232 markings, 152970144 edges, 584953 markings/sec, 135 secs
lola: 86319783 markings, 158243662 edges, 575510 markings/sec, 140 secs
lola: 89207131 markings, 163541672 edges, 577470 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((P1wM1 <= M3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((P1wM1 <= M3)))))
lola: processed formula length: 29
lola: 115 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: 2874297 markings, 5274152 edges, 574859 markings/sec, 0 secs
lola: 6262093 markings, 11481780 edges, 677559 markings/sec, 5 secs
lola: 9610909 markings, 17620853 edges, 669763 markings/sec, 10 secs
lola: 12887626 markings, 23632450 edges, 655343 markings/sec, 15 secs
lola: 16148890 markings, 29606159 edges, 652253 markings/sec, 20 secs
lola: 19425783 markings, 35617023 edges, 655379 markings/sec, 25 secs
lola: 22668722 markings, 41563967 edges, 648588 markings/sec, 30 secs
lola: 25871662 markings, 47430732 edges, 640588 markings/sec, 35 secs
lola: 29144211 markings, 53431878 edges, 654510 markings/sec, 40 secs
lola: 32359320 markings, 59325401 edges, 643022 markings/sec, 45 secs
lola: 35548465 markings, 65166688 edges, 637829 markings/sec, 50 secs
lola: 38816697 markings, 71164755 edges, 653646 markings/sec, 55 secs
lola: 42008469 markings, 77012732 edges, 638354 markings/sec, 60 secs
lola: 45143350 markings, 82761092 edges, 626976 markings/sec, 65 secs
lola: 48297845 markings, 88545429 edges, 630899 markings/sec, 70 secs
lola: 51372340 markings, 94179539 edges, 614899 markings/sec, 75 secs
lola: 54466589 markings, 99854659 edges, 618850 markings/sec, 80 secs
lola: 57599020 markings, 105596139 edges, 626486 markings/sec, 85 secs
lola: 60764319 markings, 111398197 edges, 633060 markings/sec, 90 secs
lola: 63876498 markings, 117098255 edges, 622436 markings/sec, 95 secs
lola: 66942944 markings, 122723986 edges, 613289 markings/sec, 100 secs
lola: 70087575 markings, 128488136 edges, 628926 markings/sec, 105 secs
lola: 73148603 markings, 134099885 edges, 612206 markings/sec, 110 secs
lola: 76174676 markings, 139642161 edges, 605215 markings/sec, 115 secs
lola: 79330720 markings, 145433501 edges, 631209 markings/sec, 120 secs
lola: 82479924 markings, 151204495 edges, 629841 markings/sec, 125 secs
lola: 85539345 markings, 156812664 edges, 611884 markings/sec, 130 secs
lola: 88595371 markings, 162412346 edges, 611205 markings/sec, 135 secs
lola: 89572941 markings, 164216152 edges, 195514 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes no unknown yes yes no no no no no unknown no unknown
lola:
preliminary result: no no no yes no unknown yes yes no no no no no unknown no unknown
lola: memory consumption: 21596 KB
lola: time consumption: 980 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589542286826

--------------------
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="FMS-PT-10000"
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 FMS-PT-10000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r090-smll-158922999300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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