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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K 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.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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-nC00200vN-00
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-01
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-02
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-03
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-04
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-05
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-06
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-07
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-08
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-09
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-10
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-11
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-12
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-13
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-14
FORMULA_NAME TwoPhaseLocking-PT-nC00200vN-15

=== Now, execution of the tool begins

BK_START 1621447901964

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

FORMULA TwoPhaseLocking-PT-nC00200vN-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TwoPhaseLocking-PT-nC00200vN-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vN-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vN-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA TwoPhaseLocking-PT-nC00200vN-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA TwoPhaseLocking-PT-nC00200vN-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vN-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC00200vN-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2536
rslt: Output for LTLFireability @ TwoPhaseLocking-PT-nC00200vN

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 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": "((p3 <= 0) OR (p4 <= 0))",
"processed_size": 25,
"rewrites": 49
},
"result":
{
"edges": 200,
"markings": 201,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"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 (X ((p7 <= 0))) AND G (((p3 <= 0) OR (p4 <= 0)))))",
"processed_size": 57,
"rewrites": 47
},
"result":
{
"edges": 406,
"markings": 406,
"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
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (((1 <= p3) AND (1 <= p4)))",
"processed_size": 29,
"rewrites": 47
},
"result":
{
"edges": 407,
"markings": 407,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((p3 <= 0) OR (p4 <= 0))))))",
"processed_size": 91,
"rewrites": 47
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((X (G ((p2 <= 0))) AND (G (F ((p2 <= 0))) OR G (((1 <= p0) AND (1 <= p1)))))))",
"processed_size": 84,
"rewrites": 47
},
"result":
{
"edges": 408,
"markings": 408,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"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": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X ((1 <= p6)) U (1 <= p7))",
"processed_size": 27,
"rewrites": 47
},
"result":
{
"edges": 403,
"markings": 403,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 2,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((1 <= p6) U (((X (G (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p4))) U (1 <= p6)) OR (G (((p6 <= 0) OR ((1 <= p0) AND (1 <= p1)))) AND F ((1 <= p6)))))",
"processed_size": 163,
"rewrites": 47
},
"result":
{
"edges": 405,
"markings": 405,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 32
},
"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": 594
},
"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": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((X (G (((1 <= p3) AND (1 <= p4)))) AND F ((1 <= p7)))))",
"processed_size": 61,
"rewrites": 47
},
"result":
{
"edges": 404,
"markings": 404,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 768
},
"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": 47
},
"result":
{
"edges": 2153897,
"markings": 1069769,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 1024
},
"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": 47
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1536
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 3,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((F (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)) U (((p3 <= 0) OR (p5 <= 0)) U ((1 <= p6) U (1 <= p2))))",
"processed_size": 102,
"rewrites": 47
},
"result":
{
"edges": 45434652,
"markings": 18569052,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3035
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 2,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p3) AND (1 <= p5))) AND ((((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5))) OR (((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5)))))))",
"processed_size": 160,
"rewrites": 47
},
"result":
{
"edges": 436,
"markings": 424,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"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": 3308,
"runtime": 1033.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) OR **) U (** U (** U **))) : (X(X(X(G((F(**) AND (X(*) OR **)))))) OR F(**)) : G((X(X(*)) AND G(*))) : F(G((F(**) AND ((** U **) OR (** U **))))) : (X(X(F((X(F(*)) AND **)))) OR G(**)) : X(G((X(G(*)) AND (G(F(*)) OR G(**))))) : (X(**) U **) : F(G(*)) : G(F(**)) : (** U (((X(G(**)) OR **) U **) OR (G(**) AND F(**)))) : X(F((X(G(**)) AND F(**)))) : G((X(G((F(G(**)) AND G((X(**) OR G(**)))))) OR F(**)))"
},
"net":
{
"arcs": 18,
"conflict_clusters": 5,
"places": 8,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 6
},
"result":
{
"preliminary_value": "yes yes no no yes no no no yes no no unknown ",
"value": "yes yes no no yes no no no yes no no unknown "
},
"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: ((F (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)) U (((p3 <= 0) OR (p5 <= 0)) U ((1 <= p6) U (1 <= p2)))) : (X (G (X (X ((NOT(X (((1 <= p3) AND (1 <= p4)))) U ((1 <= p3) AND (1 <= p5))))))) OR F (((1 <= p3) AND (1 <= p4)))) : G ((NOT(X (X ((1 <= p7)))) AND NOT(F (((1 <= p3) AND (1 <= p4)))))) : F (G (X (((((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5))) U (((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5))))))) : (X (X (F ((F (NOT(X (((1 <= p3) AND (1 <= p4) AND (1 <= p7))))) AND ((p3 <= 0) OR (p4 <= 0)))))) OR G (((1 <= p3) AND (1 <= p4)))) : X (G ((NOT(F (X ((1 <= p2)))) AND (G (NOT(G ((1 <= p2)))) OR G (((1 <= p0) AND (1 <= p1))))))) : (X ((1 <= p6)) U (1 <= p7)) : NOT(G (X (X (F (X ((((p0 <= 0) OR (p1 <= 0)) U X (((1 <= p3) AND (1 <= p5)))))))))) : X (G (F (((1 <= p0) AND (1 <= p1))))) : ((1 <= p6) U (G (((p6 <= 0) OR ((1 <= p0) AND (1 <= p1)))) U ((X (G (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p4))) U (1 <= p6)))) : X (F ((G (X (((1 <= p3) AND (1 <= p4)))) AND F ((1 <= p7))))) : G ((G (X (G ((X (((1 <= p0) AND (1 <= p1))) U G ((1 <= p2)))))) OR F (((1 <= p0) AND (1 <= p1)))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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 (X (G ((F (((1 <= p3) AND (1 <= p5))) AND (X (((p3 <= 0) OR (p4 <= 0))) OR ((1 <= p3) AND (1 <= p5)))))))) OR F (((1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p3) AND (1 <= p4)))
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: ((p3 <= 0) OR (p4 <= 0))
lola: processed formula length: 25
lola: 49 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 201 markings, 200 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (X ((p7 <= 0))) AND 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 ((X (X ((p7 <= 0))) AND G (((p3 <= 0) OR (p4 <= 0)))))
lola: processed formula length: 57
lola: 47 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: 406 markings, 406 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((p3 <= 0) OR (p4 <= 0)))))) OR G (((1 <= p3) AND (1 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p3) AND (1 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p3) AND (1 <= p4)))
lola: processed formula length: 29
lola: 47 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: 407 markings, 407 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((p3 <= 0) OR (p4 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((X (F (((p3 <= 0) OR (p4 <= 0) OR (p7 <= 0)))) AND ((p3 <= 0) OR (p4 <= 0))))))
lola: processed formula length: 91
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((p2 <= 0))) AND (G (F ((p2 <= 0))) OR 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 ((X (G ((p2 <= 0))) AND (G (F ((p2 <= 0))) OR G (((1 <= p0) AND (1 <= p1)))))))
lola: processed formula length: 84
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 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: 408 markings, 408 edges
lola: ========================================
lola: subprocess 4 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((1 <= p6)) U (1 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X ((1 <= p6)) U (1 <= p7))
lola: processed formula length: 27
lola: 47 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: 403 markings, 403 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p6) U (((X (G (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p4))) U (1 <= p6)) OR (G (((p6 <= 0) OR ((1 <= p0) AND (1 <= p1)))) AND F ((1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p6) U (((X (G (((1 <= p3) AND (1 <= p5)))) OR ((1 <= p3) AND (1 <= p4))) U (1 <= p6)) OR (G (((p6 <= 0) OR ((1 <= p0) AND (1 <= p1)))) AND F ((1 <= p6)))))
lola: processed formula length: 163
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 32 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: 405 markings, 405 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (G (((1 <= p3) AND (1 <= p4)))) AND F ((1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (G (((1 <= p3) AND (1 <= p4)))) AND F ((1 <= p7)))))
lola: processed formula length: 61
lola: 47 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: 404 markings, 404 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G ((F (G ((1 <= p2))) AND G ((X (((1 <= p0) AND (1 <= p1))) OR G ((1 <= p2))))))) OR 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 ((X (G ((F (G ((1 <= p2))) AND G ((X (((1 <= p0) AND (1 <= p1))) OR G ((1 <= p2))))))) OR F (((1 <= p0) AND (1 <= p1)))))
lola: processed formula length: 123
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2693081 markings, 9492796 edges, 538616 markings/sec, 0 secs
lola: 4906187 markings, 17853397 edges, 442621 markings/sec, 5 secs
lola: 6996906 markings, 25817511 edges, 418144 markings/sec, 10 secs
lola: 9052278 markings, 33671146 edges, 411074 markings/sec, 15 secs
lola: 10978246 markings, 41131343 edges, 385194 markings/sec, 20 secs
lola: 12977571 markings, 48908944 edges, 399865 markings/sec, 25 secs
lola: 14936823 markings, 56561581 edges, 391850 markings/sec, 30 secs
lola: 16835570 markings, 64041245 edges, 379749 markings/sec, 35 secs
lola: 18710819 markings, 71466526 edges, 375050 markings/sec, 40 secs
lola: 20519601 markings, 78683602 edges, 361756 markings/sec, 45 secs
lola: 22376420 markings, 86054939 edges, 371364 markings/sec, 50 secs
lola: 24156126 markings, 93280635 edges, 355941 markings/sec, 55 secs
lola: 25923164 markings, 100288565 edges, 353408 markings/sec, 60 secs
lola: 27663947 markings, 107271476 edges, 348157 markings/sec, 65 secs
lola: 29415969 markings, 114343784 edges, 350404 markings/sec, 70 secs
lola: 31134515 markings, 121348959 edges, 343709 markings/sec, 75 secs
lola: 32849896 markings, 128138536 edges, 343076 markings/sec, 80 secs
lola: 34597774 markings, 135291867 edges, 349576 markings/sec, 85 secs
lola: 36308063 markings, 142252815 edges, 342058 markings/sec, 90 secs
lola: 38011826 markings, 149188933 edges, 340753 markings/sec, 95 secs
lola: 39728238 markings, 156193429 edges, 343282 markings/sec, 100 secs
lola: 41367224 markings, 162912531 edges, 327797 markings/sec, 105 secs
lola: 42991253 markings, 169639945 edges, 324806 markings/sec, 110 secs
lola: 44695844 markings, 176646508 edges, 340918 markings/sec, 115 secs
lola: 46308831 markings, 183263989 edges, 322597 markings/sec, 120 secs
lola: 47987771 markings, 190155006 edges, 335788 markings/sec, 125 secs
lola: 49633435 markings, 196994740 edges, 329133 markings/sec, 130 secs
lola: 51278112 markings, 203778273 edges, 328935 markings/sec, 135 secs
lola: 52959460 markings, 210621997 edges, 336270 markings/sec, 140 secs
lola: 54600678 markings, 217478350 edges, 328244 markings/sec, 145 secs
lola: 56182865 markings, 224003179 edges, 316437 markings/sec, 150 secs
lola: 57776825 markings, 230532444 edges, 318792 markings/sec, 155 secs
lola: 59391360 markings, 237310490 edges, 322907 markings/sec, 160 secs
lola: 61007375 markings, 244070702 edges, 323203 markings/sec, 165 secs
lola: 62618016 markings, 250724151 edges, 322128 markings/sec, 170 secs
lola: 64203502 markings, 257334208 edges, 317097 markings/sec, 175 secs
lola: 65766562 markings, 263862355 edges, 312612 markings/sec, 180 secs
lola: 67330525 markings, 270515521 edges, 312793 markings/sec, 185 secs
lola: 68973372 markings, 277346557 edges, 328569 markings/sec, 190 secs
lola: 70538006 markings, 283877497 edges, 312927 markings/sec, 195 secs
lola: 72123645 markings, 290397569 edges, 317128 markings/sec, 200 secs
lola: 73676683 markings, 296924134 edges, 310608 markings/sec, 205 secs
lola: 75232813 markings, 303423245 edges, 311226 markings/sec, 210 secs
lola: 76749706 markings, 309796910 edges, 303379 markings/sec, 215 secs
lola: 78255895 markings, 316114003 edges, 301238 markings/sec, 220 secs
lola: 79771505 markings, 322484772 edges, 303122 markings/sec, 225 secs
lola: 81287507 markings, 328890509 edges, 303200 markings/sec, 230 secs
lola: 82822134 markings, 335292505 edges, 306925 markings/sec, 235 secs
lola: 84320916 markings, 341640434 edges, 299756 markings/sec, 240 secs
lola: 85866931 markings, 348149712 edges, 309203 markings/sec, 245 secs
lola: 87395901 markings, 354592116 edges, 305794 markings/sec, 250 secs
lola: 88888348 markings, 360880188 edges, 298489 markings/sec, 255 secs
lola: 90384943 markings, 367187425 edges, 299319 markings/sec, 260 secs
lola: 91892885 markings, 373642098 edges, 301588 markings/sec, 265 secs
lola: 93369917 markings, 379761226 edges, 295406 markings/sec, 270 secs
lola: 94838646 markings, 385944675 edges, 293746 markings/sec, 275 secs
lola: 96328352 markings, 392221077 edges, 297941 markings/sec, 280 secs
lola: 97806817 markings, 398483990 edges, 295693 markings/sec, 285 secs
lola: 99292186 markings, 404678079 edges, 297074 markings/sec, 290 secs
lola: 100772191 markings, 410909516 edges, 296001 markings/sec, 295 secs
lola: 102247803 markings, 417170399 edges, 295122 markings/sec, 300 secs
lola: 103718324 markings, 423364052 edges, 294104 markings/sec, 305 secs
lola: 105164786 markings, 429501401 edges, 289292 markings/sec, 310 secs
lola: 106640755 markings, 435781147 edges, 295194 markings/sec, 315 secs
lola: 108101701 markings, 441892490 edges, 292189 markings/sec, 320 secs
lola: 109533320 markings, 447864325 edges, 286324 markings/sec, 325 secs
lola: 110961947 markings, 453910214 edges, 285725 markings/sec, 330 secs
lola: 112411384 markings, 460014241 edges, 289887 markings/sec, 335 secs
lola: 113877565 markings, 466158716 edges, 293236 markings/sec, 340 secs
lola: 115307749 markings, 472245083 edges, 286037 markings/sec, 345 secs
lola: 116757819 markings, 478331383 edges, 290014 markings/sec, 350 secs
lola: 118045890 markings, 483788561 edges, 257614 markings/sec, 355 secs
lola: 119086725 markings, 488171634 edges, 208167 markings/sec, 360 secs
lola: 120319401 markings, 493447004 edges, 246535 markings/sec, 365 secs
lola: 121710478 markings, 499226359 edges, 278215 markings/sec, 370 secs
lola: 122746011 markings, 503652205 edges, 207107 markings/sec, 375 secs
lola: 123926965 markings, 508609672 edges, 236191 markings/sec, 380 secs
lola: 124811833 markings, 512361915 edges, 176974 markings/sec, 385 secs
lola: 125968260 markings, 517259915 edges, 231285 markings/sec, 390 secs
lola: 126674066 markings, 520218726 edges, 141161 markings/sec, 395 secs
lola: 127820504 markings, 525098813 edges, 229288 markings/sec, 400 secs
lola: 129031081 markings, 530200257 edges, 242115 markings/sec, 405 secs
lola: 130178679 markings, 534949445 edges, 229520 markings/sec, 410 secs
lola: 131318677 markings, 539714743 edges, 228000 markings/sec, 415 secs
lola: 132552580 markings, 544890589 edges, 246781 markings/sec, 420 secs
lola: 133919798 markings, 550678774 edges, 273444 markings/sec, 425 secs
lola: 134988771 markings, 555194102 edges, 213795 markings/sec, 430 secs
lola: 135957059 markings, 559288299 edges, 193658 markings/sec, 435 secs
lola: 137062193 markings, 563901696 edges, 221027 markings/sec, 440 secs
lola: 137914427 markings, 567455438 edges, 170447 markings/sec, 445 secs
lola: 139021500 markings, 572123290 edges, 221415 markings/sec, 450 secs
lola: 140259374 markings, 577385380 edges, 247575 markings/sec, 455 secs
lola: 141330309 markings, 581943216 edges, 214187 markings/sec, 460 secs
lola: 142366701 markings, 586309554 edges, 207278 markings/sec, 465 secs
lola: 143411312 markings, 590705933 edges, 208922 markings/sec, 470 secs
lola: 144552271 markings, 595483935 edges, 228192 markings/sec, 475 secs
lola: 145005048 markings, 597420413 edges, 90555 markings/sec, 480 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 768 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: 47 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: 1069769 markings, 2153897 edges
lola: ========================================
lola: subprocess 9 will run for 1024 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: 47 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 10 will run for 1536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)) U (((p3 <= 0) OR (p5 <= 0)) U ((1 <= p6) U (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p3) AND (1 <= p5))) OR (1 <= p2)) U (((p3 <= 0) OR (p5 <= 0)) U ((1 <= p6) U (1 <= p2))))
lola: processed formula length: 102
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 2629125 markings, 6192521 edges, 525825 markings/sec, 0 secs
lola: 4939223 markings, 11755287 edges, 462020 markings/sec, 5 secs
lola: 7141612 markings, 17063415 edges, 440478 markings/sec, 10 secs
lola: 9256958 markings, 22193560 edges, 423069 markings/sec, 15 secs
lola: 11477441 markings, 27920451 edges, 444097 markings/sec, 20 secs
lola: 14041908 markings, 34272545 edges, 512893 markings/sec, 25 secs
lola: 16722861 markings, 40897409 edges, 536191 markings/sec, 30 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 18569052 markings, 45434652 edges
lola: ========================================
lola: subprocess 11 will run for 3035 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p3) AND (1 <= p5))) AND ((((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5))) OR (((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p3) AND (1 <= p5))) AND ((((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5))) OR (((1 <= p0) AND (1 <= p1)) U ((1 <= p3) AND (1 <= p5)))))))
lola: processed formula length: 160
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 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: 424 markings, 436 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G ((X (G ((F (G ((1 <= p2))) AND G ((X (((1 <= p0) AND (1 <= p1))) OR G ((1 <= p2))))))) OR 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 ((X (G ((F (G ((1 <= p2))) AND G ((X (((1 <= p0) AND (1 <= p1))) OR G ((1 <= p2))))))) OR F (((1 <= p0) AND (1 <= p1)))))
lola: processed formula length: 123
lola: 47 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2661387 markings, 9397512 edges, 532277 markings/sec, 0 secs
lola: 4959128 markings, 18084665 edges, 459548 markings/sec, 5 secs
lola: 7160074 markings, 26497566 edges, 440189 markings/sec, 10 secs
lola: 9368437 markings, 34858551 edges, 441673 markings/sec, 15 secs
lola: 11395258 markings, 42768570 edges, 405364 markings/sec, 20 secs
lola: 13361065 markings, 50447287 edges, 393161 markings/sec, 25 secs
lola: 15424362 markings, 58439713 edges, 412659 markings/sec, 30 secs
lola: 17276998 markings, 65829780 edges, 370527 markings/sec, 35 secs
lola: 19190500 markings, 73375213 edges, 382700 markings/sec, 40 secs
lola: 21038008 markings, 80806400 edges, 369502 markings/sec, 45 secs
lola: 22930209 markings, 88346504 edges, 378440 markings/sec, 50 secs
lola: 24740880 markings, 95601052 edges, 362134 markings/sec, 55 secs
lola: 26586019 markings, 102987157 edges, 369028 markings/sec, 60 secs
lola: 28407766 markings, 110310361 edges, 364349 markings/sec, 65 secs
lola: 30236023 markings, 117699156 edges, 365651 markings/sec, 70 secs
lola: 31993094 markings, 124718953 edges, 351414 markings/sec, 75 secs
lola: 33748203 markings, 131870397 edges, 351022 markings/sec, 80 secs
lola: 35556925 markings, 139169813 edges, 361744 markings/sec, 85 secs
lola: 37309176 markings, 146383586 edges, 350450 markings/sec, 90 secs
lola: 39036875 markings, 153357726 edges, 345540 markings/sec, 95 secs
lola: 40764948 markings, 160485227 edges, 345615 markings/sec, 100 secs
lola: 42431273 markings, 167305947 edges, 333265 markings/sec, 105 secs
lola: 44152916 markings, 174434228 edges, 344329 markings/sec, 110 secs
lola: 45898295 markings, 181588520 edges, 349076 markings/sec, 115 secs
lola: 47571887 markings, 188451613 edges, 334718 markings/sec, 120 secs
lola: 49274191 markings, 195533758 edges, 340461 markings/sec, 125 secs
lola: 50956029 markings, 202447933 edges, 336368 markings/sec, 130 secs
lola: 52696540 markings, 209556450 edges, 348102 markings/sec, 135 secs
lola: 54391203 markings, 216611360 edges, 338933 markings/sec, 140 secs
lola: 56003634 markings, 223283420 edges, 322486 markings/sec, 145 secs
lola: 57640457 markings, 229973364 edges, 327365 markings/sec, 150 secs
lola: 59285240 markings, 236836043 edges, 328957 markings/sec, 155 secs
lola: 60957275 markings, 243846627 edges, 334407 markings/sec, 160 secs
lola: 62645028 markings, 250829170 edges, 337551 markings/sec, 165 secs
lola: 64290627 markings, 257681209 edges, 329120 markings/sec, 170 secs
lola: 65913357 markings, 264493987 edges, 324546 markings/sec, 175 secs
lola: 67533861 markings, 271327611 edges, 324101 markings/sec, 180 secs
lola: 69197604 markings, 278261821 edges, 332749 markings/sec, 185 secs
lola: 70835842 markings, 285074948 edges, 327648 markings/sec, 190 secs
lola: 72470944 markings, 291862348 edges, 327020 markings/sec, 195 secs
lola: 74077734 markings, 298644460 edges, 321358 markings/sec, 200 secs
lola: 75713630 markings, 305417607 edges, 327179 markings/sec, 205 secs
lola: 77292953 markings, 312068643 edges, 315865 markings/sec, 210 secs
lola: 78902475 markings, 318825114 edges, 321904 markings/sec, 215 secs
lola: 80498701 markings, 325495680 edges, 319245 markings/sec, 220 secs
lola: 82105316 markings, 332321209 edges, 321323 markings/sec, 225 secs
lola: 83695023 markings, 338991487 edges, 317941 markings/sec, 230 secs
lola: 85297199 markings, 345711623 edges, 320435 markings/sec, 235 secs
lola: 86880597 markings, 352453800 edges, 316680 markings/sec, 240 secs
lola: 88414133 markings, 358919700 edges, 306707 markings/sec, 245 secs
lola: 90001262 markings, 365574705 edges, 317426 markings/sec, 250 secs
lola: 91569061 markings, 372268512 edges, 313560 markings/sec, 255 secs
lola: 93162808 markings, 378885194 edges, 318749 markings/sec, 260 secs
lola: 94702295 markings, 385387356 edges, 307897 markings/sec, 265 secs
lola: 96249048 markings, 391891542 edges, 309351 markings/sec, 270 secs
lola: 97784312 markings, 398393624 edges, 307053 markings/sec, 275 secs
lola: 99346559 markings, 404911180 edges, 312449 markings/sec, 280 secs
lola: 100894406 markings, 411415010 edges, 309569 markings/sec, 285 secs
lola: 102424837 markings, 417954187 edges, 306086 markings/sec, 290 secs
lola: 103967150 markings, 424411461 edges, 308463 markings/sec, 295 secs
lola: 105465974 markings, 430741277 edges, 299765 markings/sec, 300 secs
lola: 107017372 markings, 437359826 edges, 310280 markings/sec, 305 secs
lola: 108526958 markings, 443685670 edges, 301917 markings/sec, 310 secs
lola: 110044091 markings, 450028203 edges, 303427 markings/sec, 315 secs
lola: 111527591 markings, 456288732 edges, 296700 markings/sec, 320 secs
lola: 113015137 markings, 462551275 edges, 297509 markings/sec, 325 secs
lola: 114515891 markings, 468890913 edges, 300151 markings/sec, 330 secs
lola: 116008268 markings, 475204137 edges, 298475 markings/sec, 335 secs
lola: 117487106 markings, 481444235 edges, 295768 markings/sec, 340 secs
lola: 118861902 markings, 487247206 edges, 274959 markings/sec, 345 secs
lola: 119857047 markings, 491454786 edges, 199029 markings/sec, 350 secs
lola: 120965661 markings, 496163983 edges, 221723 markings/sec, 355 secs
lola: 121860483 markings, 499871941 edges, 178964 markings/sec, 360 secs
lola: 123092979 markings, 505102921 edges, 246499 markings/sec, 365 secs
lola: 123873869 markings, 508394074 edges, 156178 markings/sec, 370 secs
lola: 124888168 markings, 512675208 edges, 202860 markings/sec, 375 secs
lola: 126204033 markings, 518250951 edges, 263173 markings/sec, 380 secs
lola: 127092917 markings, 522031260 edges, 177777 markings/sec, 385 secs
lola: 128151965 markings, 526527586 edges, 211810 markings/sec, 390 secs
lola: 129289350 markings, 531256385 edges, 227477 markings/sec, 395 secs
lola: 130558509 markings, 536499133 edges, 253832 markings/sec, 400 secs
lola: 131722461 markings, 541441109 edges, 232790 markings/sec, 405 secs
lola: 132911704 markings, 546435032 edges, 237849 markings/sec, 410 secs
lola: 134150471 markings, 551660318 edges, 247753 markings/sec, 415 secs
lola: 135189738 markings, 556060301 edges, 207853 markings/sec, 420 secs
lola: 135848445 markings, 558826454 edges, 131741 markings/sec, 425 secs
lola: 136825691 markings, 562933752 edges, 195449 markings/sec, 430 secs
lola: 137835490 markings, 567143582 edges, 201960 markings/sec, 435 secs
lola: 139050323 markings, 572242098 edges, 242967 markings/sec, 440 secs
lola: 140293258 markings, 577529655 edges, 248587 markings/sec, 445 secs
lola: 141431759 markings, 582361024 edges, 227700 markings/sec, 450 secs
lola: 142564297 markings, 587141575 edges, 226508 markings/sec, 455 secs
lola: 143677666 markings, 591835966 edges, 222674 markings/sec, 460 secs
lola: 144780921 markings, 596456499 edges, 220651 markings/sec, 465 secs
lola: 145158636 markings, 598074586 edges, 75543 markings/sec, 470 secs
lola: 145163046 markings, 598088679 edges, 882 markings/sec, 475 secs
lola: 145163094 markings, 598088985 edges, 10 markings/sec, 480 secs
lola: 145163150 markings, 598089336 edges, 11 markings/sec, 485 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no no yes no no unknown
lola:
preliminary result: yes yes no no yes no no no yes no no unknown
lola: memory consumption: 3308 KB
lola: time consumption: 1033 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-nC00200vN"
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-nC00200vN, 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-162132127900150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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