Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800300090.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 SmartHome-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800300090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 35K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621197597222

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:39:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 20:39:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:39:58] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-16 20:39:58] [INFO ] Transformed 139 places.
[2021-05-16 20:39:58] [INFO ] Transformed 159 transitions.
[2021-05-16 20:39:58] [INFO ] Found NUPN structural information;
[2021-05-16 20:39:58] [INFO ] Parsed PT model containing 139 places and 159 transitions in 86 ms.
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 19 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1045 resets, run finished after 243 ms. (steps per millisecond=411 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 140 rows 122 cols
[2021-05-16 20:39:59] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-16 20:39:59] [INFO ] [Real]Absence check using 7 positive place invariants in 16 ms returned sat
[2021-05-16 20:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:39:59] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2021-05-16 20:39:59] [INFO ] Deduced a trap composed of 27 places in 48 ms
[2021-05-16 20:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2021-05-16 20:39:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:39:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2021-05-16 20:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:39:59] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-16 20:39:59] [INFO ] Deduced a trap composed of 27 places in 29 ms
[2021-05-16 20:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-16 20:39:59] [INFO ] Computed and/alt/rep : 139/369/139 causal constraints in 11 ms.
[2021-05-16 20:40:00] [INFO ] Added : 139 causal constraints over 28 iterations in 323 ms. Result :sat
[2021-05-16 20:40:00] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-16 20:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:40:00] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-16 20:40:00] [INFO ] Deduced a trap composed of 27 places in 18 ms
[2021-05-16 20:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2021-05-16 20:40:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:40:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-16 20:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:40:00] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-16 20:40:00] [INFO ] Deduced a trap composed of 27 places in 17 ms
[2021-05-16 20:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2021-05-16 20:40:00] [INFO ] Computed and/alt/rep : 139/369/139 causal constraints in 10 ms.
[2021-05-16 20:40:00] [INFO ] Added : 139 causal constraints over 28 iterations in 273 ms. Result :sat
[2021-05-16 20:40:00] [INFO ] Deduced a trap composed of 32 places in 24 ms
[2021-05-16 20:40:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2021-05-16 20:40:00] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-16 20:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:40:00] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-16 20:40:00] [INFO ] Deduced a trap composed of 27 places in 66 ms
[2021-05-16 20:40:00] [INFO ] Deduced a trap composed of 35 places in 30 ms
[2021-05-16 20:40:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2021-05-16 20:40:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:40:00] [INFO ] [Nat]Absence check using 7 positive place invariants in 72 ms returned sat
[2021-05-16 20:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:40:01] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-16 20:40:01] [INFO ] Deduced a trap composed of 27 places in 31 ms
[2021-05-16 20:40:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-16 20:40:01] [INFO ] Computed and/alt/rep : 139/369/139 causal constraints in 7 ms.
[2021-05-16 20:40:01] [INFO ] Added : 139 causal constraints over 28 iterations in 252 ms. Result :sat
[2021-05-16 20:40:01] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2021-05-16 20:40:01] [INFO ] Flatten gal took : 39 ms
FORMULA SmartHome-PT-04-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-04-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:40:01] [INFO ] Applying decomposition
[2021-05-16 20:40:01] [INFO ] Flatten gal took : 12 ms
[2021-05-16 20:40:01] [INFO ] Decomposing Gal with order
[2021-05-16 20:40:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:40:01] [INFO ] Removed a total of 9 redundant transitions.
[2021-05-16 20:40:01] [INFO ] Flatten gal took : 33 ms
[2021-05-16 20:40:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2021-05-16 20:40:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-16 20:40:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SmartHome-PT-04 @ 3570 seconds

FORMULA SmartHome-PT-04-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmartHome-PT-04-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-04-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ SmartHome-PT-04

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 20:40:04 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((F (G (((1 <= p33) AND (1 <= p117)))) OR G (((1 <= p33))))) OR F (((1 <= p69) AND (1 <= p112)))))",
"processed_size": 104,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 2,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"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": "((X (((1 <= p95))) U (((1 <= p69) AND (1 <= p111)) OR (G (((1 <= p54))) AND F (((1 <= p69) AND (1 <= p111)))))) U ((1 <= p95)))",
"processed_size": 127,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 446
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F ((G ((F ((X (((1 <= p5))) OR ((p50 <= 0)))) AND (F (((1 <= p19))) OR (X (((1 <= p5))) OR ((p50 <= 0)))))) OR ((1 <= p1))))",
"processed_size": 124,
"rewrites": 69
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 4,
"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": "(((p68 <= 0)) R (X (((1 <= p92))) AND (F (((p11 <= 0))) OR X (G (((1 <= p92)))))))",
"processed_size": 82,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X ((X (G (((1 <= p87)))) AND ((1 <= p36)))) AND ((1 <= p70))))",
"processed_size": 66,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((F (((p33 <= 0))) OR ((1 <= p60)))))",
"processed_size": 42,
"rewrites": 69
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((((p50 <= 0)) R X (X ((((1 <= p43)) OR ((1 <= p50)))))))",
"processed_size": 60,
"rewrites": 69
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 2,
"aneg": 3,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (((((X (F (((1 <= p78)))) AND ((1 <= p78))) U ((1 <= p78))) AND (((1 <= p69)) AND ((1 <= p120)))) R X (((p69 <= 0) OR (p120 <= 0)))))",
"processed_size": 136,
"rewrites": 69
},
"result":
{
"edges": 195374,
"markings": 55686,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((p89 <= 0))))",
"processed_size": 20,
"rewrites": 69
},
"result":
{
"edges": 74,
"markings": 64,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "G (F (((p61 <= 0))))",
"processed_size": 20,
"rewrites": 69
},
"result":
{
"edges": 77,
"markings": 66,
"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": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 30960,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G(*)) : G((X((F(G(**)) OR G(**))) OR F(**))) : ((X(**) U (** OR (G(**) AND F(**)))) U **) : F((G((F((X(**) OR **)) AND (F(**) OR (X(**) OR **)))) OR **)) : (* R (X(*) AND (F(*) OR X(G(*))))) : X((X((X(G(**)) AND **)) AND **)) : X(F((F(*) OR *))) : X((* R X(X(**)))) : F(((((X(F(**)) AND **) U **) AND (* AND *)) R X(*))) : G(F(**))"
},
"net":
{
"arcs": 323,
"conflict_clusters": 107,
"places": 122,
"places_significant": 115,
"singleton_clusters": 0,
"transitions": 140
},
"result":
{
"preliminary_value": "no no no yes no no yes no no no ",
"value": "no no no yes no no yes 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: 262/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 122
lola: finding significant places
lola: 122 places, 140 transitions, 115 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p89 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p117 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p112 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p111 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p68 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p92 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p9 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: X (((((1 <= p32)) U ((1 <= p10))) U G (F ((((1 <= p33) AND (1 <= p117)) U NOT(G (F (((1 <= p89)))))))))) : G ((X ((G (F (X (G (((1 <= p33) AND (1 <= p117)))))) OR G (((1 <= p33))))) OR F (((1 <= p69) AND (1 <= p112))))) : ((X (((1 <= p95))) U (G (((1 <= p54))) U ((1 <= p69) AND (1 <= p111)))) U ((1 <= p95))) : F ((G ((F ((((p19 <= 0)) U ((1 <= p19)))) U (X (((1 <= p5))) OR ((p50 <= 0))))) OR ((1 <= p1)))) : NOT((((1 <= p68)) U (G (((1 <= p11))) U X (((p92 <= 0)))))) : X ((X ((G (X (((1 <= p87)))) AND ((1 <= p36)))) AND ((1 <= p70)))) : F (NOT(X ((G (((1 <= p33))) AND ((p60 <= 0)))))) : X (NOT((((1 <= p50)) U X (NOT(X ((((1 <= p43)) OR ((1 <= p50))))))))) : F (NOT((((NOT(((F (X (((1 <= p78)))) AND ((1 <= p78))) U ((1 <= p78)))) OR ((p69 <= 0))) OR ((p120 <= 0))) U X (((1 <= p69) AND (1 <= p120)))))) : ((X (G (F (((1 <= p48))))) OR (X (((1 <= p9))) U ((1 <= p17)))) U F (G (F (((p61 <= 0))))))
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:419
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((F (G (((1 <= p33) AND (1 <= p117)))) OR G (((1 <= p33))))) OR F (((1 <= p69) AND (1 <= p112)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((F (G (((1 <= p33) AND (1 <= p117)))) OR G (((1 <= p33))))) OR F (((1 <= p69) AND (1 <= p112)))))
lola: processed formula length: 104
lola: 69 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 1 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((1 <= p95))) U (((1 <= p69) AND (1 <= p111)) OR (G (((1 <= p54))) AND F (((1 <= p69) AND (1 <= p111)))))) U ((1 <= p95)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((1 <= p95))) U (((1 <= p69) AND (1 <= p111)) OR (G (((1 <= p54))) AND F (((1 <= p69) AND (1 <= p111)))))) U ((1 <= p95)))
lola: processed formula length: 127
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((X (((1 <= p5))) OR ((p50 <= 0)))) AND (F (((1 <= p19))) OR (X (((1 <= p5))) OR ((p50 <= 0)))))) OR ((1 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((X (((1 <= p5))) OR ((p50 <= 0)))) AND (F (((1 <= p19))) OR (X (((1 <= p5))) OR ((p50 <= 0)))))) OR ((1 <= p1))))
lola: processed formula length: 124
lola: 69 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: 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 3 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p68 <= 0)) R (X (((1 <= p92))) AND (F (((p11 <= 0))) OR X (G (((1 <= p92)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p68 <= 0)) R (X (((1 <= p92))) AND (F (((p11 <= 0))) OR X (G (((1 <= p92)))))))
lola: processed formula length: 82
lola: 69 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X (G (((1 <= p87)))) AND ((1 <= p36)))) AND ((1 <= p70))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X (G (((1 <= p87)))) AND ((1 <= p36)))) AND ((1 <= p70))))
lola: processed formula length: 66
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (((p33 <= 0))) OR ((1 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (((p33 <= 0))) OR ((1 <= p60)))))
lola: processed formula length: 42
lola: 69 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((p50 <= 0)) R X (X ((((1 <= p43)) OR ((1 <= p50)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((p50 <= 0)) R X (X ((((1 <= p43)) OR ((1 <= p50)))))))
lola: processed formula length: 60
lola: 69 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 7 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((((X (F (((1 <= p78)))) AND ((1 <= p78))) U ((1 <= p78))) AND (((1 <= p69)) AND ((1 <= p120)))) R X (((p69 <= 0) OR (p120 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (((((X (F (((1 <= p78)))) AND ((1 <= p78))) U ((1 <= p78))) AND (((1 <= p69)) AND ((1 <= p120)))) R X (((p69 <= 0) OR (p120 <= 0)))))
lola: processed formula length: 136
lola: 69 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: 55686 markings, 195374 edges
lola: ========================================
lola: subprocess 8 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((p89 <= 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 (((p89 <= 0))))
lola: processed formula length: 20
lola: 69 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: 64 markings, 74 edges
lola: ========================================
lola: subprocess 9 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p61 <= 0))))
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 (((p61 <= 0))))
lola: processed formula length: 20
lola: 69 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: 66 markings, 77 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no no no
lola:
preliminary result: no no no yes no no yes no no no
lola: memory consumption: 30960 KB
lola: time consumption: 3 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="SmartHome-PT-04"
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 SmartHome-PT-04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800300090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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