Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r104-oct2-155272226200591.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is PhaseVariation-PT-D02CS100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272226200591
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 4.5K Feb 12 04:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 04:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Feb 8 03:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 03:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 00:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 00:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 4 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 4 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 1 02:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 1 02:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 61K Mar 10 17:31 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 PhaseVariation-PT-D02CS100-LTLCardinality-00
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-01
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-02
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-03
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-04
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-05
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-06
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-07
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-08
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-09
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-10
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-11
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-12
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-13
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-14
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552809601020

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PhaseVariation-PT-D02CS100 @ 3570 seconds

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2683
rslt: Output for LTLCardinality @ PhaseVariation-PT-D02CS100

{
"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 Mar 17 08:00:01 2019
",
"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": 36
},
"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": 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": "(cell___1_2__B_ <= pool__1_2_)",
"processed_size": 30,
"rewrites": 36
},
"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": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (G ((3 <= cell___2_2__B_)))))",
"processed_size": 37,
"rewrites": 36
},
"result":
{
"edges": 105,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 36
},
"result":
{
"edges": 8,
"markings": 9,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (F ((2 <= cell___2_2__B_))))",
"processed_size": 33,
"rewrites": 36
},
"result":
{
"edges": 105,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A ((X (G ((cell___2_1__B_ <= run_dot))) U (3 <= cell___1_2__B_)))",
"processed_size": 65,
"rewrites": 36
},
"result":
{
"edges": 106,
"markings": 106,
"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": 36
},
"result":
{
"edges": 8,
"markings": 9,
"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
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A ((X (TRUE) OR (G ((run_dot <= pool__1_2_)) AND X (TRUE))))",
"processed_size": 60,
"rewrites": 36
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 445
},
"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 (X (G ((F ((size_dot <= pool__2_2_)) AND ((cell___1_2__B_ <= run_dot) OR (size_dot <= pool__2_2_))))))",
"processed_size": 104,
"rewrites": 36
},
"result":
{
"edges": 105,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 521
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (X ((pool__1_2_ <= pool__2_2_))))",
"processed_size": 38,
"rewrites": 36
},
"result":
{
"edges": 105,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 625
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((cell___2_1__B_ <= cell___1_1__A_)))",
"processed_size": 42,
"rewrites": 38
},
"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": 782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((pool__1_2_ <= cell___2_1__A_)))",
"processed_size": 38,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 12,
"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": 1043
},
"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": "(cell___1_2__B_ + 1 <= cell___2_2__A_)",
"processed_size": 38,
"rewrites": 38
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 28
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1564
},
"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 (G (F ((cell___2_1__A_ <= pool__2_1_))))",
"processed_size": 42,
"rewrites": 36
},
"result":
{
"edges": 105,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"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": 3129
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 3,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A ((((3 <= pool__2_2_) U (pool__1_1_ <= cell___2_2__A_)) U ((cell___2_2__A_ <= pool__1_1_) U (size_dot <= pool__2_2_))))",
"processed_size": 120,
"rewrites": 36
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"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": 18332,
"runtime": 863.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(F(**))) : A(X(TRUE)) : A(X(X(G(**)))) : A(X(TRUE)) : A(G(F(**))) : FALSE : A(G(**)) : A(G(**)) : A((X(G(**)) U **)) : ** : A((X(TRUE) OR (G(**) AND X(TRUE)))) : A(X(G((F(**) AND (** OR **))))) : A(X(F(**))) : A(F(**)) : A(((** U **) U (** U **))) : A(X(X(**)))"
},
"net":
{
"arcs": 443,
"conflict_clusters": 1,
"places": 14,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 65
},
"result":
{
"preliminary_value": "no yes no yes no no no no no yes yes no unknown yes yes no ",
"value": "no yes no yes no no no no no yes yes no unknown 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: 79/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 65 transitions, 9 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 true: (cell___1_1__A_ <= size_dot)
lola: atomic prop true by contained trap!
lola: atomic prop true by contained trap!
lola: LP says that atomic proposition is always false: (size_dot <= cell___1_2__B_)
lola: atomic prop true by contained trap!
lola: A (F (((cell___2_1__A_ <= cell___1_2__B_) U X ((2 <= cell___2_2__B_))))) : A (X (F ((cell___1_1__A_ <= size_dot)))) : A (G (X (G (X ((3 <= cell___2_2__B_)))))) : A (F (X (((1 <= size_dot) U (1 <= size_dot))))) : A (X (G (G (F ((cell___2_1__A_ <= pool__2_1_)))))) : A ((G (G ((3 <= cell___2_2__A_))) U ((cell___2_1__A_ <= pool__1_1_) U (size_dot <= cell___1_2__B_)))) : A (G ((cell___2_1__B_ <= cell___1_1__A_))) : A (G ((pool__1_2_ <= cell___2_1__A_))) : A ((X (G ((cell___2_1__B_ <= run_dot))) U (3 <= cell___1_2__B_))) : A ((cell___1_2__B_ <= pool__1_2_)) : A ((G (G ((run_dot <= pool__1_2_))) U G (X ((1 <= cell___1_1__A_))))) : A (X (G (((cell___1_2__B_ <= run_dot) U (size_dot <= pool__2_2_))))) : A ((X (F ((3 <= cell___2_1__A_))) U X (F ((run_dot <= cell___2_1__B_))))) : A (F ((cell___2_2__A_ <= cell___1_2__B_))) : A ((((3 <= pool__2_2_) U (pool__1_1_ <= cell___2_2__A_)) U ((cell___2_2__A_ <= pool__1_1_) U (size_dot <= pool__2_2_)))) : A (X (X ((pool__1_2_ <= pool__2_2_))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 36 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: (cell___1_2__B_ <= pool__1_2_)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (cell___1_2__B_ <= pool__1_2_)
lola: processed formula length: 30
lola: 36 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 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((3 <= cell___2_2__B_)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((3 <= cell___2_2__B_)))))
lola: processed formula length: 37
lola: 36 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: 105 markings, 105 edges
lola: ========================================
lola: subprocess 3 will run for 274 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: 36 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= cell___2_2__B_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= cell___2_2__B_))))
lola: processed formula length: 33
lola: 36 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: 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: 105 markings, 105 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((cell___2_1__B_ <= run_dot))) U (3 <= cell___1_2__B_)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((cell___2_1__B_ <= run_dot))) U (3 <= cell___1_2__B_)))
lola: processed formula length: 65
lola: 36 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: 106 markings, 106 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: 36 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (TRUE) OR (G ((run_dot <= pool__1_2_)) AND X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (TRUE) OR (G ((run_dot <= pool__1_2_)) AND X (TRUE))))
lola: processed formula length: 60
lola: 36 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((size_dot <= pool__2_2_)) AND ((cell___1_2__B_ <= run_dot) OR (size_dot <= pool__2_2_))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((size_dot <= pool__2_2_)) AND ((cell___1_2__B_ <= run_dot) OR (size_dot <= pool__2_2_))))))
lola: processed formula length: 104
lola: 36 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: 105 markings, 105 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((run_dot <= cell___2_1__B_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((run_dot <= cell___2_1__B_))))
lola: processed formula length: 39
lola: 36 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 825442 markings, 16339029 edges, 165088 markings/sec, 0 secs
lola: 1648835 markings, 32262530 edges, 164679 markings/sec, 5 secs
lola: 2450396 markings, 47781922 edges, 160312 markings/sec, 10 secs
lola: 3266275 markings, 63584676 edges, 163176 markings/sec, 15 secs
lola: 4087077 markings, 79479305 edges, 164160 markings/sec, 20 secs
lola: 4904017 markings, 95303141 edges, 163388 markings/sec, 25 secs
lola: 5746379 markings, 111539262 edges, 168472 markings/sec, 30 secs
lola: 6579755 markings, 127661524 edges, 166675 markings/sec, 35 secs
lola: 7415162 markings, 143615946 edges, 167081 markings/sec, 40 secs
lola: 8167129 markings, 158020764 edges, 150393 markings/sec, 45 secs
lola: 8911759 markings, 172403873 edges, 148926 markings/sec, 50 secs
lola: 9646601 markings, 186612491 edges, 146968 markings/sec, 55 secs
lola: 10385503 markings, 200972790 edges, 147780 markings/sec, 60 secs
lola: 11127133 markings, 215324359 edges, 148326 markings/sec, 65 secs
lola: 11869579 markings, 229665979 edges, 148489 markings/sec, 70 secs
lola: 12620491 markings, 244187086 edges, 150182 markings/sec, 75 secs
lola: 13373403 markings, 258748120 edges, 150582 markings/sec, 80 secs
lola: 14153804 markings, 273827630 edges, 156080 markings/sec, 85 secs
lola: 14726120 markings, 289782871 edges, 114463 markings/sec, 90 secs
lola: 15320049 markings, 305229369 edges, 118786 markings/sec, 95 secs
lola: 15910901 markings, 320659663 edges, 118170 markings/sec, 100 secs
lola: 16487685 markings, 335746714 edges, 115357 markings/sec, 105 secs
lola: 17071905 markings, 351042355 edges, 116844 markings/sec, 110 secs
lola: 17665935 markings, 366613681 edges, 118806 markings/sec, 115 secs
lola: 18244439 markings, 381657508 edges, 115701 markings/sec, 120 secs
lola: 18831599 markings, 396996068 edges, 117432 markings/sec, 125 secs
lola: 19419602 markings, 412386901 edges, 117601 markings/sec, 130 secs
lola: 20017239 markings, 428048136 edges, 119527 markings/sec, 135 secs
lola: 20607651 markings, 443503225 edges, 118082 markings/sec, 140 secs
lola: 21277417 markings, 459622482 edges, 133953 markings/sec, 145 secs
lola: 22034073 markings, 474129929 edges, 151331 markings/sec, 150 secs
lola: 22778124 markings, 488491248 edges, 148810 markings/sec, 155 secs
lola: 23502984 markings, 502498324 edges, 144972 markings/sec, 160 secs
lola: 24237038 markings, 516711082 edges, 146811 markings/sec, 165 secs
lola: 24975526 markings, 531054839 edges, 147698 markings/sec, 170 secs
lola: 25705902 markings, 545159558 edges, 146075 markings/sec, 175 secs
lola: 26446346 markings, 559474594 edges, 148089 markings/sec, 180 secs
lola: 27197194 markings, 573993458 edges, 150170 markings/sec, 185 secs
lola: 27950290 markings, 588570438 edges, 150619 markings/sec, 190 secs
lola: 28563597 markings, 603568538 edges, 122661 markings/sec, 195 secs
lola: 29101358 markings, 617552493 edges, 107552 markings/sec, 200 secs
lola: 29646688 markings, 631812310 edges, 109066 markings/sec, 205 secs
lola: 30171746 markings, 645538242 edges, 105012 markings/sec, 210 secs
lola: 30702586 markings, 659413359 edges, 106168 markings/sec, 215 secs
lola: 31235693 markings, 673350235 edges, 106621 markings/sec, 220 secs
lola: 31780039 markings, 687585211 edges, 108869 markings/sec, 225 secs
lola: 32305590 markings, 701315953 edges, 105110 markings/sec, 230 secs
lola: 32839046 markings, 715262354 edges, 106691 markings/sec, 235 secs
lola: 33375644 markings, 729294917 edges, 107320 markings/sec, 240 secs
lola: 33926386 markings, 743636314 edges, 110148 markings/sec, 245 secs
lola: 34467046 markings, 757733431 edges, 108132 markings/sec, 250 secs
lola: 35025990 markings, 772198165 edges, 111789 markings/sec, 255 secs
lola: 35606654 markings, 788079202 edges, 116133 markings/sec, 260 secs
lola: 36192501 markings, 803318779 edges, 117169 markings/sec, 265 secs
lola: 36786835 markings, 818834139 edges, 118867 markings/sec, 270 secs
lola: 37351447 markings, 833604726 edges, 112922 markings/sec, 275 secs
lola: 37926239 markings, 848652627 edges, 114958 markings/sec, 280 secs
lola: 38504297 markings, 863788927 edges, 115612 markings/sec, 285 secs
lola: 39087291 markings, 879059070 edges, 116599 markings/sec, 290 secs
lola: 39658367 markings, 893894164 edges, 114215 markings/sec, 295 secs
lola: 40236765 markings, 909008902 edges, 115680 markings/sec, 300 secs
lola: 40823986 markings, 924378612 edges, 117444 markings/sec, 305 secs
lola: 41407703 markings, 939669285 edges, 116743 markings/sec, 310 secs
lola: 41997149 markings, 955107138 edges, 117889 markings/sec, 315 secs
lola: 42698897 markings, 970117556 edges, 140350 markings/sec, 320 secs
lola: 43404539 markings, 983635317 edges, 141128 markings/sec, 325 secs
lola: 44104725 markings, 997149195 edges, 140037 markings/sec, 330 secs
lola: 44796205 markings, 1010598952 edges, 138296 markings/sec, 335 secs
lola: 45505787 markings, 1024288931 edges, 141916 markings/sec, 340 secs
lola: 46213001 markings, 1037951167 edges, 141443 markings/sec, 345 secs
lola: 46906977 markings, 1051441300 edges, 138795 markings/sec, 350 secs
lola: 47616373 markings, 1065134269 edges, 141879 markings/sec, 355 secs
lola: 48335389 markings, 1079029488 edges, 143803 markings/sec, 360 secs
lola: 49050542 markings, 1092941442 edges, 143031 markings/sec, 365 secs
lola: 49649962 markings, 1107238672 edges, 119884 markings/sec, 370 secs
lola: 50165215 markings, 1120605828 edges, 103051 markings/sec, 375 secs
lola: 50681661 markings, 1134092189 edges, 103289 markings/sec, 380 secs
lola: 51188085 markings, 1147319137 edges, 101285 markings/sec, 385 secs
lola: 51691199 markings, 1160455001 edges, 100623 markings/sec, 390 secs
lola: 52197429 markings, 1173684371 edges, 101246 markings/sec, 395 secs
lola: 52702605 markings, 1186892840 edges, 101035 markings/sec, 400 secs
lola: 53204889 markings, 1200071602 edges, 100457 markings/sec, 405 secs
lola: 53695857 markings, 1212931826 edges, 98194 markings/sec, 410 secs
lola: 54199325 markings, 1226069737 edges, 100694 markings/sec, 415 secs
lola: 54365875 markings, 1230376184 edges, 33310 markings/sec, 420 secs
lola: 54367127 markings, 1230406649 edges, 250 markings/sec, 425 secs
lola: 54388493 markings, 1230980632 edges, 4273 markings/sec, 430 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((pool__1_2_ <= pool__2_2_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((pool__1_2_ <= pool__2_2_))))
lola: processed formula length: 38
lola: 36 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: 105 markings, 105 edges
lola: ========================================
lola: subprocess 11 will run for 625 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___2_1__B_ <= cell___1_1__A_)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((cell___2_1__B_ <= cell___1_1__A_)))
lola: processed formula length: 42
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (cell___1_1__A_ + 1 <= cell___2_1__B_)
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 782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((pool__1_2_ <= cell___2_1__A_)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((pool__1_2_ <= cell___2_1__A_)))
lola: processed formula length: 38
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (cell___2_1__A_ + 1 <= pool__1_2_)
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: 0 markings, 0 edges
lola: subprocess 13 will run for 1043 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((cell___2_2__A_ <= cell___1_2__B_)))
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: (cell___1_2__B_ + 1 <= cell___2_2__A_)
lola: processed formula length: 38
lola: 38 rewrites
lola: closed formula file LTLCardinality.xml
lola: ========================================
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 14 will run for 1564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((cell___2_1__A_ <= pool__2_1_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((cell___2_1__A_ <= pool__2_1_))))
lola: processed formula length: 42
lola: 36 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: 105 markings, 105 edges
lola: ========================================
lola: subprocess 15 will run for 3129 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= pool__2_2_) U (pool__1_1_ <= cell___2_2__A_)) U ((cell___2_2__A_ <= pool__1_1_) U (size_dot <= pool__2_2_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= pool__2_2_) U (pool__1_1_ <= cell___2_2__A_)) U ((cell___2_2__A_ <= pool__1_1_) U (size_dot <= pool__2_2_))))
lola: processed formula length: 120
lola: 36 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: ========================================
lola: ...considering subproblem: A (X (F ((run_dot <= cell___2_1__B_))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((run_dot <= cell___2_1__B_))))
lola: processed formula length: 39
lola: 36 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: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 827112 markings, 16372929 edges, 165422 markings/sec, 0 secs
lola: 1654685 markings, 32381670 edges, 165515 markings/sec, 5 secs
lola: 2461483 markings, 48000106 edges, 161360 markings/sec, 10 secs
lola: 3283359 markings, 63924057 edges, 164375 markings/sec, 15 secs
lola: 4103834 markings, 79811742 edges, 164095 markings/sec, 20 secs
lola: 4921889 markings, 95635520 edges, 163611 markings/sec, 25 secs
lola: 5765443 markings, 111904960 edges, 168711 markings/sec, 30 secs
lola: 6599484 markings, 128047501 edges, 166808 markings/sec, 35 secs
lola: 7426713 markings, 143850052 edges, 165446 markings/sec, 40 secs
lola: 8175699 markings, 158186747 edges, 149797 markings/sec, 45 secs
lola: 8921783 markings, 172606677 edges, 149217 markings/sec, 50 secs
lola: 9657587 markings, 186828068 edges, 147161 markings/sec, 55 secs
lola: 10395485 markings, 201135861 edges, 147580 markings/sec, 60 secs
lola: 11136019 markings, 215500412 edges, 148107 markings/sec, 65 secs
lola: 11877913 markings, 229835439 edges, 148379 markings/sec, 70 secs
lola: 12630459 markings, 244381941 edges, 150509 markings/sec, 75 secs
lola: 13384839 markings, 258972828 edges, 150876 markings/sec, 80 secs
lola: 14160269 markings, 274072714 edges, 155086 markings/sec, 85 secs
lola: 14734285 markings, 289994904 edges, 114803 markings/sec, 90 secs
lola: 15329795 markings, 305471511 edges, 119102 markings/sec, 95 secs
lola: 15921105 markings, 320928472 edges, 118262 markings/sec, 100 secs
lola: 16497675 markings, 336018082 edges, 115314 markings/sec, 105 secs
lola: 17081329 markings, 351299261 edges, 116731 markings/sec, 110 secs
lola: 17677885 markings, 366930382 edges, 119311 markings/sec, 115 secs
lola: 18256493 markings, 381962739 edges, 115722 markings/sec, 120 secs
lola: 18843794 markings, 397319479 edges, 117460 markings/sec, 125 secs
lola: 19434411 markings, 412782067 edges, 118123 markings/sec, 130 secs
lola: 20036425 markings, 428562360 edges, 120403 markings/sec, 135 secs
lola: 20640221 markings, 444271183 edges, 120759 markings/sec, 140 secs
lola: 21329376 markings, 460633502 edges, 137831 markings/sec, 145 secs
lola: 22092938 markings, 475279471 edges, 152712 markings/sec, 150 secs
lola: 22831990 markings, 489554967 edges, 147810 markings/sec, 155 secs
lola: 23562839 markings, 503676082 edges, 146170 markings/sec, 160 secs
lola: 24311538 markings, 518151671 edges, 149740 markings/sec, 165 secs
lola: 25051202 markings, 532457636 edges, 147933 markings/sec, 170 secs
lola: 25781186 markings, 546657207 edges, 145997 markings/sec, 175 secs
lola: 26518354 markings, 560891824 edges, 147434 markings/sec, 180 secs
lola: 27272610 markings, 575473497 edges, 150851 markings/sec, 185 secs
lola: 28048158 markings, 590186791 edges, 155110 markings/sec, 190 secs
lola: 28626179 markings, 605125130 edges, 115604 markings/sec, 195 secs
lola: 29161698 markings, 619062963 edges, 107104 markings/sec, 200 secs
lola: 29711924 markings, 633436998 edges, 110045 markings/sec, 205 secs
lola: 30238992 markings, 647208740 edges, 105414 markings/sec, 210 secs
lola: 30785591 markings, 661497441 edges, 109320 markings/sec, 215 secs
lola: 31328533 markings, 675692985 edges, 108588 markings/sec, 220 secs
lola: 31885462 markings, 690255987 edges, 111386 markings/sec, 225 secs
lola: 32426284 markings, 704394944 edges, 108164 markings/sec, 230 secs
lola: 32977317 markings, 718803857 edges, 110207 markings/sec, 235 secs
lola: 33522025 markings, 733048276 edges, 108942 markings/sec, 240 secs
lola: 34075114 markings, 747518431 edges, 110618 markings/sec, 245 secs
lola: 34621206 markings, 761796023 edges, 109218 markings/sec, 250 secs
lola: 35218332 markings, 776561711 edges, 119425 markings/sec, 255 secs
lola: 35782219 markings, 792602785 edges, 112777 markings/sec, 260 secs
lola: 36331759 markings, 806973744 edges, 109908 markings/sec, 265 secs
lola: 36875577 markings, 821194052 edges, 108764 markings/sec, 270 secs
lola: 37435137 markings, 835834475 edges, 111912 markings/sec, 275 secs
lola: 37998719 markings, 850584972 edges, 112716 markings/sec, 280 secs
lola: 38584793 markings, 865841856 edges, 117215 markings/sec, 285 secs
lola: 39163970 markings, 880966104 edges, 115835 markings/sec, 290 secs
lola: 39712443 markings, 895310892 edges, 109695 markings/sec, 295 secs
lola: 40268015 markings, 909835218 edges, 111114 markings/sec, 300 secs
lola: 40820663 markings, 924295270 edges, 110530 markings/sec, 305 secs
lola: 41361377 markings, 938432239 edges, 108143 markings/sec, 310 secs
lola: 41915969 markings, 952937940 edges, 110918 markings/sec, 315 secs
lola: 42563873 markings, 967503200 edges, 129581 markings/sec, 320 secs
lola: 43273211 markings, 981062592 edges, 141868 markings/sec, 325 secs
lola: 43979585 markings, 994781415 edges, 141275 markings/sec, 330 secs
lola: 44679885 markings, 1008289932 edges, 140060 markings/sec, 335 secs
lola: 45391553 markings, 1022056746 edges, 142334 markings/sec, 340 secs
lola: 46111165 markings, 1036038434 edges, 143922 markings/sec, 345 secs
lola: 46814711 markings, 1049615140 edges, 140709 markings/sec, 350 secs
lola: 47530797 markings, 1063455657 edges, 143217 markings/sec, 355 secs
lola: 48260107 markings, 1077648230 edges, 145862 markings/sec, 360 secs
lola: 48979921 markings, 1091538750 edges, 143963 markings/sec, 365 secs
lola: 49604202 markings, 1106028373 edges, 124856 markings/sec, 370 secs
lola: 50125047 markings, 1119538173 edges, 104169 markings/sec, 375 secs
lola: 50645375 markings, 1133128604 edges, 104066 markings/sec, 380 secs
lola: 51159553 markings, 1146564413 edges, 102836 markings/sec, 385 secs
lola: 51667861 markings, 1159844251 edges, 101662 markings/sec, 390 secs
lola: 52184817 markings, 1173356781 edges, 103391 markings/sec, 395 secs
lola: 52698111 markings, 1186772118 edges, 102659 markings/sec, 400 secs
lola: 53214487 markings, 1200282148 edges, 103275 markings/sec, 405 secs
lola: 53720361 markings, 1213589149 edges, 101175 markings/sec, 410 secs
lola: 54238645 markings, 1227123816 edges, 103657 markings/sec, 415 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no no yes yes no unknown yes yes no
lola:
preliminary result: no yes no yes no no no no no yes yes no unknown yes yes no
lola: memory consumption: 18332 KB
lola: time consumption: 863 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1552810488252

--------------------
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="PhaseVariation-PT-D02CS100"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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-3954"
echo " Executing tool lola"
echo " Input is PhaseVariation-PT-D02CS100, 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 r104-oct2-155272226200591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D02CS100.tgz
mv PhaseVariation-PT-D02CS100 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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
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 ;