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.r094-tall-162048902600290.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 ERK-PT-001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-tall-162048902600290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 148K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 18:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 ERK-PT-001000-00
FORMULA_NAME ERK-PT-001000-01
FORMULA_NAME ERK-PT-001000-02
FORMULA_NAME ERK-PT-001000-03
FORMULA_NAME ERK-PT-001000-04
FORMULA_NAME ERK-PT-001000-05
FORMULA_NAME ERK-PT-001000-06
FORMULA_NAME ERK-PT-001000-07
FORMULA_NAME ERK-PT-001000-08
FORMULA_NAME ERK-PT-001000-09
FORMULA_NAME ERK-PT-001000-10
FORMULA_NAME ERK-PT-001000-11
FORMULA_NAME ERK-PT-001000-12
FORMULA_NAME ERK-PT-001000-13
FORMULA_NAME ERK-PT-001000-14
FORMULA_NAME ERK-PT-001000-15

=== Now, execution of the tool begins

BK_START 1620766274028

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

FORMULA ERK-PT-001000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ERK-PT-001000-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2799
rslt: Output for LTLFireability @ ERK-PT-001000

{
"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": "Tue May 11 20:51:22 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"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": "X (X (X (X (F ((p4 <= 0))))))",
"processed_size": 29,
"rewrites": 56
},
"result":
{
"edges": 4006,
"markings": 3008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 509
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p2 <= 0) OR (p3 <= 0))",
"processed_size": 25,
"rewrites": 58
},
"result":
{
"edges": 2002,
"markings": 2002,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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 <= p0) AND (1 <= p1)))",
"processed_size": 29,
"rewrites": 56
},
"result":
{
"edges": 14987,
"markings": 9995,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 632
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (G (((p2 <= 0) OR (p3 <= 0)))) AND (G (F (((p2 <= 0) OR (p3 <= 0)))) OR F (((p4 <= 0) AND X (F (((p2 <= 0) OR (p3 <= 0)))))))))",
"processed_size": 136,
"rewrites": 56
},
"result":
{
"edges": 2005,
"markings": 2005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 790
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p2) OR (1 <= p4))) AND F ((p4 <= 0))))",
"processed_size": 53,
"rewrites": 56
},
"result":
{
"edges": 2005,
"markings": 2005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1054
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"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": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((1 <= p4)) OR X ((1 <= p5)))))",
"processed_size": 40,
"rewrites": 56
},
"result":
{
"edges": 2005,
"markings": 2005,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 9,
"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": 1581
},
"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 <= p0) AND (1 <= p1))))",
"processed_size": 33,
"rewrites": 56
},
"result":
{
"edges": 14990,
"markings": 9996,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 3163
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"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 ((F (((p9 <= 0) OR (p10 <= 0))) OR (p4 <= 0))))",
"processed_size": 53,
"rewrites": 56
},
"result":
{
"edges": 1143,
"markings": 1097,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))",
"processed_size": 41,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"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 <= p0) AND (1 <= p1)))",
"processed_size": 29,
"rewrites": 56
},
"result":
{
"edges": 14987,
"markings": 9995,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3704,
"runtime": 770.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((X(**) AND **))) : X(G((X(G((G(**) AND **))) OR **))) : X(F(*)) : F(((** U G(**)) OR G((X(**) OR (G(**) AND X(F(**))))))) : X(X(X(X(F(*))))) : G(F((F(*) OR **))) : (F(**) AND X(**)) : (G(**) OR (X(G(**)) AND **)) : F((X(G(*)) AND (G(F(*)) OR F((* AND X(F(*))))))) : G(F(**)) : X((G(**) AND F(*))) : G(F((G(**) OR X(**))))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 7,
"places": 11,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no yes no no no no unknown no no no no ",
"value": "no no yes no no no no unknown no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 11 places, 11 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: X (F (X (F (G ((X ((1 <= p5)) AND ((1 <= p5) OR ((1 <= p0) AND (1 <= p1))))))))) : G (X ((G ((G (X (((1 <= p4) U (1 <= p4)))) AND X ((1 <= p4)))) OR (1 <= p4)))) : X (NOT(G ((1 <= p5)))) : F ((((p2 <= 0) U G ((1 <= p4))) OR G ((G ((1 <= p6)) U X ((1 <= p2)))))) : X (F (X ((X (((1 <= p2) AND (1 <= p3))) U F (NOT(X (X ((1 <= p4))))))))) : F (G (F ((NOT(G (((1 <= p9) AND (1 <= p10)))) OR (p4 <= 0))))) : (F (((1 <= p2) AND (1 <= p3))) AND X ((1 <= p5))) : (G (((1 <= p0) AND (1 <= p1))) OR (G (X (((1 <= p0) AND (1 <= p1)))) AND ((1 <= p2) OR ((1 <= p0) AND (1 <= p1))))) : NOT(G ((X (F (((1 <= p2) AND (1 <= p3)))) OR G (((1 <= p4) U G (X (G (((1 <= p2) AND (1 <= p3)))))))))) : (F ((1 <= p4)) U F (G (X ((((1 <= p0) AND (1 <= p1)) U F (((1 <= p0) AND (1 <= p1)))))))) : X ((G (((1 <= p2) OR (1 <= p4))) AND NOT(G ((1 <= p4))))) : X (G (F ((G ((1 <= p4)) OR X ((1 <= p5))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:416
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((1 <= p5)) AND ((1 <= p5) OR ((1 <= p0) AND (1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((1 <= p5)) AND ((1 <= p5) OR ((1 <= p0) AND (1 <= p1))))))
lola: processed formula length: 69
lola: 56 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: 2006 markings, 2007 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((G ((1 <= p4)) AND (1 <= p4)))) OR (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((G ((1 <= p4)) AND (1 <= p4)))) OR (1 <= p4))))
lola: processed formula length: 60
lola: 56 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: 2005 markings, 2005 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p5 <= 0)))
lola: processed formula length: 17
lola: 56 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((p2 <= 0) U G ((1 <= p4))) OR G ((X ((1 <= p2)) OR (G ((1 <= p6)) AND X (F ((1 <= p2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((((p2 <= 0) U G ((1 <= p4))) OR G ((X ((1 <= p2)) OR (G ((1 <= p6)) AND X (F ((1 <= p2))))))))
lola: processed formula length: 97
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 22 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: 2013 markings, 2014 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((p4 <= 0))))))
lola: processed formula length: 29
lola: 56 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: 3008 markings, 4006 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p2) AND (1 <= p3))) AND X ((1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2) AND (1 <= p3)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0) OR (p3 <= 0))
lola: processed formula length: 25
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2002 markings, 2002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p0) AND (1 <= p1))) OR (X (G (((1 <= p0) AND (1 <= p1)))) AND ((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))
lola: processed formula length: 41
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p0) AND (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p1)))
lola: processed formula length: 29
lola: 56 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: 9995 markings, 14987 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 56 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: 3221016 markings, 9704939 edges, 644203 markings/sec, 0 secs
lola: 6159296 markings, 19504912 edges, 587656 markings/sec, 5 secs
lola: 8998726 markings, 29182979 edges, 567886 markings/sec, 10 secs
lola: 12139259 markings, 38921945 edges, 628107 markings/sec, 15 secs
lola: 14855935 markings, 48153511 edges, 543335 markings/sec, 20 secs
lola: 17562560 markings, 57631343 edges, 541325 markings/sec, 25 secs
lola: 19625233 markings, 66474129 edges, 412535 markings/sec, 30 secs
lola: 21532367 markings, 74788385 edges, 381427 markings/sec, 35 secs
lola: 23367444 markings, 82843165 edges, 367015 markings/sec, 40 secs
lola: 25158924 markings, 90733314 edges, 358296 markings/sec, 45 secs
lola: 26924351 markings, 98532257 edges, 353085 markings/sec, 50 secs
lola: 28663396 markings, 106241560 edges, 347809 markings/sec, 55 secs
lola: 30373805 markings, 113844852 edges, 342082 markings/sec, 60 secs
lola: 32074973 markings, 121406727 edges, 340234 markings/sec, 65 secs
lola: 34365361 markings, 131606132 edges, 458078 markings/sec, 70 secs
lola: 36035717 markings, 139063982 edges, 334071 markings/sec, 75 secs
lola: 39297580 markings, 152946354 edges, 652373 markings/sec, 80 secs
lola: 41870797 markings, 161731434 edges, 514643 markings/sec, 85 secs
lola: 44548623 markings, 170876467 edges, 535565 markings/sec, 90 secs
lola: 46199047 markings, 178186317 edges, 330085 markings/sec, 95 secs
lola: 47833742 markings, 185518304 edges, 326939 markings/sec, 100 secs
lola: 51070839 markings, 200031062 edges, 647419 markings/sec, 105 secs
lola: 52675571 markings, 207242905 edges, 320946 markings/sec, 110 secs
lola: 57697662 markings, 225565923 edges, 1004418 markings/sec, 115 secs
lola: 60363801 markings, 234702728 edges, 533228 markings/sec, 120 secs
lola: 62137929 markings, 242290102 edges, 354826 markings/sec, 125 secs
lola: 63725301 markings, 249458527 edges, 317474 markings/sec, 130 secs
lola: 65304435 markings, 256587298 edges, 315827 markings/sec, 135 secs
lola: 67025408 markings, 263993606 edges, 344195 markings/sec, 140 secs
lola: 71925417 markings, 280824868 edges, 980002 markings/sec, 145 secs
lola: 74594175 markings, 289995073 edges, 533752 markings/sec, 150 secs
lola: 76248971 markings, 297314911 edges, 330959 markings/sec, 155 secs
lola: 77810350 markings, 304373953 edges, 312276 markings/sec, 160 secs
lola: 79366049 markings, 311413852 edges, 311140 markings/sec, 165 secs
lola: 80940277 markings, 318520307 edges, 314846 markings/sec, 170 secs
lola: 82717663 markings, 326549693 edges, 355477 markings/sec, 175 secs
lola: 83297475 markings, 329171869 edges, 115962 markings/sec, 180 secs
lola: 83680993 markings, 330904745 edges, 76704 markings/sec, 185 secs
lola: 84613767 markings, 335141830 edges, 186555 markings/sec, 190 secs
lola: 85706806 markings, 340065070 edges, 218608 markings/sec, 195 secs
lola: 86993947 markings, 345873143 edges, 257428 markings/sec, 200 secs
lola: 87115459 markings, 346427336 edges, 24302 markings/sec, 205 secs
lola: 87115459 markings, 346427336 edges, 0 markings/sec, 210 secs
lola: 88110829 markings, 350929156 edges, 199074 markings/sec, 215 secs
lola: 88570563 markings, 353015202 edges, 91947 markings/sec, 220 secs
lola: 88570563 markings, 353015202 edges, 0 markings/sec, 225 secs
lola: 89007148 markings, 354992566 edges, 87317 markings/sec, 230 secs
lola: 89605465 markings, 357701417 edges, 119663 markings/sec, 235 secs
lola: 89605465 markings, 357701417 edges, 0 markings/sec, 240 secs
lola: 90449979 markings, 361518038 edges, 168903 markings/sec, 245 secs
lola: 90941029 markings, 363757114 edges, 98210 markings/sec, 250 secs
lola: 91212550 markings, 364978730 edges, 54304 markings/sec, 255 secs
lola: 92339883 markings, 370098374 edges, 225467 markings/sec, 260 secs
lola: 92339883 markings, 370098374 edges, 0 markings/sec, 265 secs
lola: 93215815 markings, 374066711 edges, 175186 markings/sec, 270 secs
lola: 93537926 markings, 375529884 edges, 64422 markings/sec, 275 secs
lola: 94641157 markings, 380492993 edges, 220646 markings/sec, 280 secs
lola: 95309697 markings, 383556749 edges, 133708 markings/sec, 285 secs
lola: 96497943 markings, 387950747 edges, 237649 markings/sec, 290 secs
lola: 98138845 markings, 393597867 edges, 328180 markings/sec, 295 secs
lola: 99841977 markings, 399460730 edges, 340626 markings/sec, 300 secs
lola: 99841977 markings, 399460730 edges, 0 markings/sec, 305 secs
lola: 101734841 markings, 405977504 edges, 378573 markings/sec, 310 secs
lola: 102033812 markings, 407006856 edges, 59794 markings/sec, 315 secs
lola: 103119592 markings, 410745123 edges, 217156 markings/sec, 320 secs
lola: 103483710 markings, 411998970 edges, 72824 markings/sec, 325 secs
lola: 103483710 markings, 411998970 edges, 0 markings/sec, 330 secs
lola: 103700178 markings, 412744022 edges, 43294 markings/sec, 335 secs
lola: 103700251 markings, 412744279 edges, 15 markings/sec, 340 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: subprocess 7 will run for 632 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((p2 <= 0) OR (p3 <= 0)))) AND (G (F (((p2 <= 0) OR (p3 <= 0)))) OR F (((p4 <= 0) AND X (F (((p2 <= 0) OR (p3 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((p2 <= 0) OR (p3 <= 0)))) AND (G (F (((p2 <= 0) OR (p3 <= 0)))) OR F (((p4 <= 0) AND X (F (((p2 <= 0) OR (p3 <= 0)))))))))
lola: processed formula length: 136
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 2005 markings, 2005 edges
lola: ========================================
lola: subprocess 8 will run for 790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p2) OR (1 <= p4))) AND F ((p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p2) OR (1 <= p4))) AND F ((p4 <= 0))))
lola: processed formula length: 53
lola: 56 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: 2005 markings, 2005 edges
lola: ========================================
lola: subprocess 9 will run for 1054 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((1 <= p4)) OR X ((1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((1 <= p4)) OR X ((1 <= p5)))))
lola: processed formula length: 40
lola: 56 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: 2005 markings, 2005 edges
lola: ========================================
lola: subprocess 10 will run for 1581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 56 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: 9996 markings, 14990 edges
lola: ========================================
lola: subprocess 11 will run for 3163 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (((p9 <= 0) OR (p10 <= 0))) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (((p9 <= 0) OR (p10 <= 0))) OR (p4 <= 0))))
lola: processed formula length: 53
lola: 56 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: 1097 markings, 1143 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (((1 <= p0) AND (1 <= p1))) OR (X (G (((1 <= p0) AND (1 <= p1)))) AND ((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) OR ((1 <= p0) AND (1 <= p1)))
lola: processed formula length: 41
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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: G (((1 <= p0) AND (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p0) AND (1 <= p1)))
lola: processed formula length: 29
lola: 56 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: 9995 markings, 14987 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p0) AND (1 <= p1))))
lola: processed formula length: 33
lola: 56 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: 3240635 markings, 9770148 edges, 648127 markings/sec, 0 secs
lola: 6165736 markings, 19527420 edges, 585020 markings/sec, 5 secs
lola: 9002895 markings, 29197126 edges, 567432 markings/sec, 10 secs
lola: 12134577 markings, 38902862 edges, 626336 markings/sec, 15 secs
lola: 14833254 markings, 48076378 edges, 539735 markings/sec, 20 secs
lola: 17542558 markings, 57547730 edges, 541861 markings/sec, 25 secs
lola: 19629683 markings, 66495739 edges, 417425 markings/sec, 30 secs
lola: 21545738 markings, 74846131 edges, 383211 markings/sec, 35 secs
lola: 23389116 markings, 82939319 edges, 368676 markings/sec, 40 secs
lola: 25196653 markings, 90904442 edges, 361507 markings/sec, 45 secs
lola: 27093666 markings, 99275387 edges, 379403 markings/sec, 50 secs
lola: 28630479 markings, 106094156 edges, 307363 markings/sec, 55 secs
lola: 30174839 markings, 112955938 edges, 308872 markings/sec, 60 secs
lola: 31871470 markings, 120503755 edges, 339326 markings/sec, 65 secs
lola: 33568228 markings, 128050021 edges, 339352 markings/sec, 70 secs
lola: 35246747 markings, 135536268 edges, 335704 markings/sec, 75 secs
lola: 36903411 markings, 142953242 edges, 331333 markings/sec, 80 secs
lola: 38552365 markings, 150325376 edges, 329791 markings/sec, 85 secs
lola: 41129642 markings, 159200727 edges, 515455 markings/sec, 90 secs
lola: 43768203 markings, 168211129 edges, 527712 markings/sec, 95 secs
lola: 45601170 markings, 175502384 edges, 366593 markings/sec, 100 secs
lola: 47047496 markings, 181982365 edges, 289265 markings/sec, 105 secs
lola: 48499392 markings, 188505083 edges, 290379 markings/sec, 110 secs
lola: 50027439 markings, 195357951 edges, 305609 markings/sec, 115 secs
lola: 52497398 markings, 206450572 edges, 493992 markings/sec, 120 secs
lola: 54399241 markings, 214265417 edges, 380369 markings/sec, 125 secs
lola: 57017955 markings, 223236701 edges, 523743 markings/sec, 130 secs
lola: 59650437 markings, 232258044 edges, 526496 markings/sec, 135 secs
lola: 61709315 markings, 240387226 edges, 411776 markings/sec, 140 secs
lola: 65279361 markings, 256474340 edges, 714009 markings/sec, 145 secs
lola: 66990742 markings, 263874719 edges, 342276 markings/sec, 150 secs
lola: 72345389 markings, 282268053 edges, 1070929 markings/sec, 155 secs
lola: 74893606 markings, 291219054 edges, 509643 markings/sec, 160 secs
lola: 76506860 markings, 298481444 edges, 322651 markings/sec, 165 secs
lola: 78773946 markings, 308737341 edges, 453417 markings/sec, 170 secs
lola: 80345262 markings, 315834881 edges, 314263 markings/sec, 175 secs
lola: 81913655 markings, 322931821 edges, 313679 markings/sec, 180 secs
lola: 83483216 markings, 330016106 edges, 313912 markings/sec, 185 secs
lola: 84094057 markings, 332767014 edges, 122168 markings/sec, 190 secs
lola: 84994274 markings, 336833165 edges, 180043 markings/sec, 195 secs
lola: 85902544 markings, 340939466 edges, 181654 markings/sec, 200 secs
lola: 87089137 markings, 346308351 edges, 237319 markings/sec, 205 secs
lola: 87949983 markings, 350201431 edges, 172169 markings/sec, 210 secs
lola: 88042179 markings, 350618056 edges, 18439 markings/sec, 215 secs
lola: 89363401 markings, 356601865 edges, 264244 markings/sec, 220 secs
lola: 89603729 markings, 357694261 edges, 48066 markings/sec, 225 secs
lola: 89892115 markings, 358994859 edges, 57677 markings/sec, 230 secs
lola: 90975396 markings, 363905092 edges, 216656 markings/sec, 235 secs
lola: 91292239 markings, 365342990 edges, 63369 markings/sec, 240 secs
lola: 92248160 markings, 369683495 edges, 191184 markings/sec, 245 secs
lola: 93302762 markings, 374462195 edges, 210920 markings/sec, 250 secs
lola: 93302762 markings, 374462195 edges, 0 markings/sec, 255 secs
lola: 93877073 markings, 377063897 edges, 114862 markings/sec, 260 secs
lola: 94888404 markings, 381626278 edges, 202266 markings/sec, 265 secs
lola: 94888404 markings, 381626278 edges, 0 markings/sec, 270 secs
lola: 96217049 markings, 386984444 edges, 265729 markings/sec, 275 secs
lola: 98457569 markings, 394694971 edges, 448104 markings/sec, 280 secs
lola: 98637386 markings, 395314107 edges, 35963 markings/sec, 285 secs
lola: 98637386 markings, 395314107 edges, 0 markings/sec, 290 secs
lola: 100138841 markings, 400482697 edges, 300291 markings/sec, 295 secs
lola: 100262826 markings, 400909596 edges, 24797 markings/sec, 300 secs
lola: 101336147 markings, 404604913 edges, 214664 markings/sec, 305 secs
lola: 102699083 markings, 409297140 edges, 272587 markings/sec, 310 secs
lola: 102699083 markings, 409297140 edges, 0 markings/sec, 315 secs
lola: 102836593 markings, 409770819 edges, 27502 markings/sec, 320 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 no no unknown no no no no
lola:
preliminary result: no no yes no no no no unknown no no no no
lola: memory consumption: 3704 KB
lola: time consumption: 770 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="ERK-PT-001000"
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 ERK-PT-001000, 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 r094-tall-162048902600290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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