Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334500082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 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 gold2020
Input is ClientsAndServers-PT-N0010P2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334500082
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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 ClientsAndServers-PT-N0010P2-00
FORMULA_NAME ClientsAndServers-PT-N0010P2-01
FORMULA_NAME ClientsAndServers-PT-N0010P2-02
FORMULA_NAME ClientsAndServers-PT-N0010P2-03
FORMULA_NAME ClientsAndServers-PT-N0010P2-04
FORMULA_NAME ClientsAndServers-PT-N0010P2-05
FORMULA_NAME ClientsAndServers-PT-N0010P2-06
FORMULA_NAME ClientsAndServers-PT-N0010P2-07
FORMULA_NAME ClientsAndServers-PT-N0010P2-08
FORMULA_NAME ClientsAndServers-PT-N0010P2-09
FORMULA_NAME ClientsAndServers-PT-N0010P2-10
FORMULA_NAME ClientsAndServers-PT-N0010P2-11
FORMULA_NAME ClientsAndServers-PT-N0010P2-12
FORMULA_NAME ClientsAndServers-PT-N0010P2-13
FORMULA_NAME ClientsAndServers-PT-N0010P2-14
FORMULA_NAME ClientsAndServers-PT-N0010P2-15

=== Now, execution of the tool begins

BK_START 1620897167346

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:12:48] [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]
[2021-05-13 09:12:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:12:48] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-13 09:12:48] [INFO ] Transformed 25 places.
[2021-05-13 09:12:48] [INFO ] Transformed 18 transitions.
[2021-05-13 09:12:48] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 748 steps, including 0 resets, run visited all 26 properties in 4 ms. (steps per millisecond=187 )
[2021-05-13 09:12:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-13 09:12:49] [INFO ] Flatten gal took : 21 ms
FORMULA ClientsAndServers-PT-N0010P2-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P2-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:12:49] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:12:49] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-13 09:12:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0010P2 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0010P2-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P2-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2307
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0010P2

{
"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": "Thu May 13 09:12:49 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 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 (G ((1 <= p16)))",
"processed_size": 18,
"rewrites": 104
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X ((((p24 <= 0) R X (F ((p24 <= 0)))) R ((p9 <= 0) R (p24 <= 0)))) OR (1 <= p9)))",
"processed_size": 85,
"rewrites": 104
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((X ((p22 <= 0)) OR (1 <= p18))))",
"processed_size": 38,
"rewrites": 104
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G ((X (G ((1 <= p12))) OR ((p4 <= 0) OR (p21 <= 0)))) OR (p24 <= 0)))",
"processed_size": 73,
"rewrites": 104
},
"result":
{
"edges": 667,
"markings": 666,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1,
"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": "G (((1 <= p7) AND (1 <= p23)))",
"processed_size": 30,
"rewrites": 104
},
"result":
{
"edges": 100,
"markings": 100,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((G ((p6 <= 0)) OR (X (G ((p6 <= 0))) AND (p6 <= 0)))))",
"processed_size": 60,
"rewrites": 104
},
"result":
{
"edges": 663,
"markings": 662,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 401
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "G (F ((X (X (((p0 <= 0) OR (p13 <= 0)))) AND (X (F (((p0 <= 0) OR (p13 <= 0)))) OR (p16 <= 0)))))",
"processed_size": 99,
"rewrites": 104
},
"result":
{
"edges": 968,
"markings": 968,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 458
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 4,
"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 (X (F ((G ((1 <= p12)) OR (((p5 <= 0) OR (p15 <= 0)) AND (1 <= p12))))))",
"processed_size": 75,
"rewrites": 104
},
"result":
{
"edges": 2080523,
"markings": 436278,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 535
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 4,
"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": 4,
"visible_transitions": 0
},
"processed": "X (G (((((1 <= p3)) U ((1 <= p0) AND (1 <= p13))) AND F (G ((1 <= p24))))))",
"processed_size": 75,
"rewrites": 104
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 642
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p3 <= 0))))",
"processed_size": 19,
"rewrites": 104
},
"result":
{
"edges": 321,
"markings": 319,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 802
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"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": 3,
"visible_transitions": 0
},
"processed": "G ((F ((G (((p8 <= 0) OR (p15 <= 0))) OR G (F (((p8 <= 0) OR (p15 <= 0)))))) AND F ((p10 <= 0))))",
"processed_size": 99,
"rewrites": 104
},
"result":
{
"edges": 1409,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1070
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p16) OR ((1 <= p8) AND (1 <= p15)))) R (p22 <= 0))))",
"processed_size": 70,
"rewrites": 104
},
"result":
{
"edges": 706,
"markings": 682,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1605
},
"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": "(1 <= p18)",
"processed_size": 10,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3210
},
"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": "(p12 <= 0)",
"processed_size": 10,
"rewrites": 106
},
"result":
{
"edges": 653,
"markings": 483,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 13,
"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": true
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3210
},
"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": "((p11 <= 0) OR (p17 <= 0))",
"processed_size": 27,
"rewrites": 106
},
"result":
{
"edges": 5480,
"markings": 3011,
"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": null
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},

