fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r265-tall-162106800200038
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for SmallOperatingSystem-PT-MT0512DC0128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16256.207 3600000.00 469104.00 50054.10 FFFTFFFFFT?TTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800200038.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SmallOperatingSystem-PT-MT0512DC0128, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800200038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Mar 28 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Mar 27 13:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 13:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 19:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 13 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 8.2K May 5 16:52 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-00
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-01
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-02
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-03
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-04
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-05
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-06
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-07
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-08
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-09
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-10
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-11
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-12
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-13
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-14
FORMULA_NAME SmallOperatingSystem-PT-MT0512DC0128-15

=== Now, execution of the tool begins

BK_START 1621195107076

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

FORMULA SmallOperatingSystem-PT-MT0512DC0128-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmallOperatingSystem-PT-MT0512DC0128-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2920
rslt: Output for LTLFireability @ SmallOperatingSystem-PT-MT0512DC0128

{
"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": "Sun May 16 19:58:30 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"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": "F (((X ((1 <= p3)) U (p4 <= 0)) AND G ((1 <= p7))))",
"processed_size": 51,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 407
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 407
},
"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 <= p1) AND (1 <= p2)))",
"processed_size": 29,
"rewrites": 71
},
"result":
{
"edges": 208027,
"markings": 96484,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"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": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"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": 5,
"visible_transitions": 0
},
"processed": "X (F ((F (((p5 <= 0) OR (p6 <= 0))) OR ((1 <= p1) AND (1 <= p2) AND (p7 <= 0)))))",
"processed_size": 82,
"rewrites": 71
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "F (G ((X ((((1 <= p1) AND (1 <= p2)) AND (1 <= p7))) AND (1 <= p7))))",
"processed_size": 69,
"rewrites": 71
},
"result":
{
"edges": 5,
"markings": 4,
"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": 543
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 0,
"aneg": 5,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((X (G (((p1 <= 0) OR (p2 <= 0)))) AND (F ((G (((p5 <= 0) OR (p6 <= 0))) OR (X ((p7 <= 0)) AND ((p5 <= 0) OR (p6 <= 0))))) OR X (G (((p1 <= 0) OR (p2 <= 0)))))))",
"processed_size": 167,
"rewrites": 71
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 652
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((1 <= p4)))",
"processed_size": 17,
"rewrites": 71
},
"result":
{
"edges": 265,
"markings": 263,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 815
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 6,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G ((1 <= p4)) OR (G ((p3 <= 0)) OR (G (F ((1 <= p3))) AND F ((G ((1 <= p4)) OR G ((p3 <= 0))))))))",
"processed_size": 102,
"rewrites": 71
},
"result":
{
"edges": 20,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 7,
"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": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((G (((p8 <= 0) OR (p4 <= 0) OR (p6 <= 0))) AND ((p4 <= 0) OR (p6 <= 0)))))",
"processed_size": 83,
"rewrites": 71
},
"result":
{
"edges": 13,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"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": 1631
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"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": "G ((G ((F (((p1 <= 0) OR (p2 <= 0))) AND (p8 <= 0))) R (p3 <= 0)))",
"processed_size": 67,
"rewrites": 71
},
"result":
{
"edges": 11,
"markings": 9,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3262
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F ((F ((1 <= p3)) AND ((p2 <= 0) OR (p5 <= 0)))) U (F (((1 <= p1) AND (1 <= p2))) AND (1 <= p7)))",
"processed_size": 99,
"rewrites": 71
},
"result":
{
"edges": 4,
"markings": 4,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3116,
"runtime": 650.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F(*)) : G((G((F(*) AND *)) R *)) : G((G(**) OR (G(*) OR (G(F(**)) AND F((G(**) OR G(*))))))) : (F((F(**) AND **)) U (F(**) AND **)) : F(G((G(*) AND **))) : X(G((F(**) AND (X(G(**)) OR **)))) : F(((X(**) U **) AND G(**))) : F(G((X(F(**)) AND F(G(**))))) : (X(F((F(*) OR **))) OR G(**)) : F(G((X((** AND **)) AND **))) : G((X(G(*)) AND (F((G(*) OR (X(*) AND *))) OR X(G(*)))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "no no no no no no no unknown yes no no ",
"value": "no no no no no no no unknown 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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: LP says that atomic proposition is always true: (1 <= p0)
lola: NOT(F (((G ((G ((p8 <= 0)) OR (1 <= p8))) U ((1 <= p1) AND (1 <= p2))) U G ((p4 <= 0))))) : G (NOT((F ((G (((1 <= p1) AND (1 <= p2))) OR (1 <= p8))) U (1 <= p3)))) : G ((F (X (F (G (F (X ((1 <= p3))))))) U (G ((1 <= p4)) OR NOT(F ((1 <= p3)))))) : (F ((F ((1 <= p3)) AND ((p2 <= 0) OR (p5 <= 0)))) U (F (((1 <= p1) AND (1 <= p2))) AND (1 <= p7))) : G (X (F (G ((NOT(F (((1 <= p8) AND (1 <= p4) AND (1 <= p6)))) AND ((p4 <= 0) OR (p6 <= 0))))))) : G ((X (X (G ((1 <= p3)))) U X ((p3 <= 0)))) : F (((X ((1 <= p3)) U (p4 <= 0)) AND G ((1 <= p7)))) : F (G ((F (X (((1 <= p1) AND (1 <= p2)))) AND G (F (X (G (X (((1 <= p1) AND (1 <= p2)))))))))) : (X (F ((NOT(G (((1 <= p5) AND (1 <= p6)))) OR ((1 <= p1) AND (1 <= p2) AND (p7 <= 0))))) OR G (((1 <= p1) AND (1 <= p2)))) : F (G (((X (X (((1 <= p1) AND (1 <= p2)))) AND X (X ((1 <= p7)))) AND X ((1 <= p7))))) : G (NOT((G ((X ((1 <= p7)) U ((1 <= p5) AND (1 <= p6)))) U NOT(X (NOT(F (((1 <= p1) AND (1 <= p2)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((p3 <= 0)) AND (X (G ((1 <= p3))) OR (p3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((p3 <= 0)) AND (X (G ((1 <= p3))) OR (p3 <= 0)))))
lola: processed formula length: 60
lola: 71 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: 12 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((X ((1 <= p3)) U (p4 <= 0)) AND G ((1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((X ((1 <= p3)) U (p4 <= 0)) AND G ((1 <= p7))))
lola: processed formula length: 51
lola: 71 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p1) AND (1 <= p2)))) AND F (G (((1 <= p1) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p1) AND (1 <= p2)))) AND F (G (((1 <= p1) AND (1 <= p2)))))))
lola: processed formula length: 81
lola: 71 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: 3080279 markings, 8499418 edges, 616056 markings/sec, 0 secs
lola: 5826560 markings, 16424691 edges, 549256 markings/sec, 5 secs
lola: 8505263 markings, 24163819 edges, 535741 markings/sec, 10 secs
lola: 11122849 markings, 31748636 edges, 523517 markings/sec, 15 secs
lola: 13701449 markings, 39263819 edges, 515720 markings/sec, 20 secs
lola: 16290013 markings, 46798258 edges, 517713 markings/sec, 25 secs
lola: 18883104 markings, 54332705 edges, 518618 markings/sec, 30 secs
lola: 21408434 markings, 61728799 edges, 505066 markings/sec, 35 secs
lola: 23943833 markings, 69125753 edges, 507080 markings/sec, 40 secs
lola: 26419362 markings, 76368163 edges, 495106 markings/sec, 45 secs
lola: 28877884 markings, 83560556 edges, 491704 markings/sec, 50 secs
lola: 31355742 markings, 90795720 edges, 495572 markings/sec, 55 secs
lola: 33784964 markings, 97919137 edges, 485844 markings/sec, 60 secs
lola: 36247314 markings, 105089673 edges, 492470 markings/sec, 65 secs
lola: 38654154 markings, 112165408 edges, 481368 markings/sec, 70 secs
lola: 41047308 markings, 119197861 edges, 478631 markings/sec, 75 secs
lola: 43488847 markings, 126332210 edges, 488308 markings/sec, 80 secs
lola: 45902326 markings, 133391671 edges, 482696 markings/sec, 85 secs
lola: 48323461 markings, 140476778 edges, 484227 markings/sec, 90 secs
lola: 50725487 markings, 147531301 edges, 480405 markings/sec, 95 secs
lola: 53068206 markings, 154403398 edges, 468544 markings/sec, 100 secs
lola: 55433512 markings, 161331859 edges, 473061 markings/sec, 105 secs
lola: 57852666 markings, 168399641 edges, 483831 markings/sec, 110 secs
lola: 60180636 markings, 175241812 edges, 465594 markings/sec, 115 secs
lola: 62543694 markings, 182153417 edges, 472612 markings/sec, 120 secs
lola: 64880416 markings, 189035198 edges, 467344 markings/sec, 125 secs
lola: 67200519 markings, 195885975 edges, 464021 markings/sec, 130 secs
lola: 69560237 markings, 202801319 edges, 471944 markings/sec, 135 secs
lola: 71960038 markings, 209828656 edges, 479960 markings/sec, 140 secs
lola: 74344047 markings, 216821180 edges, 476802 markings/sec, 145 secs
lola: 76732538 markings, 223813937 edges, 477698 markings/sec, 150 secs
lola: 79016413 markings, 230537914 edges, 456775 markings/sec, 155 secs
lola: 81375008 markings, 237459809 edges, 471719 markings/sec, 160 secs
lola: 83720667 markings, 244343881 edges, 469132 markings/sec, 165 secs
lola: 86088293 markings, 251293720 edges, 473525 markings/sec, 170 secs
lola: 87693291 markings, 255992456 edges, 321000 markings/sec, 175 secs
lola: 89185220 markings, 260364887 edges, 298386 markings/sec, 180 secs
lola: 90779108 markings, 265070668 edges, 318778 markings/sec, 185 secs
lola: 92214136 markings, 269265842 edges, 287006 markings/sec, 190 secs
lola: 93836885 markings, 274006621 edges, 324550 markings/sec, 195 secs
lola: 95316956 markings, 278334173 edges, 296014 markings/sec, 200 secs
lola: 96703601 markings, 282445210 edges, 277329 markings/sec, 205 secs
lola: 97147390 markings, 283749059 edges, 88758 markings/sec, 210 secs
lola: 98674231 markings, 288258118 edges, 305368 markings/sec, 215 secs
lola: 99312847 markings, 290161072 edges, 127723 markings/sec, 220 secs
lola: 99312847 markings, 290161072 edges, 0 markings/sec, 225 secs
lola: 101151968 markings, 295531135 edges, 367824 markings/sec, 230 secs
lola: 101498850 markings, 296547161 edges, 69376 markings/sec, 235 secs
lola: 101498850 markings, 296547161 edges, 0 markings/sec, 240 secs
lola: 102188984 markings, 298569032 edges, 138027 markings/sec, 245 secs
lola: 102952343 markings, 300811142 edges, 152672 markings/sec, 250 secs
lola: 104301076 markings, 304769662 edges, 269747 markings/sec, 255 secs
lola: 105320359 markings, 307771288 edges, 203857 markings/sec, 260 secs
lola: 105320359 markings, 307771288 edges, 0 markings/sec, 265 secs
lola: 105714375 markings, 308924585 edges, 78803 markings/sec, 270 secs
lola: 107546567 markings, 314252559 edges, 366438 markings/sec, 275 secs
lola: 107896999 markings, 315303237 edges, 70086 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F (((p5 <= 0) OR (p6 <= 0))) OR ((1 <= p1) AND (1 <= p2) AND (p7 <= 0))))) OR G (((1 <= p1) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 407 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p1) AND (1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p1) AND (1 <= p2)))
lola: processed formula length: 29
lola: 71 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: 96484 markings, 208027 edges
lola: ========================================
lola: subprocess 4 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((p5 <= 0) OR (p6 <= 0))) OR ((1 <= p1) AND (1 <= p2) AND (p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((p5 <= 0) OR (p6 <= 0))) OR ((1 <= p1) AND (1 <= p2) AND (p7 <= 0)))))
lola: processed formula length: 82
lola: 71 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: 2 markings, 1 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((((1 <= p1) AND (1 <= p2)) AND (1 <= p7))) AND (1 <= p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((((1 <= p1) AND (1 <= p2)) AND (1 <= p7))) AND (1 <= p7))))
lola: processed formula length: 69
lola: 71 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 5 will run for 543 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((p1 <= 0) OR (p2 <= 0)))) AND (F ((G (((p5 <= 0) OR (p6 <= 0))) OR (X ((p7 <= 0)) AND ((p5 <= 0) OR (p6 <= 0))))) OR X (G (((p1 <= 0) OR (p2 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((p1 <= 0) OR (p2 <= 0)))) AND (F ((G (((p5 <= 0) OR (p6 <= 0))) OR (X ((p7 <= 0)) AND ((p5 <= 0) OR (p6 <= 0))))) OR X (G (((p1 <= 0) OR (p2 <= 0)))))))
lola: processed formula length: 167
lola: 71 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 652 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p4)))
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 <= p4)))
lola: processed formula length: 17
lola: 71 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: 263 markings, 265 edges
lola: ========================================
lola: subprocess 7 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((1 <= p4)) OR (G ((p3 <= 0)) OR (G (F ((1 <= p3))) AND F ((G ((1 <= p4)) OR G ((p3 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((1 <= p4)) OR (G ((p3 <= 0)) OR (G (F ((1 <= p3))) AND F ((G ((1 <= p4)) OR G ((p3 <= 0))))))))
lola: processed formula length: 102
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 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: 16 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G (((p8 <= 0) OR (p4 <= 0) OR (p6 <= 0))) AND ((p4 <= 0) OR (p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((G (((p8 <= 0) OR (p4 <= 0) OR (p6 <= 0))) AND ((p4 <= 0) OR (p6 <= 0)))))
lola: processed formula length: 83
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 13 edges
lola: ========================================
lola: subprocess 9 will run for 1631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((F (((p1 <= 0) OR (p2 <= 0))) AND (p8 <= 0))) R (p3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((F (((p1 <= 0) OR (p2 <= 0))) AND (p8 <= 0))) R (p3 <= 0)))
lola: processed formula length: 67
lola: 71 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: 9 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 3262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((F ((1 <= p3)) AND ((p2 <= 0) OR (p5 <= 0)))) U (F (((1 <= p1) AND (1 <= p2))) AND (1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((F ((1 <= p3)) AND ((p2 <= 0) OR (p5 <= 0)))) U (F (((1 <= p1) AND (1 <= p2))) AND (1 <= p7)))
lola: processed formula length: 99
lola: 71 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: 4 markings, 4 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((X (F (((1 <= p1) AND (1 <= p2)))) AND F (G (((1 <= p1) AND (1 <= p2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (F (((1 <= p1) AND (1 <= p2)))) AND F (G (((1 <= p1) AND (1 <= p2)))))))
lola: processed formula length: 81
lola: 71 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: 3090003 markings, 8527667 edges, 618001 markings/sec, 0 secs
lola: 5826688 markings, 16425218 edges, 547337 markings/sec, 5 secs
lola: 8495911 markings, 24136674 edges, 533845 markings/sec, 10 secs
lola: 11120735 markings, 31742607 edges, 524965 markings/sec, 15 secs
lola: 13704867 markings, 39273545 edges, 516826 markings/sec, 20 secs
lola: 16293472 markings, 46807598 edges, 517721 markings/sec, 25 secs
lola: 18883970 markings, 54335278 edges, 518100 markings/sec, 30 secs
lola: 21408676 markings, 61729533 edges, 504941 markings/sec, 35 secs
lola: 23942016 markings, 69120709 edges, 506668 markings/sec, 40 secs
lola: 26435200 markings, 76416905 edges, 498637 markings/sec, 45 secs
lola: 28929333 markings, 83708715 edges, 498827 markings/sec, 50 secs
lola: 31427532 markings, 91009856 edges, 499640 markings/sec, 55 secs
lola: 33896042 markings, 98240465 edges, 493702 markings/sec, 60 secs
lola: 36397861 markings, 105525605 edges, 500364 markings/sec, 65 secs
lola: 38841791 markings, 112707648 edges, 488786 markings/sec, 70 secs
lola: 41249938 markings, 119789072 edges, 481629 markings/sec, 75 secs
lola: 43728080 markings, 127022090 edges, 495628 markings/sec, 80 secs
lola: 46152039 markings, 134126849 edges, 484792 markings/sec, 85 secs
lola: 48597234 markings, 141279088 edges, 489039 markings/sec, 90 secs
lola: 51027560 markings, 148418309 edges, 486065 markings/sec, 95 secs
lola: 53449806 markings, 155507574 edges, 484449 markings/sec, 100 secs
lola: 55835282 markings, 162509967 edges, 477095 markings/sec, 105 secs
lola: 58265217 markings, 169618086 edges, 485987 markings/sec, 110 secs
lola: 60626098 markings, 176562847 edges, 472176 markings/sec, 115 secs
lola: 63058373 markings, 183650965 edges, 486455 markings/sec, 120 secs
lola: 65398870 markings, 190557694 edges, 468099 markings/sec, 125 secs
lola: 67732057 markings, 197458867 edges, 466637 markings/sec, 130 secs
lola: 70140809 markings, 204504860 edges, 481750 markings/sec, 135 secs
lola: 72573706 markings, 211629891 edges, 486579 markings/sec, 140 secs
lola: 74951037 markings, 218607563 edges, 475466 markings/sec, 145 secs
lola: 77375303 markings, 225707833 edges, 484853 markings/sec, 150 secs
lola: 79697600 markings, 232538025 edges, 464459 markings/sec, 155 secs
lola: 82105280 markings, 239587474 edges, 481536 markings/sec, 160 secs
lola: 84462132 markings, 246523201 edges, 471370 markings/sec, 165 secs
lola: 86816637 markings, 253428221 edges, 470901 markings/sec, 170 secs
lola: 88868830 markings, 259426354 edges, 410439 markings/sec, 175 secs
lola: 89014854 markings, 259851967 edges, 29205 markings/sec, 180 secs
lola: 89587367 markings, 261546699 edges, 114503 markings/sec, 185 secs
lola: 91047963 markings, 265867670 edges, 292119 markings/sec, 190 secs
lola: 91074527 markings, 265945064 edges, 5313 markings/sec, 195 secs
lola: 92232264 markings, 269319089 edges, 231547 markings/sec, 200 secs
lola: 92427487 markings, 269884507 edges, 39045 markings/sec, 205 secs
lola: 92427487 markings, 269884507 edges, 0 markings/sec, 210 secs
lola: 93930864 markings, 274279489 edges, 300675 markings/sec, 215 secs
lola: 94831628 markings, 276901086 edges, 180153 markings/sec, 220 secs
lola: 94831628 markings, 276901086 edges, 0 markings/sec, 225 secs
lola: 94831628 markings, 276901086 edges, 0 markings/sec, 230 secs
lola: 96845814 markings, 282865136 edges, 402837 markings/sec, 235 secs
lola: 97091585 markings, 283585195 edges, 49154 markings/sec, 240 secs
lola: 97114020 markings, 283649378 edges, 4487 markings/sec, 245 secs
lola: 97898326 markings, 285983976 edges, 156861 markings/sec, 250 secs
lola: 99313487 markings, 290162882 edges, 283032 markings/sec, 255 secs
lola: 99363793 markings, 290306531 edges, 10061 markings/sec, 260 secs
lola: 99363793 markings, 290306531 edges, 0 markings/sec, 265 secs
lola: 101349438 markings, 296102444 edges, 397129 markings/sec, 270 secs
lola: 101680459 markings, 297085469 edges, 66204 markings/sec, 275 secs
lola: 101699496 markings, 297144336 edges, 3807 markings/sec, 280 secs
lola: 102676183 markings, 300003086 edges, 195337 markings/sec, 285 secs
lola: 104009337 markings, 303928005 edges, 266631 markings/sec, 290 secs
lola: 104009337 markings, 303928005 edges, 0 markings/sec, 295 secs
lola: 105181344 markings, 307362229 edges, 234401 markings/sec, 300 secs
lola: 106401402 markings, 310937283 edges, 244012 markings/sec, 305 secs
lola: 107840084 markings, 315131574 edges, 287736 markings/sec, 310 secs
lola: 107840141 markings, 315131690 edges, 11 markings/sec, 315 secs
lola: 107840245 markings, 315131990 edges, 21 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no unknown yes no no
lola:
preliminary result: no no no no no no no unknown yes no no
lola: memory consumption: 3116 KB
lola: time consumption: 650 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="SmallOperatingSystem-PT-MT0512DC0128"
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 SmallOperatingSystem-PT-MT0512DC0128, 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 r265-tall-162106800200038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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