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-158922999300027.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-50000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r090-smll-158922999300027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 2.6K Apr 1 20:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 1 20:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 1 13:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 1 13:49 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.5K Apr 8 14:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.6K Apr 1 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 1 06:34 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-50000-00
FORMULA_NAME FMS-PT-50000-01
FORMULA_NAME FMS-PT-50000-02
FORMULA_NAME FMS-PT-50000-03
FORMULA_NAME FMS-PT-50000-04
FORMULA_NAME FMS-PT-50000-05
FORMULA_NAME FMS-PT-50000-06
FORMULA_NAME FMS-PT-50000-07
FORMULA_NAME FMS-PT-50000-08
FORMULA_NAME FMS-PT-50000-09
FORMULA_NAME FMS-PT-50000-10
FORMULA_NAME FMS-PT-50000-11
FORMULA_NAME FMS-PT-50000-12
FORMULA_NAME FMS-PT-50000-13
FORMULA_NAME FMS-PT-50000-14
FORMULA_NAME FMS-PT-50000-15

=== Now, execution of the tool begins

BK_START 1589542810619

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

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

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

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

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

FORMULA FMS-PT-50000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA FMS-PT-50000-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FMS-PT-50000-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2184
rslt: Output for LTLCardinality @ FMS-PT-50000

