fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334500086
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for ClientsAndServers-PT-N0020P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16252.867 3600000.00 572811.00 1495.70 FFTFFT?FFFFFFTFF normal

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-162038334500086.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-N0020P0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334500086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 147K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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.7K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K 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-N0020P0-00
FORMULA_NAME ClientsAndServers-PT-N0020P0-01
FORMULA_NAME ClientsAndServers-PT-N0020P0-02
FORMULA_NAME ClientsAndServers-PT-N0020P0-03
FORMULA_NAME ClientsAndServers-PT-N0020P0-04
FORMULA_NAME ClientsAndServers-PT-N0020P0-05
FORMULA_NAME ClientsAndServers-PT-N0020P0-06
FORMULA_NAME ClientsAndServers-PT-N0020P0-07
FORMULA_NAME ClientsAndServers-PT-N0020P0-08
FORMULA_NAME ClientsAndServers-PT-N0020P0-09
FORMULA_NAME ClientsAndServers-PT-N0020P0-10
FORMULA_NAME ClientsAndServers-PT-N0020P0-11
FORMULA_NAME ClientsAndServers-PT-N0020P0-12
FORMULA_NAME ClientsAndServers-PT-N0020P0-13
FORMULA_NAME ClientsAndServers-PT-N0020P0-14
FORMULA_NAME ClientsAndServers-PT-N0020P0-15

=== Now, execution of the tool begins

BK_START 1620897374555

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 09:16:16] [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:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:16:16] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-13 09:16:16] [INFO ] Transformed 25 places.
[2021-05-13 09:16:16] [INFO ] Transformed 18 transitions.
[2021-05-13 09:16:16] [INFO ] Parsed PT model containing 25 places and 18 transitions in 63 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 43 resets, run finished after 50 ms. (steps per millisecond=2000 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 18 rows 25 cols
[2021-05-13 09:16:16] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-13 09:16:17] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned unsat
[2021-05-13 09:16:17] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2021-05-13 09:16:17] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 6 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2021-05-13 09:16:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-13 09:16:17] [INFO ] Flatten gal took : 30 ms
FORMULA ClientsAndServers-PT-N0020P0-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:16:17] [INFO ] Flatten gal took : 5 ms
[2021-05-13 09:16:17] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2021-05-13 09:16:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ClientsAndServers-PT-N0020P0 @ 3570 seconds

FORMULA ClientsAndServers-PT-N0020P0-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P0-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0020P0-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA ClientsAndServers-PT-N0020P0-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA ClientsAndServers-PT-N0020P0-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0020P0-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ClientsAndServers-PT-N0020P0-06 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3032
rslt: Output for LTLFireability @ ClientsAndServers-PT-N0020P0

