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.r011-tall-162038006100218.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 AutoFlight-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 155K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 36K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620433912140

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 00:31:54] [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-08 00:31:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 00:31:54] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-08 00:31:54] [INFO ] Transformed 132 places.
[2021-05-08 00:31:54] [INFO ] Transformed 130 transitions.
[2021-05-08 00:31:54] [INFO ] Found NUPN structural information;
[2021-05-08 00:31:54] [INFO ] Parsed PT model containing 132 places and 130 transitions in 84 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 3060 resets, run finished after 309 ms. (steps per millisecond=323 ) properties seen :[1, 1, 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, 1, 1, 1, 1]
// Phase 1: matrix 105 rows 132 cols
[2021-05-08 00:31:54] [INFO ] Computed 34 place invariants in 7 ms
[2021-05-08 00:31:54] [INFO ] [Real]Absence check using 33 positive place invariants in 22 ms returned sat
[2021-05-08 00:31:54] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:54] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-08 00:31:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2021-05-08 00:31:54] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2021-05-08 00:31:54] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 12 ms.
[2021-05-08 00:31:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:31:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2021-05-08 00:31:54] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:55] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-08 00:31:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2021-05-08 00:31:55] [INFO ] Computed and/alt/rep : 104/311/104 causal constraints in 11 ms.
[2021-05-08 00:31:55] [INFO ] Added : 104 causal constraints over 21 iterations in 211 ms. Result :sat
[2021-05-08 00:31:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-08 00:31:55] [INFO ] Flatten gal took : 36 ms
FORMULA AutoFlight-PT-05a-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 00:31:55] [INFO ] Applying decomposition
[2021-05-08 00:31:55] [INFO ] Flatten gal took : 15 ms
[2021-05-08 00:31:55] [INFO ] Decomposing Gal with order
[2021-05-08 00:31:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 00:31:55] [INFO ] Removed a total of 27 redundant transitions.
[2021-05-08 00:31:55] [INFO ] Flatten gal took : 40 ms
[2021-05-08 00:31:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 5 ms.
[2021-05-08 00:31:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2021-05-08 00:31:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ AutoFlight-PT-05a @ 3570 seconds

FORMULA AutoFlight-PT-05a-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLFireability @ AutoFlight-PT-05a

{
"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": "Sat May 8 00:31:56 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((X (((p19 <= 0))) OR ((((p27 <= 0)) R ((p38 <= 0) OR (p104 <= 0) OR ((1 <= p27)))) OR ((p10 <= 0))))))",
"processed_size": 110,
"rewrites": 74
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "LTL model checker",
"value": true
},
"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": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (X ((G (((p29 <= 0) OR (p76 <= 0))) OR F (((p7 <= 0) OR (p67 <= 0))))))",
"processed_size": 75,
"rewrites": 74
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p61))) OR (G (((1 <= p47) AND (1 <= p122))) OR (G (((1 <= p61))) OR ((1 <= p16))))))",
"processed_size": 98,
"rewrites": 74
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 3,
"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": 6,
"visible_transitions": 0
},
"processed": "X (((G (((p105 <= 0) OR (p130 <= 0))) AND ((p39 <= 0) OR (p109 <= 0))) OR G (((1 <= p105) AND ((p105 <= 0) OR (p130 <= 0) OR (p28 <= 0) OR (p55 <= 0)) AND (1 <= p130)))))",
"processed_size": 175,
"rewrites": 74
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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 (F (((p44 <= 0) OR (p116 <= 0))))",
"processed_size": 36,
"rewrites": 74
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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 (G ((F (G (((1 <= p19)))) AND (((1 <= p41)) AND ((1 <= p110))))))",
"processed_size": 67,
"rewrites": 74
},
"result":
{
"edges": 23,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((X (X (X (F (((p22 <= 0) OR (p75 <= 0)))))) OR ((1 <= p17))))",
"processed_size": 65,
"rewrites": 74
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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": 445
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (F ((X (((p28 <= 0) OR (p70 <= 0))) OR ((1 <= p47) AND (1 <= p122))))) AND G (((1 <= p14) AND (1 <= p90)))))",
"processed_size": 115,
"rewrites": 74
},
"result":
{
"edges": 21,
"markings": 21,
"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": 509
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G (((p37 <= 0)))))",
"processed_size": 24,
"rewrites": 74
},
"result":
{
"edges": 21,
"markings": 21,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 9,
"adisj": 2,
"aneg": 4,
"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": 5,
"visible_transitions": 0
},
"processed": "G ((F ((((p85 <= 0)) R (((p84 <= 0)) AND ((p85 <= 0))))) AND (X (((1 <= p7) AND (1 <= p52))) OR ((((1 <= p17)) U ((1 <= p84))) OR X ((((p85 <= 0)) R (((p84 <= 0)) AND ((p85 <= 0)))))))))",
"processed_size": 186,
"rewrites": 74
},
"result":
{
"edges": 16040,
"markings": 3863,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((X (((p34 <= 0) OR (p126 <= 0))) OR G (F (((p13 <= 0) OR (p108 <= 0)))))))",
"processed_size": 82,
"rewrites": 74
},
"result":
{
"edges": 23,
"markings": 24,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "((p40 <= 0))",
"processed_size": 12,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 1,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((G (F (((1 <= p7) AND (1 <= p67)))) AND ((1 <= p87))) OR ((((1 <= p40)) U G (((1 <= p87)))) AND ((1 <= p40))))))",
"processed_size": 119,
"rewrites": 74
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 16
},
"compoundnumber": 12,
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p7) AND (1 <= p67))) AND (((1 <= p14)) AND ((1 <= p80))))))",
"processed_size": 76,
"rewrites": 74
},
"result":
{
"edges": 22,
"markings": 22,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 40804,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(F((X(*) OR ((* R *) OR *)))) : X(X((G(*) OR F(*)))) : G((X(**) OR (G(**) OR (G(**) OR **)))) : X(((G(*) AND *) OR G(*))) : (F(G(**)) OR **) : X(F(**)) : F(**) : G(F(((G(F(**)) AND **) OR ((** U G(**)) AND **)))) : X(G((F(G(*)) AND (** AND **)))) : X((X(X(X(F(*)))) OR **)) : G(F((G(**) AND (** AND **)))) : X((X(F((X(*) OR **))) AND G(**))) : X(X(G(*))) : G((F((* R *)) AND (X(**) OR ((** U **) OR X((* R *)))))) : X(F((X(**) OR G(F(*)))))"
},
"net":
{
"arcs": 370,
"conflict_clusters": 68,
"places": 132,
"places_significant": 98,
"singleton_clusters": 0,
"transitions": 105
},
"result":
{
"interim_value": "yes yes no no unknown yes yes no no yes no no no no yes ",
"preliminary_value": "yes yes no no unknown yes yes no no yes no no no no yes "
},
"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: 237/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 132
lola: finding significant places
lola: 132 places, 105 transitions, 98 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: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: LP says that atomic proposition is always true: (p16 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p105 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p128 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p10 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p116 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p80 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p7 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p17 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p85 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p126 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: NOT(X (G (((X (((1 <= p19))) AND (((1 <= p27)) U ((1 <= p38) AND (1 <= p104) AND ((p27 <= 0))))) AND ((1 <= p10)))))) : X (NOT(X ((F (((1 <= p29) AND (1 <= p76))) AND G (((1 <= p7) AND (1 <= p67))))))) : G ((((X (((1 <= p61))) OR G (((1 <= p47) AND (1 <= p122)))) OR G (((1 <= p61)))) OR ((1 <= p16)))) : NOT(X (((F (((1 <= p105) AND (1 <= p130))) OR ((1 <= p39) AND (1 <= p109))) AND F (((p105 <= 0) OR ((1 <= p105) AND (1 <= p130) AND (1 <= p28) AND (1 <= p55)) OR (p130 <= 0)))))) : (F (G (((1 <= p50) AND (1 <= p128)))) OR ((1 <= p65) AND (1 <= p10))) : F (X (((p44 <= 0) OR (p116 <= 0)))) : F (((1 <= p40))) : G (F (((G (F (((1 <= p7) AND (1 <= p67)))) AND ((1 <= p87))) OR ((((1 <= p40)) U G (((1 <= p87)))) AND ((1 <= p40)))))) : X (G (((G (NOT(G (F (((p19 <= 0)))))) AND ((1 <= p41))) AND ((1 <= p110))))) : X ((NOT(X (G (X (X (((1 <= p22) AND (1 <= p75))))))) OR ((1 <= p17)))) : X (X (X (F (G (F (((G (((1 <= p7) AND (1 <= p67))) AND ((1 <= p14))) AND ((1 <= p80))))))))) : (X (F ((X (NOT(X (((1 <= p28) AND (1 <= p70))))) OR X (((1 <= p47) AND (1 <= p122)))))) AND G (X (((1 <= p14) AND (1 <= p90))))) : X (NOT(F (X ((((1 <= p24) AND (1 <= p119)) U ((G (((1 <= p5))) U G (((1 <= p24)))) U ((1 <= p37)))))))) : G (((X (((1 <= p7) AND (1 <= p52))) OR (((1 <= p17)) U ((1 <= p84)))) U NOT(X ((((1 <= p85)) U (((1 <= p84)) OR ((1 <= p85)))))))) : F (X ((X (((p34 <= 0) OR (p126 <= 0))) OR NOT(G (F (G (((1 <= p13) AND (1 <= p108)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:338
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((p19 <= 0))) OR ((((p27 <= 0)) R ((p38 <= 0) OR (p104 <= 0) OR ((1 <= p27)))) OR ((p10 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((p19 <= 0))) OR ((((p27 <= 0)) R ((p38 <= 0) OR (p104 <= 0) OR ((1 <= p27)))) OR ((p10 <= 0))))))
lola: processed formula length: 110
lola: 74 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: 24 markings, 23 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((G (((p29 <= 0) OR (p76 <= 0))) OR F (((p7 <= 0) OR (p67 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((G (((p29 <= 0) OR (p76 <= 0))) OR F (((p7 <= 0) OR (p67 <= 0))))))
lola: processed formula length: 75
lola: 74 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: 24 markings, 23 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p61))) OR (G (((1 <= p47) AND (1 <= p122))) OR (G (((1 <= p61))) OR ((1 <= p16))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p61))) OR (G (((1 <= p47) AND (1 <= p122))) OR (G (((1 <= p61))) OR ((1 <= p16))))))
lola: processed formula length: 98
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21 markings, 21 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((G (((p105 <= 0) OR (p130 <= 0))) AND ((p39 <= 0) OR (p109 <= 0))) OR G (((1 <= p105) AND ((p105 <= 0) OR (p130 <= 0) OR (p28 <= 0) OR (p55 <= 0)) AND (1 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((G (((p105 <= 0) OR (p130 <= 0))) AND ((p39 <= 0) OR (p109 <= 0))) OR G (((1 <= p105) AND ((p105 <= 0) OR (p130 <= 0) OR (p28 <= 0) OR (p55 <= 0)) AND (1 <= p130)))))
lola: processed formula length: 175
lola: 74 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p44 <= 0) OR (p116 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p44 <= 0) OR (p116 <= 0))))
lola: processed formula length: 36
lola: 74 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 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F (G (((1 <= p19)))) AND (((1 <= p41)) AND ((1 <= p110))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F (G (((1 <= p19)))) AND (((1 <= p41)) AND ((1 <= p110))))))
lola: processed formula length: 67
lola: 74 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: 22 markings, 23 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (F (((p22 <= 0) OR (p75 <= 0)))))) OR ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (F (((p22 <= 0) OR (p75 <= 0)))))) OR ((1 <= p17))))
lola: processed formula length: 65
lola: 74 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 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((X (((p28 <= 0) OR (p70 <= 0))) OR ((1 <= p47) AND (1 <= p122))))) AND G (((1 <= p14) AND (1 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((X (((p28 <= 0) OR (p70 <= 0))) OR ((1 <= p47) AND (1 <= p122))))) AND G (((1 <= p14) AND (1 <= p90)))))
lola: processed formula length: 115
lola: 74 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p37 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p37 <= 0)))))
lola: processed formula length: 24
lola: 74 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((((p85 <= 0)) R (((p84 <= 0)) AND ((p85 <= 0))))) AND (X (((1 <= p7) AND (1 <= p52))) OR ((((1 <= p17)) U ((1 <= p84))) OR X ((((p85 <= 0)) R (((p84 <= 0)) AND ((p85 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((((p85 <= 0)) R (((p84 <= 0)) AND ((p85 <= 0))))) AND (X (((1 <= p7) AND (1 <= p52))) OR ((((1 <= p17)) U ((1 <= p84))) OR X ((((p85 <= 0)) R (((p84 <= 0)) AND ((p85 <= 0)))))))))
lola: processed formula length: 186
lola: 74 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: 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: 3863 markings, 16040 edges
lola: ========================================
lola: subprocess 10 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((X (((p34 <= 0) OR (p126 <= 0))) OR G (F (((p13 <= 0) OR (p108 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((X (((p34 <= 0) OR (p126 <= 0))) OR G (F (((p13 <= 0) OR (p108 <= 0)))))))
lola: processed formula length: 82
lola: 74 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: 24 markings, 23 edges
lola: ========================================
lola: subprocess 11 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p40)))
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: ((p40 <= 0))
lola: processed formula length: 12
lola: 76 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((G (F (((1 <= p7) AND (1 <= p67)))) AND ((1 <= p87))) OR ((((1 <= p40)) U G (((1 <= p87)))) AND ((1 <= p40))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((G (F (((1 <= p7) AND (1 <= p67)))) AND ((1 <= p87))) OR ((((1 <= p40)) U G (((1 <= p87)))) AND ((1 <= p40))))))
lola: processed formula length: 119
lola: 74 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 16 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 13 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p7) AND (1 <= p67))) AND (((1 <= p14)) AND ((1 <= p80))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p7) AND (1 <= p67))) AND (((1 <= p14)) AND ((1 <= p80))))))
lola: processed formula length: 76
lola: 74 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: 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 14 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p50) AND (1 <= p128)))) OR ((1 <= p65) AND (1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes yes no no unknown yes yes no no yes no no no no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 40804 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: yes yes no no unknown yes yes no no yes no no no no yes
lola:
preliminary result: yes yes no no unknown yes yes no no yes no no no no yes
lola: memory consumption: 40804 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 16107128 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16107128 kB

--------------------
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="AutoFlight-PT-05a"
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 AutoFlight-PT-05a, 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 r011-tall-162038006100218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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