About the Execution of 2019-Gold for ShieldRVt-PT-020A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15919.130 | 876824.00 | 844144.00 | 6128.60 | TF?TFFTTFFFFFFFT | 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.r221-tajo-159033502200255.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 ShieldRVt-PT-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r221-tajo-159033502200255
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.4K May 14 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 20:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 20:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.4K May 13 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 54K May 12 20:42 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 ShieldRVt-PT-020A-00
FORMULA_NAME ShieldRVt-PT-020A-01
FORMULA_NAME ShieldRVt-PT-020A-02
FORMULA_NAME ShieldRVt-PT-020A-03
FORMULA_NAME ShieldRVt-PT-020A-04
FORMULA_NAME ShieldRVt-PT-020A-05
FORMULA_NAME ShieldRVt-PT-020A-06
FORMULA_NAME ShieldRVt-PT-020A-07
FORMULA_NAME ShieldRVt-PT-020A-08
FORMULA_NAME ShieldRVt-PT-020A-09
FORMULA_NAME ShieldRVt-PT-020A-10
FORMULA_NAME ShieldRVt-PT-020A-11
FORMULA_NAME ShieldRVt-PT-020A-12
FORMULA_NAME ShieldRVt-PT-020A-13
FORMULA_NAME ShieldRVt-PT-020A-14
FORMULA_NAME ShieldRVt-PT-020A-15
=== Now, execution of the tool begins
BK_START 1590904979566
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ ShieldRVt-PT-020A @ 3570 seconds
FORMULA ShieldRVt-PT-020A-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldRVt-PT-020A-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2693
rslt: Output for LTLCardinality @ ShieldRVt-PT-020A
{
"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": "Sun May 31 06:02:59 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": "TRUE",
"processed_size": 4,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"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": 120
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"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 (X ((((p140 <= p47) OR G ((p18 <= p83))) U (1 <= p125))))",
"processed_size": 59,
"rewrites": 120
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (G (((p4 <= p57) OR G ((p57 + 1 <= p4))))))",
"processed_size": 48,
"rewrites": 120
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (((p46 <= p45) U (p116 + 1 <= p139))))",
"processed_size": 43,
"rewrites": 120
},
"result":
{
"edges": 134,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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": 120
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 396
},
"child":
[
{
"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": 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": "(p69 + 1 <= p122)",
"processed_size": 17,
"rewrites": 122
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (X (G (((p69 + 1 <= p122) AND F ((p94 + 1 <= p136))))))))",
"processed_size": 65,
"rewrites": 120
},
"result":
{
"edges": 137,
"markings": 137,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p34 + 1 <= p91)",
"processed_size": 16,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p94 <= p47))))",
"processed_size": 24,
"rewrites": 120
},
"result":
{
"edges": 6,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((p91 <= p94))))",
"processed_size": 24,
"rewrites": 120
},
"result":
{
"edges": 173,
"markings": 138,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 771
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (((p7 <= p51) OR (G ((p7 <= p51)) OR G ((p91 + 1 <= p155)))))",
"processed_size": 63,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1028
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (F (((p11 + 1 <= p120) AND ((F ((p28 + 1 <= p107)) OR G ((p11 + 1 <= p120))) AND F (G ((p144 <= p121))))))))",
"processed_size": 113,
"rewrites": 120
},
"result":
{
"edges": 627,
"markings": 620,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 1543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((F ((p122 <= p77)) U ((p1 <= p56) U (p63 <= p4))))",
"processed_size": 53,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3086
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3086
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((p122 <= p81) AND (p50 <= p44) AND ((p44 + 1 <= p50) OR (p64 + 1 <= p6)))",
"processed_size": 75,
"rewrites": 120
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 24916,
"runtime": 877.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "TRUE : A(X(((** OR G(**)) U **))) : A(G(F((F(G(**)) OR **)))) : A(X(TRUE)) : A(G(F((* AND ((F(*) OR G(*)) AND F(G(**))))))) : A(F(G(**))) : TRUE : A((** OR (G(**) OR G(**)))) : A(X(G((* OR G(*))))) : A(X((** U **))) : FALSE : (** AND A(G(**))) : A(F(G(**))) : (A(F(**)) AND A(X(X(X(G((* AND F(*)))))))) : (* AND (A(F(*)) AND A((X(X(*)) OR (* R *))))) : A((F(**) U (** U **)))"
},
"net":
{
"arcs": 686,
"conflict_clusters": 43,
"places": 163,
"places_significant": 82,
"singleton_clusters": 0,
"transitions": 163
},
"result":
{
"preliminary_value": "yes no unknown yes no no yes yes no no no no no no no yes ",
"value": "yes no unknown yes no no yes yes no no no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 326/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 163
lola: finding significant places
lola: 163 places, 163 transitions, 82 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 <= p95)
lola: LP says that atomic proposition is always false: (3 <= p95)
lola: LP says that atomic proposition is always false: (2 <= p110)
lola: LP says that atomic proposition is always false: (2 <= p35)
lola: LP says that atomic proposition is always false: (3 <= p57)
lola: LP says that atomic proposition is always false: (2 <= p141)
lola: LP says that atomic proposition is always false: (3 <= p118)
lola: LP says that atomic proposition is always false: (3 <= p136)
lola: LP says that atomic proposition is always false: (3 <= p118)
lola: LP says that atomic proposition is always false: (3 <= p136)
lola: A ((G ((0 <= p103)) OR (((p103 + 1 <= 0) U (0 <= p103)) AND G (((0 <= p103) OR NOT(F ((p71 <= p33)))))))) : A (X ((((p140 <= p47) OR G ((p18 <= p83))) U (1 <= p125)))) : A (G (F ((((3 <= p95) OR F (G (X (G (((p103 <= p24))))))) OR ((2 <= p110) U (p16 <= p58)))))) : A (X (NOT(((X (F (G ((0 <= p38)))) AND X ((p115 <= p54))) AND X ((2 <= p35)))))) : A (G (NOT(G (((G ((p107 <= p28)) U (p120 <= p11)) OR NOT(F (G ((p144 <= p121))))))))) : A (X (G (NOT((() OR X (G (NOT(G ((p94 <= p47)))))))))) : A (NOT(G (((p68 <= p137) U ())))) : A ((((p7 <= p51) OR G ((p7 <= p51))) OR G ((p91 + 1 <= p155)))) : A (X (NOT(F ((((p57 + 1 <= p4) AND NOT(X (X (NOT(X ((0 <= p60))))))) AND F ((p4 <= p57))))))) : A (X (((p46 <= p45) U (p116 + 1 <= p139)))) : A (((() AND F ((1 <= p97))) AND X (X (((0 <= p136) AND X ((3 <= p136))))))) : A ((((p122 <= p81) AND (p50 <= p44) AND ((p44 + 1 <= p50) OR (p64 + 1 <= p6))) AND G ((p50 <= p44)))) : A (F ((((1 <= p5) OR F (G ((0 <= p75)))) U G ((p91 <= p94))))) : A ((F ((p122 <= p69)) AND X (NOT(X (X (F (((p122 <= p69) OR G ((p136 <= p94)))))))))) : A (NOT((((p91 <= p34) OR G ((p82 <= p127))) OR (X (X ((p119 <= p31))) AND ((p34 + 1 <= p91) U (p31 + 1 <= p119)))))) : A (((F ((p4 + 1 <= p63)) U ((p1 <= p56) U F ((p122 <= p77)))) U ((p1 <= p56) U (p63 <= p4))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:318
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:536
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: 120 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 120 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((p140 <= p47) OR G ((p18 <= p83))) U (1 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((p140 <= p47) OR G ((p18 <= p83))) U (1 <= p125))))
lola: processed formula length: 59
lola: 120 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p4 <= p57) OR G ((p57 + 1 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p4 <= p57) OR G ((p57 + 1 <= p4))))))
lola: processed formula length: 48
lola: 120 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 134 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p46 <= p45) U (p116 + 1 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p46 <= p45) U (p116 + 1 <= p139))))
lola: processed formula length: 43
lola: 120 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: 134 markings, 134 edges
lola: ========================================
lola: subprocess 6 will run for 356 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: 120 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p122 <= p69))) AND A (X (X (X (G (((p69 + 1 <= p122) AND F ((p94 + 1 <= p136)))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p122 <= p69)))
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: (p69 + 1 <= p122)
lola: processed formula length: 17
lola: 122 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 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G (((p69 + 1 <= p122) AND F ((p94 + 1 <= p136))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G (((p69 + 1 <= p122) AND F ((p94 + 1 <= p136))))))))
lola: processed formula length: 65
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 137 markings, 137 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p34 + 1 <= p91) AND (A (F ((p127 + 1 <= p82))) AND A ((X (X ((p31 + 1 <= p119))) OR ((p91 <= p34) R (p119 <= p31))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p34 + 1 <= p91)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p34 + 1 <= p91)
lola: processed formula length: 16
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p94 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p94 <= p47))))
lola: processed formula length: 24
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p91 <= p94))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p91 <= p94))))
lola: processed formula length: 24
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 138 markings, 173 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((F (G (((p103 <= p24)))) OR (p16 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((F (G (((p103 <= p24)))) OR (p16 <= p58)))))
lola: processed formula length: 53
lola: 120 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: 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: 1019665 markings, 1185429 edges, 203933 markings/sec, 0 secs
lola: 2067765 markings, 2441063 edges, 209620 markings/sec, 5 secs
lola: 3099375 markings, 3695894 edges, 206322 markings/sec, 10 secs
lola: 4121385 markings, 4940607 edges, 204402 markings/sec, 15 secs
lola: 5135207 markings, 6185956 edges, 202764 markings/sec, 20 secs
lola: 6120011 markings, 7401207 edges, 196961 markings/sec, 25 secs
lola: 6994015 markings, 8483932 edges, 174801 markings/sec, 30 secs
lola: 7867351 markings, 9565232 edges, 174667 markings/sec, 35 secs
lola: 8798319 markings, 10731575 edges, 186194 markings/sec, 40 secs
lola: 9780626 markings, 11967038 edges, 196461 markings/sec, 45 secs
lola: 10763406 markings, 13202706 edges, 196556 markings/sec, 50 secs
lola: 11741864 markings, 14440961 edges, 195692 markings/sec, 55 secs
lola: 12720040 markings, 15680097 edges, 195635 markings/sec, 60 secs
lola: 13699959 markings, 16923874 edges, 195984 markings/sec, 65 secs
lola: 14676088 markings, 18167225 edges, 195226 markings/sec, 70 secs
lola: 15641556 markings, 19396654 edges, 193094 markings/sec, 75 secs
lola: 16611631 markings, 20636309 edges, 194015 markings/sec, 80 secs
lola: 17575943 markings, 21872843 edges, 192862 markings/sec, 85 secs
lola: 18531904 markings, 23097274 edges, 191192 markings/sec, 90 secs
lola: 19486865 markings, 24318337 edges, 190992 markings/sec, 95 secs
lola: 20436897 markings, 25537485 edges, 190006 markings/sec, 100 secs
lola: 21396246 markings, 26772083 edges, 191870 markings/sec, 105 secs
lola: 22350844 markings, 27998892 edges, 190920 markings/sec, 110 secs
lola: 23298999 markings, 29225472 edges, 189631 markings/sec, 115 secs
lola: 24249549 markings, 30448826 edges, 190110 markings/sec, 120 secs
lola: 25203345 markings, 31674064 edges, 190759 markings/sec, 125 secs
lola: 26147332 markings, 32898992 edges, 188797 markings/sec, 130 secs
lola: 27092477 markings, 34126224 edges, 189029 markings/sec, 135 secs
lola: 27986898 markings, 35285869 edges, 178884 markings/sec, 140 secs
lola: 28888859 markings, 36459506 edges, 180392 markings/sec, 145 secs
lola: 29718399 markings, 37537677 edges, 165908 markings/sec, 150 secs
lola: 30541724 markings, 38611329 edges, 164665 markings/sec, 155 secs
lola: 31329089 markings, 39640532 edges, 157473 markings/sec, 160 secs
lola: 32133812 markings, 40695053 edges, 160945 markings/sec, 165 secs
lola: 32933994 markings, 41738094 edges, 160036 markings/sec, 170 secs
lola: 33736447 markings, 42784325 edges, 160491 markings/sec, 175 secs
lola: 34532099 markings, 43821615 edges, 159130 markings/sec, 180 secs
lola: 35325870 markings, 44862636 edges, 158754 markings/sec, 185 secs
lola: 36113547 markings, 45893870 edges, 157535 markings/sec, 190 secs
lola: 36905741 markings, 46928082 edges, 158439 markings/sec, 195 secs
lola: 37696473 markings, 47965889 edges, 158146 markings/sec, 200 secs
lola: 38495686 markings, 49011981 edges, 159843 markings/sec, 205 secs
lola: 39283148 markings, 50051225 edges, 157492 markings/sec, 210 secs
lola: 40076998 markings, 51098620 edges, 158770 markings/sec, 215 secs
lola: 40865414 markings, 52138345 edges, 157683 markings/sec, 220 secs
lola: 41645170 markings, 53167928 edges, 155951 markings/sec, 225 secs
lola: 42496883 markings, 54288484 edges, 170343 markings/sec, 230 secs
lola: 43397430 markings, 55475205 edges, 180109 markings/sec, 235 secs
lola: 44299561 markings, 56663836 edges, 180426 markings/sec, 240 secs
lola: 45209717 markings, 57868227 edges, 182031 markings/sec, 245 secs
lola: 46022406 markings, 58944781 edges, 162538 markings/sec, 250 secs
lola: 46829520 markings, 60012893 edges, 161423 markings/sec, 255 secs
lola: 47705201 markings, 61176517 edges, 175136 markings/sec, 260 secs
lola: 48612644 markings, 62378573 edges, 181489 markings/sec, 265 secs
lola: 49525031 markings, 63582002 edges, 182477 markings/sec, 270 secs
lola: 50439117 markings, 64792285 edges, 182817 markings/sec, 275 secs
lola: 51348638 markings, 66001772 edges, 181904 markings/sec, 280 secs
lola: 52260453 markings, 67209701 edges, 182363 markings/sec, 285 secs
lola: 53164567 markings, 68418665 edges, 180823 markings/sec, 290 secs
lola: 54074820 markings, 69628955 edges, 182051 markings/sec, 295 secs
lola: 54981078 markings, 70841132 edges, 181252 markings/sec, 300 secs
lola: 55888123 markings, 72043065 edges, 181409 markings/sec, 305 secs
lola: 56798116 markings, 73256497 edges, 181999 markings/sec, 310 secs
lola: 57701518 markings, 74464916 edges, 180680 markings/sec, 315 secs
lola: 58610897 markings, 75686927 edges, 181876 markings/sec, 320 secs
lola: 59517430 markings, 76892116 edges, 181307 markings/sec, 325 secs
lola: 60425315 markings, 78103515 edges, 181577 markings/sec, 330 secs
lola: 61328532 markings, 79311046 edges, 180643 markings/sec, 335 secs
lola: 62237252 markings, 80526933 edges, 181744 markings/sec, 340 secs
lola: 63142430 markings, 81741450 edges, 181036 markings/sec, 345 secs
lola: 64043598 markings, 82944421 edges, 180234 markings/sec, 350 secs
lola: 64930811 markings, 84132958 edges, 177443 markings/sec, 355 secs
lola: 65751553 markings, 85236742 edges, 164148 markings/sec, 360 secs
lola: 66586545 markings, 86359170 edges, 166998 markings/sec, 365 secs
lola: 67424118 markings, 87482107 edges, 167515 markings/sec, 370 secs
lola: 68321534 markings, 88690921 edges, 179483 markings/sec, 375 secs
lola: 69219004 markings, 89899943 edges, 179494 markings/sec, 380 secs
lola: 70114504 markings, 91107460 edges, 179100 markings/sec, 385 secs
lola: 71009795 markings, 92320228 edges, 179058 markings/sec, 390 secs
lola: 71901966 markings, 93524440 edges, 178434 markings/sec, 395 secs
lola: 72699892 markings, 94600902 edges, 159585 markings/sec, 400 secs
lola: 72940526 markings, 94927876 edges, 48127 markings/sec, 405 secs
lola: 72943589 markings, 94932070 edges, 613 markings/sec, 410 secs
lola: 72946271 markings, 94935902 edges, 536 markings/sec, 415 secs
lola: 72946739 markings, 94936733 edges, 94 markings/sec, 420 secs
lola: 72947963 markings, 94938358 edges, 245 markings/sec, 425 secs
lola: 72948622 markings, 94939183 edges, 132 markings/sec, 430 secs
lola: 72950577 markings, 94941963 edges, 391 markings/sec, 435 secs
lola: 72952423 markings, 94944691 edges, 369 markings/sec, 440 secs
lola: 72956525 markings, 94949977 edges, 820 markings/sec, 445 secs
lola: 72956811 markings, 94950421 edges, 57 markings/sec, 450 secs
lola: 72958800 markings, 94953163 edges, 398 markings/sec, 455 secs
lola: 72961438 markings, 94956577 edges, 528 markings/sec, 460 secs
lola: 72962466 markings, 94957881 edges, 206 markings/sec, 465 secs
lola: 72962725 markings, 94958184 edges, 52 markings/sec, 470 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p7 <= p51) OR (G ((p7 <= p51)) OR G ((p91 + 1 <= p155)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p7 <= p51) OR (G ((p7 <= p51)) OR G ((p91 + 1 <= p155)))))
lola: processed formula length: 63
lola: 120 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: 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 13 will run for 1028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p11 + 1 <= p120) AND ((F ((p28 + 1 <= p107)) OR G ((p11 + 1 <= p120))) AND F (G ((p144 <= p121))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p11 + 1 <= p120) AND ((F ((p28 + 1 <= p107)) OR G ((p11 + 1 <= p120))) AND F (G ((p144 <= p121))))))))
lola: processed formula length: 113
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 12 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: 620 markings, 627 edges
lola: ========================================
lola: subprocess 14 will run for 1543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p122 <= p77)) U ((p1 <= p56) U (p63 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p122 <= p77)) U ((p1 <= p56) U (p63 <= p4))))
lola: processed formula length: 53
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p122 <= p81) AND (p50 <= p44) AND ((p44 + 1 <= p50) OR (p64 + 1 <= p6))) AND A (G ((p50 <= p44))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p122 <= p81) AND (p50 <= p44) AND ((p44 + 1 <= p50) OR (p64 + 1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p122 <= p81) AND (p50 <= p44) AND ((p44 + 1 <= p50) OR (p64 + 1 <= p6)))
lola: processed formula length: 75
lola: 120 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F ((F (G (((p103 <= p24)))) OR (p16 <= p58)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((F (G (((p103 <= p24)))) OR (p16 <= p58)))))
lola: processed formula length: 53
lola: 120 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: 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: 964365 markings, 1120814 edges, 192873 markings/sec, 0 secs
lola: 1979869 markings, 2336609 edges, 203101 markings/sec, 5 secs
lola: 2986493 markings, 3556937 edges, 201325 markings/sec, 10 secs
lola: 3990568 markings, 4779720 edges, 200815 markings/sec, 15 secs
lola: 4984468 markings, 6000840 edges, 198780 markings/sec, 20 secs
lola: 5973231 markings, 7218102 edges, 197753 markings/sec, 25 secs
lola: 6957135 markings, 8436916 edges, 196781 markings/sec, 30 secs
lola: 7938782 markings, 9655224 edges, 196329 markings/sec, 35 secs
lola: 8858029 markings, 10808176 edges, 183849 markings/sec, 40 secs
lola: 9770591 markings, 11953779 edges, 182512 markings/sec, 45 secs
lola: 10738892 markings, 13171937 edges, 193660 markings/sec, 50 secs
lola: 11719176 markings, 14411088 edges, 196057 markings/sec, 55 secs
lola: 12697677 markings, 15651412 edges, 195700 markings/sec, 60 secs
lola: 13680345 markings, 16899012 edges, 196534 markings/sec, 65 secs
lola: 14658905 markings, 18145774 edges, 195712 markings/sec, 70 secs
lola: 15630021 markings, 19381729 edges, 194223 markings/sec, 75 secs
lola: 16610751 markings, 20635029 edges, 196146 markings/sec, 80 secs
lola: 17578919 markings, 21876561 edges, 193634 markings/sec, 85 secs
lola: 18540027 markings, 23107630 edges, 192222 markings/sec, 90 secs
lola: 19503987 markings, 24340169 edges, 192792 markings/sec, 95 secs
lola: 20464759 markings, 25572953 edges, 192154 markings/sec, 100 secs
lola: 21431574 markings, 26818024 edges, 193363 markings/sec, 105 secs
lola: 22393070 markings, 28054595 edges, 192299 markings/sec, 110 secs
lola: 23350001 markings, 29291994 edges, 191386 markings/sec, 115 secs
lola: 24306840 markings, 30522852 edges, 191368 markings/sec, 120 secs
lola: 25271773 markings, 31763999 edges, 192987 markings/sec, 125 secs
lola: 26229372 markings, 33005530 edges, 191520 markings/sec, 130 secs
lola: 27138870 markings, 34187053 edges, 181900 markings/sec, 135 secs
lola: 27992198 markings, 35292692 edges, 170666 markings/sec, 140 secs
lola: 28842541 markings, 36399558 edges, 170069 markings/sec, 145 secs
lola: 29720051 markings, 37539672 edges, 175502 markings/sec, 150 secs
lola: 30663216 markings, 38773204 edges, 188633 markings/sec, 155 secs
lola: 31612140 markings, 40008129 edges, 189785 markings/sec, 160 secs
lola: 32554420 markings, 41243927 edges, 188456 markings/sec, 165 secs
lola: 33498593 markings, 42476086 edges, 188835 markings/sec, 170 secs
lola: 34443234 markings, 43706077 edges, 188928 markings/sec, 175 secs
lola: 35390947 markings, 44948783 edges, 189543 markings/sec, 180 secs
lola: 36332723 markings, 46181974 edges, 188355 markings/sec, 185 secs
lola: 37243782 markings, 47373859 edges, 182212 markings/sec, 190 secs
lola: 38071002 markings, 48454969 edges, 165444 markings/sec, 195 secs
lola: 38897209 markings, 49544239 edges, 165241 markings/sec, 200 secs
lola: 39782924 markings, 50709493 edges, 177143 markings/sec, 205 secs
lola: 40721679 markings, 51947974 edges, 187751 markings/sec, 210 secs
lola: 41658071 markings, 53184869 edges, 187278 markings/sec, 215 secs
lola: 42595068 markings, 54419241 edges, 187399 markings/sec, 220 secs
lola: 43529165 markings, 55648981 edges, 186819 markings/sec, 225 secs
lola: 44457144 markings, 56872536 edges, 185596 markings/sec, 230 secs
lola: 45397610 markings, 58117986 edges, 188093 markings/sec, 235 secs
lola: 46334951 markings, 59356522 edges, 187468 markings/sec, 240 secs
lola: 47265214 markings, 60594252 edges, 186053 markings/sec, 245 secs
lola: 48200259 markings, 61830625 edges, 187009 markings/sec, 250 secs
lola: 49127281 markings, 63058359 edges, 185404 markings/sec, 255 secs
lola: 50062555 markings, 64294294 edges, 187055 markings/sec, 260 secs
lola: 50993775 markings, 65534470 edges, 186244 markings/sec, 265 secs
lola: 51854079 markings, 66669928 edges, 172061 markings/sec, 270 secs
lola: 52677163 markings, 67767392 edges, 164617 markings/sec, 275 secs
lola: 53488899 markings, 68851533 edges, 162347 markings/sec, 280 secs
lola: 54353036 markings, 69999768 edges, 172827 markings/sec, 285 secs
lola: 55272039 markings, 71228599 edges, 183801 markings/sec, 290 secs
lola: 56194216 markings, 72453734 edges, 184435 markings/sec, 295 secs
lola: 57118060 markings, 73681043 edges, 184769 markings/sec, 300 secs
lola: 58031332 markings, 74907795 edges, 182654 markings/sec, 305 secs
lola: 58950751 markings, 76138050 edges, 183884 markings/sec, 310 secs
lola: 59865885 markings, 77357431 edges, 183027 markings/sec, 315 secs
lola: 60786477 markings, 78586350 edges, 184118 markings/sec, 320 secs
lola: 61705123 markings, 79816996 edges, 183729 markings/sec, 325 secs
lola: 62625427 markings, 81048866 edges, 184061 markings/sec, 330 secs
lola: 63551442 markings, 82284915 edges, 185203 markings/sec, 335 secs
lola: 64394851 markings, 83416316 edges, 168682 markings/sec, 340 secs
lola: 65220352 markings, 84520930 edges, 165100 markings/sec, 345 secs
lola: 66067496 markings, 85658723 edges, 169429 markings/sec, 350 secs
lola: 66977830 markings, 86884289 edges, 182067 markings/sec, 355 secs
lola: 67901956 markings, 88125311 edges, 184825 markings/sec, 360 secs
lola: 68821388 markings, 89362947 edges, 183886 markings/sec, 365 secs
lola: 69738694 markings, 90604314 edges, 183461 markings/sec, 370 secs
lola: 70654082 markings, 91838698 edges, 183078 markings/sec, 375 secs
lola: 71565885 markings, 93070429 edges, 182361 markings/sec, 380 secs
lola: 72489029 markings, 94315752 edges, 184629 markings/sec, 385 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown yes no no yes yes no no no no no no no yes
lola:
preliminary result: yes no unknown yes no no yes yes no no no no no no no yes
lola: memory consumption: 24916 KB
lola: time consumption: 877 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590905856390
--------------------
content from stderr:
grep: GenericPropertiesVerdict.xml: No such file or directory
grep: GenericPropertiesVerdict.xml: No such file or directory
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="ShieldRVt-PT-020A"
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 ShieldRVt-PT-020A, 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 r221-tajo-159033502200255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020A.tgz
mv ShieldRVt-PT-020A 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 ;