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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 188K
-rw-r--r-- 1 mcc users 3.3K Apr 1 20:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 1 20:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 1 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 1 13:47 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 24K 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 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 1 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 1 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 1 06:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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-05000-00
FORMULA_NAME FMS-PT-05000-01
FORMULA_NAME FMS-PT-05000-02
FORMULA_NAME FMS-PT-05000-03
FORMULA_NAME FMS-PT-05000-04
FORMULA_NAME FMS-PT-05000-05
FORMULA_NAME FMS-PT-05000-06
FORMULA_NAME FMS-PT-05000-07
FORMULA_NAME FMS-PT-05000-08
FORMULA_NAME FMS-PT-05000-09
FORMULA_NAME FMS-PT-05000-10
FORMULA_NAME FMS-PT-05000-11
FORMULA_NAME FMS-PT-05000-12
FORMULA_NAME FMS-PT-05000-13
FORMULA_NAME FMS-PT-05000-14
FORMULA_NAME FMS-PT-05000-15

=== Now, execution of the tool begins

BK_START 1589541167820

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

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

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

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

FORMULA FMS-PT-05000-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA FMS-PT-05000-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

FORMULA FMS-PT-05000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 263
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 (((P2d <= P12wM3))))",
"processed_size": 25,
"rewrites": 123
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 3,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 311
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((P3M2 <= 2)))",
"processed_size": 19,
"rewrites": 123
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"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": 5,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 409
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((X (((P2M2 + 1 <= P2s) AND ((3 <= P3s) U (P2s <= P2M2)))) OR ((2 <= P12s) U X ((P1M1 <= P2M2)))))",
"processed_size": 100,
"rewrites": 121
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 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": 123
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 9,
"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": 545
},
"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": "(1 <= P2d)",
"processed_size": 10,
"rewrites": 123
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1025
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (((P3s <= 1) OR G (((P2wP1 <= P12) AND (3 <= P3M2))))))",
"processed_size": 60,
"rewrites": 121
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 1537
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((G (F ((3 <= P3s))) OR ((P12M3 <= P1) U (P12wM3 + 1 <= P3)))))",
"processed_size": 68,
"rewrites": 121
},
"result":
{
"edges": 85011,
"markings": 65013,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3075
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3075
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((P3M2 + 1 <= P1)))",
"processed_size": 24,
"rewrites": 123
},
"result":
{
"edges": 5000,
"markings": 5001,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 22004,
"runtime": 1110.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G((G(F(**)) OR (** U **)))) : A((G(*) OR F(G((F(**) AND (F(**) OR **)))))) : A(G(F(((** OR (G(**) AND F(**))) AND F(**))))) : A(F((* OR G(*)))) : A((F(*) OR (F(*) OR X(X(G(**)))))) : (A(G(**)) AND A(X(*))) : A(F(*)) : A(X(X((** OR F((G(*) AND F(*))))))) : (A((** U (F(**) OR X(TRUE)))) AND A(G(**))) : TRUE : A(F(**)) : FALSE : A(X(G((X(**) OR (G(**) AND X(F(**))))))) : A(F(G((* OR X((* R F(**))))))) : A((X((** AND (** U **))) OR (** U X(**)))) : (A(F(*)) AND A(G(*)))"
},
"net":
{
"arcs": 50,
"conflict_clusters": 17,
"places": 22,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 20
},
"result":
{
"preliminary_value": "no unknown no yes yes no yes unknown no yes yes no no unknown yes no ",
"value": "no unknown no yes yes no yes unknown no yes yes no no unknown yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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 (G ((F (G ((F ((P3s <= 2)) U F ((3 <= P3s))))) OR ((P12M3 <= P1) U (P12wM3 + 1 <= P3))))) : A ((NOT(F ((2 <= P1s))) OR F (X (X (G ((F ((2 <= P1s)) U (P3s <= P12)))))))) : A (X (F (G (X (NOT(F (G (NOT(((G ((P2s <= P2wM2)) U (2 <= P2wM2)) AND F ((1 <= P2wM2)))))))))))) : A ((NOT(G ((2 <= P3s))) OR F (NOT(F (((P12 + 1 <= P2wP1) OR (P3M2 <= 2))))))) : A (NOT((G ((3 <= P1wP2)) AND NOT((NOT(G ((3 <= P1wP2))) OR G (X (X ((1 <= P3s))))))))) : A ((G ((P3M2 <= 2)) AND NOT(X ((3 <= P3M2))))) : A ((X (X (X (X (X ((P3s <= P1wM1)))))) U NOT(G ((3 <= P1M1))))) : A (X (X (((P1 + 1 <= P12s) OR NOT(G ((F (((3 <= P2s) AND (P12s <= P1))) OR G ((P1 + 1 <= P12s))))))))) : A (((((1 <= P2wP1) AND (2 <= P1)) U (F ((P12M3 <= M3)) OR X ((0 <= P1d)))) AND G (((P2d <= P12wM3))))) : A ((G (((0 <= P12M3) OR G ((P2s <= P12M3)))) OR NOT(G (X ((2 <= P2M2)))))) : A (F ((P2d <= 0))) : A ((((0 <= P1s) U F (NOT(F (G (F ((0 <= P1))))))) AND NOT(((M1 <= P1) OR X (F ((1 <= P2M2))))))) : A (X (G ((G ((3 <= P2wP1)) U X ((3 <= P2wP1)))))) : A (F (NOT(F (((1 <= P12s) AND X (((3 <= P2wM2) U NOT(F ((P12 <= P2s)))))))))) : A ((X (((P2M2 + 1 <= P2s) AND ((3 <= P3s) U (P2s <= P2M2)))) OR ((2 <= P12s) U X ((P1M1 <= P2M2))))) : A (NOT((G ((P1wM1 <= M3)) OR F (((P1wM1 <= M3) U (P1 <= P3M2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 121 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: A (X (X (((P1 + 1 <= P12s) OR F ((G (((P2s <= 2) OR (P1 + 1 <= P12s))) AND F ((P12s <= P1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((P1 + 1 <= P12s) OR F ((G (((P2s <= 2) OR (P1 + 1 <= P12s))) AND F ((P12s <= P1))))))))
lola: processed formula length: 98
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3249064 markings, 5957474 edges, 649813 markings/sec, 0 secs
lola: 6386988 markings, 11711348 edges, 627585 markings/sec, 5 secs
lola: 9552731 markings, 17511775 edges, 633149 markings/sec, 10 secs
lola: 12815147 markings, 23492727 edges, 652483 markings/sec, 15 secs
lola: 16068668 markings, 29455146 edges, 650704 markings/sec, 20 secs
lola: 19226427 markings, 35248756 edges, 631552 markings/sec, 25 secs
lola: 22501914 markings, 41249663 edges, 655097 markings/sec, 30 secs
lola: 25691779 markings, 47098415 edges, 637973 markings/sec, 35 secs
lola: 28836147 markings, 52861521 edges, 628874 markings/sec, 40 secs
lola: 32090838 markings, 58826567 edges, 650938 markings/sec, 45 secs
lola: 35329695 markings, 64762898 edges, 647771 markings/sec, 50 secs
lola: 38516986 markings, 70610332 edges, 637458 markings/sec, 55 secs
lola: 41783203 markings, 76595056 edges, 653243 markings/sec, 60 secs
lola: 45025311 markings, 82539517 edges, 648422 markings/sec, 65 secs
lola: 48443083 markings, 88803092 edges, 683554 markings/sec, 70 secs
lola: 51885676 markings, 95115488 edges, 688519 markings/sec, 75 secs
lola: 55184345 markings, 101162650 edges, 659734 markings/sec, 80 secs
lola: 58423181 markings, 107099674 edges, 647767 markings/sec, 85 secs
lola: 61681094 markings, 113074810 edges, 651583 markings/sec, 90 secs
lola: 64890464 markings, 118957435 edges, 641874 markings/sec, 95 secs
lola: 68037376 markings, 124723926 edges, 629382 markings/sec, 100 secs
lola: 71211135 markings, 130539015 edges, 634752 markings/sec, 105 secs
lola: 74312355 markings, 136229806 edges, 620244 markings/sec, 110 secs
lola: 77420880 markings, 141923138 edges, 621705 markings/sec, 115 secs
lola: 80458183 markings, 147492838 edges, 607461 markings/sec, 120 secs
lola: 83491791 markings, 153056101 edges, 606722 markings/sec, 125 secs
lola: 86507814 markings, 158583325 edges, 603205 markings/sec, 130 secs
lola: 89319129 markings, 163735389 edges, 562263 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((1 <= P2wP1) AND (2 <= P1)) U (F ((P12M3 <= M3)) OR X (TRUE)))) AND A (G (((P2d <= P12wM3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P2d <= P12wM3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((P2d <= P12wM3))))
lola: processed formula length: 25
lola: 123 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: 4 markings, 3 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((P1wP2 <= 2)) OR (F ((P1wP2 <= 2)) OR X (X (G ((1 <= P3s)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((P1wP2 <= 2)) OR (F ((P1wP2 <= 2)) OR X (X (G ((1 <= P3s)))))))
lola: processed formula length: 70
lola: 121 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((P3M2 <= 2))) AND A (X ((P3M2 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 311 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:787
lola: processed formula: A (G ((P3M2 <= 2)))
lola: processed formula length: 19
lola: 123 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:787
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: 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 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((X ((3 <= P2wP1)) OR (G ((3 <= P2wP1)) AND X (F ((3 <= P2wP1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((X ((3 <= P2wP1)) OR (G ((3 <= P2wP1)) AND X (F ((3 <= P2wP1))))))))
lola: processed formula length: 77
lola: 121 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((P12s <= 0) OR X (((P2wM2 <= 2) R F ((P12 <= P2s))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((P12s <= 0) OR X (((P2wM2 <= 2) R F ((P12 <= P2s))))))))
lola: processed formula length: 66
lola: 121 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: 2718577 markings, 4983260 edges, 543715 markings/sec, 0 secs
lola: 5883080 markings, 10784982 edges, 632901 markings/sec, 5 secs
lola: 8943805 markings, 16395819 edges, 612145 markings/sec, 10 secs
lola: 12107760 markings, 22193870 edges, 632791 markings/sec, 15 secs
lola: 15251514 markings, 27959978 edges, 628751 markings/sec, 20 secs
lola: 18343956 markings, 33627121 edges, 618488 markings/sec, 25 secs
lola: 21469469 markings, 39355803 edges, 625103 markings/sec, 30 secs
lola: 24550387 markings, 45005863 edges, 616184 markings/sec, 35 secs
lola: 27621781 markings, 50635047 edges, 614279 markings/sec, 40 secs
lola: 30737962 markings, 56344889 edges, 623236 markings/sec, 45 secs
lola: 33916429 markings, 62173038 edges, 635693 markings/sec, 50 secs
lola: 37068924 markings, 67950540 edges, 630499 markings/sec, 55 secs
lola: 40195128 markings, 73685272 edges, 625241 markings/sec, 60 secs
lola: 43430545 markings, 79613003 edges, 647083 markings/sec, 65 secs
lola: 46682624 markings, 85577954 edges, 650416 markings/sec, 70 secs
lola: 50090264 markings, 91820635 edges, 681528 markings/sec, 75 secs
lola: 53364015 markings, 97824197 edges, 654750 markings/sec, 80 secs
lola: 56557575 markings, 103678837 edges, 638712 markings/sec, 85 secs
lola: 59744267 markings, 109521586 edges, 637338 markings/sec, 90 secs
lola: 62900437 markings, 115304148 edges, 631234 markings/sec, 95 secs
lola: 66025943 markings, 121035850 edges, 625101 markings/sec, 100 secs
lola: 69099598 markings, 126670375 edges, 614731 markings/sec, 105 secs
lola: 72226545 markings, 132403645 edges, 625389 markings/sec, 110 secs
lola: 75294229 markings, 138024248 edges, 613537 markings/sec, 115 secs
lola: 78328276 markings, 143588609 edges, 606809 markings/sec, 120 secs
lola: 81429013 markings, 149271740 edges, 620147 markings/sec, 125 secs
lola: 84483346 markings, 154874745 edges, 610867 markings/sec, 130 secs
lola: 87557342 markings, 160507174 edges, 614799 markings/sec, 135 secs
lola: 89189512 markings, 163498984 edges, 326434 markings/sec, 140 secs
lola: 89488456 markings, 164046269 edges, 59789 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (((P2M2 + 1 <= P2s) AND ((3 <= P3s) U (P2s <= P2M2)))) OR ((2 <= P12s) U X ((P1M1 <= P2M2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((P2M2 + 1 <= P2s) AND ((3 <= P3s) U (P2s <= P2M2)))) OR ((2 <= P12s) U X ((P1M1 <= P2M2)))))
lola: processed formula length: 100
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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, 12 edges
lola: ========================================
lola: subprocess 9 will run for 467 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:788
lola: processed formula: (3 <= P1M1)
lola: processed formula length: 11
lola: 123 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 10 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P2d <= 0)))
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: (1 <= P2d)
lola: processed formula length: 10
lola: 123 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 11 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((((2 <= P2wM2) OR (G ((P2s <= P2wM2)) AND F ((2 <= P2wM2)))) AND F ((1 <= P2wM2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((((2 <= P2wM2) OR (G ((P2s <= P2wM2)) AND F ((2 <= P2wM2)))) AND F ((1 <= P2wM2))))))
lola: processed formula length: 94
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 90021 markings, 150028 edges
lola: ========================================
lola: subprocess 12 will run for 818 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((P1s <= 1)) OR F (G ((F ((P3s <= P12)) AND (F ((2 <= P1s)) OR (P3s <= P12)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((P1s <= 1)) OR F (G ((F ((P3s <= P12)) AND (F ((2 <= P1s)) OR (P3s <= P12)))))))
lola: processed formula length: 87
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3388737 markings, 4228740 edges, 677747 markings/sec, 0 secs
lola: 7022614 markings, 8772617 edges, 726775 markings/sec, 5 secs
lola: 10566195 markings, 13201198 edges, 708716 markings/sec, 10 secs
lola: 14086265 markings, 17601268 edges, 704014 markings/sec, 15 secs
lola: 17573692 markings, 21958782 edges, 697485 markings/sec, 20 secs
lola: 21052974 markings, 26307976 edges, 695856 markings/sec, 25 secs
lola: 24562308 markings, 30696008 edges, 701867 markings/sec, 30 secs
lola: 28020600 markings, 35018100 edges, 691658 markings/sec, 35 secs
lola: 31455445 markings, 39310448 edges, 686969 markings/sec, 40 secs
lola: 34879791 markings, 43591200 edges, 684869 markings/sec, 45 secs
lola: 38261632 markings, 47818624 edges, 676368 markings/sec, 50 secs
lola: 41635383 markings, 52035386 edges, 674750 markings/sec, 55 secs
lola: 45063990 markings, 56321481 edges, 685721 markings/sec, 60 secs
lola: 48439886 markings, 60539988 edges, 675179 markings/sec, 65 secs
lola: 51396193 markings, 64554752 edges, 591261 markings/sec, 70 secs
lola: 53747166 markings, 68039137 edges, 470195 markings/sec, 75 secs
lola: 56003164 markings, 71388901 edges, 451200 markings/sec, 80 secs
lola: 58195534 markings, 74640932 edges, 438474 markings/sec, 85 secs
lola: 60342441 markings, 77826000 edges, 429381 markings/sec, 90 secs
lola: 62479343 markings, 80993546 edges, 427380 markings/sec, 95 secs
lola: 64558187 markings, 84082463 edges, 415769 markings/sec, 100 secs
lola: 66648198 markings, 87177247 edges, 418002 markings/sec, 105 secs
lola: 68684642 markings, 90201331 edges, 407289 markings/sec, 110 secs
lola: 70747115 markings, 93264052 edges, 412495 markings/sec, 115 secs
lola: 72794609 markings, 96305816 edges, 409499 markings/sec, 120 secs
lola: 74792618 markings, 99268402 edges, 399602 markings/sec, 125 secs
lola: 76807086 markings, 102257327 edges, 402894 markings/sec, 130 secs
lola: 78776448 markings, 105175891 edges, 393872 markings/sec, 135 secs
lola: 80761876 markings, 108119547 edges, 397086 markings/sec, 140 secs
lola: 82729283 markings, 111042008 edges, 393481 markings/sec, 145 secs
lola: 84629595 markings, 113857460 edges, 380062 markings/sec, 150 secs
lola: 86579970 markings, 116758844 edges, 390075 markings/sec, 155 secs
lola: 88490308 markings, 119590490 edges, 382068 markings/sec, 160 secs
lola: 90446610 markings, 122495033 edges, 391260 markings/sec, 165 secs
lola: 92429238 markings, 125432419 edges, 396526 markings/sec, 170 secs
lola: 94333023 markings, 128262857 edges, 380757 markings/sec, 175 secs
lola: 96242810 markings, 131093493 edges, 381957 markings/sec, 180 secs
lola: 97782791 markings, 133378315 edges, 307996 markings/sec, 185 secs
lola: 98106776 markings, 133858345 edges, 64797 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1025 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((P3s <= 1) OR G (((P2wP1 <= P12) AND (3 <= P3M2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((P3s <= 1) OR G (((P2wP1 <= P12) AND (3 <= P3M2))))))
lola: processed formula length: 60
lola: 121 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: 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 1537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((G (F ((3 <= P3s))) OR ((P12M3 <= P1) U (P12wM3 + 1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G (F ((3 <= P3s))) OR ((P12M3 <= P1) U (P12wM3 + 1 <= P3)))))
lola: processed formula length: 68
lola: 121 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: 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: 65013 markings, 85011 edges
lola: ========================================
lola: subprocess 15 will run for 3075 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((M3 + 1 <= P1wM1))) AND A (G ((P3M2 + 1 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3075 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P3M2 + 1 <= P1)))
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 + 1 <= P1)))
lola: processed formula length: 24
lola: 123 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: (P1 <= 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-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (X (((P1 + 1 <= P12s) OR F ((G (((P2s <= 2) OR (P1 + 1 <= P12s))) AND F ((P12s <= P1))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((P1 + 1 <= P12s) OR F ((G (((P2s <= 2) OR (P1 + 1 <= P12s))) AND F ((P12s <= P1))))))))
lola: processed formula length: 98
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3272899 markings, 6000137 edges, 654580 markings/sec, 0 secs
lola: 6451077 markings, 11825859 edges, 635636 markings/sec, 5 secs
lola: 9571866 markings, 17546813 edges, 624158 markings/sec, 10 secs
lola: 12710409 markings, 23300338 edges, 627709 markings/sec, 15 secs
lola: 15831452 markings, 29022165 edges, 624209 markings/sec, 20 secs
lola: 18875060 markings, 34601341 edges, 608722 markings/sec, 25 secs
lola: 21975844 markings, 40283647 edges, 620157 markings/sec, 30 secs
lola: 25042711 markings, 45908011 edges, 613373 markings/sec, 35 secs
lola: 28077953 markings, 51475143 edges, 607048 markings/sec, 40 secs
lola: 31170238 markings, 57142120 edges, 618457 markings/sec, 45 secs
lola: 34282410 markings, 62844950 edges, 622434 markings/sec, 50 secs
lola: 37400577 markings, 68559585 edges, 623633 markings/sec, 55 secs
lola: 40491981 markings, 74227324 edges, 618281 markings/sec, 60 secs
lola: 43619358 markings, 79964986 edges, 625475 markings/sec, 65 secs
lola: 46778311 markings, 85752262 edges, 631791 markings/sec, 70 secs
lola: 50082807 markings, 91810594 edges, 660899 markings/sec, 75 secs
lola: 53286713 markings, 97682765 edges, 640781 markings/sec, 80 secs
lola: 56424128 markings, 103433708 edges, 627483 markings/sec, 85 secs
lola: 59543475 markings, 109151296 edges, 623869 markings/sec, 90 secs
lola: 62659683 markings, 114863417 edges, 623242 markings/sec, 95 secs
lola: 65726429 markings, 120487136 edges, 613349 markings/sec, 100 secs
lola: 68729468 markings, 125993983 edges, 600608 markings/sec, 105 secs
lola: 71771221 markings, 131568084 edges, 608351 markings/sec, 110 secs
lola: 74773845 markings, 137072732 edges, 600525 markings/sec, 115 secs
lola: 77757682 markings, 142542262 edges, 596767 markings/sec, 120 secs
lola: 80761558 markings, 148051200 edges, 600775 markings/sec, 125 secs
lola: 83870031 markings, 153746645 edges, 621695 markings/sec, 130 secs
lola: 87010487 markings, 159503568 edges, 628091 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (G (((P12s <= 0) OR X (((P2wM2 <= 2) R F ((P12 <= P2s))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((P12s <= 0) OR X (((P2wM2 <= 2) R F ((P12 <= P2s))))))))
lola: processed formula length: 66
lola: 121 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: 2876677 markings, 5276387 edges, 575335 markings/sec, 0 secs
lola: 6047248 markings, 11084107 edges, 634114 markings/sec, 5 secs
lola: 9111295 markings, 16703459 edges, 612809 markings/sec, 10 secs
lola: 12143953 markings, 22264347 edges, 606532 markings/sec, 15 secs
lola: 15026370 markings, 27549667 edges, 576483 markings/sec, 20 secs
lola: 18145367 markings, 33266382 edges, 623799 markings/sec, 25 secs
lola: 21448572 markings, 39321425 edges, 660641 markings/sec, 30 secs
lola: 24689119 markings, 45261649 edges, 648109 markings/sec, 35 secs
lola: 27901622 markings, 51148831 edges, 642501 markings/sec, 40 secs
lola: 30991770 markings, 56813669 edges, 618030 markings/sec, 45 secs
lola: 32850143 markings, 60221857 edges, 371675 markings/sec, 50 secs
lola: 34376040 markings, 63019004 edges, 305179 markings/sec, 55 secs
lola: 36572183 markings, 67043524 edges, 439229 markings/sec, 60 secs
lola: 39694344 markings, 72765747 edges, 624432 markings/sec, 65 secs
lola: 43112653 markings, 79033340 edges, 683662 markings/sec, 70 secs
lola: 46522259 markings, 85281517 edges, 681921 markings/sec, 75 secs
lola: 50102192 markings, 91847181 edges, 715987 markings/sec, 80 secs
lola: 53546060 markings, 98159263 edges, 688774 markings/sec, 85 secs
lola: 56911043 markings, 104330350 edges, 672997 markings/sec, 90 secs
lola: 60264826 markings, 110474499 edges, 670757 markings/sec, 95 secs
lola: 63575344 markings, 116543985 edges, 662104 markings/sec, 100 secs
lola: 66848870 markings, 122544368 edges, 654705 markings/sec, 105 secs
lola: 70108096 markings, 128520214 edges, 651845 markings/sec, 110 secs
lola: 73342834 markings, 134446249 edges, 646948 markings/sec, 115 secs
lola: 76537340 markings, 140304685 edges, 638901 markings/sec, 120 secs
lola: 79698083 markings, 146100114 edges, 632149 markings/sec, 125 secs
lola: 82966575 markings, 152091557 edges, 653698 markings/sec, 130 secs
lola: 86160169 markings, 157946384 edges, 638719 markings/sec, 135 secs
lola: 89033110 markings, 163209208 edges, 574588 markings/sec, 140 secs
lola: 89416603 markings, 163915324 edges, 76699 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((G ((P1s <= 1)) OR F (G ((F ((P3s <= P12)) AND (F ((2 <= P1s)) OR (P3s <= P12)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((P1s <= 1)) OR F (G ((F ((P3s <= P12)) AND (F ((2 <= P1s)) OR (P3s <= P12)))))))
lola: processed formula length: 87
lola: 121 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2765323 markings, 3450325 edges, 553065 markings/sec, 0 secs
lola: 5011676 markings, 6257014 edges, 449271 markings/sec, 5 secs
lola: 6406341 markings, 8001344 edges, 278933 markings/sec, 10 secs
lola: 6653572 markings, 8309693 edges, 49446 markings/sec, 15 secs
lola: 7257640 markings, 9065735 edges, 120814 markings/sec, 20 secs
lola: 9472365 markings, 11832602 edges, 442945 markings/sec, 25 secs
lola: 12630356 markings, 15780359 edges, 631598 markings/sec, 30 secs
lola: 15159823 markings, 18943221 edges, 505893 markings/sec, 35 secs
lola: 17280536 markings, 21594077 edges, 424143 markings/sec, 40 secs
lola: 19468231 markings, 24328234 edges, 437539 markings/sec, 45 secs
lola: 21917008 markings, 27388323 edges, 489755 markings/sec, 50 secs
lola: 24259351 markings, 30316602 edges, 468469 markings/sec, 55 secs
lola: 25285710 markings, 31600712 edges, 205272 markings/sec, 60 secs
lola: 26502050 markings, 33120428 edges, 243268 markings/sec, 65 secs
lola: 27383378 markings, 34222330 edges, 176266 markings/sec, 70 secs
lola: 27836251 markings, 34786594 edges, 90575 markings/sec, 75 secs
lola: 28515757 markings, 35635786 edges, 135901 markings/sec, 80 secs
lola: 29456135 markings, 36811259 edges, 188076 markings/sec, 85 secs
lola: 30491348 markings, 38106351 edges, 207043 markings/sec, 90 secs
lola: 32140556 markings, 40167623 edges, 329842 markings/sec, 95 secs
lola: 35600447 markings, 44492113 edges, 691978 markings/sec, 100 secs
lola: 38284146 markings, 47847394 edges, 536740 markings/sec, 105 secs
lola: 40617941 markings, 50762943 edges, 466759 markings/sec, 110 secs
lola: 42333025 markings, 52908027 edges, 343017 markings/sec, 115 secs
lola: 43361300 markings, 54192616 edges, 205655 markings/sec, 120 secs
lola: 44293966 markings, 55358968 edges, 186533 markings/sec, 125 secs
lola: 45154086 markings, 56434088 edges, 172024 markings/sec, 130 secs
lola: 46061968 markings, 57568347 edges, 181576 markings/sec, 135 secs
lola: 46676157 markings, 58336159 edges, 122838 markings/sec, 140 secs
lola: 47369131 markings, 59203963 edges, 138595 markings/sec, 145 secs
lola: 47963304 markings, 59945163 edges, 118835 markings/sec, 150 secs
lola: 48482126 markings, 60593343 edges, 103764 markings/sec, 155 secs
lola: 49307890 markings, 61626907 edges, 165153 markings/sec, 160 secs
lola: 49993492 markings, 62483494 edges, 137120 markings/sec, 165 secs
lola: 50548985 markings, 63292313 edges, 111099 markings/sec, 170 secs
lola: 51117508 markings, 64137404 edges, 113705 markings/sec, 175 secs
lola: 51752164 markings, 65079330 edges, 126931 markings/sec, 180 secs
lola: 52263803 markings, 65837832 edges, 102328 markings/sec, 185 secs
lola: 52644489 markings, 66406936 edges, 76137 markings/sec, 190 secs
lola: 53578800 markings, 67791230 edges, 186862 markings/sec, 195 secs
lola: 54455758 markings, 69095671 edges, 175392 markings/sec, 200 secs
lola: 55815638 markings, 71106369 edges, 271976 markings/sec, 205 secs
lola: 57638420 markings, 73813142 edges, 364556 markings/sec, 210 secs
lola: 59839599 markings, 77076251 edges, 440236 markings/sec, 215 secs
lola: 62070993 markings, 80391232 edges, 446279 markings/sec, 220 secs
lola: 64236849 markings, 83604357 edges, 433171 markings/sec, 225 secs
lola: 66395529 markings, 86810211 edges, 431736 markings/sec, 230 secs
lola: 68493244 markings, 89919327 edges, 419543 markings/sec, 235 secs
lola: 70621909 markings, 93081738 edges, 425733 markings/sec, 240 secs
lola: 72723512 markings, 96195067 edges, 420321 markings/sec, 245 secs
lola: 74776914 markings, 99243278 edges, 410680 markings/sec, 250 secs
lola: 76840625 markings, 102304590 edges, 412742 markings/sec, 255 secs
lola: 78833104 markings, 105264729 edges, 398496 markings/sec, 260 secs
lola: 80807920 markings, 108194551 edges, 394963 markings/sec, 265 secs
lola: 82566140 markings, 110803008 edges, 351644 markings/sec, 270 secs
lola: 84548738 markings, 113743100 edges, 396520 markings/sec, 275 secs
lola: 86568649 markings, 116740731 edges, 403982 markings/sec, 280 secs
lola: 88547623 markings, 119671877 edges, 395795 markings/sec, 285 secs
lola: 90574326 markings, 122685609 edges, 405341 markings/sec, 290 secs
lola: 92597783 markings, 125686958 edges, 404691 markings/sec, 295 secs
lola: 94543951 markings, 128570589 edges, 389234 markings/sec, 300 secs
lola: 96508225 markings, 131490939 edges, 392855 markings/sec, 305 secs
lola: 97845222 markings, 133469296 edges, 267399 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no yes yes no yes unknown no yes yes no no unknown yes no
lola:
preliminary result: no unknown no yes yes no yes unknown no yes yes no no unknown yes no
lola: memory consumption: 22004 KB
lola: time consumption: 1110 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589542278176

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

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