{
"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:40:10 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": 83
},
"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": 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 <= P2wP1)",
"processed_size": 12,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((F (((1 <= P2wM2) AND X (F ((P2wM2 + 1 <= P2s))))) OR G (F ((P2wM2 <= 1)))))",
"processed_size": 79,
"rewrites": 83
},
"result":
{
"edges": 250007,
"markings": 150007,
"produced_by": "LTL model checker",
"value": false
},
"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": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((3 <= P1wP2) OR (X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1)))) OR (G ((1 <= P3s)) AND F (((3 <= P1wP2) OR X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1))))))))))",
"processed_size": 161,
"rewrites": 83
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((P3M2 <= 2)))",
"processed_size": 19,
"rewrites": 85
},
"result":
{
"edges": 3,
"markings": 4,
"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": 324
},
"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 ((P2wM2 <= P2d)))))",
"processed_size": 30,
"rewrites": 83
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 397
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((P2d <= P2wM2) U (M1 <= P1)))",
"processed_size": 33,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 477
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (F (G ((G ((3 <= P2wM2)) OR ((P12 <= P2s) U ((1 <= P12s) OR X (X (G ((M1 <= P2wM2))))))))))",
"processed_size": 93,
"rewrites": 83
},
"result":
{
"edges": 13,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 27
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 716
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((X (F ((P1wM1 <= M3))) OR G ((P1d + 1 <= P1))) U X (((P1wM1 <= M3) OR (P1 <= P3M2)))))",
"processed_size": 91,
"rewrites": 83
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 954
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (((P1s <= P3M2) OR F (((P1s <= P3M2) OR G ((P1s <= P3M2))))))",
"processed_size": 63,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1432
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((P3M2 + 1 <= P2d) U ((P1wP2 <= 0) OR ((3 <= P2wM2) U (P2d <= P3M2)))))",
"processed_size": 74,
"rewrites": 83
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 2864
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (((P12 + 1 <= P2wP1) AND (F ((P2 + 1 <= P12wM3)) OR G ((P12 + 1 <= P2wP1))))))",
"processed_size": 83,
"rewrites": 83
},
"result":
{
"edges": 200009,
"markings": 200009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((P2d <= P2wM2) U (M1 <= P1)))",
"processed_size": 33,
"rewrites": 87
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /ER",
"value": true
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl",
"visible": 6
},
"threads": 1,
"type": "dfs"
},
"type": "universal_until"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 18,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23180,
"runtime": 1386.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(G(((** U **) OR (X(**) U **))))) : A(X(X((F(**) U G((F(**) AND G(**))))))) : A((F((** AND X(F(**)))) OR G(F(**)))) : A(F((* AND (F(*) OR G(*))))) : A((** OR (X(G(**)) OR (G(**) AND F((** OR X(G(**)))))))) : (A((G(**) OR X(**))) AND A(G(*))) : A(X(X(F(**)))) : A((X(TRUE) U G(*))) : FALSE : A((** OR F((** OR G(**))))) : A((** U (** OR (** U **)))) : (A(F((X(**) AND G(**)))) AND A((** U **))) : ** : A(F(G((G(**) OR (** U (** OR X(X(G(**))))))))) : A(X((** U X(*)))) : A(((X(F(**)) OR G(*)) U X(**)))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "unknown unknown no no no no no unknown no yes yes unknown no no no yes ",
"value": "unknown unknown no no no no no unknown no yes yes unknown no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: A (X (G (((((P12wM3 + 1 <= P3) OR (P1M1 + 1 <= M1)) U (M1 <= P1M1)) OR (X ((P2wM2 <= P2)) U (P12M3 <= P1)))))) : A (X ((F (X (F ((P3s <= P12)))) U G (X ((F ((1 <= M2)) AND G ((P1s <= M3)))))))) : A ((F (((1 <= P2wM2) AND X (F ((P2wM2 + 1 <= P2s))))) OR ((P2s <= P2wM2) U X (G (F ((P2wM2 <= 1))))))) : A (F (NOT((G (((P12wM3 <= P2) AND ((P2wP1 <= P12) U ((0 <= P2wM2) OR X ((P12wM3 <= P2)))))) U (P2wP1 <= P12))))) : A ((G ((1 <= P3s)) U ((3 <= P1wP2) OR X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1))))))) : A (NOT((NOT((G ((3 <= P3M2)) OR X ((P12s <= P1d)))) OR ((P12 <= P1wM1) U ((0 <= P1d) U (3 <= P3M2)))))) : A (X ((X (((3 <= P1M1) AND (P3s <= P1wM1))) U X (F ((P2wM2 <= P2d)))))) : A ((F (G (X ((0 <= P1d)))) U G (NOT(F ((1 <= P1d)))))) : A (NOT(X (X (((0 <= P1d) OR F ((P12M3 <= M3))))))) : A ((((P1s <= P3M2) OR G ((2 <= P2M2))) OR F (((P1s <= P3M2) OR G ((P1s <= P3M2)))))) : A (((P3M2 + 1 <= P2d) U ((P1wP2 <= 0) OR ((3 <= P2wM2) U (P2d <= P3M2))))) : A ((F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1))))) AND ((P2d <= P2wM2) U (M1 <= P1)))) : A ((((3 <= P2wP1) AND G ((0 <= P12s))) AND G ((() OR NOT(X (F (G ((3 <= P2wP1))))))))) : A (X (F (G ((G ((3 <= P2wM2)) OR ((P12 <= P2s) U ((1 <= P12s) OR X (G (X ((M1 <= P2wM2))))))))))) : A (X (((P1M1 + 1 <= P3) U NOT(X ((P12s <= 1)))))) : A ((NOT((G (NOT(X ((P1wM1 <= M3)))) AND F ((P1 <= P1d)))) U X (((P1wM1 <= M3) OR (P1 <= P3M2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
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:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: 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: 83 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: (3 <= P2wP1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= P2wP1)
lola: processed formula length: 12
lola: 83 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: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (((1 <= P2wM2) AND X (F ((P2wM2 + 1 <= P2s))))) OR G (F ((P2wM2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (((1 <= P2wM2) AND X (F ((P2wM2 + 1 <= P2s))))) OR G (F ((P2wM2 <= 1)))))
lola: processed formula length: 79
lola: 83 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: ========================================
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: 150007 markings, 250007 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= P1wP2) OR (X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1)))) OR (G ((1 <= P3s)) AND F (((3 <= P1wP2) OR X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= P1wP2) OR (X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1)))) OR (G ((1 <= P3s)) AND F (((3 <= P1wP2) OR X (G (((3 <= P1wP2) AND (P2d + 1 <= P2wP1))))))))))
lola: processed formula length: 161
lola: 83 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: 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((G ((3 <= P3M2)) OR X ((P12s <= P1d)))) AND A (G ((P3M2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P3M2 <= 2)))
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 ((P3M2 <= 2)))
lola: processed formula length: 19
lola: 85 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= P3M2)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P2wM2 <= P2d)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P2wM2 <= P2d)))))
lola: processed formula length: 30
lola: 83 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) U G ((P1d <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) U G ((P1d <= 0))))
lola: processed formula length: 31
lola: 83 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: 3009462 markings, 5518859 edges, 601892 markings/sec, 0 secs
lola: 5854291 markings, 10785578 edges, 568966 markings/sec, 5 secs
lola: 8734270 markings, 15985453 edges, 575996 markings/sec, 10 secs
lola: 11525663 markings, 21151092 edges, 558279 markings/sec, 15 secs
lola: 14275984 markings, 26239600 edges, 550064 markings/sec, 20 secs
lola: 17108054 markings, 31319703 edges, 566414 markings/sec, 25 secs
lola: 19986157 markings, 36671912 edges, 575621 markings/sec, 30 secs
lola: 22819328 markings, 41838192 edges, 566634 markings/sec, 35 secs
lola: 25670534 markings, 47125693 edges, 570241 markings/sec, 40 secs
lola: 28537486 markings, 52292996 edges, 573390 markings/sec, 45 secs
lola: 31346565 markings, 57492499 edges, 561816 markings/sec, 50 secs
lola: 34093092 markings, 62581876 edges, 549305 markings/sec, 55 secs
lola: 36924224 markings, 67659632 edges, 566226 markings/sec, 60 secs
lola: 39650518 markings, 72700237 edges, 545259 markings/sec, 65 secs
lola: 42374715 markings, 77685724 edges, 544839 markings/sec, 70 secs
lola: 45260595 markings, 82960142 edges, 577176 markings/sec, 75 secs
lola: 48035980 markings, 88070995 edges, 555077 markings/sec, 80 secs
lola: 50811532 markings, 93177557 edges, 555110 markings/sec, 85 secs
lola: 53572402 markings, 98243728 edges, 552174 markings/sec, 90 secs
lola: 56285806 markings, 103263107 edges, 542681 markings/sec, 95 secs
lola: 59126844 markings, 108365627 edges, 568208 markings/sec, 100 secs
lola: 61821708 markings, 113342174 edges, 538973 markings/sec, 105 secs
lola: 64561726 markings, 118352696 edges, 548004 markings/sec, 110 secs
lola: 67230390 markings, 123259429 edges, 533733 markings/sec, 115 secs
lola: 70066358 markings, 128514143 edges, 567194 markings/sec, 120 secs
lola: 72963492 markings, 133756899 edges, 579427 markings/sec, 125 secs
lola: 75788415 markings, 138975312 edges, 564985 markings/sec, 130 secs
lola: 78596924 markings, 144096135 edges, 561702 markings/sec, 135 secs
lola: 81386396 markings, 149213948 edges, 557894 markings/sec, 140 secs
lola: 84170756 markings, 154339826 edges, 556872 markings/sec, 145 secs
lola: 86866665 markings, 159314488 edges, 539182 markings/sec, 150 secs
lola: 89669222 markings, 164368325 edges, 560511 markings/sec, 155 secs
lola: 92105650 markings, 168811817 edges, 487286 markings/sec, 160 secs
lola: 94276457 markings, 172851024 edges, 434161 markings/sec, 165 secs
lola: 96342353 markings, 176603468 edges, 413179 markings/sec, 170 secs
lola: 98521807 markings, 180641640 edges, 435891 markings/sec, 175 secs
lola: 100596696 markings, 184439221 edges, 414978 markings/sec, 180 secs
lola: 102727950 markings, 188353843 edges, 426251 markings/sec, 185 secs
lola: 104760646 markings, 192048993 edges, 406539 markings/sec, 190 secs
lola: 105120564 markings, 192739023 edges, 71984 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 373 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((((P12wM3 + 1 <= P3) OR (P1M1 + 1 <= M1)) U (M1 <= P1M1)) OR (X ((P2wM2 <= P2)) U (P12M3 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((((P12wM3 + 1 <= P3) OR (P1M1 + 1 <= M1)) U (M1 <= P1M1)) OR (X ((P2wM2 <= P2)) U (P12M3 <= P1))))))
lola: processed formula length: 111
lola: 83 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: 2322460 markings, 4281085 edges, 464492 markings/sec, 0 secs
lola: 4985001 markings, 9137370 edges, 532508 markings/sec, 5 secs
lola: 7595986 markings, 13941815 edges, 522197 markings/sec, 10 secs
lola: 10255961 markings, 18811711 edges, 531995 markings/sec, 15 secs
lola: 12882870 markings, 23632741 edges, 525382 markings/sec, 20 secs
lola: 15484382 markings, 28385560 edges, 520302 markings/sec, 25 secs
lola: 18052029 markings, 33103693 edges, 513529 markings/sec, 30 secs
lola: 20599871 markings, 37774155 edges, 509568 markings/sec, 35 secs
lola: 23236432 markings, 42586200 edges, 527312 markings/sec, 40 secs
lola: 25815811 markings, 47331100 edges, 515876 markings/sec, 45 secs
lola: 28394673 markings, 52060966 edges, 515772 markings/sec, 50 secs
lola: 30946364 markings, 56742104 edges, 510338 markings/sec, 55 secs
lola: 33469040 markings, 61346754 edges, 504535 markings/sec, 60 secs
lola: 36108831 markings, 66208471 edges, 527958 markings/sec, 65 secs
lola: 38718009 markings, 70985239 edges, 521836 markings/sec, 70 secs
lola: 41309799 markings, 75748457 edges, 518358 markings/sec, 75 secs
lola: 43848616 markings, 80396351 edges, 507763 markings/sec, 80 secs
lola: 46374948 markings, 85011204 edges, 505266 markings/sec, 85 secs
lola: 48977913 markings, 89804841 edges, 520593 markings/sec, 90 secs
lola: 51534220 markings, 94509256 edges, 511261 markings/sec, 95 secs
lola: 54104698 markings, 99204158 edges, 514096 markings/sec, 100 secs
lola: 56626605 markings, 103840091 edges, 504381 markings/sec, 105 secs
lola: 59144764 markings, 108438340 edges, 503632 markings/sec, 110 secs
lola: 61732191 markings, 113203929 edges, 517485 markings/sec, 115 secs
lola: 64315557 markings, 117914915 edges, 516673 markings/sec, 120 secs
lola: 66839425 markings, 122571885 edges, 504774 markings/sec, 125 secs
lola: 69378489 markings, 127205586 edges, 507813 markings/sec, 130 secs
lola: 71867204 markings, 131741205 edges, 497743 markings/sec, 135 secs
lola: 74385691 markings, 136384946 edges, 503697 markings/sec, 140 secs
lola: 76942884 markings, 141042115 edges, 511439 markings/sec, 145 secs
lola: 79441810 markings, 145677532 edges, 499785 markings/sec, 150 secs
lola: 82030010 markings, 150379190 edges, 517640 markings/sec, 155 secs
lola: 84551929 markings, 155051082 edges, 504384 markings/sec, 160 secs
lola: 87247545 markings, 159991675 edges, 539123 markings/sec, 165 secs
lola: 89792482 markings, 164633165 edges, 508987 markings/sec, 170 secs
lola: 90165758 markings, 165287133 edges, 74655 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1)))))) AND A (((P2d <= P2wM2) U (M1 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P2d <= P2wM2) U (M1 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((P2d <= P2wM2) U (M1 <= P1)))
lola: processed formula length: 33
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 454 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1))))))
lola: processed formula length: 64
lola: 83 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: 3194062 markings, 5860066 edges, 638812 markings/sec, 0 secs
lola: 6297466 markings, 11547403 edges, 620681 markings/sec, 5 secs
lola: 9408814 markings, 17258721 edges, 622270 markings/sec, 10 secs
lola: 12515889 markings, 22964400 edges, 621415 markings/sec, 15 secs
lola: 15582133 markings, 28581977 edges, 613249 markings/sec, 20 secs
lola: 18617732 markings, 34135084 edges, 607120 markings/sec, 25 secs
lola: 21631528 markings, 39662617 edges, 602759 markings/sec, 30 secs
lola: 24725879 markings, 45325632 edges, 618870 markings/sec, 35 secs
lola: 27753641 markings, 50858398 edges, 605552 markings/sec, 40 secs
lola: 30758094 markings, 56369455 edges, 600891 markings/sec, 45 secs
lola: 33684743 markings, 61768808 edges, 585330 markings/sec, 50 secs
lola: 36795556 markings, 67462961 edges, 622163 markings/sec, 55 secs
lola: 39837544 markings, 73067856 edges, 608398 markings/sec, 60 secs
lola: 42859191 markings, 78608762 edges, 604329 markings/sec, 65 secs
lola: 45828464 markings, 84045008 edges, 593855 markings/sec, 70 secs
lola: 48880867 markings, 89630377 edges, 610481 markings/sec, 75 secs
lola: 51906077 markings, 95161109 edges, 605042 markings/sec, 80 secs
lola: 54893957 markings, 100643407 edges, 597576 markings/sec, 85 secs
lola: 57838639 markings, 106070145 edges, 588936 markings/sec, 90 secs
lola: 60820988 markings, 111525942 edges, 596470 markings/sec, 95 secs
lola: 63821192 markings, 117026376 edges, 600041 markings/sec, 100 secs
lola: 66815692 markings, 122512553 edges, 598900 markings/sec, 105 secs
lola: 69781102 markings, 127926003 edges, 593082 markings/sec, 110 secs
lola: 72717415 markings, 133316689 edges, 587263 markings/sec, 115 secs
lola: 75675758 markings, 138749997 edges, 591669 markings/sec, 120 secs
lola: 78576144 markings, 144075358 edges, 580077 markings/sec, 125 secs
lola: 81515978 markings, 149462900 edges, 587967 markings/sec, 130 secs
lola: 84421560 markings, 154770717 edges, 581116 markings/sec, 135 secs
lola: 87470645 markings, 160349418 edges, 609817 markings/sec, 140 secs
lola: 89859821 markings, 164722298 edges, 477835 markings/sec, 145 secs
lola: 90243255 markings, 165480875 edges, 76687 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((P3s <= P12)) U G ((F ((1 <= M2)) AND G ((P1s <= M3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((P3s <= P12)) U G ((F ((1 <= M2)) AND G ((P1s <= M3))))))))
lola: processed formula length: 72
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 2671615 markings, 4921548 edges, 534323 markings/sec, 0 secs
lola: 5712144 markings, 10474041 edges, 608106 markings/sec, 5 secs
lola: 8727449 markings, 16004532 edges, 603061 markings/sec, 10 secs
lola: 11786486 markings, 21622485 edges, 611807 markings/sec, 15 secs
lola: 14702286 markings, 26953967 edges, 583160 markings/sec, 20 secs
lola: 17590754 markings, 32251039 edges, 577694 markings/sec, 25 secs
lola: 20492495 markings, 37584157 edges, 580348 markings/sec, 30 secs
lola: 23372203 markings, 42871585 edges, 575942 markings/sec, 35 secs
lola: 26273061 markings, 48156401 edges, 580172 markings/sec, 40 secs
lola: 29105981 markings, 53360781 edges, 566584 markings/sec, 45 secs
lola: 31916572 markings, 58515727 edges, 562118 markings/sec, 50 secs
lola: 34740932 markings, 63725685 edges, 564872 markings/sec, 55 secs
lola: 37685161 markings, 69086119 edges, 588846 markings/sec, 60 secs
lola: 40550476 markings, 74349315 edges, 573063 markings/sec, 65 secs
lola: 43384493 markings, 79534182 edges, 566803 markings/sec, 70 secs
lola: 46149455 markings, 84646460 edges, 552992 markings/sec, 75 secs
lola: 49063407 markings, 89931202 edges, 582790 markings/sec, 80 secs
lola: 51893707 markings, 95142328 edges, 566060 markings/sec, 85 secs
lola: 54748511 markings, 100347058 edges, 570961 markings/sec, 90 secs
lola: 57513792 markings, 105456771 edges, 553056 markings/sec, 95 secs
lola: 60307962 markings, 110563495 edges, 558834 markings/sec, 100 secs
lola: 63178955 markings, 115819411 edges, 574199 markings/sec, 105 secs
lola: 65979618 markings, 120977863 edges, 560133 markings/sec, 110 secs
lola: 68792327 markings, 126131888 edges, 562542 markings/sec, 115 secs
lola: 71557708 markings, 131165903 edges, 553076 markings/sec, 120 secs
lola: 74336876 markings, 136313698 edges, 555834 markings/sec, 125 secs
lola: 77133070 markings, 141413039 edges, 559239 markings/sec, 130 secs
lola: 79893431 markings, 146483653 edges, 552072 markings/sec, 135 secs
lola: 82644663 markings, 151492467 edges, 550246 markings/sec, 140 secs
lola: 85370621 markings, 156497542 edges, 545192 markings/sec, 145 secs
lola: 88279618 markings, 161855689 edges, 581799 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((G ((3 <= P2wM2)) OR ((P12 <= P2s) U ((1 <= P12s) OR X (X (G ((M1 <= P2wM2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((G ((3 <= P2wM2)) OR ((P12 <= P2s) U ((1 <= P12s) OR X (X (G ((M1 <= P2wM2))))))))))
lola: processed formula length: 93
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 27 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: add low 19
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: 11 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((P1M1 + 1 <= P3) U X ((2 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((P1M1 + 1 <= P3) U X ((2 <= P12s)))))
lola: processed formula length: 44
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X (F ((P1wM1 <= M3))) OR G ((P1d + 1 <= P1))) U X (((P1wM1 <= M3) OR (P1 <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (F ((P1wM1 <= M3))) OR G ((P1d + 1 <= P1))) U X (((P1wM1 <= M3) OR (P1 <= P3M2)))))
lola: processed formula length: 91
lola: 83 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 954 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P1s <= P3M2) OR F (((P1s <= P3M2) OR G ((P1s <= P3M2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P1s <= P3M2) OR F (((P1s <= P3M2) OR G ((P1s <= P3M2))))))
lola: processed formula length: 63
lola: 83 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: 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 14 will run for 1432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P3M2 + 1 <= P2d) U ((P1wP2 <= 0) OR ((3 <= P2wM2) U (P2d <= P3M2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P3M2 + 1 <= P2d) U ((P1wP2 <= 0) OR ((3 <= P2wM2) U (P2d <= P3M2)))))
lola: processed formula length: 74
lola: 83 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: 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 2864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((P12 + 1 <= P2wP1) AND (F ((P2 + 1 <= P12wM3)) OR G ((P12 + 1 <= P2wP1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((P12 + 1 <= P2wP1) AND (F ((P2 + 1 <= P12wM3)) OR G ((P12 + 1 <= P2wP1))))))
lola: processed formula length: 83
lola: 83 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: 200009 markings, 200009 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) U G ((P1d <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) U G ((P1d <= 0))))
lola: processed formula length: 31
lola: 83 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: 2743712 markings, 5009207 edges, 548742 markings/sec, 0 secs
lola: 5638485 markings, 10338428 edges, 578955 markings/sec, 5 secs
lola: 8466572 markings, 15532971 edges, 565617 markings/sec, 10 secs
lola: 11267482 markings, 20718420 edges, 560182 markings/sec, 15 secs
lola: 14135170 markings, 25887564 edges, 573538 markings/sec, 20 secs
lola: 16882922 markings, 30965501 edges, 549550 markings/sec, 25 secs
lola: 19816922 markings, 36333440 edges, 586800 markings/sec, 30 secs
lola: 22675248 markings, 41637549 edges, 571665 markings/sec, 35 secs
lola: 25588416 markings, 46920397 edges, 582634 markings/sec, 40 secs
lola: 28415932 markings, 52115646 edges, 565503 markings/sec, 45 secs
lola: 31267610 markings, 57334589 edges, 570336 markings/sec, 50 secs
lola: 34073850 markings, 62533772 edges, 561248 markings/sec, 55 secs
lola: 36944553 markings, 67710454 edges, 574141 markings/sec, 60 secs
lola: 39720748 markings, 72840698 edges, 555239 markings/sec, 65 secs
lola: 42466788 markings, 77915907 edges, 549208 markings/sec, 70 secs
lola: 45401552 markings, 83252741 edges, 586953 markings/sec, 75 secs
lola: 48295417 markings, 88494934 edges, 578773 markings/sec, 80 secs
lola: 51086660 markings, 93672293 edges, 558249 markings/sec, 85 secs
lola: 53848853 markings, 98770783 edges, 552439 markings/sec, 90 secs
lola: 56706434 markings, 103914662 edges, 571516 markings/sec, 95 secs
lola: 59482559 markings, 109063923 edges, 555225 markings/sec, 100 secs
lola: 62232333 markings, 114129274 edges, 549955 markings/sec, 105 secs
lola: 65027820 markings, 119227169 edges, 559097 markings/sec, 110 secs
lola: 67683346 markings, 124156668 edges, 531105 markings/sec, 115 secs
lola: 70644323 markings, 129559038 edges, 592195 markings/sec, 120 secs
lola: 73564786 markings, 134860119 edges, 584093 markings/sec, 125 secs
lola: 76466958 markings, 140166192 edges, 580434 markings/sec, 130 secs
lola: 79268781 markings, 145335972 edges, 560365 markings/sec, 135 secs
lola: 82075834 markings, 150537528 edges, 561411 markings/sec, 140 secs
lola: 84947216 markings, 155715913 edges, 574276 markings/sec, 145 secs
lola: 87701772 markings, 160801787 edges, 550911 markings/sec, 150 secs
lola: 90435924 markings, 165837546 edges, 546830 markings/sec, 155 secs
lola: 93173213 markings, 170844560 edges, 547458 markings/sec, 160 secs
lola: 96044014 markings, 176086101 edges, 574160 markings/sec, 165 secs
lola: 98865506 markings, 181311293 edges, 564298 markings/sec, 170 secs
lola: 101816228 markings, 186688020 edges, 590144 markings/sec, 175 secs
lola: 104727377 markings, 191965818 edges, 582230 markings/sec, 180 secs
lola: 105089515 markings, 192676924 edges, 72428 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (G (((((P12wM3 + 1 <= P3) OR (P1M1 + 1 <= M1)) U (M1 <= P1M1)) OR (X ((P2wM2 <= P2)) U (P12M3 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((((P12wM3 + 1 <= P3) OR (P1M1 + 1 <= M1)) U (M1 <= P1M1)) OR (X ((P2wM2 <= P2)) U (P12M3 <= P1))))))
lola: processed formula length: 111
lola: 83 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: 2889603 markings, 5298928 edges, 577921 markings/sec, 0 secs
lola: 5648702 markings, 10396607 edges, 551820 markings/sec, 5 secs
lola: 8405196 markings, 15410219 edges, 551299 markings/sec, 10 secs
lola: 11227943 markings, 20577831 edges, 564549 markings/sec, 15 secs
lola: 13978023 markings, 25619700 edges, 550016 markings/sec, 20 secs
lola: 16708396 markings, 30645566 edges, 546075 markings/sec, 25 secs
lola: 19410666 markings, 35601172 edges, 540454 markings/sec, 30 secs
lola: 22122836 markings, 40581531 edges, 542434 markings/sec, 35 secs
lola: 24864631 markings, 45614382 edges, 548359 markings/sec, 40 secs
lola: 27569049 markings, 50568772 edges, 540884 markings/sec, 45 secs
lola: 30278077 markings, 55527774 edges, 541806 markings/sec, 50 secs
lola: 32931019 markings, 60401718 edges, 530588 markings/sec, 55 secs
lola: 35700625 markings, 65450529 edges, 553921 markings/sec, 60 secs
lola: 38481690 markings, 70562605 edges, 556213 markings/sec, 65 secs
lola: 41217124 markings, 75566712 edges, 547087 markings/sec, 70 secs
lola: 43877303 markings, 80453724 edges, 532036 markings/sec, 75 secs
lola: 46525448 markings, 85299961 edges, 529629 markings/sec, 80 secs
lola: 49282896 markings, 90364803 edges, 551490 markings/sec, 85 secs
lola: 51983140 markings, 95315237 edges, 540049 markings/sec, 90 secs
lola: 54664110 markings, 100227122 edges, 536194 markings/sec, 95 secs
lola: 57336013 markings, 105120874 edges, 534381 markings/sec, 100 secs
lola: 59999766 markings, 109999165 edges, 532751 markings/sec, 105 secs
lola: 62720581 markings, 114989903 edges, 544163 markings/sec, 110 secs
lola: 65415863 markings, 119930411 edges, 539056 markings/sec, 115 secs
lola: 68104359 markings, 124857351 edges, 537699 markings/sec, 120 secs
lola: 70736231 markings, 129713803 edges, 526374 markings/sec, 125 secs
lola: 73400708 markings, 134574929 edges, 532895 markings/sec, 130 secs
lola: 76071589 markings, 139452063 edges, 534176 markings/sec, 135 secs
lola: 78682595 markings, 144263613 edges, 522201 markings/sec, 140 secs
lola: 81315605 markings, 149079578 edges, 526602 markings/sec, 145 secs
lola: 83911639 markings, 153851993 edges, 519207 markings/sec, 150 secs
lola: 86604977 markings, 158785269 edges, 538668 markings/sec, 155 secs
lola: 89339983 markings, 163822719 edges, 547001 markings/sec, 160 secs
lola: 90071621 markings, 165141437 edges, 146328 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (A (F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1)))))) AND A (((P2d <= P2wM2) U (M1 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((P2d <= P2wM2) U (M1 <= P1)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:735
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (((P2d <= P2wM2) U (M1 <= P1)))
lola: processed formula length: 33
lola: 87 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 0
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((M1 <= P1)) AND G (((P2d <= P2wM2) OR (M1 <= P1))))))
lola: processed formula length: 64
lola: 83 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: 2774820 markings, 5099579 edges, 554964 markings/sec, 0 secs
lola: 5888541 markings, 10796196 edges, 622744 markings/sec, 5 secs
lola: 8938160 markings, 16420170 edges, 609924 markings/sec, 10 secs
lola: 12085541 markings, 22170835 edges, 629476 markings/sec, 15 secs
lola: 15150924 markings, 27751923 edges, 613077 markings/sec, 20 secs
lola: 18178046 markings, 33319653 edges, 605424 markings/sec, 25 secs
lola: 21164032 markings, 38784543 edges, 597197 markings/sec, 30 secs
lola: 24213641 markings, 44408490 edges, 609922 markings/sec, 35 secs
lola: 27226106 markings, 49939577 edges, 602493 markings/sec, 40 secs
lola: 30241937 markings, 55479080 edges, 603166 markings/sec, 45 secs
lola: 33212036 markings, 60904253 edges, 594020 markings/sec, 50 secs
lola: 36314037 markings, 66577342 edges, 620400 markings/sec, 55 secs
lola: 39398973 markings, 72247152 edges, 616987 markings/sec, 60 secs
lola: 42442697 markings, 77792274 edges, 608745 markings/sec, 65 secs
lola: 45399067 markings, 83247221 edges, 591274 markings/sec, 70 secs
lola: 48432158 markings, 88781675 edges, 606618 markings/sec, 75 secs
lola: 51459426 markings, 94322270 edges, 605454 markings/sec, 80 secs
lola: 54447217 markings, 99796674 edges, 597558 markings/sec, 85 secs
lola: 57397683 markings, 105244214 edges, 590093 markings/sec, 90 secs
lola: 60378366 markings, 110705520 edges, 596137 markings/sec, 95 secs
lola: 63372432 markings, 116193590 edges, 598813 markings/sec, 100 secs
lola: 66358542 markings, 121665751 edges, 597222 markings/sec, 105 secs
lola: 69309782 markings, 127068171 edges, 590248 markings/sec, 110 secs
lola: 72210508 markings, 132399456 edges, 580145 markings/sec, 115 secs
lola: 75199316 markings, 137871402 edges, 597762 markings/sec, 120 secs
lola: 78150525 markings, 143249745 edges, 590242 markings/sec, 125 secs
lola: 81045977 markings, 148590327 edges, 579090 markings/sec, 130 secs
lola: 83911247 markings, 153851011 edges, 573054 markings/sec, 135 secs
lola: 86915456 markings, 159361458 edges, 600842 markings/sec, 140 secs
lola: 89788338 markings, 164624876 edges, 574576 markings/sec, 145 secs
lola: 90176768 markings, 165314658 edges, 77686 markings/sec, 150 secs
lola: 90335897 markings, 165619982 edges, 31826 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((P3s <= P12)) U G ((F ((1 <= M2)) AND G ((P1s <= M3))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((P3s <= P12)) U G ((F ((1 <= M2)) AND G ((P1s <= M3))))))))
lola: processed formula length: 72
lola: 83 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 13 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: 2701980 markings, 4953834 edges, 540396 markings/sec, 0 secs
lola: 5759890 markings, 10569535 edges, 611582 markings/sec, 5 secs
lola: 8809982 markings, 16159753 edges, 610018 markings/sec, 10 secs
lola: 11876421 markings, 21765471 edges, 613288 markings/sec, 15 secs
lola: 14893866 markings, 27308945 edges, 603489 markings/sec, 20 secs
lola: 17895352 markings, 32812520 edges, 600297 markings/sec, 25 secs
lola: 20859260 markings, 38222149 edges, 592782 markings/sec, 30 secs
lola: 23907581 markings, 43842812 edges, 609664 markings/sec, 35 secs
lola: 26915781 markings, 49363173 edges, 601640 markings/sec, 40 secs
lola: 29911594 markings, 54852565 edges, 599163 markings/sec, 45 secs
lola: 32883186 markings, 60281405 edges, 594318 markings/sec, 50 secs
lola: 35940915 markings, 65925588 edges, 611546 markings/sec, 55 secs
lola: 39033702 markings, 71565826 edges, 618557 markings/sec, 60 secs
lola: 42071030 markings, 77140361 edges, 607466 markings/sec, 65 secs
lola: 45045900 markings, 82589982 edges, 594974 markings/sec, 70 secs
lola: 48049177 markings, 88096415 edges, 600655 markings/sec, 75 secs
lola: 51077391 markings, 93652723 edges, 605643 markings/sec, 80 secs
lola: 54051766 markings, 99101355 edges, 594875 markings/sec, 85 secs
lola: 57005662 markings, 104509027 edges, 590779 markings/sec, 90 secs
lola: 59925296 markings, 109885420 edges, 583927 markings/sec, 95 secs
lola: 62966981 markings, 115465306 edges, 608337 markings/sec, 100 secs
lola: 65958337 markings, 120956583 edges, 598271 markings/sec, 105 secs
lola: 68918189 markings, 126367232 edges, 591970 markings/sec, 110 secs
lola: 71854975 markings, 131709057 edges, 587357 markings/sec, 115 secs
lola: 74835112 markings, 137183123 edges, 596027 markings/sec, 120 secs
lola: 77746548 markings, 142539971 edges, 582287 markings/sec, 125 secs
lola: 80669452 markings, 147917306 edges, 584581 markings/sec, 130 secs
lola: 83579817 markings, 153220616 edges, 582073 markings/sec, 135 secs
lola: 86576573 markings, 158712366 edges, 599351 markings/sec, 140 secs
lola: 89623574 markings, 164329728 edges, 609400 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown no no no no no unknown no yes yes unknown no no no yes
lola:
preliminary result: unknown unknown no no no no no unknown no yes yes unknown no no no yes
lola: memory consumption: 23180 KB
lola: time consumption: 1386 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589544196252

--------------------
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-50000"
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-50000, 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-158922999300027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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