About the Execution of LoLA for Philosophers-PT-000020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5132.160 | 201339.00 | 185316.00 | 62.50 | FFFFFFFFFFFTFFFT | normal |
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-155272226500807.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 Philosophers-PT-000020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r104-oct2-155272226500807
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 10K Feb 12 04:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 12 04:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 8 03:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 8 03:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 7.2K Feb 5 00:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 5 00:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 1 02:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 82K 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 Philosophers-PT-000020-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552820716264
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Philosophers-PT-000020 @ 3570 seconds
FORMULA Philosophers-PT-000020-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Philosophers-PT-000020-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3369
rslt: Output for LTLCardinality @ Philosophers-PT-000020
{
"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": "Sun Mar 17 11:05:16 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": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "(Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1)",
"processed_size": 382,
"rewrites": 21
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "(1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)",
"processed_size": 235,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": "(Catch2_16 <= Catch2_20)",
"processed_size": 24,
"rewrites": 21
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X (F ((Fork_19 <= Fork_6))))",
"processed_size": 31,
"rewrites": 21
},
"result":
{
"edges": 55,
"markings": 55,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (X (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1))))",
"processed_size": 414,
"rewrites": 21
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 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 ((Catch1_1 <= Eat_12)))",
"processed_size": 28,
"rewrites": 23
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"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 ((Catch1_11 <= Fork_7)))",
"processed_size": 29,
"rewrites": 23
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"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": 396
},
"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": "(Catch1_16 + 1 <= Catch2_19)",
"processed_size": 28,
"rewrites": 23
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 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 ((Catch1_17 <= Fork_5))))",
"processed_size": 33,
"rewrites": 21
},
"result":
{
"edges": 232,
"markings": 166,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((Fork_9 <= Eat_1))))",
"processed_size": 29,
"rewrites": 21
},
"result":
{
"edges": 27,
"markings": 24,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((Think_19 <= Fork_20))))",
"processed_size": 33,
"rewrites": 21
},
"result":
{
"edges": 140,
"markings": 108,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20))))",
"processed_size": 434,
"rewrites": 21
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "A ((((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20) U (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)) U G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1))))",
"processed_size": 1057,
"rewrites": 21
},
"result":
{
"edges": 146,
"markings": 105,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 80,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 80,
"visible_transitions": 0
},
"processed": "A ((F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20)) U G ((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))))",
"processed_size": 881,
"rewrites": 21
},
"result":
{
"edges": 27,
"markings": 26,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1783
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (F (G ((2 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))))",
"processed_size": 247,
"rewrites": 21
},
"result":
{
"edges": 112535190,
"markings": 25367378,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3393
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3393
},
"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": 40,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 40,
"visible_transitions": 0
},
"processed": "A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20))))",
"processed_size": 474,
"rewrites": 21
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 20492,
"runtime": 177.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A((F(**) U G(**))) : A(X(G(**))) : A(((** U **) U G(**))) : ** : (A(F(G(**))) AND A(G((F(**) OR G(**))))) : (A(G(F(**))) AND A(G((** OR **)))) : A(G(F(**))) : ** : A(G(F(**))) : A(G(**)) : A(X(F(**))) : ** : A(G(**)) : A(G(F(**))) : A(F(G(**))) : A(F(**))"
},
"net":
{
"arcs": 320,
"conflict_clusters": 21,
"places": 100,
"places_significant": 60,
"singleton_clusters": 0,
"transitions": 100
},
"result":
{
"preliminary_value": "no no no no no no no no no no no yes no no no yes ",
"value": "no no no no no no no no no no no yes no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 200/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 100 transitions, 60 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: A ((F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20)) U G (G ((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))))) : A (X (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1)))) : A ((((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20) U (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)) U G ((Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1)))) : A ((Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1)) : A (G ((F ((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20)) U G ((2 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))))) : A (G (((2 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1) U (Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch1_18 + Catch1_19 + Catch1_20)))) : A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20)))) : A ((1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)) : A (((Fork_11 <= Eat_8) U G (F ((Think_19 <= Fork_20))))) : A (G ((Catch1_1 <= Eat_12))) : A (X (F ((Fork_19 <= Fork_6)))) : A ((Catch2_16 <= Catch2_20)) : A (G (G (G ((Catch1_11 <= Fork_7))))) : A ((F (X ((Fork_3 <= Think_1))) U G (F ((Catch1_17 <= Fork_5))))) : A (G (F (X (G ((Fork_9 <= Eat_1)))))) : A (F (F (F (F ((Catch2_19 <= Catch1_16))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_2 + Eat_1)
lola: processed formula length: 382
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)
lola: processed formula length: 235
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Catch2_16 <= Catch2_20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Catch2_16 <= Catch2_20)
lola: processed formula length: 24
lola: 21 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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((Fork_19 <= Fork_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Fork_19 <= Fork_6))))
lola: processed formula length: 31
lola: 21 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: 55 markings, 55 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Eat_20 + Eat_19 + Eat_18 + Eat_17 + Eat_16 + Eat_15 + Eat_14 + Eat_13 + Eat_12 + Eat_11 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat... (shortened)
lola: processed formula length: 414
lola: 21 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Catch1_1 <= Eat_12)))
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 ((Catch1_1 <= Eat_12)))
lola: processed formula length: 28
lola: 23 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: (Eat_12 + 1 <= Catch1_1)
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: 2 markings, 1 edges
lola: lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)state equation: write sara problem file to LTLCardinality-5-0.sara
lola: ========================================
lola: ...considering subproblem: A (G ((Catch1_11 <= Fork_7)))
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 ((Catch1_11 <= Fork_7)))
lola: processed formula length: 29
lola: 23 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: (Fork_7 + 1 <= Catch1_11)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Catch2_19 <= Catch1_16)))
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: (Catch1_16 + 1 <= Catch2_19)
lola: processed formula length: 28
lola: 23 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (F ((Catch1_17 <= Fork_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Catch1_17 <= Fork_5))))
lola: lola: state equation: calling and running saraprocessed formula length: 33
lola: 21 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: 166 markings, 232 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Fork_9 <= Eat_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Fork_9 <= Eat_1))))
lola: processed formula length: 29
lola: 21 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: 24 markings, 27 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Think_19 <= Fork_20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Think_19 <= Fork_20))))
lola: processed formula length: 33
lola: 21 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: 108 markings, 140 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17... (shortened)
lola: processed formula length: 434
lola: 21 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20) U (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= Think_1 + Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_10 + Think_11 + Think_12 + Think_13 + Think_14 + Think_15 + Think_16 + Think_17 + Think_18 + Think_19 + Think_20) U (Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch... (shortened)
lola: processed formula length: 1057
lola: 21 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: 105 markings, 146 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((Fork_1 + Fork_2 + Fork_3 + Fork_4 + Fork_5 + Fork_6 + Fork_7 + Fork_8 + Fork_9 + Fork_10 + Fork_11 + Fork_12 + Fork_13 + Fork_14 + Fork_15 + Fork_16 + Fork_17 + Fork_18 + Fork_19 + Fork_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 + Catch1_15 + Catch1_16 + Catch1_17 + Catch... (shortened)
lola: processed formula length: 881
lola: 21 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 26 markings, 27 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((2 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20)))) AND A (G ((F ((1 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20))))
lola: processed formula length: 247
lola: 21 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
sara: try reading problem file LTLCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: 1201840 markings, 4381897 edges, 240368 markings/sec, 0 secs
lola: 2115767 markings, 8090601 edges, 182785 markings/sec, 5 secs
lola: 2966779 markings, 11670740 edges, 170202 markings/sec, 10 secs
lola: 3838490 markings, 15308497 edges, 174342 markings/sec, 15 secs
lola: 4643089 markings, 18937023 edges, 160920 markings/sec, 20 secs
lola: 5472175 markings, 22431827 edges, 165817 markings/sec, 25 secs
lola: 6248074 markings, 25897343 edges, 155180 markings/sec, 30 secs
lola: 6995769 markings, 29280039 edges, 149539 markings/sec, 35 secs
lola: 7785203 markings, 32836077 edges, 157887 markings/sec, 40 secs
lola: 8568623 markings, 36282098 edges, 156684 markings/sec, 45 secs
lola: 9306813 markings, 39714789 edges, 147638 markings/sec, 50 secs
lola: 10093782 markings, 43151962 edges, 157394 markings/sec, 55 secs
lola: 10823565 markings, 46569067 edges, 145957 markings/sec, 60 secs
lola: 11428206 markings, 49115129 edges, 120928 markings/sec, 65 secs
lola: 11955092 markings, 51537308 edges, 105377 markings/sec, 70 secs
lola: 12521761 markings, 54031825 edges, 113334 markings/sec, 75 secs
lola: 13060696 markings, 56443654 edges, 107787 markings/sec, 80 secs
lola: 13655580 markings, 59270572 edges, 118977 markings/sec, 85 secs
lola: 14382544 markings, 62384378 edges, 145393 markings/sec, 90 secs
lola: 15057413 markings, 65522736 edges, 134974 markings/sec, 95 secs
lola: 15736971 markings, 68596021 edges, 135912 markings/sec, 100 secs
lola: 16400332 markings, 71762359 edges, 132672 markings/sec, 105 secs
lola: 17087254 markings, 74885167 edges, 137384 markings/sec, 110 secs
lola: 17810165 markings, 78170412 edges, 144582 markings/sec, 115 secs
lola: 18537593 markings, 81492650 edges, 145486 markings/sec, 120 secs
lola: 19295814 markings, 84825309 edges, 151644 markings/sec, 125 secs
lola: 20061797 markings, 88223242 edges, 153197 markings/sec, 130 secs
lola: 20806509 markings, 91540134 edges, 148942 markings/sec, 135 secs
lola: 21526800 markings, 95049959 edges, 144058 markings/sec, 140 secs
lola: 22301896 markings, 98432627 edges, 155019 markings/sec, 145 secs
lola: 23040660 markings, 101711926 edges, 147753 markings/sec, 150 secs
lola: 23760527 markings, 105099767 edges, 143973 markings/sec, 155 secs
lola: 24484802 markings, 108370515 edges, 144855 markings/sec, 160 secs
lola: 25185384 markings, 111786741 edges, 140116 markings/sec, 165 secs
lola: add low 93
lola: add low 89
lola: add low 52
lola: add low 88
lola: add low 96
lola: add low 95
lola: add low 94
lola: add low 91
lola: add low 90
lola: add low 79
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: 25367378 markings, 112535190 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Catch2_1 + Catch2_2 + Catch2_3 + Catch2_4 + Catch2_5 + Catch2_6 + Catch2_7 + Catch2_8 + Catch2_9 + Catch2_10 + Catch2_11 + Catch2_12 + Catch2_13 + Catch2_14 + Catch2_15 + Catch2_16 + Catch2_17 + Catch2_18 + Catch2_19 + Catch2_20 <= Catch1_1 + Catch1_2 + Catch1_3 + Catch1_4 + Catch1_5 + Catch1_6 + Catch1_7 + Catch1_8 + Catch1_9 + Catch1_10 + Catch1_11 + Catch1_12 + Catch1_13 + Catch1_14 +... (shortened)
lola: processed formula length: 474
lola: 21 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: 21 markings, 21 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no yes no no no yes
lola:
preliminary result: no no no no no no no no no no no yes no no no yes
lola: memory consumption: 20492 KB
lola: time consumption: 177 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1552820917603
--------------------
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="Philosophers-PT-000020"
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 Philosophers-PT-000020, 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-155272226500807"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000020.tgz
mv Philosophers-PT-000020 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 '
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 ;