About the Execution of 2020-gold for SwimmingPool-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16256.848 | 3600000.00 | 795716.00 | 24989.20 | FFTFFFFTFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800700393.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SwimmingPool-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700393
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-10-00
FORMULA_NAME SwimmingPool-PT-10-01
FORMULA_NAME SwimmingPool-PT-10-02
FORMULA_NAME SwimmingPool-PT-10-03
FORMULA_NAME SwimmingPool-PT-10-04
FORMULA_NAME SwimmingPool-PT-10-05
FORMULA_NAME SwimmingPool-PT-10-06
FORMULA_NAME SwimmingPool-PT-10-07
FORMULA_NAME SwimmingPool-PT-10-08
FORMULA_NAME SwimmingPool-PT-10-09
FORMULA_NAME SwimmingPool-PT-10-10
FORMULA_NAME SwimmingPool-PT-10-11
FORMULA_NAME SwimmingPool-PT-10-12
FORMULA_NAME SwimmingPool-PT-10-13
FORMULA_NAME SwimmingPool-PT-10-14
FORMULA_NAME SwimmingPool-PT-10-15
=== Now, execution of the tool begins
BK_START 1621227548510
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:59:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-17 04:59:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:59:10] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-17 04:59:10] [INFO ] Transformed 9 places.
[2021-05-17 04:59:10] [INFO ] Transformed 7 transitions.
[2021-05-17 04:59:10] [INFO ] Parsed PT model containing 9 places and 7 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100077 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=1787 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1]
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 04:59:10] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 04:59:10] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned unsat
[2021-05-17 04:59:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-17 04:59:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
[2021-05-17 04:59:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-17 04:59:10] [INFO ] Flatten gal took : 23 ms
FORMULA SwimmingPool-PT-10-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-10-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:59:10] [INFO ] Flatten gal took : 7 ms
[2021-05-17 04:59:10] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-17 04:59:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-10 @ 3570 seconds
FORMULA SwimmingPool-PT-10-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-10-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2778
rslt: Output for LTLCardinality @ SwimmingPool-PT-10
{
"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": "mcc2020",
"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": "Mon May 17 04:59:11 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((((p6 + 1 <= p8) OR (p6 + 1 <= p3)) AND (p8 <= p0))) AND (p8 <= p6)))",
"processed_size": 77,
"rewrites": 77
},
"result":
{
"edges": 207,
"markings": 207,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"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": 0,
"E": 0,
"F": 1,
"G": 0,
"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": "X (X (F ((1 <= p6))))",
"processed_size": 21,
"rewrites": 77
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"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": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((X ((p5 <= 2)) AND ((3 <= p5) AND (X ((p1 + 1 <= p6)) OR (1 <= p8)))))",
"processed_size": 73,
"rewrites": 77
},
"result":
{
"edges": 412,
"markings": 411,
"produced_by": "LTL model checker",
"value": false
},
"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": 327
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"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": "X (G (((p2 <= p4))))",
"processed_size": 20,
"rewrites": 77
},
"result":
{
"edges": 210,
"markings": 210,
"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": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((p8 <= 2)) OR ((p7 <= 1) AND X ((p8 <= 2))))))",
"processed_size": 56,
"rewrites": 77
},
"result":
{
"edges": 206,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 408
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((X (X (G ((p6 <= p3)))) AND ((p7 <= p8) U (p1 <= p6))))",
"processed_size": 58,
"rewrites": 77
},
"result":
{
"edges": 206,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 467
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p6 <= 0) U X (G (((p1 <= p7) OR (p2 + 1 <= p6)))))",
"processed_size": 53,
"rewrites": 77
},
"result":
{
"edges": 190269,
"markings": 74647,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 545
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": "F (G ((p6 <= p2)))",
"processed_size": 18,
"rewrites": 77
},
"result":
{
"edges": 608,
"markings": 607,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "(X (F ((3 <= p2))) U G ((p8 <= p2)))",
"processed_size": 36,
"rewrites": 77
},
"result":
{
"edges": 206,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 654
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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": "X (((p2 <= p6) OR (G ((p7 + 1 <= p4)) AND F ((p2 <= p6)))))",
"processed_size": 59,
"rewrites": 77
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 817
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "X (G (((p4 <= 2) AND (p2 + 1 <= p5))))",
"processed_size": 38,
"rewrites": 77
},
"result":
{
"edges": 206,
"markings": 206,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1090
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((p0 <= 0)))",
"processed_size": 17,
"rewrites": 77
},
"result":
{
"edges": 208,
"markings": 207,
"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": "stabilization",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1635
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((p6 <= p2) AND (p5 <= p6))) OR (p6 + 1 <= p7)))",
"processed_size": 55,
"rewrites": 77
},
"result":
{
"edges": 1888,
"markings": 1689,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 3270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((2 <= p4)) OR (F ((p8 <= p3)) AND (p0 <= 2))))",
"processed_size": 53,
"rewrites": 77
},
"result":
{
"edges": 208,
"markings": 208,
"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"
}
},
{
"child":
[
{
"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": "(p7 <= p8)",
"processed_size": 10,
"rewrites": 77
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 15,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4))))))",
"processed_size": 60,
"rewrites": 77
},
"result":
{
"edges": 212,
"markings": 212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3060,
"runtime": 792.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G((* AND **)) AND **)) : X(X(F(**))) : ((F((X(**) OR (G(**) AND X(F(**))))) OR (G((X(**) OR F(**))) AND F((X(**) OR (G(**) AND X(F(**))))))) AND **) : F((X(*) AND (** AND (X(*) OR **)))) : X(G(**)) : G((F(**) OR **)) : G(F((G(*) OR (* AND X(*))))) : G((X(X(G(**))) AND (** U **))) : (** U X(G(*))) : F((G(*) OR (F(*) AND **))) : ((X(F(**)) U G(**)) OR F(G(**))) : F(G(*)) : X((** OR (G(*) AND F(**)))) : X(G(*))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no yes no no no no no no no no no no yes no ",
"value": "no yes no no no no no no no no no no 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: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 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: (NOT(F ((X (((p8 <= p6) AND (p3 <= p6))) OR NOT(X ((p8 <= p0)))))) AND X ((p8 <= p6))) : F (X (X ((1 <= p6)))) : ((G ((X ((p7 <= p8)) OR F ((1 <= p4)))) U F ((G ((1 <= p4)) U X ((2 <= p4))))) AND (p7 <= p8)) : F (((NOT(X ((3 <= p5))) AND (3 <= p5)) AND (NOT(X ((p6 <= p1))) OR (1 <= p8)))) : X (G (((p2 <= p4)))) : G ((F (((p6 <= p2) AND (p5 <= p6))) OR (p6 + 1 <= p7))) : G (X ((F ((p8 <= p1)) U G (F (X (F (NOT(G (((2 <= p7) U X ((3 <= p8)))))))))))) : G ((G (X (X ((p6 <= p3)))) AND ((p7 <= p8) U (p1 <= p6)))) : ((p6 <= 0) U NOT(F (X (((p7 + 1 <= p1) AND (p6 <= p2)))))) : F ((NOT(F ((p4 <= 1))) OR (NOT(G ((p3 + 1 <= p8))) AND (p0 <= 2)))) : ((F (X (F ((3 <= p2)))) U G ((p8 <= p2))) OR G (F (G (X ((p6 <= p2)))))) : X (G (F (X (NOT(X (((0 <= 0) U (1 <= p0)))))))) : X ((NOT(F ((p4 <= p7))) U (p2 <= p6))) : NOT(X (((0 <= 0) U ((3 <= p4) OR (p5 <= p2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((p6 + 1 <= p8) OR (p6 + 1 <= p3)) AND (p8 <= p0))) AND (p8 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((p6 + 1 <= p8) OR (p6 + 1 <= p3)) AND (p8 <= p0))) AND (p8 <= p6)))
lola: processed formula length: 77
lola: 77 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: 207 markings, 207 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((1 <= p6))))
lola: processed formula length: 21
lola: 77 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4)))))) OR (G ((X ((p7 <= p8)) OR F ((1 <= p4)))) AND F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4)))))))) AND (p7 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p7 <= p8)) OR F ((1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p7 <= p8)) OR F ((1 <= p4))))
lola: processed formula length: 37
lola: 77 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: 2304192 markings, 6764156 edges, 460838 markings/sec, 0 secs
lola: 3976124 markings, 12072815 edges, 334386 markings/sec, 5 secs
lola: 5540681 markings, 17101717 edges, 312911 markings/sec, 10 secs
lola: 7002411 markings, 21887972 edges, 292346 markings/sec, 15 secs
lola: 8427619 markings, 26575127 edges, 285042 markings/sec, 20 secs
lola: 9817992 markings, 31171262 edges, 278075 markings/sec, 25 secs
lola: 11177541 markings, 35685848 edges, 271910 markings/sec, 30 secs
lola: 12511613 markings, 40128396 edges, 266814 markings/sec, 35 secs
lola: 13833653 markings, 44541182 edges, 264408 markings/sec, 40 secs
lola: 15139660 markings, 48911154 edges, 261201 markings/sec, 45 secs
lola: 16423115 markings, 53219891 edges, 256691 markings/sec, 50 secs
lola: 17691661 markings, 57493929 edges, 253709 markings/sec, 55 secs
lola: 18954612 markings, 61756429 edges, 252590 markings/sec, 60 secs
lola: 20214769 markings, 66012116 edges, 252031 markings/sec, 65 secs
lola: 21475106 markings, 70267708 edges, 252067 markings/sec, 70 secs
lola: 22718023 markings, 74477684 edges, 248583 markings/sec, 75 secs
lola: 23942484 markings, 78635748 edges, 244892 markings/sec, 80 secs
lola: 25179694 markings, 82837681 edges, 247442 markings/sec, 85 secs
lola: 26439622 markings, 87111000 edges, 251986 markings/sec, 90 secs
lola: 27703497 markings, 91425391 edges, 252775 markings/sec, 95 secs
lola: 28977703 markings, 95777705 edges, 254841 markings/sec, 100 secs
lola: 30264562 markings, 100178261 edges, 257372 markings/sec, 105 secs
lola: 31563142 markings, 104609358 edges, 259716 markings/sec, 110 secs
lola: 32870930 markings, 109077009 edges, 261558 markings/sec, 115 secs
lola: 34165028 markings, 113518884 edges, 258820 markings/sec, 120 secs
lola: 35465833 markings, 117976286 edges, 260161 markings/sec, 125 secs
lola: 36766712 markings, 122432169 edges, 260176 markings/sec, 130 secs
lola: 38073192 markings, 126921321 edges, 261296 markings/sec, 135 secs
lola: 39389475 markings, 131435096 edges, 263257 markings/sec, 140 secs
lola: 40699492 markings, 135942380 edges, 262003 markings/sec, 145 secs
lola: 42003626 markings, 140440040 edges, 260827 markings/sec, 150 secs
lola: 43313293 markings, 144943900 edges, 261933 markings/sec, 155 secs
lola: 44617029 markings, 149439533 edges, 260747 markings/sec, 160 secs
lola: 45930967 markings, 153953363 edges, 262788 markings/sec, 165 secs
lola: 47239716 markings, 158473505 edges, 261750 markings/sec, 170 secs
lola: 48528097 markings, 162925075 edges, 257676 markings/sec, 175 secs
lola: 49830691 markings, 167418680 edges, 260519 markings/sec, 180 secs
lola: 51136588 markings, 171941252 edges, 261179 markings/sec, 185 secs
lola: 52432885 markings, 176425795 edges, 259259 markings/sec, 190 secs
lola: 53734191 markings, 180930539 edges, 260261 markings/sec, 195 secs
lola: 55038362 markings, 185437320 edges, 260834 markings/sec, 200 secs
lola: 56193051 markings, 189439022 edges, 230938 markings/sec, 205 secs
lola: 57356152 markings, 193477369 edges, 232620 markings/sec, 210 secs
lola: 58534600 markings, 197552760 edges, 235690 markings/sec, 215 secs
lola: 59717954 markings, 201662311 edges, 236671 markings/sec, 220 secs
lola: 60900968 markings, 205766766 edges, 236603 markings/sec, 225 secs
lola: 62091368 markings, 209912110 edges, 238080 markings/sec, 230 secs
lola: 63298880 markings, 214100889 edges, 241502 markings/sec, 235 secs
lola: 64493634 markings, 218260955 edges, 238951 markings/sec, 240 secs
lola: 65713923 markings, 222485969 edges, 244058 markings/sec, 245 secs
lola: 66910636 markings, 226667096 edges, 239343 markings/sec, 250 secs
lola: 68122658 markings, 230876951 edges, 242404 markings/sec, 255 secs
lola: 69337060 markings, 235108040 edges, 242880 markings/sec, 260 secs
lola: 70560009 markings, 239345094 edges, 244590 markings/sec, 265 secs
lola: 71767314 markings, 243550745 edges, 241461 markings/sec, 270 secs
lola: 72978763 markings, 247771659 edges, 242290 markings/sec, 275 secs
lola: 74198832 markings, 252005284 edges, 244014 markings/sec, 280 secs
lola: 75418615 markings, 256256719 edges, 243957 markings/sec, 285 secs
lola: 76634615 markings, 260491923 edges, 243200 markings/sec, 290 secs
lola: local time limit reached - aborting
lola:
preliminary result: no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 21984 KB
lola: time consumption: 300 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X ((p5 <= 2)) AND ((3 <= p5) AND (X ((p1 + 1 <= p6)) OR (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((p5 <= 2)) AND ((3 <= p5) AND (X ((p1 + 1 <= p6)) OR (1 <= p8)))))
lola: processed formula length: 73
lola: 77 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: 411 markings, 412 edges
lola: ========================================
lola: subprocess 4 will run for 327 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p2 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p2 <= p4))))
lola: processed formula length: 20
lola: 77 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: 210 markings, 210 edges
lola: ========================================
lola: subprocess 5 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p8 <= 2)) OR ((p7 <= 1) AND X ((p8 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p8 <= 2)) OR ((p7 <= 1) AND X ((p8 <= 2))))))
lola: processed formula length: 56
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 206 markings, 206 edges
lola: ========================================
lola: subprocess 6 will run for 408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (G ((p6 <= p3)))) AND ((p7 <= p8) U (p1 <= p6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (G ((p6 <= p3)))) AND ((p7 <= p8) U (p1 <= p6))))
lola: processed formula length: 58
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 206 markings, 206 edges
lola: ========================================
lola: subprocess 7 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p6 <= 0) U X (G (((p1 <= p7) OR (p2 + 1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p6 <= 0) U X (G (((p1 <= p7) OR (p2 + 1 <= p6)))))
lola: processed formula length: 53
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 74647 markings, 190269 edges
lola: ========================================
lola: subprocess 8 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (F ((3 <= p2))) U G ((p8 <= p2))) OR F (G ((p6 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p6 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p6 <= p2)))
lola: processed formula length: 18
lola: 77 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: 607 markings, 608 edges
lola: ========================================
lola: subprocess 9 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((3 <= p2))) U G ((p8 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((3 <= p2))) U G ((p8 <= p2)))
lola: processed formula length: 36
lola: 77 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: 206 markings, 206 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 654 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p2 <= p6) OR (G ((p7 + 1 <= p4)) AND F ((p2 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p2 <= p6) OR (G ((p7 + 1 <= p4)) AND F ((p2 <= p6)))))
lola: processed formula length: 59
lola: 77 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 817 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p4 <= 2) AND (p2 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p4 <= 2) AND (p2 + 1 <= p5))))
lola: processed formula length: 38
lola: 77 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: 206 markings, 206 edges
lola: ========================================
lola: subprocess 11 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p0 <= 0)))
lola: processed formula length: 17
lola: 77 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: 207 markings, 208 edges
lola: ========================================
lola: subprocess 12 will run for 1635 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((p6 <= p2) AND (p5 <= p6))) OR (p6 + 1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((p6 <= p2) AND (p5 <= p6))) OR (p6 + 1 <= p7)))
lola: processed formula length: 55
lola: 77 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: 1689 markings, 1888 edges
lola: ========================================
lola: subprocess 13 will run for 3270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((2 <= p4)) OR (F ((p8 <= p3)) AND (p0 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((2 <= p4)) OR (F ((p8 <= p3)) AND (p0 <= 2))))
lola: processed formula length: 53
lola: 77 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: 208 markings, 208 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4)))))) OR (G ((X ((p7 <= p8)) OR F ((1 <= p4)))) AND F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4)))))))) AND (p7 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((X ((p7 <= p8)) OR F ((1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p7 <= p8)) OR F ((1 <= p4))))
lola: processed formula length: 37
lola: 77 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: 2481065 markings, 7324548 edges, 496213 markings/sec, 0 secs
lola: 4419278 markings, 13497810 edges, 387643 markings/sec, 5 secs
lola: 6247134 markings, 19407079 edges, 365571 markings/sec, 10 secs
lola: 7993190 markings, 25144860 edges, 349211 markings/sec, 15 secs
lola: 9702252 markings, 30788639 edges, 341812 markings/sec, 20 secs
lola: 11362040 markings, 36298680 edges, 331958 markings/sec, 25 secs
lola: 12705112 markings, 40775310 edges, 268614 markings/sec, 30 secs
lola: 14019649 markings, 45159827 edges, 262907 markings/sec, 35 secs
lola: 15314040 markings, 49497762 edges, 258878 markings/sec, 40 secs
lola: 16587491 markings, 53773534 edges, 254690 markings/sec, 45 secs
lola: 18045979 markings, 58685837 edges, 291698 markings/sec, 50 secs
lola: 19571857 markings, 63836748 edges, 305176 markings/sec, 55 secs
lola: 21038165 markings, 68798128 edges, 293262 markings/sec, 60 secs
lola: 22456249 markings, 73587087 edges, 283617 markings/sec, 65 secs
lola: 23826084 markings, 78238606 edges, 273967 markings/sec, 70 secs
lola: 25169846 markings, 82803510 edges, 268752 markings/sec, 75 secs
lola: 26497268 markings, 87308378 edges, 265484 markings/sec, 80 secs
lola: 27796116 markings, 91741294 edges, 259770 markings/sec, 85 secs
lola: 29078184 markings, 96117142 edges, 256414 markings/sec, 90 secs
lola: 30346033 markings, 100453323 edges, 253570 markings/sec, 95 secs
lola: 31607311 markings, 104762794 edges, 252256 markings/sec, 100 secs
lola: 32864436 markings, 109054499 edges, 251425 markings/sec, 105 secs
lola: 34094291 markings, 113274620 edges, 245971 markings/sec, 110 secs
lola: 35316527 markings, 117466786 edges, 244447 markings/sec, 115 secs
lola: 36539348 markings, 121647708 edges, 244564 markings/sec, 120 secs
lola: 37749485 markings, 125801613 edges, 242027 markings/sec, 125 secs
lola: 38956414 markings, 129949580 edges, 241386 markings/sec, 130 secs
lola: 40148159 markings, 134048849 edges, 238349 markings/sec, 135 secs
lola: 41338863 markings, 138148061 edges, 238141 markings/sec, 140 secs
lola: 42527774 markings, 142243139 edges, 237782 markings/sec, 145 secs
lola: 43729020 markings, 146371048 edges, 240249 markings/sec, 150 secs
lola: 44940916 markings, 150550003 edges, 242379 markings/sec, 155 secs
lola: 46164698 markings, 154759449 edges, 244756 markings/sec, 160 secs
lola: 47400581 markings, 159027838 edges, 247177 markings/sec, 165 secs
lola: 48636586 markings, 163295794 edges, 247201 markings/sec, 170 secs
lola: 49880755 markings, 167591804 edges, 248834 markings/sec, 175 secs
lola: 51095375 markings, 171800150 edges, 242924 markings/sec, 180 secs
lola: 52255967 markings, 175817606 edges, 232118 markings/sec, 185 secs
lola: 53449089 markings, 179943818 edges, 238624 markings/sec, 190 secs
lola: 54643710 markings, 184074292 edges, 238924 markings/sec, 195 secs
lola: 55823707 markings, 188162216 edges, 235999 markings/sec, 200 secs
lola: 57001601 markings, 192244633 edges, 235579 markings/sec, 205 secs
lola: 58166842 markings, 196286350 edges, 233048 markings/sec, 210 secs
lola: 59327748 markings, 200305693 edges, 232181 markings/sec, 215 secs
lola: 60479889 markings, 204303969 edges, 230428 markings/sec, 220 secs
lola: 61627697 markings, 208299030 edges, 229562 markings/sec, 225 secs
lola: 62803480 markings, 212386639 edges, 235157 markings/sec, 230 secs
lola: 63988439 markings, 216499663 edges, 236992 markings/sec, 235 secs
lola: 65182072 markings, 220644254 edges, 238727 markings/sec, 240 secs
lola: 66373727 markings, 224793476 edges, 238331 markings/sec, 245 secs
lola: 67575307 markings, 228968693 edges, 240316 markings/sec, 250 secs
lola: 68781563 markings, 233167380 edges, 241251 markings/sec, 255 secs
lola: 69974847 markings, 237314170 edges, 238657 markings/sec, 260 secs
lola: 71156690 markings, 241415493 edges, 236369 markings/sec, 265 secs
lola: 72315356 markings, 245462196 edges, 231733 markings/sec, 270 secs
lola: 73484127 markings, 249520662 edges, 233754 markings/sec, 275 secs
lola: 74633806 markings, 253519114 edges, 229936 markings/sec, 280 secs
lola: 75782805 markings, 257522506 edges, 229800 markings/sec, 285 secs
lola: 76916776 markings, 261481100 edges, 226794 markings/sec, 290 secs
lola: 78075660 markings, 265508149 edges, 231777 markings/sec, 295 secs
lola: 79225657 markings, 269518847 edges, 229999 markings/sec, 300 secs
lola: 80354545 markings, 273482123 edges, 225778 markings/sec, 305 secs
lola: 81505489 markings, 277494761 edges, 230189 markings/sec, 310 secs
lola: 82672132 markings, 281565422 edges, 233329 markings/sec, 315 secs
lola: 83828375 markings, 285613600 edges, 231249 markings/sec, 320 secs
lola: 84952570 markings, 289534338 edges, 224839 markings/sec, 325 secs
lola: 86079892 markings, 293465611 edges, 225464 markings/sec, 330 secs
lola: 87227197 markings, 297476372 edges, 229461 markings/sec, 335 secs
lola: 88379993 markings, 301516243 edges, 230559 markings/sec, 340 secs
lola: 89544738 markings, 305586707 edges, 232949 markings/sec, 345 secs
lola: 90715067 markings, 309681177 edges, 234066 markings/sec, 350 secs
lola: 91872107 markings, 313725556 edges, 231408 markings/sec, 355 secs
lola: 92900653 markings, 317337322 edges, 205709 markings/sec, 360 secs
lola: 93948717 markings, 320999659 edges, 209613 markings/sec, 365 secs
lola: 95032397 markings, 324806467 edges, 216736 markings/sec, 370 secs
lola: 96025909 markings, 328285446 edges, 198702 markings/sec, 375 secs
lola: 96719734 markings, 330716494 edges, 138765 markings/sec, 380 secs
lola: 97671322 markings, 334053953 edges, 190318 markings/sec, 385 secs
lola: 98617085 markings, 337385008 edges, 189153 markings/sec, 390 secs
lola: 99592140 markings, 340804009 edges, 195011 markings/sec, 395 secs
lola: 100577788 markings, 344265741 edges, 197130 markings/sec, 400 secs
lola: 101617988 markings, 347895185 edges, 208040 markings/sec, 405 secs
lola: 102447468 markings, 350806447 edges, 165896 markings/sec, 410 secs
lola: 103485148 markings, 354429216 edges, 207536 markings/sec, 415 secs
lola: 104527606 markings, 358098967 edges, 208492 markings/sec, 420 secs
lola: 105457437 markings, 361352921 edges, 185966 markings/sec, 425 secs
lola: 106250811 markings, 364142368 edges, 158675 markings/sec, 430 secs
lola: 107182455 markings, 367419206 edges, 186329 markings/sec, 435 secs
lola: 108228440 markings, 371093756 edges, 209197 markings/sec, 440 secs
lola: 109164121 markings, 374373837 edges, 187136 markings/sec, 445 secs
lola: 110192164 markings, 377996778 edges, 205609 markings/sec, 450 secs
lola: 111121881 markings, 381251352 edges, 185943 markings/sec, 455 secs
lola: 111976670 markings, 384267944 edges, 170958 markings/sec, 460 secs
lola: 112907758 markings, 387543682 edges, 186218 markings/sec, 465 secs
lola: 113995745 markings, 391361386 edges, 217597 markings/sec, 470 secs
lola: 114962771 markings, 394759205 edges, 193405 markings/sec, 475 secs
lola: 115357030 markings, 396152324 edges, 78852 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (p7 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p7 <= p8)
lola: processed formula length: 10
lola: 77 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: ========================================
lola: ...considering subproblem: F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X ((2 <= p4)) OR (G ((1 <= p4)) AND X (F ((2 <= p4))))))
lola: processed formula length: 60
lola: 77 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 212 markings, 212 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no no yes no
lola:
preliminary result: no yes no no no no no no no no no no yes no
lola: memory consumption: 3060 KB
lola: time consumption: 792 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
--------------------
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="SwimmingPool-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is SwimmingPool-PT-10, 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 r265-tall-162106800700393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-10.tgz
mv SwimmingPool-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;