{
"child":
[

{
"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 <= p13))",
"processed_size": 26,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((X (((1 <= p0) AND (1 <= p13))) AND ((1 <= p0) AND (1 <= p13)))))",
"processed_size": 71,
"rewrites": 104
},
"result":
{
"edges": 645,
"markings": 645,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"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": "((p11 <= 0) OR (p17 <= 0))",
"processed_size": 27,
"rewrites": 106
},
"result":
{
"edges": 5480,
"markings": 3011,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3468,
"runtime": 1263.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F((G(*) OR G(F(*)))) AND F(*))) : (X(G(**)) AND F((X(F((** OR **))) OR F(**)))) : G((X(((* R X(F(*))) R (* R *))) OR **)) : (F(**) OR (G((F(**) AND (** OR **))) AND F(**))) : X(F((X(**) OR **))) : (F(**) OR (G((* R *)) AND **)) : G(F((G(*) R *))) : X((G((X(G(**)) OR (* OR *))) OR *)) : (X(G((X(**) AND (** AND **)))) AND (G(F(**)) OR **)) : (G(**) OR G(F((G(*) OR (X(G(*)) AND *))))) : F(G(*)) : G(F((X(X(*)) AND (X(F(*)) OR *)))) : X(X(F((G(*) OR (* AND *))))) : X(G(((** U **) AND F(G(**)))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no no unknown yes yes no no no no no no yes no ",
"value": "no no no unknown yes yes no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 43/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800
lola: finding significant places
lola: 25 places, 18 transitions, 17 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: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: LP says that atomic proposition is always true: (1 <= p14)
lola: G ((NOT(G ((F (((1 <= p8) AND (1 <= p15))) AND F (G (((1 <= p8) AND (1 <= p15))))))) AND NOT(G ((1 <= p10))))) : (G (X (G ((1 <= p16)))) AND F ((X ((F ((1 <= p9)) OR F (((1 <= p11) AND (1 <= p17))))) OR F (((1 <= p11) AND (1 <= p17)))))) : G ((X (NOT((((1 <= p24) U G (X ((1 <= p24)))) U ((1 <= p9) U (1 <= p24))))) OR (1 <= p9))) : (G ((((1 <= p2)) U (1 <= p9))) U ((1 <= p9) U F (((1 <= p11) AND (1 <= p17))))) : X (F ((X ((p22 <= 0)) OR (1 <= p18)))) : (F ((1 <= p12)) OR (G (NOT(((1 <= p18) U ((1 <= p2))))) AND (1 <= p18))) : G (F (NOT(X ((F (((p16 <= 0) AND ((p8 <= 0) OR (p15 <= 0)))) U (1 <= p22)))))) : NOT(X ((((((1 <= p4) AND (1 <= p21)) OR ((1 <= p8) AND (1 <= p15))) U F (((X (NOT(G ((1 <= p12)))) AND (1 <= p4)) AND (1 <= p21)))) AND (1 <= p24)))) : (G (X (((X (((1 <= p0) AND (1 <= p13))) AND (1 <= p0)) AND (1 <= p13)))) AND (G (F (((1 <= p0) AND (1 <= p13)))) OR ((1 <= p0) AND (1 <= p13)))) : (G (((1 <= p7) AND (1 <= p23))) OR G (X (NOT(X (G ((X (F ((1 <= p6))) U (1 <= p6)))))))) : X (F (G (NOT(F ((((1 <= p7) AND (1 <= p23)) U ((1 <= p3)))))))) : NOT(X (F (G ((X (X (((1 <= p0) AND (1 <= p13)))) OR (X (G (((1 <= p0) AND (1 <= p13)))) AND (1 <= p16))))))) : NOT(G (X (X (G ((((1 <= p5) AND (1 <= p15)) U (p12 <= 0))))))) : X (G (((((1 <= p3)) U ((1 <= p0) AND (1 <= p13))) AND F (X (F (G ((1 <= p24))))))))
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:332
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((1 <= p16))) AND F ((X (F (((1 <= p9) OR ((1 <= p11) AND (1 <= p17))))) OR F (((1 <= p11) AND (1 <= p17))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p16)))
lola: processed formula length: 18
lola: 104 rewrites
lola: closed formula file LTLFireability.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: 645 markings, 645 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((p24 <= 0) R X (F ((p24 <= 0)))) R ((p9 <= 0) R (p24 <= 0)))) OR (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((p24 <= 0) R X (F ((p24 <= 0)))) R ((p9 <= 0) R (p24 <= 0)))) OR (1 <= p9)))
lola: processed formula length: 85
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X ((p22 <= 0)) OR (1 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X ((p22 <= 0)) OR (1 <= p18))))
lola: processed formula length: 38
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X (G ((1 <= p12))) OR ((p4 <= 0) OR (p21 <= 0)))) OR (p24 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X (G ((1 <= p12))) OR ((p4 <= 0) OR (p21 <= 0)))) OR (p24 <= 0)))
lola: processed formula length: 73
lola: 104 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: 666 markings, 667 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((X (((1 <= p0) AND (1 <= p13))) AND ((1 <= p0) AND (1 <= p13))))) AND (G (F (((1 <= p0) AND (1 <= p13)))) OR ((1 <= p0) AND (1 <= p13))))
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: ((1 <= p0) AND (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p13))
lola: processed formula length: 26
lola: 104 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 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p0) AND (1 <= p13))))
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 (((1 <= p0) AND (1 <= p13))))
lola: processed formula length: 34
lola: 104 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: 2065054 markings, 7587788 edges, 413011 markings/sec, 0 secs
lola: 3781847 markings, 14210958 edges, 343359 markings/sec, 5 secs
lola: 5673723 markings, 21607728 edges, 378375 markings/sec, 10 secs
lola: 7536594 markings, 29036681 edges, 372574 markings/sec, 15 secs
lola: 9399853 markings, 36502623 edges, 372652 markings/sec, 20 secs
lola: 11186943 markings, 43625541 edges, 357418 markings/sec, 25 secs
lola: 13046457 markings, 51102085 edges, 371903 markings/sec, 30 secs
lola: 14694358 markings, 58225590 edges, 329580 markings/sec, 35 secs
lola: 16292299 markings, 65228910 edges, 319588 markings/sec, 40 secs
lola: 17890673 markings, 72216703 edges, 319675 markings/sec, 45 secs
lola: 19388827 markings, 78857684 edges, 299631 markings/sec, 50 secs
lola: 21130776 markings, 86127508 edges, 348390 markings/sec, 55 secs
lola: 22772685 markings, 93237124 edges, 328382 markings/sec, 60 secs
lola: 24351673 markings, 100153266 edges, 315798 markings/sec, 65 secs
lola: 26097930 markings, 107405863 edges, 349251 markings/sec, 70 secs
lola: 27792926 markings, 114658625 edges, 338999 markings/sec, 75 secs
lola: 29558563 markings, 122016799 edges, 353127 markings/sec, 80 secs
lola: 31350377 markings, 129475483 edges, 358363 markings/sec, 85 secs
lola: 33263934 markings, 137245005 edges, 382711 markings/sec, 90 secs
lola: 35217000 markings, 144994554 edges, 390613 markings/sec, 95 secs
lola: 36801871 markings, 151987272 edges, 316974 markings/sec, 100 secs
lola: 38286722 markings, 158552110 edges, 296970 markings/sec, 105 secs
lola: 40038088 markings, 165818901 edges, 350273 markings/sec, 110 secs
lola: 41725445 markings, 172763873 edges, 337471 markings/sec, 115 secs
lola: 43590642 markings, 180172106 edges, 373039 markings/sec, 120 secs
lola: 45241929 markings, 187644322 edges, 330257 markings/sec, 125 secs
lola: 46960810 markings, 195330323 edges, 343776 markings/sec, 130 secs
lola: 48564362 markings, 202502580 edges, 320710 markings/sec, 135 secs
lola: 50123072 markings, 209598407 edges, 311742 markings/sec, 140 secs
lola: 51625481 markings, 216363228 edges, 300482 markings/sec, 145 secs
lola: 53167249 markings, 223486195 edges, 308354 markings/sec, 150 secs
lola: 54659588 markings, 230290848 edges, 298468 markings/sec, 155 secs
lola: 56179483 markings, 236908074 edges, 303979 markings/sec, 160 secs
lola: 57599702 markings, 243615023 edges, 284044 markings/sec, 165 secs
lola: 59108773 markings, 250043573 edges, 301814 markings/sec, 170 secs
lola: 60664494 markings, 256973078 edges, 311144 markings/sec, 175 secs
lola: 62135994 markings, 264240211 edges, 294300 markings/sec, 180 secs
lola: 63581054 markings, 271354864 edges, 289012 markings/sec, 185 secs
lola: 64906928 markings, 277951355 edges, 265175 markings/sec, 190 secs
lola: 66164287 markings, 284167141 edges, 251472 markings/sec, 195 secs
lola: 67461709 markings, 290675432 edges, 259484 markings/sec, 200 secs
lola: 68933781 markings, 297450724 edges, 294414 markings/sec, 205 secs
lola: 70203607 markings, 303846810 edges, 253965 markings/sec, 210 secs
lola: 71526847 markings, 309925882 edges, 264648 markings/sec, 215 secs
lola: 73099490 markings, 317163131 edges, 314529 markings/sec, 220 secs
lola: 74573902 markings, 324347788 edges, 294882 markings/sec, 225 secs
lola: 75921332 markings, 330972002 edges, 269486 markings/sec, 230 secs
lola: 77334992 markings, 337760294 edges, 282732 markings/sec, 235 secs
lola: 78699508 markings, 344372577 edges, 272903 markings/sec, 240 secs
lola: 80188242 markings, 351003054 edges, 297747 markings/sec, 245 secs
lola: 81709140 markings, 358365428 edges, 304180 markings/sec, 250 secs
lola: 83107459 markings, 365151310 edges, 279664 markings/sec, 255 secs
lola: 84541911 markings, 371932115 edges, 286890 markings/sec, 260 secs
lola: 86071999 markings, 378864406 edges, 306018 markings/sec, 265 secs
lola: 87509827 markings, 385664542 edges, 287566 markings/sec, 270 secs
lola: 89071092 markings, 392804966 edges, 312253 markings/sec, 275 secs
lola: 90637539 markings, 400060196 edges, 313289 markings/sec, 280 secs
lola: 92380822 markings, 407896271 edges, 348657 markings/sec, 285 secs
lola: 94098751 markings, 416217499 edges, 343586 markings/sec, 290 secs
lola: 95155584 markings, 423770135 edges, 211367 markings/sec, 295 secs
lola: 96109441 markings, 431033855 edges, 190771 markings/sec, 300 secs
lola: 97580737 markings, 438196186 edges, 294259 markings/sec, 305 secs
lola: 99230876 markings, 445226413 edges, 330028 markings/sec, 310 secs
lola: 100735869 markings, 451988009 edges, 300999 markings/sec, 315 secs
lola: 102056195 markings, 458282443 edges, 264065 markings/sec, 320 secs
lola: 103104473 markings, 465523109 edges, 209656 markings/sec, 325 secs
lola: 104100944 markings, 473133874 edges, 199294 markings/sec, 330 secs
lola: 105306002 markings, 480196659 edges, 241012 markings/sec, 335 secs
lola: 106659290 markings, 486745343 edges, 270658 markings/sec, 340 secs
lola: 107860591 markings, 492845829 edges, 240260 markings/sec, 345 secs
lola: 109751472 markings, 500519894 edges, 378176 markings/sec, 350 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown yes unknown unknown no unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown no no unknown yes unknown unknown no unknown unknown unknown unknown unknown unknown
lola: memory consumption: 27112 KB
lola: time consumption: 359 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p7) AND (1 <= p23))) OR G (F ((G ((p6 <= 0)) OR (X (G ((p6 <= 0))) AND (p6 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p7) AND (1 <= p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p7) AND (1 <= p23)))
lola: processed formula length: 30
lola: 104 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: 100 markings, 100 edges
lola: ========================================
lola: subprocess 6 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p6 <= 0)) OR (X (G ((p6 <= 0))) AND (p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p6 <= 0)) OR (X (G ((p6 <= 0))) AND (p6 <= 0)))))
lola: processed formula length: 60
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 662 markings, 663 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 401 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (((p0 <= 0) OR (p13 <= 0)))) AND (X (F (((p0 <= 0) OR (p13 <= 0)))) OR (p16 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (((p0 <= 0) OR (p13 <= 0)))) AND (X (F (((p0 <= 0) OR (p13 <= 0)))) OR (p16 <= 0)))))
lola: processed formula length: 99
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 968 markings, 968 edges
lola: ========================================
lola: subprocess 7 will run for 458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((1 <= p12)) OR (((p5 <= 0) OR (p15 <= 0)) AND (1 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((1 <= p12)) OR (((p5 <= 0) OR (p15 <= 0)) AND (1 <= p12))))))
lola: processed formula length: 75
lola: 104 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 436278 markings, 2080523 edges
lola: ========================================
lola: subprocess 8 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((((1 <= p3)) U ((1 <= p0) AND (1 <= p13))) AND F (G ((1 <= p24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((((1 <= p3)) U ((1 <= p0) AND (1 <= p13))) AND F (G ((1 <= p24))))))
lola: processed formula length: 75
lola: 104 rewrites
lola: closed formula file LTLFireability.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: 645 markings, 645 edges
lola: ========================================
lola: subprocess 9 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p3 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p3 <= 0))))
lola: processed formula length: 19
lola: 104 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: 319 markings, 321 edges
lola: ========================================
lola: subprocess 10 will run for 802 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((G (((p8 <= 0) OR (p15 <= 0))) OR G (F (((p8 <= 0) OR (p15 <= 0)))))) AND F ((p10 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((G (((p8 <= 0) OR (p15 <= 0))) OR G (F (((p8 <= 0) OR (p15 <= 0)))))) AND F ((p10 <= 0))))
lola: processed formula length: 99
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1001 markings, 1409 edges
lola: ========================================
lola: subprocess 11 will run for 1070 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p16) OR ((1 <= p8) AND (1 <= p15)))) R (p22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p16) OR ((1 <= p8) AND (1 <= p15)))) R (p22 <= 0))))
lola: processed formula length: 70
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 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: 682 markings, 706 edges
lola: ========================================
lola: subprocess 12 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p12)) OR (G (((p18 <= 0) R ((p2 <= 0)))) AND (1 <= p18)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 1605 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p18)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p18)
lola: processed formula length: 10
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p12))
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: (p12 <= 0)
lola: processed formula length: 10
lola: 106 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: 483 markings, 653 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p11) AND (1 <= p17))) OR (G ((F ((1 <= p9)) AND (((1 <= p2)) OR (1 <= p9)))) AND F (((1 <= p11) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 3210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p11) AND (1 <= p17)))
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: ((p11 <= 0) OR (p17 <= 0))
lola: processed formula length: 27
lola: 106 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: 3011 markings, 5480 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 (((1 <= p0) AND (1 <= p13))) AND ((1 <= p0) AND (1 <= p13))))) AND (G (F (((1 <= p0) AND (1 <= p13)))) OR ((1 <= p0) AND (1 <= p13))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p0) AND (1 <= p13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p0) AND (1 <= p13))
lola: processed formula length: 26
lola: 104 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: ========================================
lola: ...considering subproblem: G (F (((1 <= p0) AND (1 <= p13))))
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 (((1 <= p0) AND (1 <= p13))))
lola: processed formula length: 34
lola: 104 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: 2299052 markings, 8474560 edges, 459810 markings/sec, 0 secs
lola: 4193163 markings, 15893517 edges, 378822 markings/sec, 5 secs
lola: 5974608 markings, 22839877 edges, 356289 markings/sec, 10 secs
lola: 7630414 markings, 29395769 edges, 331161 markings/sec, 15 secs
lola: 9391205 markings, 36464258 edges, 352158 markings/sec, 20 secs
lola: 11106708 markings, 43285745 edges, 343101 markings/sec, 25 secs
lola: 12947984 markings, 50715276 edges, 368255 markings/sec, 30 secs
lola: 14583742 markings, 57744500 edges, 327152 markings/sec, 35 secs
lola: 16141934 markings, 64564940 edges, 311638 markings/sec, 40 secs
lola: 17734731 markings, 71487450 edges, 318559 markings/sec, 45 secs
lola: 19277500 markings, 78336561 edges, 308554 markings/sec, 50 secs
lola: 21047104 markings, 85780203 edges, 353921 markings/sec, 55 secs
lola: 22731478 markings, 93050333 edges, 336875 markings/sec, 60 secs
lola: 24325196 markings, 100033695 edges, 318744 markings/sec, 65 secs
lola: 26101685 markings, 107422082 edges, 355298 markings/sec, 70 secs
lola: 27809989 markings, 114735451 edges, 341661 markings/sec, 75 secs
lola: 29572087 markings, 122076990 edges, 352420 markings/sec, 80 secs
lola: 31380160 markings, 129602021 edges, 361615 markings/sec, 85 secs
lola: 33303480 markings, 137410751 edges, 384664 markings/sec, 90 secs
lola: 35204771 markings, 144942270 edges, 380258 markings/sec, 95 secs
lola: 36747477 markings, 151760439 edges, 308541 markings/sec, 100 secs
lola: 38203030 markings, 158218131 edges, 291111 markings/sec, 105 secs
lola: 39931903 markings, 165377893 edges, 345775 markings/sec, 110 secs
lola: 41550244 markings, 172115197 edges, 323668 markings/sec, 115 secs
lola: 43359832 markings, 179198447 edges, 361918 markings/sec, 120 secs
lola: 45011619 markings, 186586587 edges, 330357 markings/sec, 125 secs
lola: 46731042 markings, 194247433 edges, 343885 markings/sec, 130 secs
lola: 48306143 markings, 201406367 edges, 315020 markings/sec, 135 secs
lola: 49888234 markings, 208517603 edges, 316418 markings/sec, 140 secs
lola: 51347780 markings, 215209327 edges, 291909 markings/sec, 145 secs
lola: 52903882 markings, 222252137 edges, 311220 markings/sec, 150 secs
lola: 54351107 markings, 228868600 edges, 289445 markings/sec, 155 secs
lola: 55864443 markings, 235513718 edges, 302667 markings/sec, 160 secs
lola: 57323045 markings, 242297954 edges, 291720 markings/sec, 165 secs
lola: 58821128 markings, 248730536 edges, 299617 markings/sec, 170 secs
lola: 60328657 markings, 255418875 edges, 301506 markings/sec, 175 secs
lola: 61788384 markings, 262510228 edges, 291945 markings/sec, 180 secs
lola: 63265174 markings, 269742169 edges, 295358 markings/sec, 185 secs
lola: 64592863 markings, 276408775 edges, 265538 markings/sec, 190 secs
lola: 65860840 markings, 282823424 edges, 253595 markings/sec, 195 secs
lola: 67207586 markings, 289442213 edges, 269349 markings/sec, 200 secs
lola: 68653446 markings, 296157214 edges, 289172 markings/sec, 205 secs
lola: 69935264 markings, 302449118 edges, 256364 markings/sec, 210 secs
lola: 71274213 markings, 308752338 edges, 267790 markings/sec, 215 secs
lola: 72814884 markings, 315751555 edges, 308134 markings/sec, 220 secs
lola: 74269975 markings, 322889548 edges, 291018 markings/sec, 225 secs
lola: 75618269 markings, 329578433 edges, 269659 markings/sec, 230 secs
lola: 76992936 markings, 336176507 edges, 274933 markings/sec, 235 secs
lola: 78391355 markings, 342783990 edges, 279684 markings/sec, 240 secs
lola: 79747367 markings, 349127494 edges, 271202 markings/sec, 245 secs
lola: 81326706 markings, 356500050 edges, 315868 markings/sec, 250 secs
lola: 82716301 markings, 363274040 edges, 277919 markings/sec, 255 secs
lola: 84160255 markings, 370036387 edges, 288791 markings/sec, 260 secs
lola: 85687096 markings, 377022742 edges, 305368 markings/sec, 265 secs
lola: 87136733 markings, 384007061 edges, 289927 markings/sec, 270 secs
lola: 88682810 markings, 390984028 edges, 309215 markings/sec, 275 secs
lola: 90239665 markings, 398231857 edges, 311371 markings/sec, 280 secs
lola: 91871983 markings, 405659818 edges, 326464 markings/sec, 285 secs
lola: 93737557 markings, 413813430 edges, 373115 markings/sec, 290 secs
lola: 94858847 markings, 421548990 edges, 224258 markings/sec, 295 secs
lola: 95828614 markings, 428927798 edges, 193953 markings/sec, 300 secs
lola: 97144358 markings, 436316737 edges, 263149 markings/sec, 305 secs
lola: 98786403 markings, 443281445 edges, 328409 markings/sec, 310 secs
lola: 100315221 markings, 450001640 edges, 305764 markings/sec, 315 secs
lola: 101709732 markings, 456590242 edges, 278902 markings/sec, 320 secs
lola: 102771561 markings, 463733282 edges, 212366 markings/sec, 325 secs
lola: 103871507 markings, 471203159 edges, 219989 markings/sec, 330 secs
lola: 104956738 markings, 478553200 edges, 217046 markings/sec, 335 secs
lola: 106336658 markings, 485060830 edges, 275984 markings/sec, 340 secs
lola: 107564154 markings, 491522340 edges, 245499 markings/sec, 345 secs
lola: 109357906 markings, 498907762 edges, 358750 markings/sec, 350 secs
lola: 111044262 markings, 506009432 edges, 337271 markings/sec, 355 secs
lola: 112300578 markings, 511478103 edges, 251263 markings/sec, 360 secs
lola: 112711053 markings, 513159665 edges, 82095 markings/sec, 365 secs
lola: 114178861 markings, 519615283 edges, 293562 markings/sec, 370 secs
lola: 115653912 markings, 526044282 edges, 295010 markings/sec, 375 secs
lola: 117030425 markings, 532120375 edges, 275303 markings/sec, 380 secs
lola: 118425381 markings, 538103121 edges, 278991 markings/sec, 385 secs
lola: 119813315 markings, 544481216 edges, 277587 markings/sec, 390 secs
lola: 121163172 markings, 550402836 edges, 269971 markings/sec, 395 secs
lola: 122457300 markings, 556309545 edges, 258826 markings/sec, 400 secs
lola: 123956934 markings, 562741205 edges, 299927 markings/sec, 405 secs
lola: 125283801 markings, 568924531 edges, 265373 markings/sec, 410 secs
lola: 126345969 markings, 573286758 edges, 212434 markings/sec, 415 secs
lola: 127039446 markings, 576145860 edges, 138695 markings/sec, 420 secs
lola: 127789414 markings, 579400446 edges, 149994 markings/sec, 425 secs
lola: 128662418 markings, 583091567 edges, 174601 markings/sec, 430 secs
lola: 129414035 markings, 586299621 edges, 150323 markings/sec, 435 secs
lola: 129961578 markings, 588779956 edges, 109509 markings/sec, 440 secs
lola: 130686111 markings, 592255385 edges, 144907 markings/sec, 445 secs
lola: 131382794 markings, 595522478 edges, 139337 markings/sec, 450 secs
lola: 132741697 markings, 601552831 edges, 271781 markings/sec, 455 secs
lola: 134038765 markings, 607593911 edges, 259414 markings/sec, 460 secs
lola: 135303335 markings, 613507905 edges, 252914 markings/sec, 465 secs
lola: 136532841 markings, 619284523 edges, 245901 markings/sec, 470 secs
lola: 137763742 markings, 624465054 edges, 246180 markings/sec, 475 secs
lola: 138519978 markings, 628908099 edges, 151247 markings/sec, 480 secs
lola: 139009136 markings, 632707687 edges, 97832 markings/sec, 485 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((X (((1 <= p0) AND (1 <= p13))) AND ((1 <= p0) AND (1 <= p13)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((1 <= p0) AND (1 <= p13))) AND ((1 <= p0) AND (1 <= p13)))))
lola: processed formula length: 71
lola: 104 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: 645 markings, 645 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p11) AND (1 <= p17))) OR (G ((F ((1 <= p9)) AND (((1 <= p2)) OR (1 <= p9)))) AND F (((1 <= p11) AND (1 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F (((1 <= p11) AND (1 <= p17)))
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: ((p11 <= 0) OR (p17 <= 0))
lola: processed formula length: 27
lola: 106 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: 3011 markings, 5480 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((F ((1 <= p9)) AND (((1 <= p2)) OR (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((1 <= p9)) AND (((1 <= p2)) OR (1 <= p9))))
lola: processed formula length: 50
lola: 104 rewrites
lola: closed formula file LTLFireability.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: 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: 3060487 markings, 9464898 edges, 612097 markings/sec, 0 secs
lola: 5797334 markings, 18714394 edges, 547369 markings/sec, 5 secs
lola: 8245952 markings, 27591644 edges, 489724 markings/sec, 10 secs
lola: 10523318 markings, 35653019 edges, 455473 markings/sec, 15 secs
lola: 12751941 markings, 43797894 edges, 445725 markings/sec, 20 secs
lola: 14722730 markings, 51644702 edges, 394158 markings/sec, 25 secs
lola: 16760572 markings, 59348335 edges, 407568 markings/sec, 30 secs
lola: 19068399 markings, 67390287 edges, 461565 markings/sec, 35 secs
lola: 21219114 markings, 75421973 edges, 430143 markings/sec, 40 secs
lola: 23078754 markings, 82822391 edges, 371928 markings/sec, 45 secs
lola: 25138817 markings, 90670469 edges, 412013 markings/sec, 50 secs
lola: 27168656 markings, 98484763 edges, 405968 markings/sec, 55 secs
lola: 29101557 markings, 105984982 edges, 386580 markings/sec, 60 secs
lola: 31060542 markings, 113608517 edges, 391797 markings/sec, 65 secs
lola: 33262821 markings, 121575254 edges, 440456 markings/sec, 70 secs
lola: 35439479 markings, 129726785 edges, 435332 markings/sec, 75 secs
lola: 37204928 markings, 137009346 edges, 353090 markings/sec, 80 secs
lola: 39120885 markings, 144563643 edges, 383191 markings/sec, 85 secs
lola: 40923097 markings, 151743647 edges, 360442 markings/sec, 90 secs
lola: 42727432 markings, 159087801 edges, 360867 markings/sec, 95 secs
lola: 44353679 markings, 166167069 edges, 325249 markings/sec, 100 secs
lola: 46081668 markings, 173740451 edges, 345598 markings/sec, 105 secs
lola: 47811734 markings, 181338818 edges, 346013 markings/sec, 110 secs
lola: 49827330 markings, 189530680 edges, 403119 markings/sec, 115 secs
lola: 52141386 markings, 198008717 edges, 462811 markings/sec, 120 secs
lola: 54457417 markings, 206577113 edges, 463206 markings/sec, 125 secs
lola: 56728384 markings, 215017619 edges, 454193 markings/sec, 130 secs
lola: 59013885 markings, 223609098 edges, 457100 markings/sec, 135 secs
lola: 60993659 markings, 231774558 edges, 395955 markings/sec, 140 secs
lola: 62922588 markings, 239848873 edges, 385786 markings/sec, 145 secs
lola: 64842402 markings, 247914817 edges, 383963 markings/sec, 150 secs
lola: 66791453 markings, 256134688 edges, 389810 markings/sec, 155 secs
lola: 68878306 markings, 264478874 edges, 417371 markings/sec, 160 secs
lola: 71076634 markings, 273159923 edges, 439666 markings/sec, 165 secs
lola: 73122076 markings, 281447120 edges, 409088 markings/sec, 170 secs
lola: 75093626 markings, 289473885 edges, 394310 markings/sec, 175 secs
lola: 77108402 markings, 297702235 edges, 402955 markings/sec, 180 secs
lola: 79080267 markings, 305785841 edges, 394373 markings/sec, 185 secs
lola: 81031248 markings, 313783584 edges, 390196 markings/sec, 190 secs
lola: 83013233 markings, 321909835 edges, 396397 markings/sec, 195 secs
lola: 85001528 markings, 330080380 edges, 397659 markings/sec, 200 secs
lola: 87033992 markings, 338412610 edges, 406493 markings/sec, 205 secs
lola: 89448147 markings, 347080089 edges, 482831 markings/sec, 210 secs
lola: 91635113 markings, 355584869 edges, 437393 markings/sec, 215 secs
lola: 93724221 markings, 364021065 edges, 417822 markings/sec, 220 secs
lola: 95865184 markings, 372512054 edges, 428193 markings/sec, 225 secs
lola: 97991219 markings, 381064523 edges, 425207 markings/sec, 230 secs
lola: 99907365 markings, 389400643 edges, 383229 markings/sec, 235 secs
lola: 101746070 markings, 397450472 edges, 367741 markings/sec, 240 secs
lola: 103571626 markings, 405472384 edges, 365111 markings/sec, 245 secs
lola: 105556065 markings, 413827052 edges, 396888 markings/sec, 250 secs
lola: 107558804 markings, 422138288 edges, 400548 markings/sec, 255 secs
lola: 109529406 markings, 430393110 edges, 394120 markings/sec, 260 secs
lola: 111458581 markings, 438523981 edges, 385835 markings/sec, 265 secs
lola: 113398855 markings, 446707798 edges, 388055 markings/sec, 270 secs
lola: 115272199 markings, 454487713 edges, 374669 markings/sec, 275 secs
lola: 116625249 markings, 460599403 edges, 270610 markings/sec, 280 secs
lola: 117915169 markings, 466465712 edges, 257984 markings/sec, 285 secs
lola: 119019335 markings, 471521284 edges, 220833 markings/sec, 290 secs
lola: 120219818 markings, 476995152 edges, 240097 markings/sec, 295 secs
lola: 121538844 markings, 483038995 edges, 263805 markings/sec, 300 secs
lola: 122749096 markings, 488611742 edges, 242050 markings/sec, 305 secs
lola: 123911405 markings, 493929999 edges, 232462 markings/sec, 310 secs
lola: 124983396 markings, 498862963 edges, 214398 markings/sec, 315 secs
lola: 126054445 markings, 503793006 edges, 214210 markings/sec, 320 secs
lola: 127164855 markings, 508904607 edges, 222082 markings/sec, 325 secs
lola: 128273628 markings, 514010429 edges, 221755 markings/sec, 330 secs
lola: 129402745 markings, 519217399 edges, 225823 markings/sec, 335 secs
lola: 130513162 markings, 524348610 edges, 222083 markings/sec, 340 secs
lola: 131493713 markings, 528880112 edges, 196110 markings/sec, 345 secs
lola: 132608909 markings, 533795421 edges, 223039 markings/sec, 350 secs
lola: 134196086 markings, 539731179 edges, 317435 markings/sec, 355 secs
lola: 135510549 markings, 544749593 edges, 262893 markings/sec, 360 secs
lola: 136723720 markings, 549431726 edges, 242634 markings/sec, 365 secs
lola: 137834475 markings, 553718799 edges, 222151 markings/sec, 370 secs
lola: 138662966 markings, 556936382 edges, 165698 markings/sec, 375 secs
lola: 139645331 markings, 560715790 edges, 196473 markings/sec, 380 secs
lola: 140703111 markings, 564835313 edges, 211556 markings/sec, 385 secs
lola: 141437349 markings, 567680820 edges, 146848 markings/sec, 390 secs
lola: 142445115 markings, 571603990 edges, 201553 markings/sec, 395 secs
lola: 143087280 markings, 574088897 edges, 128433 markings/sec, 400 secs
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: RESULT
lola:
SUMMARY: no no no unknown yes yes no no no no no no yes no
lola:
preliminary result: no no no unknown yes yes no no no no no no yes no
lola: memory consumption: 3468 KB
lola: time consumption: 1263 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="ClientsAndServers-PT-N0010P2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is ClientsAndServers-PT-N0010P2, 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 r056-oct2-162038334500082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P2.tgz
mv ClientsAndServers-PT-N0010P2 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 ;