About the Execution of ITS-LoLa for SwimmingPool-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15791.850 | 3600000.00 | 1422850.00 | 14345.30 | FFFFFFF?TFTTFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2020-input.r194-csrt-159033389800281.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is SwimmingPool-PT-06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389800281
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 4.0K Apr 12 18:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 18:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 20:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Apr 11 20:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 10 21:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 21:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 10 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 24 05:38 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SwimmingPool-PT-06-00
FORMULA_NAME SwimmingPool-PT-06-01
FORMULA_NAME SwimmingPool-PT-06-02
FORMULA_NAME SwimmingPool-PT-06-03
FORMULA_NAME SwimmingPool-PT-06-04
FORMULA_NAME SwimmingPool-PT-06-05
FORMULA_NAME SwimmingPool-PT-06-06
FORMULA_NAME SwimmingPool-PT-06-07
FORMULA_NAME SwimmingPool-PT-06-08
FORMULA_NAME SwimmingPool-PT-06-09
FORMULA_NAME SwimmingPool-PT-06-10
FORMULA_NAME SwimmingPool-PT-06-11
FORMULA_NAME SwimmingPool-PT-06-12
FORMULA_NAME SwimmingPool-PT-06-13
FORMULA_NAME SwimmingPool-PT-06-14
FORMULA_NAME SwimmingPool-PT-06-15
=== Now, execution of the tool begins
BK_START 1591211809953
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:16:52] [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]
[2020-06-03 19:16:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:16:52] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2020-06-03 19:16:52] [INFO ] Transformed 9 places.
[2020-06-03 19:16:52] [INFO ] Transformed 7 transitions.
[2020-06-03 19:16:52] [INFO ] Parsed PT model containing 9 places and 7 transitions in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100020 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=1010 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
// Phase 1: matrix 7 rows 9 cols
[2020-06-03 19:16:52] [INFO ] Computed 3 place invariants in 3 ms
[2020-06-03 19:16:52] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned unsat
[2020-06-03 19:16:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2020-06-03 19:16:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 19:16:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2020-06-03 19:16:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
[2020-06-03 19:16:52] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 19:16:52] [INFO ] Flatten gal took : 38 ms
FORMULA SwimmingPool-PT-06-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:16:52] [INFO ] Flatten gal took : 4 ms
[2020-06-03 19:16:52] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 12 ms.
[2020-06-03 19:16:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-06 @ 3570 seconds
FORMULA SwimmingPool-PT-06-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SwimmingPool-PT-06-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2474
rslt: Output for LTLCardinality @ SwimmingPool-PT-06
{
"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": "Wed Jun 3 19:16:53 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((G ((G ((p2 <= p6)) AND (2 <= p4))) OR F ((3 <= p4))))",
"processed_size": 57,
"rewrites": 70
},
"result":
{
"edges": 130,
"markings": 130,
"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": 324
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((2 <= p1)) AND (X ((p6 <= p0)) OR ((p7 <= 0) OR (2 <= p1))))))",
"processed_size": 72,
"rewrites": 70
},
"result":
{
"edges": 135,
"markings": 134,
"produced_by": "LTL model checker",
"value": false
},
"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": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((3 <= p4)))",
"processed_size": 17,
"rewrites": 70
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p8 <= 0)",
"processed_size": 9,
"rewrites": 72
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p0) U X (X ((X (G ((p4 + 1 <= p0))) U (p0 <= p4)))))",
"processed_size": 59,
"rewrites": 70
},
"result":
{
"edges": 1779,
"markings": 957,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 2)",
"processed_size": 9,
"rewrites": 72
},
"result":
{
"edges": 366,
"markings": 366,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 4,
"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": "X (X (X (X (G ((p2 + 1 <= p6))))))",
"processed_size": 34,
"rewrites": 70
},
"result":
{
"edges": 128,
"markings": 128,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((p8 <= p3)))",
"processed_size": 18,
"rewrites": 70
},
"result":
{
"edges": 126,
"markings": 126,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 4,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((p5 <= p3) U G ((X (G ((F ((p4 <= 2)) AND (F (G ((p7 <= 0))) OR G (F ((p4 <= 2))))))) OR (p0 + 1 <= p5))))",
"processed_size": 107,
"rewrites": 70
},
"result":
{
"edges": 71867,
"markings": 28464,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 35
},
"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": 743
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((X ((p4 + 1 <= p8)) AND (p2 + 1 <= p4))))",
"processed_size": 47,
"rewrites": 70
},
"result":
{
"edges": 128,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 990
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((3 <= p6)))",
"processed_size": 17,
"rewrites": 70
},
"result":
{
"edges": 425,
"markings": 425,
"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": "fairness",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1486
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1486
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(3 <= p8)",
"processed_size": 9,
"rewrites": 70
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2972
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(2 <= p6)",
"processed_size": 9,
"rewrites": 72
},
"result":
{
"edges": 421,
"markings": 421,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2972
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2972
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((3 <= p7) AND (p2 <= p6)))",
"processed_size": 30,
"rewrites": 70
},
"result":
{
"edges": 426,
"markings": 426,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},
{
"child":
[
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((3 <= p7) AND (p2 <= p6)))",
"processed_size": 30,
"rewrites": 70
},
"result":
{
"edges": 426,
"markings": 426,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"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": "G (((p7 <= 2) AND (p8 + 1 <= p3)))",
"processed_size": 34,
"rewrites": 70
},
"result":
{
"edges": 426,
"markings": 426,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3436,
"runtime": 1096.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G((G(**) AND **)) OR F(**))) : F(G((F(**) AND (X(**) OR (** OR **))))) : X(F(**)) : (G(*) OR (G(**) AND F(G(*)))) : (F(**) AND (** U X(X((X(G(**)) U **))))) : (X(X(X(X(G(*))))) OR F(**)) : X(G(**)) : X(G((X(F(**)) OR F(G((G(**) AND **)))))) : (F(*) AND **) : (** U G((X(G((F(*) AND (F(G(*)) OR G(F(*)))))) OR **))) : G(F(**)) : F(G((X(*) AND *)))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no no no no no no unknown no no no no ",
"value": "no no no no no no no unknown no no no 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: X ((G ((G ((p2 <= p6)) AND (2 <= p4))) OR F ((3 <= p4)))) : NOT(G (X (NOT(G (((X ((p6 <= p0)) OR (p7 <= 0)) U (2 <= p1))))))) : ((0 <= 0) U X ((3 <= p4))) : (G (((3 <= p7) AND (p2 <= p6))) U NOT(F (((3 <= p7) OR (p3 <= p8))))) : (F ((1 <= p8)) AND ((1 <= p0) U X (X ((G (X ((p4 + 1 <= p0))) U (p0 <= p4)))))) : (G (X (X (X (NOT(X (F ((p6 <= p2)))))))) OR F ((3 <= p2))) : G (X ((p8 <= p3))) : G (X ((F (X ((p7 + 1 <= p1))) OR F (G ((G ((1 <= p8)) AND (p7 + 1 <= p1))))))) : (NOT(G ((2 <= p6))) AND (3 <= p8)) : ((p5 <= p3) U G ((NOT(X (F ((G (F ((1 <= p7))) U G ((3 <= p4)))))) OR (p0 + 1 <= p5)))) : F (G (F ((F ((G ((1 <= p4)) OR (p2 <= p7))) U (3 <= p6))))) : F (NOT(((3 <= p8) U F (((2 <= p2) U F ((F ((p4 <= p2)) U (X ((p8 <= p4)) OR (p4 <= p2)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((G ((p2 <= p6)) AND (2 <= p4))) OR F ((3 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((G ((p2 <= p6)) AND (2 <= p4))) OR F ((3 <= p4))))
lola: processed formula length: 57
lola: 70 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: 130 markings, 130 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((2 <= p1)) AND (X ((p6 <= p0)) OR ((p7 <= 0) OR (2 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((2 <= p1)) AND (X ((p6 <= p0)) OR ((p7 <= 0) OR (2 <= p1))))))
lola: processed formula length: 72
lola: 70 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 134 markings, 135 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((3 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((3 <= p4)))
lola: processed formula length: 17
lola: 70 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p8)) AND ((1 <= p0) U X (X ((X (G ((p4 + 1 <= p0))) U (p0 <= p4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p8 <= 0)
lola: processed formula length: 9
lola: 72 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 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) U X (X ((X (G ((p4 + 1 <= p0))) U (p0 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p0) U X (X ((X (G ((p4 + 1 <= p0))) U (p0 <= p4)))))
lola: processed formula length: 59
lola: 70 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 11 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: 957 markings, 1779 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (G ((p2 + 1 <= p6)))))) OR F ((3 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 2)
lola: processed formula length: 9
lola: 72 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 366 markings, 366 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G ((p2 + 1 <= p6))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G ((p2 + 1 <= p6))))))
lola: processed formula length: 34
lola: 70 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: 128 markings, 128 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p8 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p8 <= p3)))
lola: processed formula length: 18
lola: 70 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: 126 markings, 126 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((p7 + 1 <= p1))) OR F (G ((G ((1 <= p8)) AND (p7 + 1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((p7 + 1 <= p1))) OR F (G ((G ((1 <= p8)) AND (p7 + 1 <= p1)))))))
lola: processed formula length: 78
lola: 70 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: 2159468 markings, 7289060 edges, 431894 markings/sec, 0 secs
lola: 3837462 markings, 13199708 edges, 335599 markings/sec, 5 secs
lola: 5477783 markings, 19039763 edges, 328064 markings/sec, 10 secs
lola: 7015822 markings, 24548612 edges, 307608 markings/sec, 15 secs
lola: 8463966 markings, 29759596 edges, 289629 markings/sec, 20 secs
lola: 9883224 markings, 34878100 edges, 283852 markings/sec, 25 secs
lola: 11300854 markings, 40002864 edges, 283526 markings/sec, 30 secs
lola: 12728661 markings, 45186503 edges, 285561 markings/sec, 35 secs
lola: 14013347 markings, 49853068 edges, 256937 markings/sec, 40 secs
lola: 15344511 markings, 54692108 edges, 266233 markings/sec, 45 secs
lola: 16603566 markings, 59273957 edges, 251811 markings/sec, 50 secs
lola: 17832831 markings, 63757859 edges, 245853 markings/sec, 55 secs
lola: 19057432 markings, 68229796 edges, 244920 markings/sec, 60 secs
lola: 20283143 markings, 72705452 edges, 245142 markings/sec, 65 secs
lola: 21508114 markings, 77187467 edges, 244994 markings/sec, 70 secs
lola: 22731604 markings, 81671087 edges, 244698 markings/sec, 75 secs
lola: 23890841 markings, 85912750 edges, 231847 markings/sec, 80 secs
lola: 25149196 markings, 90523685 edges, 251671 markings/sec, 85 secs
lola: 26317527 markings, 94809072 edges, 233666 markings/sec, 90 secs
lola: 27519476 markings, 99222137 edges, 240390 markings/sec, 95 secs
lola: 28649915 markings, 103375102 edges, 226088 markings/sec, 100 secs
lola: 29810307 markings, 107641793 edges, 232078 markings/sec, 105 secs
lola: 30975953 markings, 111926302 edges, 233129 markings/sec, 110 secs
lola: 32146374 markings, 116226604 edges, 234084 markings/sec, 115 secs
lola: 33280455 markings, 120401551 edges, 226816 markings/sec, 120 secs
lola: 34435608 markings, 124651293 edges, 231031 markings/sec, 125 secs
lola: 35565023 markings, 128810215 edges, 225883 markings/sec, 130 secs
lola: 36710988 markings, 133028412 edges, 229193 markings/sec, 135 secs
lola: 37848059 markings, 137218281 edges, 227414 markings/sec, 140 secs
lola: 39059049 markings, 141679021 edges, 242198 markings/sec, 145 secs
lola: 40273211 markings, 146153664 edges, 242832 markings/sec, 150 secs
lola: 41413277 markings, 150361436 edges, 228013 markings/sec, 155 secs
lola: 42539488 markings, 154519588 edges, 225242 markings/sec, 160 secs
lola: 43666370 markings, 158676620 edges, 225376 markings/sec, 165 secs
lola: 44750242 markings, 162679016 edges, 216774 markings/sec, 170 secs
lola: 45915537 markings, 166978821 edges, 233059 markings/sec, 175 secs
lola: 47045607 markings, 171146403 edges, 226014 markings/sec, 180 secs
lola: 48155895 markings, 175244662 edges, 222058 markings/sec, 185 secs
lola: 49237662 markings, 179246826 edges, 216353 markings/sec, 190 secs
lola: 50232554 markings, 182914746 edges, 198978 markings/sec, 195 secs
lola: 51336525 markings, 186994881 edges, 220794 markings/sec, 200 secs
lola: 52394596 markings, 190904511 edges, 211614 markings/sec, 205 secs
lola: 53501637 markings, 194996334 edges, 221408 markings/sec, 210 secs
lola: 54600360 markings, 199062383 edges, 219745 markings/sec, 215 secs
lola: 55701426 markings, 203134769 edges, 220213 markings/sec, 220 secs
lola: 56767106 markings, 207075983 edges, 213136 markings/sec, 225 secs
lola: 57890554 markings, 211227165 edges, 224690 markings/sec, 230 secs
lola: 58928657 markings, 215069942 edges, 207621 markings/sec, 235 secs
lola: 60006935 markings, 219061292 edges, 215656 markings/sec, 240 secs
lola: 60995888 markings, 222719971 edges, 197791 markings/sec, 245 secs
lola: 62020003 markings, 226507020 edges, 204823 markings/sec, 250 secs
lola: 63035153 markings, 230268649 edges, 203030 markings/sec, 255 secs
lola: 64065494 markings, 234078371 edges, 206068 markings/sec, 260 secs
lola: 65077402 markings, 237827558 edges, 202382 markings/sec, 265 secs
lola: 66139224 markings, 241765698 edges, 212364 markings/sec, 270 secs
lola: 67220320 markings, 245764822 edges, 216219 markings/sec, 275 secs
lola: 68274295 markings, 249665214 edges, 210795 markings/sec, 280 secs
lola: 69312153 markings, 253504395 edges, 207572 markings/sec, 285 secs
lola: 70384967 markings, 257473598 edges, 214563 markings/sec, 290 secs
lola: 71447694 markings, 261414643 edges, 212545 markings/sec, 295 secs
lola: 72513085 markings, 265359913 edges, 213078 markings/sec, 300 secs
lola: 73647582 markings, 269561472 edges, 226899 markings/sec, 305 secs
lola: 74729859 markings, 273572226 edges, 216455 markings/sec, 310 secs
lola: 75790888 markings, 277505141 edges, 212206 markings/sec, 315 secs
lola: 76882599 markings, 281555246 edges, 218342 markings/sec, 320 secs
lola: 77964411 markings, 285555996 edges, 216362 markings/sec, 325 secs
lola: 79022800 markings, 289472448 edges, 211678 markings/sec, 330 secs
lola: 80077483 markings, 293380511 edges, 210937 markings/sec, 335 secs
lola: 81132732 markings, 297292617 edges, 211050 markings/sec, 340 secs
lola: 82188601 markings, 301204867 edges, 211174 markings/sec, 345 secs
lola: 83231371 markings, 305069652 edges, 208554 markings/sec, 350 secs
lola: 84274903 markings, 308941763 edges, 208706 markings/sec, 355 secs
lola: 85324530 markings, 312832146 edges, 209925 markings/sec, 360 secs
lola: 86360957 markings, 316679650 edges, 207285 markings/sec, 365 secs
lola: 87387708 markings, 320485112 edges, 205350 markings/sec, 370 secs
lola: 88096240 markings, 323115112 edges, 141706 markings/sec, 375 secs
lola: 88364962 markings, 324108851 edges, 53744 markings/sec, 380 secs
lola: 88608206 markings, 325011701 edges, 48649 markings/sec, 385 secs
lola: 88923885 markings, 326179593 edges, 63136 markings/sec, 390 secs
lola: 89201575 markings, 327209308 edges, 55538 markings/sec, 395 secs
lola: 89626014 markings, 328779975 edges, 84888 markings/sec, 400 secs
lola: 89915961 markings, 329851860 edges, 57989 markings/sec, 405 secs
lola: 90184230 markings, 330847543 edges, 53654 markings/sec, 410 secs
lola: 90483271 markings, 331951612 edges, 59808 markings/sec, 415 secs
lola: 90753215 markings, 332951939 edges, 53989 markings/sec, 420 secs
lola: 91049174 markings, 334048692 edges, 59192 markings/sec, 425 secs
lola: 91337532 markings, 335118845 edges, 57672 markings/sec, 430 secs
lola: 91612565 markings, 336137724 edges, 55007 markings/sec, 435 secs
lola: 91927459 markings, 337306561 edges, 62979 markings/sec, 440 secs
lola: 92224572 markings, 338408636 edges, 59423 markings/sec, 445 secs
lola: 92489015 markings, 339385339 edges, 52889 markings/sec, 450 secs
lola: 92765253 markings, 340410619 edges, 55248 markings/sec, 455 secs
lola: 93047199 markings, 341452995 edges, 56389 markings/sec, 460 secs
lola: 93334254 markings, 342521754 edges, 57411 markings/sec, 465 secs
lola: 93609385 markings, 343544356 edges, 55026 markings/sec, 470 secs
lola: 93905366 markings, 344642857 edges, 59196 markings/sec, 475 secs
lola: 94255703 markings, 345942598 edges, 70067 markings/sec, 480 secs
lola: 94593431 markings, 347195784 edges, 67546 markings/sec, 485 secs
lola: 94917832 markings, 348398257 edges, 64880 markings/sec, 490 secs
lola: 95268534 markings, 349700018 edges, 70140 markings/sec, 495 secs
lola: 95590595 markings, 350895471 edges, 64412 markings/sec, 500 secs
lola: 96014625 markings, 352467937 edges, 84806 markings/sec, 505 secs
lola: 96362055 markings, 353757408 edges, 69486 markings/sec, 510 secs
lola: 96693740 markings, 354983282 edges, 66337 markings/sec, 515 secs
lola: 96999742 markings, 356115577 edges, 61200 markings/sec, 520 secs
lola: 97292185 markings, 357199096 edges, 58489 markings/sec, 525 secs
lola: 97653136 markings, 358539613 edges, 72190 markings/sec, 530 secs
lola: 98211316 markings, 360611983 edges, 111636 markings/sec, 535 secs
lola: 98463503 markings, 361547001 edges, 50437 markings/sec, 540 secs
lola: 98709144 markings, 362456967 edges, 49128 markings/sec, 545 secs
lola: 99024689 markings, 363625018 edges, 63109 markings/sec, 550 secs
lola: 99339701 markings, 364790038 edges, 63002 markings/sec, 555 secs
lola: 99679958 markings, 366053837 edges, 68051 markings/sec, 560 secs
lola: 99919841 markings, 366938008 edges, 47977 markings/sec, 565 secs
lola: 100186764 markings, 367928017 edges, 53385 markings/sec, 570 secs
lola: 100487077 markings, 369041536 edges, 60063 markings/sec, 575 secs
lola: 100728265 markings, 369938600 edges, 48238 markings/sec, 580 secs
lola: 101031899 markings, 371061299 edges, 60727 markings/sec, 585 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no unknown no no no unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 <= p3) U G ((X (G ((F ((p4 <= 2)) AND (F (G ((p7 <= 0))) OR G (F ((p4 <= 2))))))) OR (p0 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p5 <= p3) U G ((X (G ((F ((p4 <= 2)) AND (F (G ((p7 <= 0))) OR G (F ((p4 <= 2))))))) OR (p0 + 1 <= p5))))
lola: processed formula length: 107
lola: 70 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 35 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: 28464 markings, 71867 edges
lola: ========================================
lola: subprocess 8 will run for 743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p4 + 1 <= p8)) AND (p2 + 1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p4 + 1 <= p8)) AND (p2 + 1 <= p4))))
lola: processed formula length: 47
lola: 70 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: 127 markings, 128 edges
lola: ========================================
lola: subprocess 9 will run for 990 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((3 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((3 <= p6)))
lola: processed formula length: 17
lola: 70 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: 425 markings, 425 edges
lola: ========================================
lola: subprocess 10 will run for 1486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p6 <= 1)) AND (3 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p8)
lola: processed formula length: 9
lola: 70 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 2972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p6 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (2 <= p6)
lola: processed formula length: 9
lola: 72 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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 421 markings, 421 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 2972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p7 <= 2) AND (p8 + 1 <= p3))) OR (G (((3 <= p7) AND (p2 <= p6))) AND F (G (((p7 <= 2) AND (p8 + 1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((3 <= p7) AND (p2 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((3 <= p7) AND (p2 <= p6)))
lola: processed formula length: 30
lola: 70 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: 426 markings, 426 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (F ((p7 + 1 <= p1))) OR F (G ((G ((1 <= p8)) AND (p7 + 1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (F ((p7 + 1 <= p1))) OR F (G ((G ((1 <= p8)) AND (p7 + 1 <= p1)))))))
lola: processed formula length: 78
lola: 70 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: 1967539 markings, 6618974 edges, 393508 markings/sec, 0 secs
lola: 3560273 markings, 12219023 edges, 318547 markings/sec, 5 secs
lola: 5048112 markings, 17506328 edges, 297568 markings/sec, 10 secs
lola: 6487996 markings, 22653375 edges, 287977 markings/sec, 15 secs
lola: 7903789 markings, 27740821 edges, 283159 markings/sec, 20 secs
lola: 9273740 markings, 32676789 edges, 273990 markings/sec, 25 secs
lola: 10680035 markings, 37757284 edges, 281259 markings/sec, 30 secs
lola: 12008684 markings, 42569920 edges, 265730 markings/sec, 35 secs
lola: 13078769 markings, 46454133 edges, 214017 markings/sec, 40 secs
lola: 14138475 markings, 50307580 edges, 211941 markings/sec, 45 secs
lola: 15366086 markings, 54770960 edges, 245522 markings/sec, 50 secs
lola: 16678702 markings, 59548505 edges, 262523 markings/sec, 55 secs
lola: 17956524 markings, 64210643 edges, 255564 markings/sec, 60 secs
lola: 19238063 markings, 68888849 edges, 256308 markings/sec, 65 secs
lola: 20519822 markings, 73573166 edges, 256352 markings/sec, 70 secs
lola: 21797233 markings, 78247304 edges, 255482 markings/sec, 75 secs
lola: 23061486 markings, 82874527 edges, 252851 markings/sec, 80 secs
lola: 24310710 markings, 87453411 edges, 249845 markings/sec, 85 secs
lola: 25559054 markings, 92027188 edges, 249669 markings/sec, 90 secs
lola: 26793961 markings, 96558992 edges, 246981 markings/sec, 95 secs
lola: 27988069 markings, 100942080 edges, 238822 markings/sec, 100 secs
lola: 29198654 markings, 105391957 edges, 242117 markings/sec, 105 secs
lola: 30416452 markings, 109868336 edges, 243560 markings/sec, 110 secs
lola: 31630970 markings, 114330719 edges, 242904 markings/sec, 115 secs
lola: 32883745 markings, 118941961 edges, 250555 markings/sec, 120 secs
lola: 34142106 markings, 123570187 edges, 251672 markings/sec, 125 secs
lola: 35363779 markings, 128068158 edges, 244335 markings/sec, 130 secs
lola: 36616606 markings, 132678269 edges, 250565 markings/sec, 135 secs
lola: 37842676 markings, 137198528 edges, 245214 markings/sec, 140 secs
lola: 39085177 markings, 141776499 edges, 248500 markings/sec, 145 secs
lola: 40320423 markings, 146328645 edges, 247049 markings/sec, 150 secs
lola: 41568735 markings, 150934715 edges, 249662 markings/sec, 155 secs
lola: 42800500 markings, 155482131 edges, 246353 markings/sec, 160 secs
lola: 44025817 markings, 160005248 edges, 245063 markings/sec, 165 secs
lola: 45228682 markings, 164443844 edges, 240573 markings/sec, 170 secs
lola: 46440384 markings, 168914458 edges, 242340 markings/sec, 175 secs
lola: 47623783 markings, 173277068 edges, 236680 markings/sec, 180 secs
lola: 48803324 markings, 177642293 edges, 235908 markings/sec, 185 secs
lola: 49974811 markings, 181961822 edges, 234297 markings/sec, 190 secs
lola: 51178857 markings, 186411021 edges, 240809 markings/sec, 195 secs
lola: 52369283 markings, 190811003 edges, 238085 markings/sec, 200 secs
lola: 53582752 markings, 195296274 edges, 242694 markings/sec, 205 secs
lola: 54767745 markings, 199681082 edges, 236999 markings/sec, 210 secs
lola: 55961505 markings, 204093875 edges, 238752 markings/sec, 215 secs
lola: 57141008 markings, 208459692 edges, 235901 markings/sec, 220 secs
lola: 58344862 markings, 212910672 edges, 240771 markings/sec, 225 secs
lola: 59522927 markings, 217270331 edges, 235613 markings/sec, 230 secs
lola: 60690931 markings, 221589967 edges, 233601 markings/sec, 235 secs
lola: 61821089 markings, 225770781 edges, 226032 markings/sec, 240 secs
lola: 62998672 markings, 230133782 edges, 235517 markings/sec, 245 secs
lola: 64172139 markings, 234475117 edges, 234693 markings/sec, 250 secs
lola: 65335991 markings, 238786560 edges, 232770 markings/sec, 255 secs
lola: 66500842 markings, 243099795 edges, 232970 markings/sec, 260 secs
lola: 67678682 markings, 247461290 edges, 235568 markings/sec, 265 secs
lola: 68840000 markings, 251751703 edges, 232264 markings/sec, 270 secs
lola: 69933729 markings, 255801919 edges, 218746 markings/sec, 275 secs
lola: 71069680 markings, 260008872 edges, 227190 markings/sec, 280 secs
lola: 72241068 markings, 264350044 edges, 234278 markings/sec, 285 secs
lola: 73409207 markings, 268681638 edges, 233628 markings/sec, 290 secs
lola: 74554727 markings, 272922051 edges, 229104 markings/sec, 295 secs
lola: 75713097 markings, 277216219 edges, 231674 markings/sec, 300 secs
lola: 76841663 markings, 281402954 edges, 225713 markings/sec, 305 secs
lola: 78004331 markings, 285704119 edges, 232534 markings/sec, 310 secs
lola: 79143515 markings, 289922646 edges, 227837 markings/sec, 315 secs
lola: 80286310 markings, 294155340 edges, 228559 markings/sec, 320 secs
lola: 81397934 markings, 298274638 edges, 222325 markings/sec, 325 secs
lola: 82550252 markings, 302543451 edges, 230464 markings/sec, 330 secs
lola: 83662935 markings, 306669983 edges, 222537 markings/sec, 335 secs
lola: 84777159 markings, 310802911 edges, 222845 markings/sec, 340 secs
lola: 85876999 markings, 314882653 edges, 219968 markings/sec, 345 secs
lola: 87027528 markings, 319151075 edges, 230106 markings/sec, 350 secs
lola: 88115225 markings, 323191624 edges, 217539 markings/sec, 355 secs
lola: 88797710 markings, 325741967 edges, 136497 markings/sec, 360 secs
lola: 89634207 markings, 328812267 edges, 167299 markings/sec, 365 secs
lola: 90500660 markings, 332016075 edges, 173291 markings/sec, 370 secs
lola: 91210431 markings, 334646768 edges, 141954 markings/sec, 375 secs
lola: 91943531 markings, 337366655 edges, 146620 markings/sec, 380 secs
lola: 92820391 markings, 340615008 edges, 175372 markings/sec, 385 secs
lola: 93594634 markings, 343488832 edges, 154849 markings/sec, 390 secs
lola: 94441713 markings, 346632876 edges, 169416 markings/sec, 395 secs
lola: 95442100 markings, 350344599 edges, 200077 markings/sec, 400 secs
lola: 96318357 markings, 353595282 edges, 175251 markings/sec, 405 secs
lola: 97220903 markings, 356932302 edges, 180509 markings/sec, 410 secs
lola: 98050225 markings, 360017456 edges, 165864 markings/sec, 415 secs
lola: 98867477 markings, 363042727 edges, 163450 markings/sec, 420 secs
lola: 99736519 markings, 366262409 edges, 173808 markings/sec, 425 secs
lola: 100689541 markings, 369793492 edges, 190604 markings/sec, 430 secs
lola: 101495814 markings, 372778596 edges, 161255 markings/sec, 435 secs
lola: 102250291 markings, 375581766 edges, 150895 markings/sec, 440 secs
lola: 103053555 markings, 378563461 edges, 160653 markings/sec, 445 secs
lola: 103874902 markings, 381604596 edges, 164269 markings/sec, 450 secs
lola: 104774062 markings, 384942605 edges, 179832 markings/sec, 455 secs
lola: 105547303 markings, 387805380 edges, 154648 markings/sec, 460 secs
lola: 106303609 markings, 390608366 edges, 151261 markings/sec, 465 secs
lola: 107049159 markings, 393376033 edges, 149110 markings/sec, 470 secs
lola: 107867944 markings, 396412539 edges, 163757 markings/sec, 475 secs
lola: 108698673 markings, 399500271 edges, 166146 markings/sec, 480 secs
lola: 109506159 markings, 402495627 edges, 161497 markings/sec, 485 secs
lola: 110241644 markings, 405225671 edges, 147097 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (G (((p7 <= 2) AND (p8 + 1 <= p3))) OR (G (((3 <= p7) AND (p2 <= p6))) AND F (G (((p7 <= 2) AND (p8 + 1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((3 <= p7) AND (p2 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((3 <= p7) AND (p2 <= p6)))
lola: processed formula length: 30
lola: 70 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: 426 markings, 426 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((p7 <= 2) AND (p8 + 1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p7 <= 2) AND (p8 + 1 <= p3)))
lola: processed formula length: 34
lola: 70 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: 426 markings, 426 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown no no no no
lola:
preliminary result: no no no no no no no unknown no no no no
lola: memory consumption: 3436 KB
lola: time consumption: 1096 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-06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is SwimmingPool-PT-06, 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 r194-csrt-159033389800281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-06.tgz
mv SwimmingPool-PT-06 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 ;