About the Execution of 2019-Gold for Dekker-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.050 | 865404.00 | 878936.00 | 955.20 | FFFTTTTFTTFFTFT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r075-tajo-158922839600083.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tajo-158922839600083
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-00
FORMULA_NAME Dekker-PT-050-01
FORMULA_NAME Dekker-PT-050-02
FORMULA_NAME Dekker-PT-050-03
FORMULA_NAME Dekker-PT-050-04
FORMULA_NAME Dekker-PT-050-05
FORMULA_NAME Dekker-PT-050-06
FORMULA_NAME Dekker-PT-050-07
FORMULA_NAME Dekker-PT-050-08
FORMULA_NAME Dekker-PT-050-09
FORMULA_NAME Dekker-PT-050-10
FORMULA_NAME Dekker-PT-050-11
FORMULA_NAME Dekker-PT-050-12
FORMULA_NAME Dekker-PT-050-13
FORMULA_NAME Dekker-PT-050-14
FORMULA_NAME Dekker-PT-050-15
=== Now, execution of the tool begins
BK_START 1589542825653
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Dekker-PT-050 @ 3570 seconds
FORMULA Dekker-PT-050-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Dekker-PT-050-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2705
rslt: Output for LTLCardinality @ Dekker-PT-050
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 15 11:40:25 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "FALSE",
"processed_size": 5,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "TRUE",
"processed_size": 4,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 142
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 509
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p3_28 <= p1_2)",
"processed_size": 15,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((p3_28 <= p1_2)))",
"processed_size": 23,
"rewrites": 142
},
"result":
{
"edges": 50,
"markings": 51,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((p1_26 <= p3_22)))",
"processed_size": 24,
"rewrites": 142
},
"result":
{
"edges": 42,
"markings": 42,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (X (F ((p3_1 + 1 <= p0_38)))))",
"processed_size": 35,
"rewrites": 142
},
"result":
{
"edges": 28,
"markings": 28,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"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 (G (F ((G ((p1_25 + 1 <= flag_0_20)) OR (X ((flag_1_42 + 1 <= flag_1_21)) AND (p1_25 + 1 <= flag_0_20))))))",
"processed_size": 109,
"rewrites": 142
},
"result":
{
"edges": 21403637,
"markings": 427594,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 886
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (((flag_1_43 <= flag_0_29) OR G (((flag_1_43 <= flag_0_29) OR (G ((flag_1_43 <= flag_0_29)) AND F ((flag_1_43 <= flag_0_29))))))))",
"processed_size": 135,
"rewrites": 142
},
"result":
{
"edges": 50,
"markings": 51,
"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": 1181
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((G ((p1_10 <= p3_26)) OR X ((p1_10 <= p3_26))))",
"processed_size": 50,
"rewrites": 142
},
"result":
{
"edges": 58,
"markings": 58,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3127
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 5,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))) OR (F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))) AND F (G ((p1_6 <= p1_22))))))",
"processed_size": 154,
"rewrites": 142
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 70524,
"runtime": 865.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : (** AND (A(X(**)) AND A(X(**)))) : A(G(F((G(*) OR (X(*) AND *))))) : A(X((** OR G((** OR (G(**) AND F(**))))))) : TRUE : TRUE : TRUE : A((G(**) OR X(**))) : A(X(TRUE)) : TRUE : A(X(X(F(*)))) : FALSE : A((F((** OR F(G(**)))) OR (F((** OR F(G(**)))) AND F(G(**))))) : FALSE : TRUE : A(X(X(F(((** U **) OR (G((** OR (F(**) U **))) AND F(**)))))))"
},
"net":
{
"arcs": 20100,
"conflict_clusters": 1,
"places": 250,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 2600
},
"result":
{
"preliminary_value": "no no no yes yes yes yes no yes yes no no yes no yes unknown ",
"value": "no no no yes yes yes yes no yes yes no no yes no yes unknown "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2850/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 2600 transitions, 100 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: (3 <= p1_49)
lola: LP says that atomic proposition is always false: (3 <= p0_24)
lola: LP says that atomic proposition is always false: (2 <= flag_0_43)
lola: LP says that atomic proposition is always false: (3 <= p0_6)
lola: LP says that atomic proposition is always false: (3 <= p0_2)
lola: LP says that atomic proposition is always false: (3 <= p0_2)
lola: LP says that atomic proposition is always false: (3 <= p0_2)
lola: LP says that atomic proposition is always false: (3 <= p3_48)
lola: LP says that atomic proposition is always false: (3 <= p0_21)
lola: LP says that atomic proposition is always false: (3 <= p1_32)
lola: LP says that atomic proposition is always false: (2 <= p0_43)
lola: LP says that atomic proposition is always false: (2 <= p0_43)
lola: LP says that atomic proposition is always false: (2 <= flag_0_26)
lola: LP says that atomic proposition is always false: (2 <= flag_0_26)
lola: LP says that atomic proposition is always false: (2 <= flag_0_26)
lola: LP says that atomic proposition is always false: (2 <= flag_0_15)
lola: LP says that atomic proposition is always false: (2 <= flag_0_15)
lola: LP says that atomic proposition is always false: (3 <= p0_18)
lola: LP says that atomic proposition is always false: (3 <= p0_18)
lola: A (G ((3 <= p1_49))) : A ((((p3_28 <= p1_2) AND X ((p1_26 <= p3_22))) AND (G (X ((3 <= p0_24))) U X ((p3_28 <= p1_2))))) : A (X (NOT(X (F (G ((X ((flag_1_21 <= flag_1_42)) U (flag_0_20 <= p1_25)))))))) : A ((X ((flag_1_43 <= flag_0_29)) OR G ((X (G ((flag_1_43 <= flag_0_29))) U X (((2 <= flag_0_43) U (flag_1_43 <= flag_0_29))))))) : A (NOT(G (F (X (F (X ((G ((3 <= p0_6)) AND X (G (NOT(X (G ((p1_14 <= p1_35)))))))))))))) : A (F (NOT((F (((p0_2 <= 2) U G (F ((3 <= p0_2))))) U (3 <= p0_2))))) : A (((p0_15 <= 0) OR (X (NOT(G ((0 <= flag_1_5)))) U (((p1_27 <= flag_1_25) U F ((0 <= flag_1_5))) U G ((0 <= flag_1_5)))))) : A (((G ((p1_10 <= p3_26)) OR ((G ((3 <= p3_48)) AND NOT(G ((p1_10 <= p3_26)))) U X ((p1_10 <= p3_26)))) OR G ((3 <= p0_21)))) : A (X (X (X (G (()))))) : A (NOT(((3 <= p1_32) OR NOT(G (NOT(X (X ((flag_0_1 + 1 <= 0))))))))) : A (F ((((2 <= p0_43) U NOT(X (G (X ((p0_38 <= p3_1)))))) OR ((p1_2 <= p0_9) AND X ((2 <= p0_43)))))) : A (NOT(((G ((flag_0_26 <= 1)) OR G ((2 <= flag_0_26))) OR G (((p3_2 + 1 <= p0_35)))))) : A ((G (F (G ((p1_6 <= p1_22)))) U F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))))) : A (G ((((2 <= flag_0_15) U F ((p0_39 <= p1_0))) U X ((2 <= flag_0_15))))) : A (NOT((X (G ((3 <= p0_18))) U (X ((p1_35 <= flag_1_25)) AND X (((3 <= p0_18) AND ((p1_35 <= flag_1_25) OR X ((p1_35 <= flag_1_25))))))))) : A (X (F (X ((G (((flag_0_44 <= flag_0_33) OR (F ((p0_2 <= p1_22)) U (p0_2 <= p1_22)))) U ((1 <= flag_0_9) U (1 <= p3_45)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:123
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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: 142 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 142 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 2 will run for 254 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: 142 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 142 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 6 will run for 356 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: 142 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 7 will run for 396 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: 142 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3_28 <= p1_2) AND (A (X ((p1_26 <= p3_22))) AND A (X ((p3_28 <= p1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3_28 <= p1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3_28 <= p1_2)
lola: processed formula length: 15
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p3_28 <= p1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p3_28 <= p1_2)))
lola: processed formula length: 23
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 51 markings, 50 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p1_26 <= p3_22)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p1_26 <= p3_22)))
lola: processed formula length: 24
lola: 142 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: 42 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p3_1 + 1 <= p0_38)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p3_1 + 1 <= p0_38)))))
lola: processed formula length: 35
lola: 142 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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((p1_25 + 1 <= flag_0_20)) OR (X ((flag_1_42 + 1 <= flag_1_21)) AND (p1_25 + 1 <= flag_0_20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((p1_25 + 1 <= flag_0_20)) OR (X ((flag_1_42 + 1 <= flag_1_21)) AND (p1_25 + 1 <= flag_0_20))))))
lola: processed formula length: 109
lola: 142 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: 142137 markings, 5127776 edges, 28427 markings/sec, 0 secs
lola: 251517 markings, 10746893 edges, 21876 markings/sec, 5 secs
lola: 346533 markings, 16393433 edges, 19003 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 427594 markings, 21403637 edges
lola: ========================================
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((flag_1_43 <= flag_0_29) OR G (((flag_1_43 <= flag_0_29) OR (G ((flag_1_43 <= flag_0_29)) AND F ((flag_1_43 <= flag_0_29))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((flag_1_43 <= flag_0_29) OR G (((flag_1_43 <= flag_0_29) OR (G ((flag_1_43 <= flag_0_29)) AND F ((flag_1_43 <= flag_0_29))))))))
lola: processed formula length: 135
lola: 142 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: 51 markings, 50 edges
lola: ========================================
lola: subprocess 13 will run for 1181 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((p1_10 <= p3_26)) OR X ((p1_10 <= p3_26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((p1_10 <= p3_26)) OR X ((p1_10 <= p3_26))))
lola: processed formula length: 50
lola: 142 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: 58 markings, 58 edges
lola: ========================================
lola: subprocess 14 will run for 1772 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((((1 <= flag_0_9) U (1 <= p3_45)) OR (G (((flag_0_44 <= flag_0_33) OR (F ((p0_2 <= p1_22)) U (p0_2 <= p1_22)))) AND F ((1 <= p3_45))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((((1 <= flag_0_9) U (1 <= p3_45)) OR (G (((flag_0_44 <= flag_0_33) OR (F ((p0_2 <= p1_22)) U (p0_2 <= p1_22)))) AND F ((1 <= p3_45))))))))
lola: processed formula length: 150
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 149042 markings, 5484113 edges, 29808 markings/sec, 0 secs
lola: 259791 markings, 11139193 edges, 22150 markings/sec, 5 secs
lola: 347480 markings, 16431776 edges, 17538 markings/sec, 10 secs
lola: 443112 markings, 22052877 edges, 19126 markings/sec, 15 secs
lola: 538354 markings, 27679015 edges, 19048 markings/sec, 20 secs
lola: 629164 markings, 33305141 edges, 18162 markings/sec, 25 secs
lola: 710362 markings, 38930259 edges, 16240 markings/sec, 30 secs
lola: 800493 markings, 44465628 edges, 18026 markings/sec, 35 secs
lola: 889372 markings, 50111541 edges, 17776 markings/sec, 40 secs
lola: 970517 markings, 55622641 edges, 16229 markings/sec, 45 secs
lola: 1055898 markings, 61085660 edges, 17076 markings/sec, 50 secs
lola: 1125935 markings, 66683833 edges, 14007 markings/sec, 55 secs
lola: 1207411 markings, 72168824 edges, 16295 markings/sec, 60 secs
lola: 1282361 markings, 77679119 edges, 14990 markings/sec, 65 secs
lola: 1369180 markings, 83251643 edges, 17364 markings/sec, 70 secs
lola: 1447702 markings, 88860980 edges, 15704 markings/sec, 75 secs
lola: 1529353 markings, 94546360 edges, 16330 markings/sec, 80 secs
lola: 1627955 markings, 100171370 edges, 19720 markings/sec, 85 secs
lola: 1723050 markings, 105708817 edges, 19019 markings/sec, 90 secs
lola: 1801829 markings, 111249897 edges, 15756 markings/sec, 95 secs
lola: 1872096 markings, 116798150 edges, 14053 markings/sec, 100 secs
lola: 1950312 markings, 122318810 edges, 15643 markings/sec, 105 secs
lola: 2031749 markings, 127654945 edges, 16287 markings/sec, 110 secs
lola: 2104482 markings, 133275086 edges, 14547 markings/sec, 115 secs
lola: 2176479 markings, 138854336 edges, 14399 markings/sec, 120 secs
lola: 2258346 markings, 144474685 edges, 16373 markings/sec, 125 secs
lola: 2336359 markings, 150104770 edges, 15603 markings/sec, 130 secs
lola: 2413220 markings, 155639582 edges, 15372 markings/sec, 135 secs
lola: 2486585 markings, 161198688 edges, 14673 markings/sec, 140 secs
lola: 2559040 markings, 166758251 edges, 14491 markings/sec, 145 secs
lola: 2661661 markings, 172392109 edges, 20524 markings/sec, 150 secs
lola: 2750415 markings, 178024382 edges, 17751 markings/sec, 155 secs
lola: 2834165 markings, 183622723 edges, 16750 markings/sec, 160 secs
lola: 2927088 markings, 189177002 edges, 18585 markings/sec, 165 secs
lola: 3009543 markings, 194743706 edges, 16491 markings/sec, 170 secs
lola: 3086489 markings, 200300676 edges, 15389 markings/sec, 175 secs
lola: 3168667 markings, 205857195 edges, 16436 markings/sec, 180 secs
lola: 3254894 markings, 211419552 edges, 17245 markings/sec, 185 secs
lola: 3325929 markings, 216362864 edges, 14207 markings/sec, 190 secs
lola: 3398475 markings, 221204405 edges, 14509 markings/sec, 195 secs
lola: 3465922 markings, 226163646 edges, 13489 markings/sec, 200 secs
lola: 3556303 markings, 231548953 edges, 18076 markings/sec, 205 secs
lola: 3637056 markings, 237196023 edges, 16151 markings/sec, 210 secs
lola: 3724948 markings, 242816481 edges, 17578 markings/sec, 215 secs
lola: 3813792 markings, 248401693 edges, 17769 markings/sec, 220 secs
lola: 3890036 markings, 253913333 edges, 15249 markings/sec, 225 secs
lola: 3952663 markings, 259079885 edges, 12525 markings/sec, 230 secs
lola: 4017855 markings, 264121827 edges, 13038 markings/sec, 235 secs
lola: 4083821 markings, 269564641 edges, 13193 markings/sec, 240 secs
lola: 4152712 markings, 275051978 edges, 13778 markings/sec, 245 secs
lola: 4231647 markings, 280593128 edges, 15787 markings/sec, 250 secs
lola: 4306505 markings, 286135344 edges, 14972 markings/sec, 255 secs
lola: 4377717 markings, 291718190 edges, 14242 markings/sec, 260 secs
lola: 4451709 markings, 297285666 edges, 14798 markings/sec, 265 secs
lola: 4520713 markings, 302816525 edges, 13801 markings/sec, 270 secs
lola: 4601031 markings, 308434651 edges, 16064 markings/sec, 275 secs
lola: 4667265 markings, 314044147 edges, 13247 markings/sec, 280 secs
lola: 4732569 markings, 319530404 edges, 13061 markings/sec, 285 secs
lola: 4805331 markings, 325104502 edges, 14552 markings/sec, 290 secs
lola: 4877522 markings, 330593630 edges, 14438 markings/sec, 295 secs
lola: 4946093 markings, 336115035 edges, 13714 markings/sec, 300 secs
lola: 5019884 markings, 341641863 edges, 14758 markings/sec, 305 secs
lola: 5086669 markings, 347163215 edges, 13357 markings/sec, 310 secs
lola: 5151927 markings, 352701461 edges, 13052 markings/sec, 315 secs
lola: 5216468 markings, 358230971 edges, 12908 markings/sec, 320 secs
lola: 5279072 markings, 363751012 edges, 12521 markings/sec, 325 secs
lola: 5345773 markings, 369288911 edges, 13340 markings/sec, 330 secs
lola: 5420408 markings, 374924206 edges, 14927 markings/sec, 335 secs
lola: 5510841 markings, 380614962 edges, 18087 markings/sec, 340 secs
lola: 5584017 markings, 386291073 edges, 14635 markings/sec, 345 secs
lola: 5661182 markings, 391906885 edges, 15433 markings/sec, 350 secs
lola: 5741326 markings, 397476409 edges, 16029 markings/sec, 355 secs
lola: 5826661 markings, 402986730 edges, 17067 markings/sec, 360 secs
lola: 5905573 markings, 408499233 edges, 15782 markings/sec, 365 secs
lola: 5983331 markings, 413995534 edges, 15552 markings/sec, 370 secs
lola: 6042374 markings, 419497233 edges, 11809 markings/sec, 375 secs
lola: 6105311 markings, 425064246 edges, 12587 markings/sec, 380 secs
lola: 6174713 markings, 430685610 edges, 13880 markings/sec, 385 secs
lola: 6248113 markings, 436286588 edges, 14680 markings/sec, 390 secs
lola: 6334825 markings, 441849449 edges, 17342 markings/sec, 395 secs
lola: 6409334 markings, 447368560 edges, 14902 markings/sec, 400 secs
lola: 6482373 markings, 452866753 edges, 14608 markings/sec, 405 secs
lola: 6555848 markings, 458480736 edges, 14695 markings/sec, 410 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3127 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))) OR (F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))) AND F (G ((p1_6 <= p1_22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))) OR (F (((p1_4 <= flag_0_19) OR F (G ((p0_18 <= flag_0_34))))) AND F (G ((p1_6 <= p1_22))))))
lola: processed formula length: 154
lola: 142 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: 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: ========================================
lola: ...considering subproblem: A (X (X (F ((((1 <= flag_0_9) U (1 <= p3_45)) OR (G (((flag_0_44 <= flag_0_33) OR (F ((p0_2 <= p1_22)) U (p0_2 <= p1_22)))) AND F ((1 <= p3_45))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((((1 <= flag_0_9) U (1 <= p3_45)) OR (G (((flag_0_44 <= flag_0_33) OR (F ((p0_2 <= p1_22)) U (p0_2 <= p1_22)))) AND F ((1 <= p3_45))))))))
lola: processed formula length: 150
lola: 142 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 14 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: 140604 markings, 5065129 edges, 28121 markings/sec, 0 secs
lola: 250849 markings, 10720403 edges, 22049 markings/sec, 5 secs
lola: 346096 markings, 16368101 edges, 19049 markings/sec, 10 secs
lola: 442299 markings, 22004595 edges, 19241 markings/sec, 15 secs
lola: 538083 markings, 27654172 edges, 19157 markings/sec, 20 secs
lola: 629324 markings, 33312847 edges, 18248 markings/sec, 25 secs
lola: 710914 markings, 38973096 edges, 16318 markings/sec, 30 secs
lola: 801548 markings, 44524812 edges, 18127 markings/sec, 35 secs
lola: 891818 markings, 50224706 edges, 18054 markings/sec, 40 secs
lola: 974610 markings, 55857429 edges, 16558 markings/sec, 45 secs
lola: 1059803 markings, 61438990 edges, 17039 markings/sec, 50 secs
lola: 1126274 markings, 66703873 edges, 13294 markings/sec, 55 secs
lola: 1208281 markings, 72223735 edges, 16401 markings/sec, 60 secs
lola: 1283076 markings, 77746551 edges, 14959 markings/sec, 65 secs
lola: 1369610 markings, 83283502 edges, 17307 markings/sec, 70 secs
lola: 1447519 markings, 88846562 edges, 15582 markings/sec, 75 secs
lola: 1529116 markings, 94527494 edges, 16319 markings/sec, 80 secs
lola: 1627367 markings, 100133444 edges, 19650 markings/sec, 85 secs
lola: 1721489 markings, 105637769 edges, 18824 markings/sec, 90 secs
lola: 1800563 markings, 111155076 edges, 15815 markings/sec, 95 secs
lola: 1870543 markings, 116672396 edges, 13996 markings/sec, 100 secs
lola: 1948126 markings, 122170521 edges, 15517 markings/sec, 105 secs
lola: 2032366 markings, 127716985 edges, 16848 markings/sec, 110 secs
lola: 2105044 markings, 133312843 edges, 14536 markings/sec, 115 secs
lola: 2176794 markings, 138872262 edges, 14350 markings/sec, 120 secs
lola: 2258291 markings, 144470399 edges, 16299 markings/sec, 125 secs
lola: 2335931 markings, 150075891 edges, 15528 markings/sec, 130 secs
lola: 2412563 markings, 155586523 edges, 15326 markings/sec, 135 secs
lola: 2485708 markings, 161115611 edges, 14629 markings/sec, 140 secs
lola: 2557483 markings, 166643353 edges, 14355 markings/sec, 145 secs
lola: 2659580 markings, 172245343 edges, 20419 markings/sec, 150 secs
lola: 2747900 markings, 177841247 edges, 17664 markings/sec, 155 secs
lola: 2831479 markings, 183396236 edges, 16716 markings/sec, 160 secs
lola: 2922285 markings, 188923434 edges, 18161 markings/sec, 165 secs
lola: 3005129 markings, 194378723 edges, 16569 markings/sec, 170 secs
lola: 3080204 markings, 199790085 edges, 15015 markings/sec, 175 secs
lola: 3157611 markings, 205206127 edges, 15481 markings/sec, 180 secs
lola: 3246390 markings, 210732091 edges, 17756 markings/sec, 185 secs
lola: 3324052 markings, 216211156 edges, 15532 markings/sec, 190 secs
lola: 3404664 markings, 221676946 edges, 16122 markings/sec, 195 secs
lola: 3483958 markings, 227135378 edges, 15859 markings/sec, 200 secs
lola: 3573417 markings, 232784986 edges, 17892 markings/sec, 205 secs
lola: 3654029 markings, 238365400 edges, 16122 markings/sec, 210 secs
lola: 3743975 markings, 243897743 edges, 17989 markings/sec, 215 secs
lola: 3823946 markings, 249109096 edges, 15994 markings/sec, 220 secs
lola: 3898213 markings, 254604679 edges, 14853 markings/sec, 225 secs
lola: 3965846 markings, 260160875 edges, 13527 markings/sec, 230 secs
lola: 4039277 markings, 265761610 edges, 14686 markings/sec, 235 secs
lola: 4105015 markings, 271333926 edges, 13148 markings/sec, 240 secs
lola: 4176574 markings, 276848996 edges, 14312 markings/sec, 245 secs
lola: 4256264 markings, 282394510 edges, 15938 markings/sec, 250 secs
lola: 4331509 markings, 287950488 edges, 15049 markings/sec, 255 secs
lola: 4398463 markings, 293525219 edges, 13391 markings/sec, 260 secs
lola: 4474113 markings, 299100217 edges, 15130 markings/sec, 265 secs
lola: 4549257 markings, 304652025 edges, 15029 markings/sec, 270 secs
lola: 4624628 markings, 310293870 edges, 15074 markings/sec, 275 secs
lola: 4688638 markings, 315864289 edges, 12802 markings/sec, 280 secs
lola: 4754074 markings, 321364184 edges, 13087 markings/sec, 285 secs
lola: 4827020 markings, 326935537 edges, 14589 markings/sec, 290 secs
lola: 4897574 markings, 332410022 edges, 14111 markings/sec, 295 secs
lola: 4971323 markings, 337929469 edges, 14750 markings/sec, 300 secs
lola: 5043864 markings, 343505195 edges, 14508 markings/sec, 305 secs
lola: 5107131 markings, 349018095 edges, 12653 markings/sec, 310 secs
lola: 5174444 markings, 354574750 edges, 13463 markings/sec, 315 secs
lola: 5236740 markings, 360107193 edges, 12459 markings/sec, 320 secs
lola: 5301885 markings, 365638694 edges, 13029 markings/sec, 325 secs
lola: 5370508 markings, 371185162 edges, 13725 markings/sec, 330 secs
lola: 5452747 markings, 376834190 edges, 16448 markings/sec, 335 secs
lola: 5536209 markings, 382527932 edges, 16692 markings/sec, 340 secs
lola: 5613360 markings, 388172470 edges, 15430 markings/sec, 345 secs
lola: 5688880 markings, 393792671 edges, 15104 markings/sec, 350 secs
lola: 5771299 markings, 399355186 edges, 16484 markings/sec, 355 secs
lola: 5854219 markings, 404904950 edges, 16584 markings/sec, 360 secs
lola: 5934164 markings, 410419681 edges, 15989 markings/sec, 365 secs
lola: 6004029 markings, 415933841 edges, 13973 markings/sec, 370 secs
lola: 6063133 markings, 421472162 edges, 11821 markings/sec, 375 secs
lola: 6130999 markings, 427056569 edges, 13573 markings/sec, 380 secs
lola: 6200673 markings, 432660836 edges, 13935 markings/sec, 385 secs
lola: 6280564 markings, 438255028 edges, 15978 markings/sec, 390 secs
lola: 6366045 markings, 443823143 edges, 17096 markings/sec, 395 secs
lola: 6432679 markings, 449341452 edges, 13327 markings/sec, 400 secs
lola: 6505929 markings, 454578462 edges, 14650 markings/sec, 405 secs
lola: 6568160 markings, 459454252 edges, 12446 markings/sec, 410 secs
lola: 6573214 markings, 459927606 edges, 1011 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no yes yes yes yes no yes yes no no yes no yes unknown
lola:
preliminary result: no no no yes yes yes yes no yes yes no no yes no yes unknown
lola: memory consumption: 70524 KB
lola: time consumption: 865 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1589543691057
--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r075-tajo-158922839600083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 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 '
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 ;