{
"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:16:17 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p24) AND (1 <= p4) AND (1 <= p21))",
"processed_size": 41,
"rewrites": 107
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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 (((p0 <= 0) OR (p13 <= 0)))",
"processed_size": 30,
"rewrites": 104
},
"result":
{
"edges": 875,
"markings": 875,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (F ((1 <= p16)))",
"processed_size": 18,
"rewrites": 104
},
"result":
{
"edges": 320,
"markings": 321,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 274
},
"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 <= p20)))",
"processed_size": 18,
"rewrites": 104
},
"result":
{
"edges": 1001,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"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": 297
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"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 <= p9)",
"processed_size": 9,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 355
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": "X (G (((p24 <= 0) AND (1 <= p8) AND (1 <= p15))))",
"processed_size": 49,
"rewrites": 104
},
"result":
{
"edges": 1001,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((1 <= p10) OR (1 <= p6))",
"processed_size": 25,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((F ((1 <= p10)) AND (1 <= p6)))",
"processed_size": 34,
"rewrites": 104
},
"result":
{
"edges": 1001,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 444
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X ((G ((F ((p10 <= 0)) OR ((p0 <= 0) OR (p13 <= 0)))) R ((p1 <= 0) OR (p19 <= 0)))) AND G (((p1 <= 0) OR (p19 <= 0)))))",
"processed_size": 125,
"rewrites": 104
},
"result":
{
"edges": 1023,
"markings": 1022,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 507
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((p6 <= 0)) AND X (G (((1 <= p5) AND (1 <= p15))))))))",
"processed_size": 66,
"rewrites": 104
},
"result":
{
"edges": 1001,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 592
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 592
},
"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 ((p10 <= 0)))",
"processed_size": 18,
"rewrites": 104
},
"result":
{
"edges": 659,
"markings": 658,
"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": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"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)) OR (1 <= p12))) AND F (((1 <= p7) AND (1 <= p23)))))",
"processed_size": 73,
"rewrites": 104
},
"result":
{
"edges": 1001,
"markings": 1001,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 711
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((G (F ((1 <= p16))) OR X (((X (((1 <= p1) AND (1 <= p19))) AND ((1 <= p0) AND (1 <= p13))) U X (F (((1 <= p0) AND (1 <= p13))))))) U ((1 <= p0) AND (1 <= p13)))",
"processed_size": 161,
"rewrites": 104
},
"result":
{
"edges": 43223358,
"markings": 10543540,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 883
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F (((1 <= p5) AND (1 <= p15))))",
"processed_size": 34,
"rewrites": 104
},
"result":
{
"edges": 588579,
"markings": 468420,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1177
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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": "F (G (((p5 <= 0) OR (p15 <= 0))))",
"processed_size": 34,
"rewrites": 104
},
"result":
{
"edges": 1373,
"markings": 1136,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1766
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p24 <= 0) R ((p3 <= 0))) OR F (G ((1 <= p20))))))",
"processed_size": 58,
"rewrites": 104
},
"result":
{
"edges": 605,
"markings": 604,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3532
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p18 <= 0))",
"processed_size": 14,
"rewrites": 104
},
"result":
{
"edges": 185,
"markings": 185,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p18 <= 0))",
"processed_size": 14,
"rewrites": 104
},
"result":
{
"edges": 185,
"markings": 185,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"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": "(p18 <= 0)",
"processed_size": 10,
"rewrites": 104
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 16,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3760,
"runtime": 538.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(**)) : ((X((X(**) OR **)) AND (** AND (** AND **))) OR (G(**) AND F((X((X(**) OR **)) AND (** AND (** AND **)))))) : X(F(**)) : X(G(**)) : (** OR X((F(**) AND **))) : (* AND (F((F(**) AND **)) OR G(*))) : G(F((X(X(**)) OR G(**)))) : X(G(**)) : (X((F(**) AND **)) OR (** OR **)) : X((X((G((F(*) OR (* OR *))) R *)) AND G(**))) : X(X(F((G(*) AND X(G(*)))))) : (F(G(**)) OR X((G(**) AND F(**)))) : ((G(F(**)) OR X(((X(**) AND (** AND **)) U X(F(**))))) U **) : F(G(*)) : G(F(((* R *) OR F(G(**)))))"
},
"net":
{
"arcs": 54,
"conflict_clusters": 16,
"places": 25,
"places_significant": 17,
"singleton_clusters": 0,
"transitions": 18
},
"result":
{
"preliminary_value": "no no yes no no unknown no no no no no no yes no no ",
"value": "no no yes no no unknown no no no no no no yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 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: X ((X ((F ((1 <= p10)) OR ((1 <= p12) AND (1 <= p5) AND (1 <= p15)))) U X (NOT(F (NOT(F (((1 <= p5) AND (1 <= p15))))))))) : (G (((p0 <= 0) OR (p13 <= 0))) U (((X ((X ((1 <= p18)) OR (1 <= p18))) AND (1 <= p24)) AND (1 <= p4)) AND (1 <= p21))) : (X (NOT((F (((1 <= p3))) U (1 <= 0)))) U X ((1 <= p16))) : NOT(X (F ((X (G ((1 <= p24))) U NOT(G ((1 <= p20))))))) : ((1 <= p9) OR (F (X ((1 <= p9))) AND X ((1 <= p9)))) : NOT((NOT(F ((F ((1 <= p22)) AND (1 <= p2)))) U (1 <= p18))) : X (F (X (G (F (((1 <= p22) U G (F ((X (X (((1 <= p8) AND (1 <= p15)))) OR G (((1 <= p3)))))))))))) : X (G (((p24 <= 0) AND (1 <= p8) AND (1 <= p15)))) : ((X ((F ((1 <= p10)) AND (1 <= p6))) OR (1 <= p10)) OR (1 <= p6)) : X ((NOT(X ((F (((G ((1 <= p10)) AND (1 <= p0)) AND (1 <= p13))) U ((1 <= p1) AND (1 <= p19))))) AND G (((p1 <= 0) OR (p19 <= 0))))) : F (X ((G (NOT(F (X ((1 <= p6))))) AND X (NOT(X (F (((p5 <= 0) OR (p15 <= 0))))))))) : (G (F (G ((p10 <= 0)))) OR (X (G ((((1 <= p3)) OR (1 <= p12)))) AND F (X (((1 <= p7) AND (1 <= p23)))))) : ((G (F ((1 <= p16))) OR X ((((X (((1 <= p1) AND (1 <= p19))) AND (1 <= p0)) AND (1 <= p13)) U X (F (((1 <= p0) AND (1 <= p13))))))) U ((1 <= p0) AND (1 <= p13))) : NOT(F (G (F (X (((1 <= p5) AND (1 <= p15))))))) : G (F (NOT(G (X (G ((((1 <= p24) U ((1 <= p3))) AND G (NOT(G (X ((1 <= p20))))))))))))
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k: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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:525
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((X ((1 <= p18)) OR (1 <= p18))) AND ((1 <= p24) AND ((1 <= p4) AND (1 <= p21)))) OR (G (((p0 <= 0) OR (p13 <= 0))) AND F ((X ((X ((1 <= p18)) OR (1 <= p18))) AND ((1 <= p24) AND ((1 <= p4) AND (1 <= p21)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p24) AND ((1 <= p4) AND (1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p24) AND (1 <= p4) AND (1 <= p21))
lola: processed formula length: 41
lola: 107 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p0 <= 0) OR (p13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p0 <= 0) OR (p13 <= 0)))
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: 875 markings, 875 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p16)))
lola: processed formula length: 18
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: 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: 321 markings, 320 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((1 <= p20)))
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: 1001 markings, 1001 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p9) OR X ((F ((1 <= p9)) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p9)
lola: processed formula length: 9
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 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p9)) AND (1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p9)) AND (1 <= p9)))
lola: processed formula length: 33
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: 1001 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (((1 <= p8) AND (1 <= p15)))) OR G (((1 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (((1 <= p8) AND (1 <= p15)))) OR G (((1 <= p3))))))
lola: processed formula length: 63
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: 2770918 markings, 10715703 edges, 554184 markings/sec, 0 secs
lola: 5403430 markings, 21799862 edges, 526502 markings/sec, 5 secs
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: 6419635 markings, 26174687 edges
lola: ========================================
lola: subprocess 5 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p24 <= 0) AND (1 <= p8) AND (1 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p24 <= 0) AND (1 <= p8) AND (1 <= p15))))
lola: processed formula length: 49
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: 1001 markings, 1001 edges
lola: ========================================
lola: subprocess 6 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F ((1 <= p10)) AND (1 <= p6))) OR ((1 <= p10) OR (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p10) OR (1 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:797
lola: processed formula: ((1 <= p10) OR (1 <= p6))
lola: processed formula length: 25
lola: 105 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 7 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((1 <= p10)) AND (1 <= p6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((1 <= p10)) AND (1 <= p6)))
lola: processed formula length: 34
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: 1001 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G ((F ((p10 <= 0)) OR ((p0 <= 0) OR (p13 <= 0)))) R ((p1 <= 0) OR (p19 <= 0)))) AND G (((p1 <= 0) OR (p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G ((F ((p10 <= 0)) OR ((p0 <= 0) OR (p13 <= 0)))) R ((p1 <= 0) OR (p19 <= 0)))) AND G (((p1 <= 0) OR (p19 <= 0)))))
lola: processed formula length: 125
lola: 104 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1022 markings, 1023 edges
lola: ========================================
lola: subprocess 8 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((p6 <= 0)) AND X (G (((1 <= p5) AND (1 <= p15))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((p6 <= 0)) AND X (G (((1 <= p5) AND (1 <= p15))))))))
lola: processed formula length: 66
lola: 104 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: 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, 1001 edges
lola: ========================================
lola: subprocess 9 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p10 <= 0))) OR X ((G ((((1 <= p3)) OR (1 <= p12))) AND F (((1 <= p7) AND (1 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p10 <= 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 ((p10 <= 0)))
lola: processed formula length: 18
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: 658 markings, 659 edges
lola: ========================================
lola: subprocess 10 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p3)) OR (1 <= p12))) AND F (((1 <= p7) AND (1 <= p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p3)) OR (1 <= p12))) AND F (((1 <= p7) AND (1 <= p23)))))
lola: processed formula length: 73
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: 1001 markings, 1001 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((G (F ((1 <= p16))) OR X (((X (((1 <= p1) AND (1 <= p19))) AND ((1 <= p0) AND (1 <= p13))) U X (F (((1 <= p0) AND (1 <= p13))))))) U ((1 <= p0) AND (1 <= p13)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((G (F ((1 <= p16))) OR X (((X (((1 <= p1) AND (1 <= p19))) AND ((1 <= p0) AND (1 <= p13))) U X (F (((1 <= p0) AND (1 <= p13))))))) U ((1 <= p0) AND (1 <= p13)))
lola: processed formula length: 161
lola: 104 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: 2560297 markings, 9962652 edges, 512059 markings/sec, 0 secs
lola: 4884000 markings, 19638606 edges, 464741 markings/sec, 5 secs
lola: 7147909 markings, 29069532 edges, 452782 markings/sec, 10 secs
lola: 9306494 markings, 38063707 edges, 431717 markings/sec, 15 secs
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: 10543540 markings, 43223358 edges
lola: ========================================
lola: subprocess 11 will run for 883 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p5) AND (1 <= p15))))
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 <= p5) AND (1 <= p15))))
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: 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: 468420 markings, 588579 edges
lola: ========================================
lola: subprocess 12 will run for 1177 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p5 <= 0) OR (p15 <= 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 (((p5 <= 0) OR (p15 <= 0))))
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: 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: 1136 markings, 1373 edges
lola: ========================================
lola: subprocess 13 will run for 1766 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p24 <= 0) R ((p3 <= 0))) OR F (G ((1 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p24 <= 0) R ((p3 <= 0))) OR F (G ((1 <= p20))))))
lola: processed formula length: 58
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: 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: 604 markings, 605 edges
lola: ========================================
lola: subprocess 14 will run for 3532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p18 <= 0) AND (F ((F ((1 <= p22)) AND (1 <= p2))) OR G ((p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 3532 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p18 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 <= 0))
lola: processed formula length: 14
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: 185 markings, 185 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 16 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p22)) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p22)) AND (1 <= p2)))
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: local time limit reached - aborting
lola:
preliminary result: no no yes no no unknown no no no no no no yes no no
lola: memory consumption: 112960 KB
lola: time consumption: 39 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((p18 <= 0) AND (F ((F ((1 <= p22)) AND (1 <= p2))) OR G ((p18 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G ((p18 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p18 <= 0))
lola: processed formula length: 14
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: 185 markings, 185 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p18 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= 0)
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: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((F ((1 <= p22)) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F ((1 <= p22)) AND (1 <= p2)))
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: 3135899 markings, 8428053 edges, 627180 markings/sec, 0 secs
lola: 6483001 markings, 16231263 edges, 669420 markings/sec, 5 secs
lola: 9930829 markings, 23715668 edges, 689566 markings/sec, 10 secs
lola: 13323213 markings, 31080597 edges, 678477 markings/sec, 15 secs
lola: 16781658 markings, 38588278 edges, 691689 markings/sec, 20 secs
lola: 20257986 markings, 46134093 edges, 695266 markings/sec, 25 secs
lola: 23762079 markings, 53740775 edges, 700819 markings/sec, 30 secs
lola: 27251687 markings, 61327224 edges, 697922 markings/sec, 35 secs
lola: 30786224 markings, 69056545 edges, 706907 markings/sec, 40 secs
lola: 34219879 markings, 77087308 edges, 686731 markings/sec, 45 secs
lola: 36153517 markings, 84126716 edges, 386728 markings/sec, 50 secs
lola: 37819953 markings, 90325149 edges, 333287 markings/sec, 55 secs
lola: 39379863 markings, 96225218 edges, 311982 markings/sec, 60 secs
lola: 41010101 markings, 102246299 edges, 326048 markings/sec, 65 secs
lola: 42273095 markings, 107219806 edges, 252599 markings/sec, 70 secs
lola: 43970499 markings, 113469054 edges, 339481 markings/sec, 75 secs
lola: 45030324 markings, 117681536 edges, 211965 markings/sec, 80 secs
lola: 46388051 markings, 122796036 edges, 271545 markings/sec, 85 secs
lola: 47889592 markings, 128472094 edges, 300308 markings/sec, 90 secs
lola: 48967413 markings, 132777524 edges, 215564 markings/sec, 95 secs
lola: 50275129 markings, 137749971 edges, 261543 markings/sec, 100 secs
lola: 51868968 markings, 143687739 edges, 318768 markings/sec, 105 secs
lola: 53038591 markings, 148369597 edges, 233925 markings/sec, 110 secs
lola: 54222641 markings, 153092356 edges, 236810 markings/sec, 115 secs
lola: 55600384 markings, 158206905 edges, 275549 markings/sec, 120 secs
lola: 57074586 markings, 163763520 edges, 294840 markings/sec, 125 secs
lola: 58265965 markings, 168552565 edges, 238276 markings/sec, 130 secs
lola: 59376104 markings, 173005011 edges, 222028 markings/sec, 135 secs
lola: 60169633 markings, 176129915 edges, 158706 markings/sec, 140 secs
lola: 61309918 markings, 180306801 edges, 228057 markings/sec, 145 secs
lola: 62906801 markings, 186315801 edges, 319377 markings/sec, 150 secs
lola: 64044466 markings, 190909092 edges, 227533 markings/sec, 155 secs
lola: 65149443 markings, 195360142 edges, 220995 markings/sec, 160 secs
lola: 66224101 markings, 199648703 edges, 214932 markings/sec, 165 secs
lola: 67628427 markings, 204894836 edges, 280865 markings/sec, 170 secs
lola: 69284811 markings, 211047425 edges, 331277 markings/sec, 175 secs
lola: 70527920 markings, 216041560 edges, 248622 markings/sec, 180 secs
lola: 71714537 markings, 220847131 edges, 237323 markings/sec, 185 secs
lola: 72930675 markings, 225738450 edges, 243228 markings/sec, 190 secs
lola: 74227548 markings, 230821279 edges, 259375 markings/sec, 195 secs
lola: 75805721 markings, 236594357 edges, 315635 markings/sec, 200 secs
lola: 77276059 markings, 242213766 edges, 294068 markings/sec, 205 secs
lola: 78466850 markings, 247038374 edges, 238158 markings/sec, 210 secs
lola: 79647340 markings, 251820725 edges, 236098 markings/sec, 215 secs
lola: 80845117 markings, 256645356 edges, 239555 markings/sec, 220 secs
lola: 82099414 markings, 261602549 edges, 250859 markings/sec, 225 secs
lola: 83615496 markings, 267179735 edges, 303216 markings/sec, 230 secs
lola: 85150374 markings, 272913773 edges, 306976 markings/sec, 235 secs
lola: 86336009 markings, 277691650 edges, 237127 markings/sec, 240 secs
lola: 87508956 markings, 282451259 edges, 234589 markings/sec, 245 secs
lola: 88672243 markings, 287170779 edges, 232657 markings/sec, 250 secs
lola: 89845557 markings, 291901557 edges, 234663 markings/sec, 255 secs
lola: 91082624 markings, 296783761 edges, 247413 markings/sec, 260 secs
lola: 92547413 markings, 302177723 edges, 292958 markings/sec, 265 secs
lola: 94106635 markings, 307962641 edges, 311844 markings/sec, 270 secs
lola: 95274028 markings, 312632760 edges, 233479 markings/sec, 275 secs
lola: 96396617 markings, 317197496 edges, 224518 markings/sec, 280 secs
lola: 97523730 markings, 321780039 edges, 225423 markings/sec, 285 secs
lola: 98486003 markings, 325693040 edges, 192455 markings/sec, 290 secs
lola: 99659189 markings, 330414654 edges, 234637 markings/sec, 295 secs
lola: 100880060 markings, 335228967 edges, 244174 markings/sec, 300 secs
lola: 102321316 markings, 340546491 edges, 288251 markings/sec, 305 secs
lola: 103853558 markings, 346203149 edges, 306448 markings/sec, 310 secs
lola: 105050805 markings, 350943846 edges, 239449 markings/sec, 315 secs
lola: 106176158 markings, 355514912 edges, 225071 markings/sec, 320 secs
lola: 107271220 markings, 359988753 edges, 219012 markings/sec, 325 secs
lola: 108376812 markings, 364475689 edges, 221118 markings/sec, 330 secs
lola: 109508099 markings, 369067070 edges, 226257 markings/sec, 335 secs
lola: 110690880 markings, 373790052 edges, 236556 markings/sec, 340 secs
lola: 111957222 markings, 378734556 edges, 253268 markings/sec, 345 secs
lola: 113451335 markings, 384185382 edges, 298823 markings/sec, 350 secs
lola: 114967408 markings, 389821141 edges, 303215 markings/sec, 355 secs
lola: 116114243 markings, 394452673 edges, 229367 markings/sec, 360 secs
lola: 117202534 markings, 398867180 edges, 217658 markings/sec, 365 secs
lola: 118237593 markings, 403091019 edges, 207012 markings/sec, 370 secs
lola: 119236803 markings, 407162252 edges, 199842 markings/sec, 375 secs
lola: 120229195 markings, 411192995 edges, 198478 markings/sec, 380 secs
lola: 120928791 markings, 414024451 edges, 139919 markings/sec, 385 secs
lola: 121978923 markings, 418222120 edges, 210026 markings/sec, 390 secs
lola: 123134043 markings, 422757459 edges, 231024 markings/sec, 395 secs
lola: 124435762 markings, 427529537 edges, 260344 markings/sec, 400 secs
lola: 125744549 markings, 432416015 edges, 261757 markings/sec, 405 secs
lola: 126843315 markings, 436553396 edges, 219753 markings/sec, 410 secs
lola: 127841819 markings, 440616606 edges, 199701 markings/sec, 415 secs
lola: 128813391 markings, 444574776 edges, 194314 markings/sec, 420 secs
lola: 129867992 markings, 448879438 edges, 210920 markings/sec, 425 secs
lola: 130910454 markings, 453126923 edges, 208492 markings/sec, 430 secs
lola: 131934800 markings, 457290242 edges, 204869 markings/sec, 435 secs
lola: 133040861 markings, 461765451 edges, 221212 markings/sec, 440 secs
lola: 133948407 markings, 465383477 edges, 181509 markings/sec, 445 secs
lola: 134830055 markings, 468885428 edges, 176330 markings/sec, 450 secs
lola: 135500047 markings, 471476945 edges, 133998 markings/sec, 455 secs
lola: 136690848 markings, 475807122 edges, 238160 markings/sec, 460 secs
lola: 138070548 markings, 480968787 edges, 275940 markings/sec, 465 secs
lola: 139282462 markings, 485578448 edges, 242383 markings/sec, 470 secs
lola: 140350210 markings, 489916935 edges, 213550 markings/sec, 475 secs
lola: 141398245 markings, 494197894 edges, 209607 markings/sec, 480 secs
lola: 142433947 markings, 498417126 edges, 207140 markings/sec, 485 secs
lola: 143395813 markings, 502329312 edges, 192373 markings/sec, 490 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 yes no no unknown no no no no no no yes no no
lola:
preliminary result: no no yes no no unknown no no no no no no yes no no
lola: memory consumption: 3760 KB
lola: time consumption: 538 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-N0020P0"
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-N0020P0, 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-162038334500086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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