Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478000802.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-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 itslola
Input is ShieldRVs-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478000802
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.2K May 14 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 19:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.1K May 13 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 09:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 13 09:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 49K May 12 20:42 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 ShieldRVs-PT-004B-00
FORMULA_NAME ShieldRVs-PT-004B-01
FORMULA_NAME ShieldRVs-PT-004B-02
FORMULA_NAME ShieldRVs-PT-004B-03
FORMULA_NAME ShieldRVs-PT-004B-04
FORMULA_NAME ShieldRVs-PT-004B-05
FORMULA_NAME ShieldRVs-PT-004B-06
FORMULA_NAME ShieldRVs-PT-004B-07
FORMULA_NAME ShieldRVs-PT-004B-08
FORMULA_NAME ShieldRVs-PT-004B-09
FORMULA_NAME ShieldRVs-PT-004B-10
FORMULA_NAME ShieldRVs-PT-004B-11
FORMULA_NAME ShieldRVs-PT-004B-12
FORMULA_NAME ShieldRVs-PT-004B-13
FORMULA_NAME ShieldRVs-PT-004B-14
FORMULA_NAME ShieldRVs-PT-004B-15

=== Now, execution of the tool begins

BK_START 1591326951809

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 03:15:53] [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]
[2020-06-05 03:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 03:15:54] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2020-06-05 03:15:54] [INFO ] Transformed 163 places.
[2020-06-05 03:15:54] [INFO ] Transformed 183 transitions.
[2020-06-05 03:15:54] [INFO ] Found NUPN structural information;
[2020-06-05 03:15:54] [INFO ] Parsed PT model containing 163 places and 183 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 520 resets, run finished after 146 ms. (steps per millisecond=684 ) properties seen :[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, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 183 rows 163 cols
[2020-06-05 03:15:54] [INFO ] Computed 17 place invariants in 7 ms
[2020-06-05 03:15:54] [INFO ] [Real]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-06-05 03:15:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:54] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2020-06-05 03:15:54] [INFO ] Deduced a trap composed of 21 places in 62 ms
[2020-06-05 03:15:54] [INFO ] Deduced a trap composed of 26 places in 28 ms
[2020-06-05 03:15:54] [INFO ] Deduced a trap composed of 27 places in 44 ms
[2020-06-05 03:15:54] [INFO ] Deduced a trap composed of 26 places in 28 ms
[2020-06-05 03:15:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 216 ms
[2020-06-05 03:15:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:15:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2020-06-05 03:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:54] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2020-06-05 03:15:54] [INFO ] Deduced a trap composed of 29 places in 28 ms
[2020-06-05 03:15:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-06-05 03:15:54] [INFO ] Computed and/alt/rep : 182/515/182 causal constraints in 16 ms.
[2020-06-05 03:15:55] [INFO ] Added : 173 causal constraints over 36 iterations in 493 ms. Result :sat
[2020-06-05 03:15:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 03:15:55] [INFO ] Flatten gal took : 105 ms
FORMULA ShieldRVs-PT-004B-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-004B-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 03:15:55] [INFO ] Applying decomposition
[2020-06-05 03:15:55] [INFO ] Flatten gal took : 20 ms
[2020-06-05 03:15:55] [INFO ] Decomposing Gal with order
[2020-06-05 03:15:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 03:15:55] [INFO ] Removed a total of 81 redundant transitions.
[2020-06-05 03:15:55] [INFO ] Flatten gal took : 66 ms
[2020-06-05 03:15:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 14 ms.
[2020-06-05 03:15:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2020-06-05 03:15:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ShieldRVs-PT-004B @ 3570 seconds

FORMULA ShieldRVs-PT-004B-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-004B-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2037
rslt: Output for LTLFireability @ ShieldRVs-PT-004B

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"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 (((p129 <= 0)))))",
"processed_size": 25,
"rewrites": 56
},
"result":
{
"edges": 291,
"markings": 291,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "X ((F (((1 <= p91) AND (1 <= p132) AND (1 <= p159))) AND (X (X (((1 <= p20)))) R ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))))",
"processed_size": 129,
"rewrites": 56
},
"result":
{
"edges": 121328806,
"markings": 27744565,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 340
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((G ((((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66)) AND ((1 <= p56) AND (1 <= p62) AND (1 <= p70)))) OR (G (F (((1 <= p146)))) AND F (G ((((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66)) AND ((1 <= p56) AND (1 <= p62) AND (1 <= p70))))))))",
"processed_size": 322,
"rewrites": 56
},
"result":
{
"edges": 291,
"markings": 291,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 5,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 1,
"aneg": 5,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (G ((X ((F (G (((p24 <= 0) OR (p37 <= 0)))) AND ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))) AND (F (G (((1 <= p24) AND (1 <= p37)))) OR X (G ((F (G (((p24 <= 0) OR (p37 <= 0)))) AND ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))))))))",
"processed_size": 242,
"rewrites": 56
},
"result":
{
"edges": 3774,
"markings": 1326,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 431
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "G (((X (((1 <= p5))) OR (G (((1 <= p5))) AND X (F (((1 <= p5)))))) AND (((p52 <= 0) OR (p96 <= 0) OR (p120 <= 0)) AND ((p18 <= 0) OR (p23 <= 0) OR (p32 <= 0)))))",
"processed_size": 165,
"rewrites": 56
},
"result":
{
"edges": 291,
"markings": 291,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 503
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 503
},
"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": "((p2 <= 0))",
"processed_size": 11,
"rewrites": 58
},
"result":
{
"edges": 35,
"markings": 35,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 604
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(((p13 <= 0) OR (p57 <= 0) OR (p81 <= 0)) U (X (((1 <= p152))) U ((1 <= p132))))",
"processed_size": 82,
"rewrites": 56
},
"result":
{
"edges": 49994330,
"markings": 7387270,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 7,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 739
},
"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": "((p39 <= 0))",
"processed_size": 12,
"rewrites": 58
},
"result":
{
"edges": 255,
"markings": 256,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 985
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((1 <= p39))",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1478
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p39))) AND G (((p88 <= 0)))))",
"processed_size": 43,
"rewrites": 56
},
"result":
{
"edges": 291,
"markings": 291,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 985
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F ((F (((1 <= p53))) OR (G (((1 <= p138))) AND (((1 <= p32)) AND (((1 <= p43)) AND ((1 <= p66)))))))",
"processed_size": 100,
"rewrites": 56
},
"result":
{
"edges": 257,
"markings": 257,
"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": "LTL",
"workflow": "product automaton"
}
},

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2957
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p39)))",
"processed_size": 16,
"rewrites": 56
},
"result":
{
"edges": 192,
"markings": 192,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (((1 <= p39)))",
"processed_size": 16,
"rewrites": 56
},
"result":
{
"edges": 192,
"markings": 192,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p28 <= 0) OR (p143 <= 0))",
"processed_size": 28,
"rewrites": 58
},
"result":
{
"edges": 228,
"markings": 228,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3788,
"runtime": 1533.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(G(*))) : X((F(**) AND (X(X(**)) R *))) : X((G((** AND **)) OR (G(F(**)) AND F(G((** AND **)))))) : X(X(G((G(**) OR F(*))))) : X(G((X((F(G(*)) AND *)) AND (F(G(*)) OR X(G((F(G(*)) AND *))))))) : F((F(**) OR (G(**) AND (** AND (** AND **))))) : (F(**) OR G(**)) : G(((X(**) OR (G(**) AND X(F(**)))) AND (** AND **))) : (F(**) AND X(((* R *) AND **))) : (((F(**) OR **) U X(**)) AND (** U (X(**) U **))) : (** OR ((G(F(**)) AND F(**)) OR G((X(**) AND G(*))))) : (F(**) OR **)"
},
"net":
{
"arcs": 576,
"conflict_clusters": 115,
"places": 163,
"places_significant": 146,
"singleton_clusters": 0,
"transitions": 183
},
"result":
{
"preliminary_value": "no no no unknown no no no no no no no yes ",
"value": "no no no unknown no no no 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: 346/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5216
lola: finding significant places
lola: 163 places, 183 transitions, 146 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: (p129 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: LP says that atomic proposition is always true: (p91 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p146 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p82 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 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: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p37 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p138 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p43 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p5 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p96 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p29 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p42 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p13 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: X (G (NOT(X (((1 <= p129)))))) : X (((((1 <= p153)) U F (((1 <= p91) AND (1 <= p132) AND (1 <= p159)))) AND NOT((NOT(X (X (((1 <= p20))))) U ((1 <= p107) AND (1 <= p118) AND (1 <= p144)))))) : X ((G (F (((1 <= p146)))) U (G (((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66))) AND G (((1 <= p56) AND (1 <= p62) AND (1 <= p70)))))) : G (X (X (G ((G (((p106 <= 0) OR ((1 <= p133)))) OR F (NOT(G (((1 <= p106)))))))))) : G (NOT(X ((G (F (((p24 <= 0) OR (p37 <= 0)))) U X ((G (F (((1 <= p24) AND (1 <= p37)))) OR ((1 <= p107) AND (1 <= p118) AND (1 <= p144)))))))) : F ((((1 <= p55)) U (F (((1 <= p53))) OR (((G (((1 <= p138))) AND ((1 <= p32))) AND ((1 <= p43))) AND ((1 <= p66)))))) : (F (((1 <= p28) AND (1 <= p143))) OR G (((1 <= p39)))) : G ((((G (((1 <= p5))) U X (((1 <= p5)))) AND ((p52 <= 0) OR (p96 <= 0) OR (p120 <= 0))) AND ((p18 <= 0) OR (p23 <= 0) OR (p32 <= 0)))) : (F (((1 <= p2))) AND X ((NOT((((1 <= p29) AND (1 <= p40) AND (1 <= p66)) U ((1 <= p108)))) AND ((1 <= p2))))) : (((F (((1 <= p13) AND (1 <= p57) AND (1 <= p81))) OR ((1 <= p42))) U X (((1 <= p152)))) AND (((p13 <= 0) OR (p57 <= 0) OR (p81 <= 0)) U (X (((1 <= p152))) U ((1 <= p132))))) : ((G (F (((1 <= p39)))) U ((1 <= p39))) OR G ((X (((1 <= p39))) AND NOT(F (((1 <= p88))))))) : (F ((((1 <= p81)) OR ((1 <= p28)))) OR ((1 <= p28)))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:332
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((p129 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((p129 <= 0)))))
lola: processed formula length: 25
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 291 markings, 291 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p91) AND (1 <= p132) AND (1 <= p159))) AND (X (X (((1 <= p20)))) R ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p91) AND (1 <= p132) AND (1 <= p159))) AND (X (X (((1 <= p20)))) R ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))))
lola: processed formula length: 129
lola: 56 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: 878590 markings, 3582544 edges, 175718 markings/sec, 0 secs
lola: 1812884 markings, 7572363 edges, 186859 markings/sec, 5 secs
lola: 2688637 markings, 11476420 edges, 175151 markings/sec, 10 secs
lola: 3603537 markings, 15405366 edges, 182980 markings/sec, 15 secs
lola: 4532519 markings, 19318422 edges, 185796 markings/sec, 20 secs
lola: 5449706 markings, 23191927 edges, 183437 markings/sec, 25 secs
lola: 6325010 markings, 27086719 edges, 175061 markings/sec, 30 secs
lola: 7164078 markings, 30824895 edges, 167814 markings/sec, 35 secs
lola: 8038248 markings, 34683134 edges, 174834 markings/sec, 40 secs
lola: 8919236 markings, 38531300 edges, 176198 markings/sec, 45 secs
lola: 9741336 markings, 42052540 edges, 164420 markings/sec, 50 secs
lola: 10531074 markings, 45540895 edges, 157948 markings/sec, 55 secs
lola: 11381030 markings, 49158358 edges, 169991 markings/sec, 60 secs
lola: 12217099 markings, 52805014 edges, 167214 markings/sec, 65 secs
lola: 13026247 markings, 56402805 edges, 161830 markings/sec, 70 secs
lola: 13836400 markings, 60107265 edges, 162031 markings/sec, 75 secs
lola: 14605199 markings, 63757591 edges, 153760 markings/sec, 80 secs
lola: 15329007 markings, 67128350 edges, 144762 markings/sec, 85 secs
lola: 16042630 markings, 70588850 edges, 142725 markings/sec, 90 secs
lola: 16888645 markings, 74293459 edges, 169203 markings/sec, 95 secs
lola: 17713214 markings, 77981296 edges, 164914 markings/sec, 100 secs
lola: 18481992 markings, 81580672 edges, 153756 markings/sec, 105 secs
lola: 19251966 markings, 85135875 edges, 153995 markings/sec, 110 secs
lola: 19989389 markings, 88503627 edges, 147485 markings/sec, 115 secs
lola: 20936576 markings, 92063786 edges, 189437 markings/sec, 120 secs
lola: 21878875 markings, 95737235 edges, 188460 markings/sec, 125 secs
lola: 22760217 markings, 99434379 edges, 176268 markings/sec, 130 secs
lola: 23658922 markings, 103214289 edges, 179741 markings/sec, 135 secs
lola: 24514643 markings, 106862510 edges, 171144 markings/sec, 140 secs
lola: 25367100 markings, 110559280 edges, 170491 markings/sec, 145 secs
lola: 26130417 markings, 114166283 edges, 152663 markings/sec, 150 secs
lola: 26994012 markings, 117911434 edges, 172719 markings/sec, 155 secs
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: 27744565 markings, 121328806 edges
lola: ========================================
lola: subprocess 2 will run for 340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66)) AND ((1 <= p56) AND (1 <= p62) AND (1 <= p70)))) OR (G (F (((1 <= p146)))) AND F (G ((((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66)) AND ((1 <= p56) AND (1 <= p62) AND (1 <= p70))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66)) AND ((1 <= p56) AND (1 <= p62) AND (1 <= p70)))) OR (G (F (((1 <= p146)))) AND F (G ((((1 <= p13) AND (1 <= p54) AND (1 <= p82) AND (1 <= p32) AND (1 <= p40) AND (1 <= p66)) AND ((1 <= p56) AND (1 <= p62) AND (1 <= p70))))))))
lola: processed formula length: 322
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 291 markings, 291 edges
lola: ========================================
lola: subprocess 3 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((G (((p106 <= 0) OR ((1 <= p133)))) OR F (((p106 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G (((p106 <= 0) OR ((1 <= p133)))) OR F (((p106 <= 0)))))))
lola: processed formula length: 70
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1177719 markings, 3671969 edges, 235544 markings/sec, 0 secs
lola: 2202194 markings, 7462336 edges, 204895 markings/sec, 5 secs
lola: 3191742 markings, 11217705 edges, 197910 markings/sec, 10 secs
lola: 4146007 markings, 14793687 edges, 190853 markings/sec, 15 secs
lola: 5123097 markings, 18332429 edges, 195418 markings/sec, 20 secs
lola: 6139339 markings, 21953633 edges, 203248 markings/sec, 25 secs
lola: 7102663 markings, 25477645 edges, 192665 markings/sec, 30 secs
lola: 7988288 markings, 28969639 edges, 177125 markings/sec, 35 secs
lola: 8860462 markings, 32381213 edges, 174435 markings/sec, 40 secs
lola: 9756979 markings, 35801111 edges, 179303 markings/sec, 45 secs
lola: 10636971 markings, 38919378 edges, 175998 markings/sec, 50 secs
lola: 11387079 markings, 41798765 edges, 150022 markings/sec, 55 secs
lola: 12192316 markings, 44908654 edges, 161047 markings/sec, 60 secs
lola: 13032560 markings, 48041530 edges, 168049 markings/sec, 65 secs
lola: 13897474 markings, 51269128 edges, 172983 markings/sec, 70 secs
lola: 14795266 markings, 54599710 edges, 179558 markings/sec, 75 secs
lola: 15648758 markings, 57898584 edges, 170698 markings/sec, 80 secs
lola: 16607783 markings, 61470782 edges, 191805 markings/sec, 85 secs
lola: 17584687 markings, 65116785 edges, 195381 markings/sec, 90 secs
lola: 18427936 markings, 68239785 edges, 168650 markings/sec, 95 secs
lola: 19249927 markings, 71278064 edges, 164398 markings/sec, 100 secs
lola: 20242329 markings, 74633241 edges, 198480 markings/sec, 105 secs
lola: 21234225 markings, 78307859 edges, 198379 markings/sec, 110 secs
lola: 22195386 markings, 82050666 edges, 192232 markings/sec, 115 secs
lola: 23153954 markings, 85777903 edges, 191714 markings/sec, 120 secs
lola: 24105506 markings, 89478771 edges, 190310 markings/sec, 125 secs
lola: 25081147 markings, 93177829 edges, 195128 markings/sec, 130 secs
lola: 25990503 markings, 96661380 edges, 181871 markings/sec, 135 secs
lola: 26941273 markings, 100185360 edges, 190154 markings/sec, 140 secs
lola: 27872833 markings, 103666752 edges, 186312 markings/sec, 145 secs
lola: 28794874 markings, 107132938 edges, 184408 markings/sec, 150 secs
lola: 29710772 markings, 110665585 edges, 183180 markings/sec, 155 secs
lola: 30623406 markings, 114051083 edges, 182527 markings/sec, 160 secs
lola: 31537544 markings, 117492542 edges, 182828 markings/sec, 165 secs
lola: 32378338 markings, 120970345 edges, 168159 markings/sec, 170 secs
lola: 33256852 markings, 124474415 edges, 175703 markings/sec, 175 secs
lola: 34111735 markings, 127893783 edges, 170977 markings/sec, 180 secs
lola: 34953505 markings, 131201688 edges, 168354 markings/sec, 185 secs
lola: 35813020 markings, 134640562 edges, 171903 markings/sec, 190 secs
lola: 36671914 markings, 137928220 edges, 171779 markings/sec, 195 secs
lola: 37520201 markings, 141147658 edges, 169657 markings/sec, 200 secs
lola: 38471637 markings, 144574747 edges, 190287 markings/sec, 205 secs
lola: 39339246 markings, 148010913 edges, 173522 markings/sec, 210 secs
lola: 40195506 markings, 151419292 edges, 171252 markings/sec, 215 secs
lola: 41058225 markings, 154773634 edges, 172544 markings/sec, 220 secs
lola: 41930210 markings, 158105675 edges, 174397 markings/sec, 225 secs
lola: 42813475 markings, 161504144 edges, 176653 markings/sec, 230 secs
lola: 43684934 markings, 164853965 edges, 174292 markings/sec, 235 secs
lola: 44586198 markings, 168305154 edges, 180253 markings/sec, 240 secs
lola: 45483755 markings, 171660656 edges, 179511 markings/sec, 245 secs
lola: 46320608 markings, 174983072 edges, 167371 markings/sec, 250 secs
lola: 47171911 markings, 178292676 edges, 170261 markings/sec, 255 secs
lola: 48011155 markings, 181577025 edges, 167849 markings/sec, 260 secs
lola: 48831597 markings, 184904239 edges, 164088 markings/sec, 265 secs
lola: 49837532 markings, 188512917 edges, 201187 markings/sec, 270 secs
lola: 50756138 markings, 192203940 edges, 183721 markings/sec, 275 secs
lola: 51601334 markings, 195874952 edges, 169039 markings/sec, 280 secs
lola: 52438513 markings, 199512646 edges, 167436 markings/sec, 285 secs
lola: 53264175 markings, 202952236 edges, 165132 markings/sec, 290 secs
lola: 54100880 markings, 206398874 edges, 167341 markings/sec, 295 secs
lola: 54948081 markings, 209933564 edges, 169440 markings/sec, 300 secs
lola: 55810614 markings, 213380736 edges, 172507 markings/sec, 305 secs
lola: 56573716 markings, 216774465 edges, 152620 markings/sec, 310 secs
lola: 57341791 markings, 220161812 edges, 153615 markings/sec, 315 secs
lola: 58103515 markings, 223463613 edges, 152345 markings/sec, 320 secs
lola: 58866824 markings, 226730583 edges, 152662 markings/sec, 325 secs
lola: 59666605 markings, 229956311 edges, 159956 markings/sec, 330 secs
lola: 60436556 markings, 233294691 edges, 153990 markings/sec, 335 secs
lola: 61187481 markings, 236577892 edges, 150185 markings/sec, 340 secs
lola: 61978074 markings, 239918475 edges, 158119 markings/sec, 345 secs
lola: 62784524 markings, 243331431 edges, 161290 markings/sec, 350 secs
lola: 63582630 markings, 246640778 edges, 159621 markings/sec, 355 secs
lola: 64318327 markings, 249885528 edges, 147139 markings/sec, 360 secs
lola: 65061608 markings, 253155205 edges, 148656 markings/sec, 365 secs
lola: 65910939 markings, 256718939 edges, 169866 markings/sec, 370 secs
lola: local time limit reached - aborting
lola:
preliminary result: no no no unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 9395076 KB
lola: time consumption: 547 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X ((F (G (((p24 <= 0) OR (p37 <= 0)))) AND ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))) AND (F (G (((1 <= p24) AND (1 <= p37)))) OR X (G ((F (G (((p24 <= 0) OR (p37 <= 0)))) AND ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X ((F (G (((p24 <= 0) OR (p37 <= 0)))) AND ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))) AND (F (G (((1 <= p24) AND (1 <= p37)))) OR X (G ((F (G (((p24 <= 0) OR (p37 <= 0)))) AND ((p107 <= 0) OR (p118 <= 0) OR (p144 <= 0)))))))))
lola: processed formula length: 242
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 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: add low 113
lola: add low 143
lola: add low 128
lola: add low 18
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: 1326 markings, 3774 edges
lola: ========================================
lola: subprocess 5 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((X (((1 <= p5))) OR (G (((1 <= p5))) AND X (F (((1 <= p5)))))) AND (((p52 <= 0) OR (p96 <= 0) OR (p120 <= 0)) AND ((p18 <= 0) OR (p23 <= 0) OR (p32 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((X (((1 <= p5))) OR (G (((1 <= p5))) AND X (F (((1 <= p5)))))) AND (((p52 <= 0) OR (p96 <= 0) OR (p120 <= 0)) AND ((p18 <= 0) OR (p23 <= 0) OR (p32 <= 0)))))
lola: processed formula length: 165
lola: 56 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: 291 markings, 291 edges
lola: ========================================
lola: subprocess 6 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p2))) AND X (((((p29 <= 0) OR (p40 <= 0) OR (p66 <= 0)) R ((p108 <= 0))) AND ((1 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p2 <= 0))
lola: processed formula length: 11
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 35 markings, 35 edges
lola: ========================================
lola: subprocess 7 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p29 <= 0) OR (p40 <= 0) OR (p66 <= 0)) R ((p108 <= 0))) AND ((1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p29 <= 0) OR (p40 <= 0) OR (p66 <= 0)) R ((p108 <= 0))) AND ((1 <= p2))))
lola: processed formula length: 82
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 291 markings, 291 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F (((1 <= p13) AND (1 <= p57) AND (1 <= p81))) OR ((1 <= p42))) U X (((1 <= p152)))) AND (((p13 <= 0) OR (p57 <= 0) OR (p81 <= 0)) U (X (((1 <= p152))) U ((1 <= p132)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 604 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p13 <= 0) OR (p57 <= 0) OR (p81 <= 0)) U (X (((1 <= p152))) U ((1 <= p132))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p13 <= 0) OR (p57 <= 0) OR (p81 <= 0)) U (X (((1 <= p152))) U ((1 <= p132))))
lola: processed formula length: 82
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 644868 markings, 3735193 edges, 128974 markings/sec, 0 secs
lola: 1251038 markings, 7721178 edges, 121234 markings/sec, 5 secs
lola: 1788456 markings, 11430698 edges, 107484 markings/sec, 10 secs
lola: 2325835 markings, 15153573 edges, 107476 markings/sec, 15 secs
lola: 2893511 markings, 18927916 edges, 113535 markings/sec, 20 secs
lola: 3485150 markings, 22924255 edges, 118328 markings/sec, 25 secs
lola: 3991574 markings, 26867166 edges, 101285 markings/sec, 30 secs
lola: 4545508 markings, 30772797 edges, 110787 markings/sec, 35 secs
lola: 5142164 markings, 34698524 edges, 119331 markings/sec, 40 secs
lola: 5758180 markings, 38646668 edges, 123203 markings/sec, 45 secs
lola: 6336103 markings, 42541761 edges, 115585 markings/sec, 50 secs
lola: 6799356 markings, 45963666 edges, 92651 markings/sec, 55 secs
lola: 7299039 markings, 49445442 edges, 99937 markings/sec, 60 secs
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: 7387270 markings, 49994330 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p39)) OR ((G (F (((1 <= p39)))) AND F (((1 <= p39)))) OR G ((X (((1 <= p39))) AND G (((p88 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p39)))
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: ((p39 <= 0))
lola: processed formula length: 12
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 256 markings, 255 edges
lola: ========================================
lola: subprocess 9 will run for 985 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p39))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p39))
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 1478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p39))) AND G (((p88 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p39))) AND G (((p88 <= 0)))))
lola: processed formula length: 43
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 291 markings, 291 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 985 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((1 <= p53))) OR (G (((1 <= p138))) AND (((1 <= p32)) AND (((1 <= p43)) AND ((1 <= p66)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((1 <= p53))) OR (G (((1 <= p138))) AND (((1 <= p32)) AND (((1 <= p43)) AND ((1 <= p66)))))))
lola: processed formula length: 100
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 257 markings, 257 edges
lola: ========================================
lola: subprocess 10 will run for 1478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((1 <= p81)) OR ((1 <= p28)))) OR ((1 <= p28)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p28))
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 2957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((((1 <= p81)) OR ((1 <= p28))))
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: (((p81 <= 0)) AND ((p28 <= 0)))
lola: processed formula length: 31
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 759 markings, 910 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 2957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p28) AND (1 <= p143))) OR G (((1 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 2957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p39)))
lola: processed formula length: 16
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 192 markings, 192 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((G (((p106 <= 0) OR ((1 <= p133)))) OR F (((p106 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((G (((p106 <= 0) OR ((1 <= p133)))) OR F (((p106 <= 0)))))))
lola: processed formula length: 70
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1091401 markings, 3369898 edges, 218280 markings/sec, 0 secs
lola: 2131785 markings, 7177304 edges, 208077 markings/sec, 5 secs
lola: 3064931 markings, 10714991 edges, 186629 markings/sec, 10 secs
lola: 3935054 markings, 14010211 edges, 174025 markings/sec, 15 secs
lola: 4884313 markings, 17440620 edges, 189852 markings/sec, 20 secs
lola: 5798750 markings, 20808414 edges, 182887 markings/sec, 25 secs
lola: 6691110 markings, 23958651 edges, 178472 markings/sec, 30 secs
lola: 7481256 markings, 26999380 edges, 158029 markings/sec, 35 secs
lola: 8218902 markings, 29914538 edges, 147529 markings/sec, 40 secs
lola: 9010221 markings, 32963839 edges, 158264 markings/sec, 45 secs
lola: 9833712 markings, 36090632 edges, 164698 markings/sec, 50 secs
lola: 10703059 markings, 39163093 edges, 173869 markings/sec, 55 secs
lola: 11560655 markings, 42449930 edges, 171519 markings/sec, 60 secs
lola: 12357211 markings, 45521495 edges, 159311 markings/sec, 65 secs
lola: 13203967 markings, 48692117 edges, 169351 markings/sec, 70 secs
lola: 14162472 markings, 52219051 edges, 191701 markings/sec, 75 secs
lola: 15038260 markings, 55578716 edges, 175158 markings/sec, 80 secs
lola: 15818487 markings, 58572650 edges, 156045 markings/sec, 85 secs
lola: 16708005 markings, 61861193 edges, 177904 markings/sec, 90 secs
lola: 17703785 markings, 65600940 edges, 199156 markings/sec, 95 secs
lola: 18735201 markings, 69332606 edges, 206283 markings/sec, 100 secs
lola: 19748273 markings, 73020806 edges, 202614 markings/sec, 105 secs
lola: 20831458 markings, 76748538 edges, 216637 markings/sec, 110 secs
lola: 21691639 markings, 80088828 edges, 172036 markings/sec, 115 secs
lola: 22552892 markings, 83433241 edges, 172251 markings/sec, 120 secs
lola: 23514413 markings, 87146811 edges, 192304 markings/sec, 125 secs
lola: 24485186 markings, 90854687 edges, 194155 markings/sec, 130 secs
lola: 25440003 markings, 94505978 edges, 190963 markings/sec, 135 secs
lola: 26334030 markings, 97995665 edges, 178805 markings/sec, 140 secs
lola: 27305494 markings, 101518343 edges, 194293 markings/sec, 145 secs
lola: 28226672 markings, 105035074 edges, 184236 markings/sec, 150 secs
lola: 29184324 markings, 108605545 edges, 191530 markings/sec, 155 secs
lola: 30121233 markings, 112118211 edges, 187382 markings/sec, 160 secs
lola: 31024481 markings, 115556781 edges, 180650 markings/sec, 165 secs
lola: 31921680 markings, 119075389 edges, 179440 markings/sec, 170 secs
lola: 32738260 markings, 122328352 edges, 163316 markings/sec, 175 secs
lola: 33524841 markings, 125590400 edges, 157316 markings/sec, 180 secs
lola: 34337111 markings, 128795907 edges, 162454 markings/sec, 185 secs
lola: 35200593 markings, 132191505 edges, 172696 markings/sec, 190 secs
lola: 36070018 markings, 135622791 edges, 173885 markings/sec, 195 secs
lola: 36927744 markings, 138891446 edges, 171545 markings/sec, 200 secs
lola: 37784516 markings, 142111809 edges, 171354 markings/sec, 205 secs
lola: 38710117 markings, 145563368 edges, 185120 markings/sec, 210 secs
lola: 39575182 markings, 148950508 edges, 173013 markings/sec, 215 secs
lola: 40380854 markings, 152094833 edges, 161134 markings/sec, 220 secs
lola: 41155893 markings, 155157328 edges, 155008 markings/sec, 225 secs
lola: 41977846 markings, 158278895 edges, 164391 markings/sec, 230 secs
lola: 42796659 markings, 161436878 edges, 163763 markings/sec, 235 secs
lola: 43611236 markings, 164579813 edges, 162915 markings/sec, 240 secs
lola: 44435915 markings, 167715538 edges, 164936 markings/sec, 245 secs
lola: 45219971 markings, 170673576 edges, 156811 markings/sec, 250 secs
lola: 46006774 markings, 173742237 edges, 157361 markings/sec, 255 secs
lola: 46770999 markings, 176741069 edges, 152845 markings/sec, 260 secs
lola: 47510142 markings, 179649009 edges, 147829 markings/sec, 265 secs
lola: 48295116 markings, 182714247 edges, 156995 markings/sec, 270 secs
lola: 49103709 markings, 185932837 edges, 161719 markings/sec, 275 secs
lola: 50120736 markings, 189628075 edges, 203405 markings/sec, 280 secs
lola: 51020451 markings, 193330376 edges, 179943 markings/sec, 285 secs
lola: 51882772 markings, 197019469 edges, 172464 markings/sec, 290 secs
lola: 52710047 markings, 200605789 edges, 165455 markings/sec, 295 secs
lola: 53540934 markings, 204063339 edges, 166177 markings/sec, 300 secs
lola: 54380757 markings, 207551799 edges, 167965 markings/sec, 305 secs
lola: 55255367 markings, 211082676 edges, 174922 markings/sec, 310 secs
lola: 56071289 markings, 214495579 edges, 163184 markings/sec, 315 secs
lola: 56793518 markings, 217679718 edges, 144446 markings/sec, 320 secs
lola: 57486282 markings, 220785546 edges, 138553 markings/sec, 325 secs
lola: 58251701 markings, 224132972 edges, 153084 markings/sec, 330 secs
lola: 59001456 markings, 227323721 edges, 149951 markings/sec, 335 secs
lola: 59831202 markings, 230644662 edges, 165949 markings/sec, 340 secs
lola: 60600348 markings, 234010651 edges, 153829 markings/sec, 345 secs
lola: 61318387 markings, 237132407 edges, 143608 markings/sec, 350 secs
lola: 62038147 markings, 240177653 edges, 143952 markings/sec, 355 secs
lola: 62769082 markings, 243268090 edges, 146187 markings/sec, 360 secs
lola: 63505088 markings, 246298894 edges, 147201 markings/sec, 365 secs
lola: 64125456 markings, 249042979 edges, 124074 markings/sec, 370 secs
lola: 64751455 markings, 251763184 edges, 125200 markings/sec, 375 secs
lola: 65461710 markings, 254745863 edges, 142051 markings/sec, 380 secs
lola: 66222946 markings, 257940711 edges, 152247 markings/sec, 385 secs
lola: 66994459 markings, 261179727 edges, 154303 markings/sec, 390 secs
lola: 67795367 markings, 264534400 edges, 160182 markings/sec, 395 secs
lola: 68588355 markings, 267857407 edges, 158598 markings/sec, 400 secs
lola: 69470669 markings, 271272659 edges, 176463 markings/sec, 405 secs
lola: 70279187 markings, 274724137 edges, 161704 markings/sec, 410 secs
lola: 71084719 markings, 278238597 edges, 161106 markings/sec, 415 secs
lola: 71898638 markings, 281789020 edges, 162784 markings/sec, 420 secs
lola: 72711652 markings, 285328635 edges, 162603 markings/sec, 425 secs
lola: 73528903 markings, 288869944 edges, 163450 markings/sec, 430 secs
lola: 74331894 markings, 292347412 edges, 160598 markings/sec, 435 secs
lola: 75047316 markings, 295516796 edges, 143084 markings/sec, 440 secs
lola: 75800833 markings, 298675467 edges, 150703 markings/sec, 445 secs
lola: 76552881 markings, 301810448 edges, 150410 markings/sec, 450 secs
lola: 77311211 markings, 305126559 edges, 151666 markings/sec, 455 secs
lola: 78096076 markings, 308393896 edges, 156973 markings/sec, 460 secs
lola: 78869443 markings, 311713102 edges, 154673 markings/sec, 465 secs
lola: 79585744 markings, 314787148 edges, 143260 markings/sec, 470 secs
lola: 80312147 markings, 317892215 edges, 145281 markings/sec, 475 secs
lola: 81022880 markings, 321119729 edges, 142147 markings/sec, 480 secs
lola: 81753654 markings, 324361101 edges, 146155 markings/sec, 485 secs
lola: 82462494 markings, 327648418 edges, 141768 markings/sec, 490 secs
lola: 83163177 markings, 330772668 edges, 140137 markings/sec, 495 secs
lola: 83856148 markings, 333831091 edges, 138594 markings/sec, 500 secs
lola: 84567830 markings, 337009793 edges, 142336 markings/sec, 505 secs
lola: 85196073 markings, 339795002 edges, 125649 markings/sec, 510 secs
lola: 85812253 markings, 342459051 edges, 123236 markings/sec, 515 secs
lola: 86454964 markings, 345237489 edges, 128542 markings/sec, 520 secs
lola: 87211391 markings, 348298518 edges, 151285 markings/sec, 525 secs
lola: 87937189 markings, 351468216 edges, 145160 markings/sec, 530 secs
lola: 88628951 markings, 354582414 edges, 138352 markings/sec, 535 secs
lola: 89330268 markings, 357671587 edges, 140263 markings/sec, 540 secs
lola: 90005541 markings, 360677284 edges, 135055 markings/sec, 545 secs
lola: 90624689 markings, 363346236 edges, 123830 markings/sec, 550 secs
lola: 91243938 markings, 366023051 edges, 123850 markings/sec, 555 secs
lola: 91861032 markings, 368715280 edges, 123419 markings/sec, 560 secs
lola: 92472992 markings, 371395206 edges, 122392 markings/sec, 565 secs
lola: 93137583 markings, 374215721 edges, 132918 markings/sec, 570 secs
lola: 93777050 markings, 377022284 edges, 127893 markings/sec, 575 secs
lola: 94431074 markings, 379764153 edges, 130805 markings/sec, 580 secs
lola: 95028799 markings, 382431376 edges, 119545 markings/sec, 585 secs
lola: 95630854 markings, 385118602 edges, 120411 markings/sec, 590 secs
lola: 96217794 markings, 387682158 edges, 117388 markings/sec, 595 secs
lola: 96805913 markings, 390242586 edges, 117624 markings/sec, 600 secs
lola: 97367682 markings, 392790587 edges, 112354 markings/sec, 605 secs
lola: 97938213 markings, 395398846 edges, 114106 markings/sec, 610 secs
lola: 98804456 markings, 398481902 edges, 173249 markings/sec, 615 secs
lola: 99610730 markings, 401704540 edges, 161255 markings/sec, 620 secs
lola: 100386373 markings, 405095843 edges, 155129 markings/sec, 625 secs
lola: 101229674 markings, 408680080 edges, 168660 markings/sec, 630 secs
lola: 102027305 markings, 412051303 edges, 159526 markings/sec, 635 secs
lola: 102829185 markings, 415337553 edges, 160376 markings/sec, 640 secs
lola: 103582770 markings, 418471948 edges, 150717 markings/sec, 645 secs
lola: 104344353 markings, 421522034 edges, 152317 markings/sec, 650 secs
lola: 105058546 markings, 424537035 edges, 142839 markings/sec, 655 secs
lola: 105780874 markings, 427717506 edges, 144466 markings/sec, 660 secs
lola: 106474405 markings, 430829868 edges, 138706 markings/sec, 665 secs
lola: 107128877 markings, 433669721 edges, 130894 markings/sec, 670 secs
lola: 107765442 markings, 436405497 edges, 127313 markings/sec, 675 secs
lola: 108422677 markings, 439080897 edges, 131447 markings/sec, 680 secs
lola: 109110181 markings, 441939209 edges, 137501 markings/sec, 685 secs
lola: 109742310 markings, 444763631 edges, 126426 markings/sec, 690 secs
lola: 110423924 markings, 447665116 edges, 136323 markings/sec, 695 secs
lola: 111125550 markings, 450638551 edges, 140325 markings/sec, 700 secs
lola: 111864850 markings, 453767263 edges, 147860 markings/sec, 705 secs
lola: 112547911 markings, 456575302 edges, 136612 markings/sec, 710 secs
lola: 113157024 markings, 459268873 edges, 121823 markings/sec, 715 secs
lola: 113782794 markings, 462008837 edges, 125154 markings/sec, 720 secs
lola: 114491715 markings, 464964025 edges, 141784 markings/sec, 725 secs
lola: 115293776 markings, 468325421 edges, 160412 markings/sec, 730 secs
lola: 116100708 markings, 471703594 edges, 161386 markings/sec, 735 secs
lola: 116915596 markings, 475113525 edges, 162978 markings/sec, 740 secs
lola: 117718004 markings, 478473417 edges, 160482 markings/sec, 745 secs
lola: 118608407 markings, 481927803 edges, 178081 markings/sec, 750 secs
lola: 119391279 markings, 485328589 edges, 156574 markings/sec, 755 secs
lola: 120023916 markings, 488061354 edges, 126527 markings/sec, 760 secs
lola: 120728460 markings, 491125290 edges, 140909 markings/sec, 765 secs
lola: 121399069 markings, 494111140 edges, 134122 markings/sec, 770 secs
lola: 122097491 markings, 497183582 edges, 139684 markings/sec, 775 secs
lola: 122868381 markings, 500440547 edges, 154178 markings/sec, 780 secs
lola: 123573409 markings, 503467216 edges, 141006 markings/sec, 785 secs
lola: 124230362 markings, 506393588 edges, 131391 markings/sec, 790 secs
lola: 124939622 markings, 509334395 edges, 141852 markings/sec, 795 secs
lola: 125613460 markings, 512171541 edges, 134768 markings/sec, 800 secs
lola: 126296695 markings, 515156945 edges, 136647 markings/sec, 805 secs
lola: 126975625 markings, 517966055 edges, 135786 markings/sec, 810 secs
lola: 127691116 markings, 521133327 edges, 143098 markings/sec, 815 secs
lola: 128408663 markings, 524125236 edges, 143509 markings/sec, 820 secs
lola: 129113551 markings, 527120259 edges, 140978 markings/sec, 825 secs
lola: 129812253 markings, 530232813 edges, 139740 markings/sec, 830 secs
lola: 130498285 markings, 533344182 edges, 137206 markings/sec, 835 secs
lola: 131193251 markings, 536498156 edges, 138993 markings/sec, 840 secs
lola: 131855392 markings, 539562993 edges, 132428 markings/sec, 845 secs
lola: 132441608 markings, 542081610 edges, 117243 markings/sec, 850 secs
lola: 133067021 markings, 544873441 edges, 125083 markings/sec, 855 secs
lola: 133693209 markings, 547689177 edges, 125238 markings/sec, 860 secs
lola: 134303681 markings, 550337006 edges, 122094 markings/sec, 865 secs
lola: 134922261 markings, 553018933 edges, 123716 markings/sec, 870 secs
lola: 135478102 markings, 555429683 edges, 111168 markings/sec, 875 secs
lola: 136140991 markings, 558094032 edges, 132578 markings/sec, 880 secs
lola: 136669697 markings, 560421397 edges, 105741 markings/sec, 885 secs
lola: 137316227 markings, 563267773 edges, 129306 markings/sec, 890 secs
lola: 137971747 markings, 566170412 edges, 131104 markings/sec, 895 secs
lola: 138653263 markings, 569223980 edges, 136303 markings/sec, 900 secs
lola: 139326938 markings, 572164557 edges, 134735 markings/sec, 905 secs
lola: 139955781 markings, 574861482 edges, 125769 markings/sec, 910 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p28) AND (1 <= p143))) OR G (((1 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: G (((1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p39)))
lola: processed formula length: 16
lola: 56 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 192 markings, 192 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (((1 <= p28) AND (1 <= p143)))
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: ((p28 <= 0) OR (p143 <= 0))
lola: processed formula length: 28
lola: 58 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 228 markings, 228 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no unknown no no no no no no no yes
lola:
preliminary result: no no no unknown no no no no no no no yes
lola: ========================================
lola: memory consumption: 3788 KB
lola: time consumption: 1533 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="ShieldRVs-PT-004B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is ShieldRVs-PT-004B, 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 r211-tajo-159033478000802"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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