Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 3.6K Apr 12 08:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 08:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 09:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 09:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 14:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 14:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 9 21:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 21:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 62K Mar 24 05:38 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 Raft-PT-05-00
FORMULA_NAME Raft-PT-05-01
FORMULA_NAME Raft-PT-05-02
FORMULA_NAME Raft-PT-05-03
FORMULA_NAME Raft-PT-05-04
FORMULA_NAME Raft-PT-05-05
FORMULA_NAME Raft-PT-05-06
FORMULA_NAME Raft-PT-05-07
FORMULA_NAME Raft-PT-05-08
FORMULA_NAME Raft-PT-05-09
FORMULA_NAME Raft-PT-05-10
FORMULA_NAME Raft-PT-05-11
FORMULA_NAME Raft-PT-05-12
FORMULA_NAME Raft-PT-05-13
FORMULA_NAME Raft-PT-05-14
FORMULA_NAME Raft-PT-05-15

=== Now, execution of the tool begins

BK_START 1589920197017

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Raft-PT-05 @ 3570 seconds

FORMULA Raft-PT-05-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA Raft-PT-05-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Raft-PT-05-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2794
rslt: Output for LTLCardinality @ Raft-PT-05

{
"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": "Tue May 19 20:29:57 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": 100
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 100
},
"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": 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": 100
},
"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": 100
},
"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": 100
},
"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": "TRUE",
"processed_size": 4,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A ((X (F ((F ((p20 <= p67)) AND G ((p20 <= p67))))) OR ((p45 <= p36) U (p29 <= p122))))",
"processed_size": 87,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 452
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((F ((p46 <= p24)) OR X (((p44 <= p106) AND G ((p44 <= p106))))))",
"processed_size": 67,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 528
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 528
},
"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": "(p36 <= p60)",
"processed_size": 12,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((p27 <= p45) AND (p107 <= p128)) U X ((1 <= p33))))",
"processed_size": 56,
"rewrites": 100
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 633
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((p32 <= 0)))",
"processed_size": 18,
"rewrites": 102
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 792
},
"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": "(p20 + 1 <= p26)",
"processed_size": 16,
"rewrites": 102
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 11
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1056
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (((G ((p73 <= p18)) OR F ((p49 <= 0))) AND F ((1 <= p49)))))",
"processed_size": 65,
"rewrites": 100
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1584
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((G ((p51 <= p86)) OR F ((p21 <= p25))))",
"processed_size": 42,
"rewrites": 100
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3168
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((G ((1 <= p38)) OR (((p9 + 1 <= p129) R (p47 + 1 <= p2)) AND F ((p9 + 1 <= p129)))))",
"processed_size": 87,
"rewrites": 100
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"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": 25100,
"runtime": 776.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((G(**) OR F(**))) : A((G(*) OR ((* R *) AND F(*)))) : FALSE : A((** U X(G(**)))) : A((X(F((F(**) AND G(**)))) OR (** U **))) : FALSE : FALSE : A(G(*)) : TRUE : A(F(**)) : TRUE : FALSE : A(F(((G(**) OR F(*)) AND F(**)))) : TRUE : A((F(**) OR X((** AND G(**))))) : (** AND A((** U X(**))))"
},
"net":
{
"arcs": 864,
"conflict_clusters": 15,
"places": 133,
"places_significant": 108,
"singleton_clusters": 0,
"transitions": 238
},
"result":
{
"preliminary_value": "yes no no unknown yes no no no yes yes yes no no yes yes no ",
"value": "yes no no unknown yes no no no yes yes yes no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 371/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 133
lola: finding significant places
lola: 133 places, 238 transitions, 108 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 <= p91)
lola: LP says that atomic proposition is always false: (3 <= p91)
lola: LP says that atomic proposition is always false: (2 <= p45)
lola: LP says that atomic proposition is always false: (3 <= p109)
lola: LP says that atomic proposition is always false: (2 <= p46)
lola: LP says that atomic proposition is always false: (2 <= p66)
lola: LP says that atomic proposition is always false: (2 <= p66)
lola: LP says that atomic proposition is always false: (3 <= p63)
lola: LP says that atomic proposition is always false: (3 <= p94)
lola: LP says that atomic proposition is always false: (3 <= p55)
lola: LP says that atomic proposition is always false: (2 <= p62)
lola: LP says that atomic proposition is always false: (2 <= p62)
lola: A ((G ((p51 <= p86)) OR ((G ((p21 <= p25)) U (0 <= p55)) U (X (G ((0 <= p55))) U (p21 <= p25))))) : A ((NOT(F ((p38 <= 0))) OR (NOT(((p129 <= p9) U (p2 <= p47))) AND NOT(G ((p129 <= p9)))))) : A (F ((() AND G ((NOT(F ((p82 <= 0))) OR ((3 <= p91) U (p43 <= p96))))))) : A ((((p64 <= p89) U NOT(F (NOT(X ((p64 <= p89)))))) AND G (NOT(F (G ((p34 + 1 <= 0))))))) : A ((X (F ((F ((p20 <= p67)) AND G (((2 <= p45) U (p20 <= p67)))))) OR ((p45 <= p36) U (p29 <= p122)))) : A (F (((p103 <= p102) AND G (X (G (NOT(F ((((p126 <= p83) U (p109 <= 2)) OR X ((p126 <= p83))))))))))) : A ((F (G ((p106 <= p52))) U ((p14 + 1 <= p80) AND G ((2 <= p46))))) : A (G (((2 <= p66) OR NOT(((1 <= p32) OR F ((2 <= p66))))))) : A (((X ((p118 <= p23)) OR X (G ((p17 <= p126)))) OR G (NOT(X ((p101 + 1 <= 0)))))) : A (F (((((p89 <= p61) OR X ((p26 <= p20))) U F (((p89 <= p61) OR (1 <= p80)))) U F ((p26 <= p20))))) : A (((() OR ((1 <= p46) U (0 <= p31))) OR X (X (((1 <= p46)))))) : A (((p131 + 1 <= p30) AND X ((G ((3 <= p55)) AND NOT(F ((p76 <= p86))))))) : A (F (((G ((p73 <= p18)) OR NOT(G ((1 <= p49)))) AND F ((1 <= p49))))) : A (NOT(G ((((p36 + 1 <= p50)) U F (G ((2 <= p62))))))) : A ((F ((p46 <= p24)) OR (X ((p44 <= p106)) AND X (G ((p44 <= p106)))))) : A (((p36 <= p60) AND (((p27 <= p45) AND (p107 <= p128)) U X (((1 <= p33) OR G ((1 <= p33)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:124
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:123
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:122
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:494
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 100 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 100 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: 100 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: 100 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 100 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 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p64 <= p89) U X (G ((p64 <= p89)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p64 <= p89) U X (G ((p64 <= p89)))))
lola: processed formula length: 41
lola: 100 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: 1271767 markings, 2298431 edges, 254353 markings/sec, 0 secs
lola: 2507918 markings, 4545946 edges, 247230 markings/sec, 5 secs
lola: 3749195 markings, 6810592 edges, 248255 markings/sec, 10 secs
lola: 4956253 markings, 9013075 edges, 241412 markings/sec, 15 secs
lola: 6104557 markings, 11119899 edges, 229661 markings/sec, 20 secs
lola: 7285555 markings, 13270047 edges, 236200 markings/sec, 25 secs
lola: 8445945 markings, 15395050 edges, 232078 markings/sec, 30 secs
lola: 9569749 markings, 17453249 edges, 224761 markings/sec, 35 secs
lola: 10675176 markings, 19491581 edges, 221085 markings/sec, 40 secs
lola: 11788993 markings, 21542523 edges, 222763 markings/sec, 45 secs
lola: 12865297 markings, 23531012 edges, 215261 markings/sec, 50 secs
lola: 13928960 markings, 25497968 edges, 212733 markings/sec, 55 secs
lola: 15023472 markings, 27512044 edges, 218902 markings/sec, 60 secs
lola: 16108355 markings, 29501917 edges, 216977 markings/sec, 65 secs
lola: 17193765 markings, 31503164 edges, 217082 markings/sec, 70 secs
lola: 18259548 markings, 33469126 edges, 213157 markings/sec, 75 secs
lola: 19349549 markings, 35481140 edges, 218000 markings/sec, 80 secs
lola: 20435019 markings, 37489939 edges, 217094 markings/sec, 85 secs
lola: 21465722 markings, 39405368 edges, 206141 markings/sec, 90 secs
lola: 22507910 markings, 41327082 edges, 208438 markings/sec, 95 secs
lola: 23569756 markings, 43286985 edges, 212369 markings/sec, 100 secs
lola: 24646122 markings, 45261627 edges, 215273 markings/sec, 105 secs
lola: 25686297 markings, 47193556 edges, 208035 markings/sec, 110 secs
lola: 26816366 markings, 49259618 edges, 226014 markings/sec, 115 secs
lola: 27859247 markings, 51183935 edges, 208576 markings/sec, 120 secs
lola: 28909955 markings, 53120861 edges, 210142 markings/sec, 125 secs
lola: 29909709 markings, 54979093 edges, 199951 markings/sec, 130 secs
lola: 30989845 markings, 56963488 edges, 216027 markings/sec, 135 secs
lola: 32061884 markings, 58936944 edges, 214408 markings/sec, 140 secs
lola: 33096780 markings, 60850867 edges, 206979 markings/sec, 145 secs
lola: 34107366 markings, 62727179 edges, 202117 markings/sec, 150 secs
lola: 35148640 markings, 64653722 edges, 208255 markings/sec, 155 secs
lola: 36195769 markings, 66583896 edges, 209426 markings/sec, 160 secs
lola: 37178908 markings, 68414684 edges, 196628 markings/sec, 165 secs
lola: 38222296 markings, 70339828 edges, 208678 markings/sec, 170 secs
lola: 39140697 markings, 72041780 edges, 183680 markings/sec, 175 secs
lola: 40105963 markings, 73836023 edges, 193053 markings/sec, 180 secs
lola: 41082365 markings, 75649110 edges, 195280 markings/sec, 185 secs
lola: 42018894 markings, 77385589 edges, 187306 markings/sec, 190 secs
lola: 42974040 markings, 79173253 edges, 191029 markings/sec, 195 secs
lola: 44004165 markings, 81085384 edges, 206025 markings/sec, 200 secs
lola: 44988302 markings, 82922488 edges, 196827 markings/sec, 205 secs
lola: 45974780 markings, 84767359 edges, 197296 markings/sec, 210 secs
lola: 46972613 markings, 86616426 edges, 199567 markings/sec, 215 secs
lola: 48008896 markings, 88504422 edges, 207257 markings/sec, 220 secs
lola: 49030387 markings, 90397049 edges, 204298 markings/sec, 225 secs
lola: 50028524 markings, 92249591 edges, 199627 markings/sec, 230 secs
lola: 51045434 markings, 94121148 edges, 203382 markings/sec, 235 secs
lola: 52042545 markings, 95974766 edges, 199422 markings/sec, 240 secs
lola: 53033162 markings, 97814530 edges, 198123 markings/sec, 245 secs
lola: 54010488 markings, 99646108 edges, 195465 markings/sec, 250 secs
lola: 54953530 markings, 101411373 edges, 188608 markings/sec, 255 secs
lola: 55911973 markings, 103200858 edges, 191689 markings/sec, 260 secs
lola: 56916610 markings, 105060866 edges, 200927 markings/sec, 265 secs
lola: 57906073 markings, 106897873 edges, 197893 markings/sec, 270 secs
lola: 58840186 markings, 108652836 edges, 186823 markings/sec, 275 secs
lola: 59804193 markings, 110443188 edges, 192801 markings/sec, 280 secs
lola: 60790437 markings, 112256193 edges, 197249 markings/sec, 285 secs
lola: 61791278 markings, 114118249 edges, 200168 markings/sec, 290 secs
lola: 62765798 markings, 115934220 edges, 194904 markings/sec, 295 secs
lola: 63737398 markings, 117740904 edges, 194320 markings/sec, 300 secs
lola: 64710560 markings, 119521786 edges, 194632 markings/sec, 305 secs
lola: 65685671 markings, 121334484 edges, 195022 markings/sec, 310 secs
lola: 66666178 markings, 123151834 edges, 196101 markings/sec, 315 secs
lola: 67643489 markings, 124963239 edges, 195462 markings/sec, 320 secs
lola: 68651371 markings, 126835385 edges, 201576 markings/sec, 325 secs
lola: 69619561 markings, 128638877 edges, 193638 markings/sec, 330 secs
lola: 70599191 markings, 130464434 edges, 195926 markings/sec, 335 secs
lola: 71583560 markings, 132299125 edges, 196874 markings/sec, 340 secs
lola: 72578957 markings, 134148316 edges, 199079 markings/sec, 345 secs
lola: 73536652 markings, 135933993 edges, 191539 markings/sec, 350 secs
lola: 74499361 markings, 137722296 edges, 192542 markings/sec, 355 secs
lola: 75464663 markings, 139520358 edges, 193060 markings/sec, 360 secs
lola: 76439478 markings, 141305715 edges, 194963 markings/sec, 365 secs
lola: 77416409 markings, 143116371 edges, 195386 markings/sec, 370 secs
lola: 77839016 markings, 143908879 edges, 84521 markings/sec, 375 secs
lola: 77864707 markings, 143957896 edges, 5138 markings/sec, 380 secs
lola: 77868387 markings, 143965020 edges, 736 markings/sec, 385 secs
lola: 77868462 markings, 143965151 edges, 15 markings/sec, 390 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown no unknown unknown no no unknown yes unknown yes no unknown yes unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((F ((p20 <= p67)) AND G ((p20 <= p67))))) OR ((p45 <= p36) U (p29 <= p122))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((F ((p20 <= p67)) AND G ((p20 <= p67))))) OR ((p45 <= p36) U (p29 <= p122))))
lola: processed formula length: 87
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 452 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p46 <= p24)) OR X (((p44 <= p106) AND G ((p44 <= p106))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p46 <= p24)) OR X (((p44 <= p106) AND G ((p44 <= p106))))))
lola: processed formula length: 67
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p36 <= p60) AND A ((((p27 <= p45) AND (p107 <= p128)) U X ((1 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p36 <= p60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p36 <= p60)
lola: processed formula length: 12
lola: 100 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 11 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p27 <= p45) AND (p107 <= p128)) U X ((1 <= p33))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p27 <= p45) AND (p107 <= p128)) U X ((1 <= p33))))
lola: processed formula length: 56
lola: 100 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: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 633 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p32 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: A (G ((p32 <= 0)))
lola: processed formula length: 18
lola: 102 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p32)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p26 <= p20)))
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: (p20 + 1 <= p26)
lola: processed formula length: 16
lola: 102 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 13 will run for 1056 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((G ((p73 <= p18)) OR F ((p49 <= 0))) AND F ((1 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((G ((p73 <= p18)) OR F ((p49 <= 0))) AND F ((1 <= p49)))))
lola: processed formula length: 65
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((p51 <= p86)) OR F ((p21 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((p51 <= p86)) OR F ((p21 <= p25))))
lola: processed formula length: 42
lola: 100 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3168 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((1 <= p38)) OR (((p9 + 1 <= p129) R (p47 + 1 <= p2)) AND F ((p9 + 1 <= p129)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((1 <= p38)) OR (((p9 + 1 <= p129) R (p47 + 1 <= p2)) AND F ((p9 + 1 <= p129)))))
lola: processed formula length: 87
lola: 100 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((p64 <= p89) U X (G ((p64 <= p89)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p64 <= p89) U X (G ((p64 <= p89)))))
lola: processed formula length: 41
lola: 100 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: 1369970 markings, 2476321 edges, 273994 markings/sec, 0 secs
lola: 2593073 markings, 4701185 edges, 244621 markings/sec, 5 secs
lola: 3820755 markings, 6942072 edges, 245536 markings/sec, 10 secs
lola: 5017622 markings, 9125123 edges, 239373 markings/sec, 15 secs
lola: 6159086 markings, 11220910 edges, 228293 markings/sec, 20 secs
lola: 7351600 markings, 13389824 edges, 238503 markings/sec, 25 secs
lola: 8498621 markings, 15491604 edges, 229404 markings/sec, 30 secs
lola: 9609156 markings, 17526564 edges, 222107 markings/sec, 35 secs
lola: 10707901 markings, 19552314 edges, 219749 markings/sec, 40 secs
lola: 11818778 markings, 21598048 edges, 222175 markings/sec, 45 secs
lola: 12889505 markings, 23575306 edges, 214145 markings/sec, 50 secs
lola: 13925384 markings, 25491382 edges, 207176 markings/sec, 55 secs
lola: 15009274 markings, 27485421 edges, 216778 markings/sec, 60 secs
lola: 16084431 markings, 29457800 edges, 215031 markings/sec, 65 secs
lola: 17171012 markings, 31460593 edges, 217316 markings/sec, 70 secs
lola: 18224969 markings, 33405271 edges, 210791 markings/sec, 75 secs
lola: 19304223 markings, 35396943 edges, 215851 markings/sec, 80 secs
lola: 20382127 markings, 37390982 edges, 215581 markings/sec, 85 secs
lola: 21421226 markings, 39321456 edges, 207820 markings/sec, 90 secs
lola: 22461656 markings, 41240127 edges, 208086 markings/sec, 95 secs
lola: 23520733 markings, 43197713 edges, 211815 markings/sec, 100 secs
lola: 24622115 markings, 45216542 edges, 220276 markings/sec, 105 secs
lola: 25666772 markings, 47157134 edges, 208931 markings/sec, 110 secs
lola: 26798037 markings, 49225431 edges, 226253 markings/sec, 115 secs
lola: 27838594 markings, 51145659 edges, 208111 markings/sec, 120 secs
lola: 28902050 markings, 53105697 edges, 212691 markings/sec, 125 secs
lola: 29907760 markings, 54975418 edges, 201142 markings/sec, 130 secs
lola: 30995358 markings, 56973345 edges, 217520 markings/sec, 135 secs
lola: 32074905 markings, 58960824 edges, 215909 markings/sec, 140 secs
lola: 33120122 markings, 60893024 edges, 209043 markings/sec, 145 secs
lola: 34133765 markings, 62775426 edges, 202729 markings/sec, 150 secs
lola: 35184180 markings, 64718004 edges, 210083 markings/sec, 155 secs
lola: 36239127 markings, 66663879 edges, 210989 markings/sec, 160 secs
lola: 37226483 markings, 68503391 edges, 197471 markings/sec, 165 secs
lola: 38279465 markings, 70446098 edges, 210596 markings/sec, 170 secs
lola: 39299253 markings, 72337201 edges, 203958 markings/sec, 175 secs
lola: 40316153 markings, 74228260 edges, 203380 markings/sec, 180 secs
lola: 41322002 markings, 76093954 edges, 201170 markings/sec, 185 secs
lola: 42323467 markings, 77958436 edges, 200293 markings/sec, 190 secs
lola: 43338409 markings, 79844979 edges, 202988 markings/sec, 195 secs
lola: 44329617 markings, 81694750 edges, 198242 markings/sec, 200 secs
lola: 45312626 markings, 83530880 edges, 196602 markings/sec, 205 secs
lola: 46315585 markings, 85401015 edges, 200592 markings/sec, 210 secs
lola: 47334606 markings, 87273338 edges, 203804 markings/sec, 215 secs
lola: 48376641 markings, 89184422 edges, 208407 markings/sec, 220 secs
lola: 49399730 markings, 91080328 edges, 204618 markings/sec, 225 secs
lola: 50416440 markings, 92957180 edges, 203342 markings/sec, 230 secs
lola: 51418170 markings, 94806329 edges, 200346 markings/sec, 235 secs
lola: 52382140 markings, 96609585 edges, 192794 markings/sec, 240 secs
lola: 53375498 markings, 98459057 edges, 198672 markings/sec, 245 secs
lola: 54351494 markings, 100281137 edges, 195199 markings/sec, 250 secs
lola: 55309108 markings, 102076463 edges, 191523 markings/sec, 255 secs
lola: 56288104 markings, 103893061 edges, 195799 markings/sec, 260 secs
lola: 57312261 markings, 105793334 edges, 204831 markings/sec, 265 secs
lola: 58234971 markings, 107514835 edges, 184542 markings/sec, 270 secs
lola: 59185964 markings, 109301838 edges, 190199 markings/sec, 275 secs
lola: 60204414 markings, 111171304 edges, 203690 markings/sec, 280 secs
lola: 61201748 markings, 113025371 edges, 199467 markings/sec, 285 secs
lola: 62205296 markings, 114890274 edges, 200710 markings/sec, 290 secs
lola: 63202615 markings, 116752238 edges, 199464 markings/sec, 295 secs
lola: 64214032 markings, 118617523 edges, 202283 markings/sec, 300 secs
lola: 65234799 markings, 120498879 edges, 204153 markings/sec, 305 secs
lola: 66237899 markings, 122364142 edges, 200620 markings/sec, 310 secs
lola: 67254803 markings, 124243489 edges, 203381 markings/sec, 315 secs
lola: 68279731 markings, 126142907 edges, 204986 markings/sec, 320 secs
lola: 69264359 markings, 127984537 edges, 196926 markings/sec, 325 secs
lola: 70262575 markings, 129840559 edges, 199643 markings/sec, 330 secs
lola: 71295951 markings, 131759684 edges, 206675 markings/sec, 335 secs
lola: 72291568 markings, 133614911 edges, 199123 markings/sec, 340 secs
lola: 73274773 markings, 135446960 edges, 196641 markings/sec, 345 secs
lola: 74262694 markings, 137286554 edges, 197584 markings/sec, 350 secs
lola: 75253847 markings, 139128956 edges, 198231 markings/sec, 355 secs
lola: 76255367 markings, 140968005 edges, 200304 markings/sec, 360 secs
lola: 77262590 markings, 142828389 edges, 201445 markings/sec, 365 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no no unknown yes no no no yes yes yes no no yes yes no
lola:
preliminary result: yes no no unknown yes no no no yes yes yes no no yes yes no
lola: memory consumption: 25100 KB
lola: time consumption: 776 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1589920973948

--------------------
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="Raft-PT-05"
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 Raft-PT-05, 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 r150-smll-158961529300061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Raft-PT-05.tgz
mv Raft-PT-05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;