fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r194-csrt-159033389800282
Last Updated
Jun 28, 2020

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
15799.450 3600000.00 1609578.00 14724.00 FFFFFTTTFTTFFFF? 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-159033389800282.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033389800282
=====================================================================

--------------------
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 1591212112860

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 19:21:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 19:21:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 19:21:59] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2020-06-03 19:21:59] [INFO ] Transformed 9 places.
[2020-06-03 19:21:59] [INFO ] Transformed 7 transitions.
[2020-06-03 19:21:59] [INFO ] Parsed PT model containing 9 places and 7 transitions in 79 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 1251 steps, including 0 resets, run visited all 19 properties in 9 ms. (steps per millisecond=139 )
[2020-06-03 19:21:59] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-03 19:21:59] [INFO ] Flatten gal took : 25 ms
FORMULA SwimmingPool-PT-06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 19:21:59] [INFO ] Flatten gal took : 3 ms
[2020-06-03 19:21:59] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2020-06-03 19:21:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ 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-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-09 TRUE 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-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-05 TRUE 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-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-06-06 TRUE 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-07 TRUE 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

FORMULA SwimmingPool-PT-06-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2334
rslt: Output for LTLFireability @ 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=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 19:22:00 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G (((p5 <= 0) AND ((p0 <= 0) OR (p7 <= 0)))) OR X ((p2 <= 0))))",
"processed_size": 68,
"rewrites": 49
},
"result":
{
"edges": 371,
"markings": 371,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((((p2 <= 0) U (1 <= p4)) OR (X (X (F (((p0 <= 0) OR (p7 <= 0))))) AND G ((1 <= p2)))))",
"processed_size": 90,
"rewrites": 49
},
"result":
{
"edges": 130,
"markings": 130,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 5,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G (((F ((p6 <= 0)) AND (((p1 <= 0) OR (p8 <= 0)) AND (((p0 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0))))) OR (p6 <= 0))))",
"processed_size": 132,
"rewrites": 49
},
"result":
{
"edges": 131,
"markings": 131,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 7,
"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": "X (F ((X (X (X (F ((1 <= p6))))) OR (G ((1 <= p6)) AND X (X (X (F ((1 <= p6)))))))))",
"processed_size": 84,
"rewrites": 49
},
"result":
{
"edges": 45,
"markings": 30,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 17
},
"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": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 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": "(p6 <= 0)",
"processed_size": 9,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((G ((1 <= p6)) OR ((p1 <= 0) OR (p8 <= 0)))))",
"processed_size": 51,
"rewrites": 49
},
"result":
{
"edges": 130,
"markings": 130,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F (G (((1 <= p1) AND (1 <= p8)))) AND ((1 <= p1) AND ((1 <= p8) AND ((1 <= p0) AND (1 <= p7)))))))",
"processed_size": 105,
"rewrites": 49
},
"result":
{
"edges": 128,
"markings": 127,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p1 <= 0) OR (p8 <= 0))",
"processed_size": 25,
"rewrites": 51
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 520
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"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": "F (G (((p6 <= 0) OR (1 <= p5) OR (1 <= p4))))",
"processed_size": 47,
"rewrites": 49
},
"result":
{
"edges": 33262,
"markings": 19748,
"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": 624
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 6,
"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": 2,
"visible_transitions": 0
},
"processed": "(F (((1 <= p0) AND (1 <= p7))) U (G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p0) AND (1 <= p7))))",
"processed_size": 94,
"rewrites": 49
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 780
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 780
},
"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": "(p5 <= 0)",
"processed_size": 9,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1040
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p0 <= 0) OR (p7 <= 0))",
"processed_size": 25,
"rewrites": 51
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1040
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1040
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "((1 <= p0) AND (1 <= p7))",
"processed_size": 25,
"rewrites": 49
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 3,
"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 (F ((((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))",
"processed_size": 49,
"rewrites": 49
},
"result":
{
"edges": 126,
"markings": 126,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1561
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "G (((p0 <= 0) OR (p7 <= 0)))",
"processed_size": 29,
"rewrites": 49
},
"result":
{
"edges": 426,
"markings": 426,
"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": 3122
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "((p1 <= 0) OR (p8 <= 0))",
"processed_size": 25,
"rewrites": 51
},
"result":
{
"edges": 120,
"markings": 121,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3122
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3122
},
"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": "F (G ((1 <= p5)))",
"processed_size": 17,
"rewrites": 49
},
"result":
{
"edges": 428,
"markings": 427,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3264,
"runtime": 1235.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((G(*) OR X(**))) : F(G(**)) : X(((** U **) OR (X(X(F(*))) AND G(*)))) : (F(G(**)) AND G((F(**) OR G(**)))) : (G(F(*)) OR **) : F(**) : (F(**) AND **) : (F(**) OR G(*)) : X(G(((F(*) AND (* AND (* AND *))) OR *))) : X(F((X(X(X(F(**)))) OR (G(**) AND X(X(X(F(**)))))))) : (F(**) U (G(**) OR **)) : (X(G((G(**) OR (** OR **)))) AND F(**)) : X(G((F(G(**)) AND (** AND (** AND (** AND **)))))) : X(F((G((G((F(**) OR **)) OR **)) OR G(**))))"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "no no no no no yes yes yes no yes yes no no unknown ",
"value": "no no no no no yes yes yes no yes yes no no unknown "
},
"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 LTLFireability.xml
lola: G ((NOT(F (((1 <= p5) OR ((1 <= p0) AND (1 <= p7))))) OR X ((p2 <= 0)))) : F (G (((p6 <= 0) OR (1 <= p5) OR (1 <= p4)))) : X ((((p2 <= 0) U (1 <= p4)) OR (NOT(X (X (G (((1 <= p0) AND (1 <= p7)))))) AND NOT(F ((p2 <= 0)))))) : (F (X (G ((1 <= p5)))) AND G ((F ((1 <= p6)) OR G ((1 <= p5))))) : (G (F (NOT(G ((((1 <= p0) AND (1 <= p7)) OR (1 <= p5)))))) OR ((1 <= p0) AND (1 <= p7))) : F (((1 <= p1) AND (1 <= p8))) : (F (((1 <= p0) AND (1 <= p7))) AND (p5 <= 0)) : (((X (((1 <= p3) AND (1 <= p7))) AND ((p3 <= 0) OR (p7 <= 0))) U F (((1 <= p1) AND (1 <= p8)))) OR NOT(F (((1 <= p0) AND (1 <= p7))))) : NOT(F (X (((((G ((1 <= p6)) OR ((1 <= p1) AND (1 <= p8))) OR ((1 <= p0) AND (1 <= p7))) OR ((1 <= p3) AND (1 <= p7))) AND (1 <= p6))))) : F (X ((G ((1 <= p6)) U X (X (F (X ((1 <= p6)))))))) : (F (((1 <= p0) AND (1 <= p7))) U (G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p0) AND (1 <= p7)))) : (G (X (((G ((1 <= p6)) OR (p1 <= 0)) OR (p8 <= 0)))) AND F ((1 <= p6))) : G (X (((((F (G (((1 <= p1) AND (1 <= p8)))) AND (1 <= p1)) AND (1 <= p8)) AND (1 <= p0)) AND (1 <= p7)))) : F (X ((G ((G ((F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8)))) OR (1 <= p6))) OR G (((1 <= p1) AND (1 <= p8))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:315
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:318
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:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p5 <= 0) AND ((p0 <= 0) OR (p7 <= 0)))) OR X ((p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p5 <= 0) AND ((p0 <= 0) OR (p7 <= 0)))) OR X ((p2 <= 0))))
lola: processed formula length: 68
lola: 49 rewrites
lola: closed formula file LTLFireability.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: 371 markings, 371 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p2 <= 0) U (1 <= p4)) OR (X (X (F (((p0 <= 0) OR (p7 <= 0))))) AND G ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p2 <= 0) U (1 <= p4)) OR (X (X (F (((p0 <= 0) OR (p7 <= 0))))) AND G ((1 <= p2)))))
lola: processed formula length: 90
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F ((p6 <= 0)) AND (((p1 <= 0) OR (p8 <= 0)) AND (((p0 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0))))) OR (p6 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((p6 <= 0)) AND (((p1 <= 0) OR (p8 <= 0)) AND (((p0 <= 0) OR (p7 <= 0)) AND ((p3 <= 0) OR (p7 <= 0))))) OR (p6 <= 0))))
lola: processed formula length: 132
lola: 49 rewrites
lola: closed formula file LTLFireability.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: 131 markings, 131 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (X (X (F ((1 <= p6))))) OR (G ((1 <= p6)) AND X (X (X (F ((1 <= p6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (X (X (F ((1 <= p6))))) OR (G ((1 <= p6)) AND X (X (X (F ((1 <= p6)))))))))
lola: processed formula length: 84
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 17 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: 30 markings, 45 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((G ((1 <= p6)) OR ((p1 <= 0) OR (p8 <= 0))))) AND F ((1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p6))
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: (p6 <= 0)
lola: processed formula length: 9
lola: 51 rewrites
lola: closed formula file LTLFireability.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 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((1 <= p6)) OR ((p1 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((1 <= p6)) OR ((p1 <= 0) OR (p8 <= 0)))))
lola: processed formula length: 51
lola: 49 rewrites
lola: closed formula file LTLFireability.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((1 <= p1) AND (1 <= p8)))) AND ((1 <= p1) AND ((1 <= p8) AND ((1 <= p0) AND (1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((1 <= p1) AND (1 <= p8)))) AND ((1 <= p1) AND ((1 <= p8) AND ((1 <= p0) AND (1 <= p7)))))))
lola: processed formula length: 105
lola: 49 rewrites
lola: closed formula file LTLFireability.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: 127 markings, 128 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((G ((F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8)))) OR (1 <= p6))) OR G (((1 <= p1) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((G ((F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8)))) OR (1 <= p6))) OR G (((1 <= p1) AND (1 <= p8))))))
lola: processed formula length: 126
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1787958 markings, 8658388 edges, 357592 markings/sec, 0 secs
lola: 3155986 markings, 15785110 edges, 273606 markings/sec, 5 secs
lola: 4607493 markings, 23354532 edges, 290301 markings/sec, 10 secs
lola: 5755172 markings, 29308150 edges, 229536 markings/sec, 15 secs
lola: 6876454 markings, 35073789 edges, 224256 markings/sec, 20 secs
lola: 8029387 markings, 41039992 edges, 230587 markings/sec, 25 secs
lola: 9305578 markings, 47542075 edges, 255238 markings/sec, 30 secs
lola: 10354153 markings, 52981363 edges, 209715 markings/sec, 35 secs
lola: 11423988 markings, 58504601 edges, 213967 markings/sec, 40 secs
lola: 12522848 markings, 64108984 edges, 219772 markings/sec, 45 secs
lola: 13672597 markings, 69994956 edges, 229950 markings/sec, 50 secs
lola: 14811831 markings, 75732122 edges, 227847 markings/sec, 55 secs
lola: 15826186 markings, 80874376 edges, 202871 markings/sec, 60 secs
lola: 16886066 markings, 86290540 edges, 211976 markings/sec, 65 secs
lola: 18101652 markings, 92465170 edges, 243117 markings/sec, 70 secs
lola: 19306727 markings, 98677026 edges, 241015 markings/sec, 75 secs
lola: 20563771 markings, 104865339 edges, 251409 markings/sec, 80 secs
lola: 21760819 markings, 110949413 edges, 239410 markings/sec, 85 secs
lola: 22914486 markings, 116661570 edges, 230733 markings/sec, 90 secs
lola: 24024593 markings, 122464563 edges, 222021 markings/sec, 95 secs
lola: 25158204 markings, 128050780 edges, 226722 markings/sec, 100 secs
lola: 26188985 markings, 133328853 edges, 206156 markings/sec, 105 secs
lola: 27242594 markings, 138705366 edges, 210722 markings/sec, 110 secs
lola: 28255275 markings, 143669449 edges, 202536 markings/sec, 115 secs
lola: 29262575 markings, 148689931 edges, 201460 markings/sec, 120 secs
lola: 30269522 markings, 153868248 edges, 201389 markings/sec, 125 secs
lola: 31313311 markings, 158951786 edges, 208758 markings/sec, 130 secs
lola: 32329693 markings, 164050211 edges, 203276 markings/sec, 135 secs
lola: 33392739 markings, 169305257 edges, 212609 markings/sec, 140 secs
lola: 34462434 markings, 174787163 edges, 213939 markings/sec, 145 secs
lola: 35561749 markings, 180069678 edges, 219863 markings/sec, 150 secs
lola: 36621803 markings, 185393977 edges, 212011 markings/sec, 155 secs
lola: 37700822 markings, 190930438 edges, 215804 markings/sec, 160 secs
lola: 38793573 markings, 196327578 edges, 218550 markings/sec, 165 secs
lola: 39816224 markings, 201308756 edges, 204530 markings/sec, 170 secs
lola: 40898580 markings, 206765601 edges, 216471 markings/sec, 175 secs
lola: 41917849 markings, 211961656 edges, 203854 markings/sec, 180 secs
lola: 42995777 markings, 217288572 edges, 215586 markings/sec, 185 secs
lola: 44035832 markings, 222368021 edges, 208011 markings/sec, 190 secs
lola: 45067405 markings, 227475262 edges, 206315 markings/sec, 195 secs
lola: 46112562 markings, 232593419 edges, 209031 markings/sec, 200 secs
lola: 47172559 markings, 237970388 edges, 211999 markings/sec, 205 secs
lola: 48211446 markings, 243031296 edges, 207777 markings/sec, 210 secs
lola: 49224027 markings, 248211816 edges, 202516 markings/sec, 215 secs
lola: 50271802 markings, 253378864 edges, 209555 markings/sec, 220 secs
lola: 51341771 markings, 258709601 edges, 213994 markings/sec, 225 secs
lola: 52320352 markings, 263575522 edges, 195716 markings/sec, 230 secs
lola: 53411612 markings, 268973724 edges, 218252 markings/sec, 235 secs
lola: 54448725 markings, 274008482 edges, 207423 markings/sec, 240 secs
lola: 55541755 markings, 279462173 edges, 218606 markings/sec, 245 secs
lola: 56583866 markings, 284617145 edges, 208422 markings/sec, 250 secs
lola: 57632930 markings, 290016389 edges, 209813 markings/sec, 255 secs
lola: 58765522 markings, 295482927 edges, 226518 markings/sec, 260 secs
lola: 59868325 markings, 300828627 edges, 220561 markings/sec, 265 secs
lola: 60941244 markings, 306127304 edges, 214584 markings/sec, 270 secs
lola: 62008270 markings, 311443672 edges, 213405 markings/sec, 275 secs
lola: 63082848 markings, 316680875 edges, 214916 markings/sec, 280 secs
lola: 64148949 markings, 321909205 edges, 213220 markings/sec, 285 secs
lola: 65281091 markings, 327597300 edges, 226428 markings/sec, 290 secs
lola: 66513393 markings, 333368977 edges, 246460 markings/sec, 295 secs
lola: 67717838 markings, 339493278 edges, 240889 markings/sec, 300 secs
lola: 68855239 markings, 345043804 edges, 227480 markings/sec, 305 secs
lola: 69930003 markings, 350457537 edges, 214953 markings/sec, 310 secs
lola: 71014016 markings, 355666281 edges, 216803 markings/sec, 315 secs
lola: 72101223 markings, 360914664 edges, 217441 markings/sec, 320 secs
lola: 73254145 markings, 366785097 edges, 230584 markings/sec, 325 secs
lola: 74452069 markings, 372442141 edges, 239585 markings/sec, 330 secs
lola: 75656547 markings, 378262771 edges, 240896 markings/sec, 335 secs
lola: 76683888 markings, 383498732 edges, 205468 markings/sec, 340 secs
lola: 77763013 markings, 388779407 edges, 215825 markings/sec, 345 secs
lola: 78860547 markings, 394139655 edges, 219507 markings/sec, 350 secs
lola: 79956237 markings, 399547759 edges, 219138 markings/sec, 355 secs
lola: 81071101 markings, 404848973 edges, 222973 markings/sec, 360 secs
lola: 82193225 markings, 410350580 edges, 224425 markings/sec, 365 secs
lola: 83268484 markings, 415746250 edges, 215052 markings/sec, 370 secs
lola: 84331432 markings, 420992420 edges, 212590 markings/sec, 375 secs
lola: 85409078 markings, 426254607 edges, 215529 markings/sec, 380 secs
lola: 86481899 markings, 431685012 edges, 214564 markings/sec, 385 secs
lola: 87554840 markings, 436748507 edges, 214588 markings/sec, 390 secs
lola: 88546300 markings, 441813322 edges, 198292 markings/sec, 395 secs
lola: 89637636 markings, 446796343 edges, 218267 markings/sec, 400 secs
lola: 90637174 markings, 451609972 edges, 199908 markings/sec, 405 secs
lola: 91629883 markings, 456539408 edges, 198542 markings/sec, 410 secs
lola: 92603774 markings, 461360318 edges, 194778 markings/sec, 415 secs
lola: 93589572 markings, 466187627 edges, 197160 markings/sec, 420 secs
lola: 94569409 markings, 470821025 edges, 195967 markings/sec, 425 secs
lola: 95574397 markings, 475728740 edges, 200998 markings/sec, 430 secs
lola: 96579989 markings, 480653658 edges, 201118 markings/sec, 435 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no unknown unknown unknown unknown unknown no yes unknown no no unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1) AND (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: ((p1 <= 0) OR (p8 <= 0))
lola: processed formula length: 25
lola: 51 rewrites
lola: closed formula file LTLFireability.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: 121 markings, 120 edges
lola: ========================================
lola: subprocess 8 will run for 520 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p6 <= 0) OR (1 <= p5) OR (1 <= p4))))
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 <= 0) OR (1 <= p5) OR (1 <= p4))))
lola: processed formula length: 47
lola: 49 rewrites
lola: closed formula file LTLFireability.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: 19748 markings, 33262 edges
lola: ========================================
lola: subprocess 9 will run for 624 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p0) AND (1 <= p7))) U (G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p0) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((1 <= p0) AND (1 <= p7))) U (G (((1 <= p0) AND (1 <= p7))) OR ((1 <= p0) AND (1 <= p7))))
lola: processed formula length: 94
lola: 49 rewrites
lola: closed formula file LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p0) AND (1 <= p7))) AND (p5 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p5 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 <= 0)
lola: processed formula length: 9
lola: 49 rewrites
lola: closed formula file LTLFireability.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 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p0) AND (1 <= p7)))
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: ((p0 <= 0) OR (p7 <= 0))
lola: processed formula length: 25
lola: 51 rewrites
lola: closed formula file LTLFireability.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0)))) OR ((1 <= p0) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1040 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p7))
lola: processed formula length: 25
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))
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 ((((p0 <= 0) OR (p7 <= 0)) AND (p5 <= 0))))
lola: processed formula length: 49
lola: 49 rewrites
lola: closed formula file LTLFireability.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: 126 markings, 126 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p1) AND (1 <= p8))) OR G (((p0 <= 0) OR (p7 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p0 <= 0) OR (p7 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p0 <= 0) OR (p7 <= 0)))
lola: processed formula length: 29
lola: 49 rewrites
lola: closed formula file LTLFireability.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: subprocess 13 will run for 3122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p1) AND (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: ((p1 <= 0) OR (p8 <= 0))
lola: processed formula length: 25
lola: 51 rewrites
lola: closed formula file LTLFireability.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: 121 markings, 120 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 3122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p5))) AND G ((F ((1 <= p6)) OR G ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3122 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p5)))
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 ((1 <= p5)))
lola: processed formula length: 17
lola: 49 rewrites
lola: closed formula file LTLFireability.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: 427 markings, 428 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((G ((G ((F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8)))) OR (1 <= p6))) OR G (((1 <= p1) AND (1 <= p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((G ((F (((1 <= p1) AND (1 <= p8))) OR ((1 <= p1) AND (1 <= p8)))) OR (1 <= p6))) OR G (((1 <= p1) AND (1 <= p8))))))
lola: processed formula length: 126
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1721127 markings, 8318442 edges, 344225 markings/sec, 0 secs
lola: 3176255 markings, 15887571 edges, 291026 markings/sec, 5 secs
lola: 4525444 markings, 22921915 edges, 269838 markings/sec, 10 secs
lola: 5856152 markings, 29781789 edges, 266142 markings/sec, 15 secs
lola: 7162539 markings, 36523702 edges, 261277 markings/sec, 20 secs
lola: 8208069 markings, 41962014 edges, 209106 markings/sec, 25 secs
lola: 9448842 markings, 48317817 edges, 248155 markings/sec, 30 secs
lola: 10673634 markings, 54590167 edges, 244958 markings/sec, 35 secs
lola: 11867871 markings, 60736697 edges, 238847 markings/sec, 40 secs
lola: 13090521 markings, 67008946 edges, 244530 markings/sec, 45 secs
lola: 14245639 markings, 72883073 edges, 231024 markings/sec, 50 secs
lola: 15425273 markings, 78847014 edges, 235927 markings/sec, 55 secs
lola: 16586875 markings, 84793331 edges, 232320 markings/sec, 60 secs
lola: 17805606 markings, 90929512 edges, 243746 markings/sec, 65 secs
lola: 18961698 markings, 96847391 edges, 231218 markings/sec, 70 secs
lola: 20150491 markings, 102839111 edges, 237759 markings/sec, 75 secs
lola: 21295782 markings, 108614712 edges, 229058 markings/sec, 80 secs
lola: 22472891 markings, 114463361 edges, 235422 markings/sec, 85 secs
lola: 23578495 markings, 120147086 edges, 221121 markings/sec, 90 secs
lola: 24687529 markings, 125739555 edges, 221807 markings/sec, 95 secs
lola: 25818973 markings, 131408915 edges, 226289 markings/sec, 100 secs
lola: 26981779 markings, 137361984 edges, 232561 markings/sec, 105 secs
lola: 28100527 markings, 142880455 edges, 223750 markings/sec, 110 secs
lola: 29251667 markings, 148641066 edges, 230228 markings/sec, 115 secs
lola: 30349548 markings, 154228203 edges, 219576 markings/sec, 120 secs
lola: 31470417 markings, 159718056 edges, 224174 markings/sec, 125 secs
lola: 32582184 markings, 165375205 edges, 222353 markings/sec, 130 secs
lola: 33676420 markings, 170651061 edges, 218847 markings/sec, 135 secs
lola: 34769450 markings, 176278221 edges, 218606 markings/sec, 140 secs
lola: 35873363 markings, 181754472 edges, 220783 markings/sec, 145 secs
lola: 37018567 markings, 187429709 edges, 229041 markings/sec, 150 secs
lola: 38130758 markings, 193050899 edges, 222438 markings/sec, 155 secs
lola: 39192408 markings, 198307630 edges, 212330 markings/sec, 160 secs
lola: 40222668 markings, 203285663 edges, 206052 markings/sec, 165 secs
lola: 41271076 markings, 208813050 edges, 209682 markings/sec, 170 secs
lola: 42308457 markings, 213966356 edges, 207476 markings/sec, 175 secs
lola: 43395338 markings, 219138145 edges, 217376 markings/sec, 180 secs
lola: 44458134 markings, 224477801 edges, 212559 markings/sec, 185 secs
lola: 45568177 markings, 229893018 edges, 222009 markings/sec, 190 secs
lola: 46728577 markings, 235685432 edges, 232080 markings/sec, 195 secs
lola: 47851955 markings, 241377086 edges, 224676 markings/sec, 200 secs
lola: 48949611 markings, 246863387 edges, 219531 markings/sec, 205 secs
lola: 50086735 markings, 252543937 edges, 227425 markings/sec, 210 secs
lola: 51216750 markings, 258127747 edges, 226003 markings/sec, 215 secs
lola: 52331837 markings, 263639938 edges, 223017 markings/sec, 220 secs
lola: 53378038 markings, 268764647 edges, 209240 markings/sec, 225 secs
lola: 54482175 markings, 274141077 edges, 220827 markings/sec, 230 secs
lola: 55566674 markings, 279600560 edges, 216900 markings/sec, 235 secs
lola: 56644352 markings, 284885243 edges, 215536 markings/sec, 240 secs
lola: 57676083 markings, 290251210 edges, 206346 markings/sec, 245 secs
lola: 58771389 markings, 295504485 edges, 219061 markings/sec, 250 secs
lola: 59852440 markings, 300763394 edges, 216210 markings/sec, 255 secs
lola: 60977215 markings, 306303908 edges, 224955 markings/sec, 260 secs
lola: 62046479 markings, 311611979 edges, 213853 markings/sec, 265 secs
lola: 63123369 markings, 316873064 edges, 215378 markings/sec, 270 secs
lola: 64233069 markings, 322273980 edges, 221940 markings/sec, 275 secs
lola: 65325958 markings, 327791965 edges, 218578 markings/sec, 280 secs
lola: 66382413 markings, 332783439 edges, 211291 markings/sec, 285 secs
lola: 67481596 markings, 338244030 edges, 219837 markings/sec, 290 secs
lola: 68507860 markings, 343467388 edges, 205253 markings/sec, 295 secs
lola: 69558773 markings, 348481103 edges, 210183 markings/sec, 300 secs
lola: 70619389 markings, 353806168 edges, 212123 markings/sec, 305 secs
lola: 71694942 markings, 358977704 edges, 215111 markings/sec, 310 secs
lola: 72726358 markings, 364111039 edges, 206283 markings/sec, 315 secs
lola: 73747962 markings, 369064044 edges, 204321 markings/sec, 320 secs
lola: 74760381 markings, 373955862 edges, 202484 markings/sec, 325 secs
lola: 75820081 markings, 379198504 edges, 211940 markings/sec, 330 secs
lola: 76891260 markings, 384439281 edges, 214236 markings/sec, 335 secs
lola: 77936661 markings, 389639385 edges, 209080 markings/sec, 340 secs
lola: 78953448 markings, 394615853 edges, 203357 markings/sec, 345 secs
lola: 79999552 markings, 399738008 edges, 209221 markings/sec, 350 secs
lola: 81027355 markings, 404636276 edges, 205561 markings/sec, 355 secs
lola: 82116546 markings, 409867301 edges, 217838 markings/sec, 360 secs
lola: 83131873 markings, 415123951 edges, 203065 markings/sec, 365 secs
lola: 84192810 markings, 420336896 edges, 212187 markings/sec, 370 secs
lola: 85308310 markings, 425801379 edges, 223100 markings/sec, 375 secs
lola: 86360712 markings, 431120852 edges, 210480 markings/sec, 380 secs
lola: 87437275 markings, 436185132 edges, 215313 markings/sec, 385 secs
lola: 88481918 markings, 441437514 edges, 208929 markings/sec, 390 secs
lola: 89551120 markings, 446435246 edges, 213840 markings/sec, 395 secs
lola: 90590700 markings, 451389338 edges, 207916 markings/sec, 400 secs
lola: 91596778 markings, 456363489 edges, 201216 markings/sec, 405 secs
lola: 92631360 markings, 461473520 edges, 206916 markings/sec, 410 secs
lola: 93705021 markings, 466689508 edges, 214732 markings/sec, 415 secs
lola: 94778481 markings, 471812685 edges, 214692 markings/sec, 420 secs
lola: 95800085 markings, 476819091 edges, 204321 markings/sec, 425 secs
lola: 96824354 markings, 481836235 edges, 204854 markings/sec, 430 secs
lola: 97851954 markings, 486856769 edges, 205520 markings/sec, 435 secs
lola: 98880715 markings, 491884116 edges, 205752 markings/sec, 440 secs
lola: 99887218 markings, 496817826 edges, 201301 markings/sec, 445 secs
lola: 100485965 markings, 499746419 edges, 119749 markings/sec, 450 secs
lola: 100808012 markings, 501327062 edges, 64409 markings/sec, 455 secs
lola: 101512658 markings, 504802049 edges, 140929 markings/sec, 460 secs
lola: 102391746 markings, 509111118 edges, 175818 markings/sec, 465 secs
lola: 102960802 markings, 511907123 edges, 113811 markings/sec, 470 secs
lola: 103301141 markings, 513500811 edges, 68068 markings/sec, 475 secs
lola: 103830322 markings, 516069624 edges, 105836 markings/sec, 480 secs
lola: 104245817 markings, 518152854 edges, 83099 markings/sec, 485 secs
lola: 104595340 markings, 519958956 edges, 69905 markings/sec, 490 secs
lola: 105180523 markings, 522816710 edges, 117037 markings/sec, 495 secs
lola: 105567254 markings, 524704717 edges, 77346 markings/sec, 500 secs
lola: 105970662 markings, 526447443 edges, 80682 markings/sec, 505 secs
lola: 106417705 markings, 528540097 edges, 89409 markings/sec, 510 secs
lola: 106905158 markings, 530989556 edges, 97491 markings/sec, 515 secs
lola: 107536990 markings, 534102991 edges, 126366 markings/sec, 520 secs
lola: 107858233 markings, 535732464 edges, 64249 markings/sec, 525 secs
lola: 108204635 markings, 537359169 edges, 69280 markings/sec, 530 secs
lola: 108600740 markings, 539440241 edges, 79221 markings/sec, 535 secs
lola: 109125766 markings, 542011809 edges, 105005 markings/sec, 540 secs
lola: 109552143 markings, 544081561 edges, 85275 markings/sec, 545 secs
lola: 109864552 markings, 545608328 edges, 62482 markings/sec, 550 secs
lola: 110153911 markings, 546977661 edges, 57872 markings/sec, 555 secs
lola: 110389819 markings, 548109295 edges, 47182 markings/sec, 560 secs
lola: 110719858 markings, 549791005 edges, 66008 markings/sec, 565 secs
lola: 111337423 markings, 552678246 edges, 123513 markings/sec, 570 secs
lola: 111639170 markings, 554121280 edges, 60349 markings/sec, 575 secs
lola: 111947811 markings, 555579700 edges, 61728 markings/sec, 580 secs
lola: 112230323 markings, 556955742 edges, 56502 markings/sec, 585 secs
lola: 112556242 markings, 558558651 edges, 65184 markings/sec, 590 secs
lola: 112845640 markings, 560053102 edges, 57880 markings/sec, 595 secs
lola: 113160482 markings, 561541187 edges, 62968 markings/sec, 600 secs
lola: 113436120 markings, 562925415 edges, 55128 markings/sec, 605 secs
lola: 113752554 markings, 564312523 edges, 63287 markings/sec, 610 secs
lola: 114072758 markings, 565961846 edges, 64041 markings/sec, 615 secs
lola: 114387178 markings, 567534448 edges, 62884 markings/sec, 620 secs
lola: 114699313 markings, 569030034 edges, 62427 markings/sec, 625 secs
lola: 115029049 markings, 570588407 edges, 65947 markings/sec, 630 secs
lola: 115321177 markings, 571977980 edges, 58426 markings/sec, 635 secs
lola: 115605919 markings, 573331279 edges, 56948 markings/sec, 640 secs
lola: 115909294 markings, 574758384 edges, 60675 markings/sec, 645 secs
lola: 116344376 markings, 576794080 edges, 87016 markings/sec, 650 secs
lola: 116638619 markings, 578231131 edges, 58849 markings/sec, 655 secs
lola: 116958057 markings, 579743340 edges, 63888 markings/sec, 660 secs
lola: 117277823 markings, 581299612 edges, 63953 markings/sec, 665 secs
lola: 117623318 markings, 582989878 edges, 69099 markings/sec, 670 secs
lola: 117891594 markings, 584376827 edges, 53655 markings/sec, 675 secs
lola: 118215304 markings, 585942112 edges, 64742 markings/sec, 680 secs
lola: 118528335 markings, 587470586 edges, 62606 markings/sec, 685 secs
lola: 118895649 markings, 589266725 edges, 73463 markings/sec, 690 secs
lola: 119226695 markings, 590805171 edges, 66209 markings/sec, 695 secs
lola: 119558594 markings, 592441528 edges, 66380 markings/sec, 700 secs
lola: 119833236 markings, 593838552 edges, 54928 markings/sec, 705 secs
lola: 120136558 markings, 595278620 edges, 60664 markings/sec, 710 secs
lola: 120415801 markings, 596733785 edges, 55849 markings/sec, 715 secs
lola: 120994695 markings, 599572500 edges, 115779 markings/sec, 720 secs
lola: 121528056 markings, 602051266 edges, 106672 markings/sec, 725 secs
lola: 121912000 markings, 603992790 edges, 76789 markings/sec, 730 secs
lola: 122334888 markings, 606088454 edges, 84578 markings/sec, 735 secs
lola: 122651066 markings, 607771151 edges, 63236 markings/sec, 740 secs
lola: 122929431 markings, 609199115 edges, 55673 markings/sec, 745 secs
lola: 123223385 markings, 610605277 edges, 58791 markings/sec, 750 secs
lola: 123494383 markings, 611977435 edges, 54200 markings/sec, 755 secs
lola: 123809473 markings, 613612985 edges, 63018 markings/sec, 760 secs
lola: 124152011 markings, 615288693 edges, 68508 markings/sec, 765 secs
lola: 124578862 markings, 617200015 edges, 85370 markings/sec, 770 secs
lola: 125019863 markings, 619385981 edges, 88200 markings/sec, 775 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no yes yes yes no yes yes no no unknown
lola:
preliminary result: no no no no no yes yes yes no yes yes no no unknown
lola: memory consumption: 3264 KB
lola: time consumption: 1235 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.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="LTLFireability"
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 LTLFireability"
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-159033389800282"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;