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.r322-tall-162132128000162.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 TwoPhaseLocking-PT-nC01000vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r322-tall-162132128000162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.5K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC01000vD-00
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-01
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-02
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-03
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-04
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-05
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-06
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-07
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-08
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-09
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-10
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-11
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-12
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-13
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-14
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-15

=== Now, execution of the tool begins

BK_START 1621448767969

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

FORMULA TwoPhaseLocking-PT-nC01000vD-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC01000vD-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2984
rslt: Output for LTLFireability @ TwoPhaseLocking-PT-nC01000vD

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 18:26:11 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X ((F ((1 <= p7)) OR G (F (((1 <= p3) AND (1 <= p5)))))))",
"processed_size": 60,
"rewrites": 71
},
"result":
{
"edges": 253502,
"markings": 253002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (X (X (((p2 <= 0) AND (F (((1 <= p3) AND (1 <= p5))) OR G ((p2 <= 0))))))) R ((p3 <= 0) OR (p5 <= 0) OR (p4 <= 0))))",
"processed_size": 124,
"rewrites": 71
},
"result":
{
"edges": 2003,
"markings": 2003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p0) AND (1 <= p1))) AND F ((p2 <= 0))))",
"processed_size": 53,
"rewrites": 71
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 410
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 0) OR (p1 <= 0)) OR (X ((p6 <= 0)) AND (p6 <= 0)))))",
"processed_size": 68,
"rewrites": 71
},
"result":
{
"edges": 3514,
"markings": 3512,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 468
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p3) AND (1 <= p4))) AND F (G ((p7 <= 0)))))",
"processed_size": 57,
"rewrites": 71
},
"result":
{
"edges": 2003,
"markings": 2003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 546
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 546
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(((p0 <= 0) OR (p1 <= 0)) U ((1 <= p0) AND (1 <= p1)))",
"processed_size": 55,
"rewrites": 71
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G (((p3 <= 0) OR (p5 <= 0))))",
"processed_size": 33,
"rewrites": 71
},
"result":
{
"edges": 2003,
"markings": 2003,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p7)))",
"processed_size": 17,
"rewrites": 71
},
"result":
{
"edges": 5994,
"markings": 4996,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"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": 3,
"visible_transitions": 0
},
"processed": "X ((X (G (((p2 <= 0)))) AND F (((1 <= p3) AND (1 <= p5)))))",
"processed_size": 59,
"rewrites": 71
},
"result":
{
"edges": 2009,
"markings": 2009,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1093
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 3,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((X ((X (X (F ((F (((1 <= p0) AND (1 <= p1))) OR (1 <= p2))))) OR F (((1 <= p3) AND (1 <= p5))))) AND (1 <= p2))))",
"processed_size": 119,
"rewrites": 71
},
"result":
{
"edges": 2005,
"markings": 2004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1640
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G (((p3 <= 0) OR (p5 <= 0))))",
"processed_size": 33,
"rewrites": 71
},
"result":
{
"edges": 8,
"markings": 7,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3281
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((p3 <= 0) OR (p4 <= 0)))",
"processed_size": 29,
"rewrites": 71
},
"result":
{
"edges": 2007,
"markings": 2007,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3372,
"runtime": 586.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X((F(**) OR G(F(**))))) : G(*) : G((X(X(X((* AND (F(*) OR G(*)))))) R *)) : G(F((X(X(F(**))) OR G((** OR (G(**) AND F(**))))))) : (X((F(**) AND F(*))) AND **) : F(G(*)) : G(F((** OR (X(*) AND **)))) : G((X(*) AND F(G(*)))) : (X(G(*)) AND (** U **)) : (F(G(**)) OR (F(G(**)) AND F(G((X(F(*)) AND **))))) : X((X(G(*)) AND F(**))) : F(G((X((X(X(F((F(**) OR **)))) OR F(**))) AND **)))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "no no no unknown yes no no no no no no no ",
"value": "no no no unknown yes no no no 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: 14/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 256
lola: finding significant places
lola: 8 places, 6 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: X (X ((F ((1 <= p7)) OR G (F (((1 <= p3) AND (1 <= p5))))))) : NOT(F (((1 <= p3) AND (1 <= p4)))) : G (NOT((X (X ((G (X (((p3 <= 0) OR (p5 <= 0)))) U X ((1 <= p2))))) U ((1 <= p3) AND (1 <= p5) AND (1 <= p4))))) : F (G (F ((F (X (X (((1 <= p3) AND (1 <= p5))))) OR G ((G (((1 <= p0) AND (1 <= p1))) U ((1 <= p0) AND (1 <= p1)))))))) : (NOT(X ((NOT((X (((1 <= p0) AND (1 <= p1))) U F (((1 <= p0) AND (1 <= p1))))) OR G ((1 <= p2))))) AND (p6 <= 0)) : NOT(G (X (X (X (F (X (((1 <= p2) U ((1 <= p3) AND (1 <= p5)))))))))) : G (X (F ((((p0 <= 0) OR (p1 <= 0)) OR (NOT(X ((1 <= p6))) AND (p6 <= 0)))))) : NOT(F ((X (((p3 <= 0) OR (p4 <= 0))) OR G (F ((1 <= p7)))))) : (NOT(F (X ((((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5)))))) AND (((p0 <= 0) OR (p1 <= 0)) U ((1 <= p0) AND (1 <= p1)))) : (X (G (F (G ((NOT(G (X ((1 <= p7)))) AND (p7 <= 0)))))) U F (G ((1 <= p7)))) : X ((G (NOT(X (((1 <= p2))))) AND ((1 <= p2) U F (((1 <= p3) AND (1 <= p5)))))) : F (G ((X ((X (X (F ((F (((1 <= p0) AND (1 <= p1))) OR (1 <= p2))))) OR F (((1 <= p3) AND (1 <= p5))))) AND (1 <= p2))))
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((1 <= p7)) OR G (F (((1 <= p3) AND (1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((1 <= p7)) OR G (F (((1 <= p3) AND (1 <= p5)))))))
lola: processed formula length: 60
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: 253002 markings, 253502 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X (X (((p2 <= 0) AND (F (((1 <= p3) AND (1 <= p5))) OR G ((p2 <= 0))))))) R ((p3 <= 0) OR (p5 <= 0) OR (p4 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (X (X (((p2 <= 0) AND (F (((1 <= p3) AND (1 <= p5))) OR G ((p2 <= 0))))))) R ((p3 <= 0) OR (p5 <= 0) OR (p4 <= 0))))
lola: processed formula length: 124
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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2003 markings, 2003 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (F (((1 <= p3) AND (1 <= p5))))) OR G ((((1 <= p0) AND (1 <= p1)) OR (G (((1 <= p0) AND (1 <= p1))) AND F (((1 <= p0) AND (1 <= p1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (F (((1 <= p3) AND (1 <= p5))))) OR G ((((1 <= p0) AND (1 <= p1)) OR (G (((1 <= p0) AND (1 <= p1))) AND F (((1 <= p0) AND (1 <= p1)))))))))
lola: processed formula length: 151
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3705905 markings, 5973610 edges, 741181 markings/sec, 0 secs
lola: 7169992 markings, 11611647 edges, 692817 markings/sec, 5 secs
lola: 10565737 markings, 17160668 edges, 679149 markings/sec, 10 secs
lola: 13894506 markings, 22622073 edges, 665754 markings/sec, 15 secs
lola: 17203071 markings, 28040546 edges, 661713 markings/sec, 20 secs
lola: 20426394 markings, 33350220 edges, 644665 markings/sec, 25 secs
lola: 23590804 markings, 38563940 edges, 632882 markings/sec, 30 secs
lola: 26723142 markings, 43698938 edges, 626468 markings/sec, 35 secs
lola: 29754684 markings, 48740761 edges, 606308 markings/sec, 40 secs
lola: 32783242 markings, 53720502 edges, 605712 markings/sec, 45 secs
lola: 35707028 markings, 58589014 edges, 584757 markings/sec, 50 secs
lola: 38633727 markings, 63386531 edges, 585340 markings/sec, 55 secs
lola: 41491602 markings, 68139953 edges, 571575 markings/sec, 60 secs
lola: 44328009 markings, 72843956 edges, 567281 markings/sec, 65 secs
lola: 47124630 markings, 77499439 edges, 559324 markings/sec, 70 secs
lola: 49893244 markings, 82139480 edges, 553723 markings/sec, 75 secs
lola: 52692100 markings, 86768192 edges, 559771 markings/sec, 80 secs
lola: 55417875 markings, 91357637 edges, 545155 markings/sec, 85 secs
lola: 58152424 markings, 95880185 edges, 546910 markings/sec, 90 secs
lola: 60828682 markings, 100389030 edges, 535252 markings/sec, 95 secs
lola: 63497471 markings, 104882898 edges, 533758 markings/sec, 100 secs
lola: 66171094 markings, 109333945 edges, 534725 markings/sec, 105 secs
lola: 68795304 markings, 113776201 edges, 524842 markings/sec, 110 secs
lola: 71425687 markings, 118222568 edges, 526077 markings/sec, 115 secs
lola: 74038056 markings, 122622956 edges, 522474 markings/sec, 120 secs
lola: 76629763 markings, 127032086 edges, 518341 markings/sec, 125 secs
lola: 79228462 markings, 131462961 edges, 519740 markings/sec, 130 secs
lola: 81833874 markings, 135903921 edges, 521082 markings/sec, 135 secs
lola: 84462759 markings, 140390904 edges, 525777 markings/sec, 140 secs
lola: 87071047 markings, 144874664 edges, 521658 markings/sec, 145 secs
lola: 89699733 markings, 149414036 edges, 525737 markings/sec, 150 secs
lola: 92364747 markings, 154028212 edges, 533003 markings/sec, 155 secs
lola: 95042905 markings, 158722828 edges, 535632 markings/sec, 160 secs
lola: 97701077 markings, 163416842 edges, 531634 markings/sec, 165 secs
lola: 100358878 markings, 168171249 edges, 531560 markings/sec, 170 secs
lola: 103025113 markings, 173013402 edges, 533247 markings/sec, 175 secs
lola: 105796186 markings, 178215774 edges, 554215 markings/sec, 180 secs
lola: 108643029 markings, 183927405 edges, 569369 markings/sec, 185 secs
lola: 112023061 markings, 191067639 edges, 676006 markings/sec, 190 secs
lola: 115738162 markings, 196776806 edges, 743020 markings/sec, 195 secs
lola: 119373566 markings, 202138357 edges, 727081 markings/sec, 200 secs
lola: 122973438 markings, 207351454 edges, 719974 markings/sec, 205 secs
lola: 126171743 markings, 211924230 edges, 639661 markings/sec, 210 secs
lola: 127971198 markings, 214525538 edges, 359891 markings/sec, 215 secs
lola: 131202261 markings, 219039378 edges, 646213 markings/sec, 220 secs
lola: 134280986 markings, 223372012 edges, 615745 markings/sec, 225 secs
lola: 137582689 markings, 227994007 edges, 660341 markings/sec, 230 secs
lola: 139485391 markings, 230657875 edges, 380540 markings/sec, 235 secs
lola: 141662265 markings, 233685135 edges, 435375 markings/sec, 240 secs
lola: 144831014 markings, 238083999 edges, 633750 markings/sec, 245 secs
lola: 147665100 markings, 242015999 edges, 566817 markings/sec, 250 secs
lola: 149024320 markings, 243902168 edges, 271844 markings/sec, 255 secs
lola: 151646016 markings, 247522312 edges, 524339 markings/sec, 260 secs
lola: 153901592 markings, 250641705 edges, 451115 markings/sec, 265 secs
lola: 155637872 markings, 253025964 edges, 347256 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((F (((1 <= p0) AND (1 <= p1))) AND F ((p2 <= 0)))) AND (p6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 <= 0)
lola: processed formula length: 9
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p0) AND (1 <= p1))) AND F ((p2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p0) AND (1 <= p1))) AND F ((p2 <= 0))))
lola: processed formula length: 53
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 0) OR (p1 <= 0)) OR (X ((p6 <= 0)) AND (p6 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((((p0 <= 0) OR (p1 <= 0)) OR (X ((p6 <= 0)) AND (p6 <= 0)))))
lola: processed formula length: 68
lola: 71 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: 3512 markings, 3514 edges
lola: ========================================
lola: subprocess 5 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p3) AND (1 <= p4))) AND F (G ((p7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p3) AND (1 <= p4))) AND F (G ((p7 <= 0)))))
lola: processed formula length: 57
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: 2003 markings, 2003 edges
lola: ========================================
lola: subprocess 6 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((p3 <= 0) OR (p5 <= 0)))) AND (((p0 <= 0) OR (p1 <= 0)) U ((1 <= p0) AND (1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p0 <= 0) OR (p1 <= 0)) U ((1 <= p0) AND (1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p0 <= 0) OR (p1 <= 0)) U ((1 <= p0) AND (1 <= p1)))
lola: processed formula length: 55
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: 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: ========================================
lola: subprocess 7 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p3 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p3 <= 0) OR (p5 <= 0))))
lola: processed formula length: 33
lola: 71 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: 2003 markings, 2003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p7))) OR (F (G ((1 <= p7))) AND F (G ((X (F ((p7 <= 0))) AND (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p7)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((1 <= p7)))
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: 4996 markings, 5994 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G (((p2 <= 0)))) AND F (((1 <= p3) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G (((p2 <= 0)))) AND F (((1 <= p3) AND (1 <= p5)))))
lola: processed formula length: 59
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: 2009 markings, 2009 edges
lola: ========================================
lola: subprocess 9 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((X (X (F ((F (((1 <= p0) AND (1 <= p1))) OR (1 <= p2))))) OR F (((1 <= p3) AND (1 <= p5))))) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((X (X (F ((F (((1 <= p0) AND (1 <= p1))) OR (1 <= p2))))) OR F (((1 <= p3) AND (1 <= p5))))) AND (1 <= p2))))
lola: processed formula length: 119
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: 2004 markings, 2005 edges
lola: ========================================
lola: subprocess 10 will run for 1640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p3 <= 0) OR (p5 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((p3 <= 0) OR (p5 <= 0))))
lola: processed formula length: 33
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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 11 will run for 3281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p3 <= 0) OR (p4 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p3 <= 0) OR (p4 <= 0)))
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: 2007 markings, 2007 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((X (X (F (((1 <= p3) AND (1 <= p5))))) OR G ((((1 <= p0) AND (1 <= p1)) OR (G (((1 <= p0) AND (1 <= p1))) AND F (((1 <= p0) AND (1 <= p1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((X (X (F (((1 <= p3) AND (1 <= p5))))) OR G ((((1 <= p0) AND (1 <= p1)) OR (G (((1 <= p0) AND (1 <= p1))) AND F (((1 <= p0) AND (1 <= p1)))))))))
lola: processed formula length: 151
lola: 71 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3661915 markings, 5897329 edges, 732383 markings/sec, 0 secs
lola: 7060471 markings, 11434708 edges, 679711 markings/sec, 5 secs
lola: 10385336 markings, 16872485 edges, 664973 markings/sec, 10 secs
lola: 13665966 markings, 22248891 edges, 656126 markings/sec, 15 secs
lola: 16898418 markings, 27559486 edges, 646490 markings/sec, 20 secs
lola: 20069231 markings, 32779868 edges, 634163 markings/sec, 25 secs
lola: 23189336 markings, 37899845 edges, 624021 markings/sec, 30 secs
lola: 26248613 markings, 42951124 edges, 611855 markings/sec, 35 secs
lola: 29275603 markings, 47917305 edges, 605398 markings/sec, 40 secs
lola: 32252619 markings, 52834027 edges, 595403 markings/sec, 45 secs
lola: 35163888 markings, 57668653 edges, 582254 markings/sec, 50 secs
lola: 38060711 markings, 62454280 edges, 579365 markings/sec, 55 secs
lola: 40896732 markings, 67164837 edges, 567204 markings/sec, 60 secs
lola: 43720727 markings, 71845024 edges, 564799 markings/sec, 65 secs
lola: 46505846 markings, 76462908 edges, 557024 markings/sec, 70 secs
lola: 49243318 markings, 81055210 edges, 547494 markings/sec, 75 secs
lola: 52005900 markings, 85613137 edges, 552516 markings/sec, 80 secs
lola: 54704661 markings, 90150413 edges, 539752 markings/sec, 85 secs
lola: 57396779 markings, 94653058 edges, 538424 markings/sec, 90 secs
lola: 60071660 markings, 99099600 edges, 534976 markings/sec, 95 secs
lola: 62713627 markings, 103535818 edges, 528393 markings/sec, 100 secs
lola: 65324416 markings, 107937606 edges, 522158 markings/sec, 105 secs
lola: 67921235 markings, 112332400 edges, 519364 markings/sec, 110 secs
lola: 70533471 markings, 116701224 edges, 522447 markings/sec, 115 secs
lola: 73135969 markings, 121101435 edges, 520500 markings/sec, 120 secs
lola: 75727228 markings, 125500008 edges, 518252 markings/sec, 125 secs
lola: 78309750 markings, 129889265 edges, 516504 markings/sec, 130 secs
lola: 80905535 markings, 134299945 edges, 519157 markings/sec, 135 secs
lola: 83492460 markings, 138727732 edges, 517385 markings/sec, 140 secs
lola: 86069688 markings, 143167422 edges, 515446 markings/sec, 145 secs
lola: 88669649 markings, 147634598 edges, 519992 markings/sec, 150 secs
lola: 91279011 markings, 152177860 edges, 521872 markings/sec, 155 secs
lola: 93920984 markings, 156766140 edges, 528395 markings/sec, 160 secs
lola: 96557477 markings, 161381106 edges, 527299 markings/sec, 165 secs
lola: 99178879 markings, 166055132 edges, 524280 markings/sec, 170 secs
lola: 101826745 markings, 170823735 edges, 529573 markings/sec, 175 secs
lola: 104511730 markings, 175788435 edges, 536997 markings/sec, 180 secs
lola: 107265118 markings, 181067176 edges, 550678 markings/sec, 185 secs
lola: 110096081 markings, 187729619 edges, 566193 markings/sec, 190 secs
lola: 113796633 markings, 193848015 edges, 740110 markings/sec, 195 secs
lola: 117406026 markings, 199252207 edges, 721879 markings/sec, 200 secs
lola: 120983079 markings, 204484634 edges, 715411 markings/sec, 205 secs
lola: 124512209 markings, 209542376 edges, 705826 markings/sec, 210 secs
lola: 127826078 markings, 214262825 edges, 662774 markings/sec, 215 secs
lola: 128671153 markings, 215470150 edges, 169015 markings/sec, 220 secs
lola: 131447400 markings, 219381665 edges, 555249 markings/sec, 225 secs
lola: 133131497 markings, 221762513 edges, 336819 markings/sec, 230 secs
lola: 135567370 markings, 225175667 edges, 487175 markings/sec, 235 secs
lola: 137661990 markings, 228100110 edges, 418924 markings/sec, 240 secs
lola: 140255915 markings, 231727489 edges, 518785 markings/sec, 245 secs
lola: 142442498 markings, 234766480 edges, 437317 markings/sec, 250 secs
lola: 144621170 markings, 237803013 edges, 435734 markings/sec, 255 secs
lola: 146954009 markings, 241030141 edges, 466568 markings/sec, 260 secs
lola: 149299043 markings, 244280897 edges, 469007 markings/sec, 265 secs
lola: 151641104 markings, 247512796 edges, 468412 markings/sec, 270 secs
lola: 154041574 markings, 250829254 edges, 480094 markings/sec, 275 secs
lola: 155851654 markings, 253321898 edges, 362016 markings/sec, 280 secs
lola: 156012293 markings, 253546678 edges, 32128 markings/sec, 285 secs
lola: 156016382 markings, 253552153 edges, 818 markings/sec, 290 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no unknown yes no no no no no no no
lola:
preliminary result: no no no unknown yes no no no no no no no
lola: memory consumption: 3372 KB
lola: time consumption: 586 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="TwoPhaseLocking-PT-nC01000vD"
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 TwoPhaseLocking-PT-nC01000vD, 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 r322-tall-162132128000162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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