fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r056-oct2-162038334600150
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for CloudDeployment-PT-4a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4330.000 3600000.00 345276.00 489.60 FFFFTFFFFFFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334600150.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CloudDeployment-PT-4a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334600150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 03:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 156K 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 CloudDeployment-PT-4a-00
FORMULA_NAME CloudDeployment-PT-4a-01
FORMULA_NAME CloudDeployment-PT-4a-02
FORMULA_NAME CloudDeployment-PT-4a-03
FORMULA_NAME CloudDeployment-PT-4a-04
FORMULA_NAME CloudDeployment-PT-4a-05
FORMULA_NAME CloudDeployment-PT-4a-06
FORMULA_NAME CloudDeployment-PT-4a-07
FORMULA_NAME CloudDeployment-PT-4a-08
FORMULA_NAME CloudDeployment-PT-4a-09
FORMULA_NAME CloudDeployment-PT-4a-10
FORMULA_NAME CloudDeployment-PT-4a-11
FORMULA_NAME CloudDeployment-PT-4a-12
FORMULA_NAME CloudDeployment-PT-4a-13
FORMULA_NAME CloudDeployment-PT-4a-14
FORMULA_NAME CloudDeployment-PT-4a-15

=== Now, execution of the tool begins

BK_START 1620900046298

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 10:00:47] [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-13 10:00:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 10:00:48] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2021-05-13 10:00:48] [INFO ] Transformed 141 places.
[2021-05-13 10:00:48] [INFO ] Transformed 475 transitions.
[2021-05-13 10:00:48] [INFO ] Found NUPN structural information;
[2021-05-13 10:00:48] [INFO ] Parsed PT model containing 141 places and 475 transitions in 100 ms.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1659 resets, run finished after 298 ms. (steps per millisecond=335 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1]
[2021-05-13 10:00:48] [INFO ] Flow matrix only has 226 transitions (discarded 197 similar events)
// Phase 1: matrix 226 rows 141 cols
[2021-05-13 10:00:48] [INFO ] Computed 24 place invariants in 7 ms
[2021-05-13 10:00:48] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2021-05-13 10:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:48] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2021-05-13 10:00:48] [INFO ] State equation strengthened by 90 read => feed constraints.
[2021-05-13 10:00:48] [INFO ] [Real]Added 90 Read/Feed constraints in 18 ms returned sat
[2021-05-13 10:00:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:48] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 36 ms returned sat
[2021-05-13 10:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:49] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-13 10:00:49] [INFO ] [Nat]Added 90 Read/Feed constraints in 14 ms returned sat
[2021-05-13 10:00:49] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 19 ms.
[2021-05-13 10:00:49] [INFO ] Added : 142 causal constraints over 29 iterations in 572 ms. Result :sat
[2021-05-13 10:00:49] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 20 ms returned sat
[2021-05-13 10:00:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:50] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2021-05-13 10:00:50] [INFO ] [Real]Added 90 Read/Feed constraints in 9 ms returned sat
[2021-05-13 10:00:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:50] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 28 ms returned sat
[2021-05-13 10:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:50] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-13 10:00:50] [INFO ] [Nat]Added 90 Read/Feed constraints in 21 ms returned sat
[2021-05-13 10:00:50] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 44 ms.
[2021-05-13 10:00:50] [INFO ] Added : 138 causal constraints over 28 iterations in 635 ms. Result :sat
[2021-05-13 10:00:50] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2021-05-13 10:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:51] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-13 10:00:51] [INFO ] [Real]Added 90 Read/Feed constraints in 26 ms returned sat
[2021-05-13 10:00:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:51] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 29 ms returned sat
[2021-05-13 10:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:51] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-13 10:00:51] [INFO ] [Nat]Added 90 Read/Feed constraints in 17 ms returned sat
[2021-05-13 10:00:51] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 22 ms.
[2021-05-13 10:00:51] [INFO ] Added : 132 causal constraints over 27 iterations in 565 ms. Result :sat
[2021-05-13 10:00:52] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 157 ms returned sat
[2021-05-13 10:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:53] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2021-05-13 10:00:53] [INFO ] [Real]Added 90 Read/Feed constraints in 63 ms returned sat
[2021-05-13 10:00:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:53] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 115 ms returned sat
[2021-05-13 10:00:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:54] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2021-05-13 10:00:54] [INFO ] [Nat]Added 90 Read/Feed constraints in 46 ms returned sat
[2021-05-13 10:00:54] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 106 ms.
[2021-05-13 10:00:55] [INFO ] Added : 132 causal constraints over 27 iterations in 1178 ms. Result :sat
[2021-05-13 10:00:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-13 10:00:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:55] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-13 10:00:55] [INFO ] [Real]Added 90 Read/Feed constraints in 18 ms returned sat
[2021-05-13 10:00:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:55] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 28 ms returned sat
[2021-05-13 10:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:55] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-13 10:00:55] [INFO ] [Nat]Added 90 Read/Feed constraints in 19 ms returned sat
[2021-05-13 10:00:55] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 16 ms.
[2021-05-13 10:00:56] [INFO ] Added : 169 causal constraints over 34 iterations in 963 ms. Result :sat
[2021-05-13 10:00:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-13 10:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:56] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2021-05-13 10:00:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 35 ms returned sat
[2021-05-13 10:00:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:56] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-13 10:00:56] [INFO ] [Real]Added 90 Read/Feed constraints in 27 ms returned sat
[2021-05-13 10:00:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:57] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 70 ms returned sat
[2021-05-13 10:00:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:57] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2021-05-13 10:00:57] [INFO ] [Nat]Added 90 Read/Feed constraints in 31 ms returned sat
[2021-05-13 10:00:57] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 20 ms.
[2021-05-13 10:00:57] [INFO ] Added : 132 causal constraints over 27 iterations in 682 ms. Result :sat
[2021-05-13 10:00:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-13 10:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:58] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-13 10:00:58] [INFO ] [Real]Added 90 Read/Feed constraints in 12 ms returned sat
[2021-05-13 10:00:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 42 ms returned sat
[2021-05-13 10:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:58] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-13 10:00:58] [INFO ] [Nat]Added 90 Read/Feed constraints in 30 ms returned sat
[2021-05-13 10:00:58] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 23 ms.
[2021-05-13 10:00:58] [INFO ] Added : 143 causal constraints over 29 iterations in 531 ms. Result :sat
[2021-05-13 10:00:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2021-05-13 10:00:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:59] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-13 10:00:59] [INFO ] [Real]Added 90 Read/Feed constraints in 13 ms returned sat
[2021-05-13 10:00:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 10:00:59] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 63 ms returned sat
[2021-05-13 10:00:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 10:00:59] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2021-05-13 10:00:59] [INFO ] [Nat]Added 90 Read/Feed constraints in 32 ms returned sat
[2021-05-13 10:00:59] [INFO ] Computed and/alt/rep : 422/2436/225 causal constraints in 24 ms.
[2021-05-13 10:00:59] [INFO ] Added : 133 causal constraints over 27 iterations in 516 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 10:01:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-13 10:01:00] [INFO ] Flatten gal took : 60 ms
FORMULA CloudDeployment-PT-4a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 10:01:00] [INFO ] Applying decomposition
[2021-05-13 10:01:00] [INFO ] Flatten gal took : 24 ms
[2021-05-13 10:01:00] [INFO ] Decomposing Gal with order
[2021-05-13 10:01:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 10:01:00] [INFO ] Removed a total of 951 redundant transitions.
[2021-05-13 10:01:00] [INFO ] Flatten gal took : 62 ms
[2021-05-13 10:01:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 10 ms.
[2021-05-13 10:01:00] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2021-05-13 10:01:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudDeployment-PT-4a @ 3570 seconds

FORMULA CloudDeployment-PT-4a-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudDeployment-PT-4a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3256
rslt: Output for LTLFireability @ CloudDeployment-PT-4a

{
"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": "Thu May 13 10:01:00 2021
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F (((1 <= p81))))",
"processed_size": 20,
"rewrites": 57
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 2,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 20,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 20,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "(X (G (((((1 <= p86) AND (1 <= p88) AND (1 <= p103) AND (1 <= p130) AND (1 <= p139)) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p130) AND (1 <= p139)))) OR F (((1 <= p30) AND (1 <= p32) AND (1 <= p54) AND (1 <= p130) AND (1 <= p139)))))) U G (((p2 <= 0) OR (p4 <= 0) OR (p19 <= 0) OR (p130 <= 0) OR (p139 <= 0))))",
"processed_size": 329,
"rewrites": 57
},
"result":
{
"edges": 173547165,
"markings": 5571240,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 342
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 2,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((G (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p130 <= 0) OR (p139 <= 0))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p106) AND (1 <= p130) AND (1 <= p139))))",
"processed_size": 161,
"rewrites": 57
},
"result":
{
"edges": 189271987,
"markings": 6055017,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 363
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 0,
"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": "(((1 <= p30) AND (1 <= p32) AND (1 <= p56) AND (1 <= p125)) U X (X (G (((1 <= p77))))))",
"processed_size": 87,
"rewrites": 57
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 409
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 3,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "G ((X (((1 <= p86) AND (1 <= p88) AND (1 <= p90) AND (1 <= p130) AND (1 <= p139))) R (((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p133 <= 0)) R X (((p86 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))",
"processed_size": 228,
"rewrites": 57
},
"result":
{
"edges": 2991,
"markings": 528,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 467
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 545
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 5,
"U": 0,
"X": 2,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "X ((F (G (((1 <= p104)))) AND G ((((((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139)) OR (G (((1 <= p60) AND (1 <= p86))) AND F (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139))))) AND X (G (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p130) AND (1 <= p139))))) OR G (((1 <= p104)))))))",
"processed_size": 340,
"rewrites": 57
},
"result":
{
"edges": 23126704,
"markings": 784691,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 651
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 6,
"adisj": 0,
"aneg": 3,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "((X (((((p30 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p130 <= 0) OR (p139 <= 0)) R ((p30 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p130 <= 0) OR (p139 <= 0))) R ((p30 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139) AND (1 <= p69))) U (((1 <= p69)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139))))",
"processed_size": 427,
"rewrites": 57
},
"result":
{
"edges": 12,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 814
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 1,
"aconj": 10,
"adisj": 0,
"aneg": 0,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 6,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (G (((F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139)))) OR (G (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139))) AND F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139)))))) AND (((1 <= p86)) AND (((1 <= p88)) AND (((1 <= p101)) AND (((1 <= p130)) AND ((1 <= p139)))))))))",
"processed_size": 523,
"rewrites": 57
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 1086
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((G (((((1 <= p4) AND (1 <= p86)) OR (G (((1 <= p47))) AND F (((1 <= p4) AND (1 <= p86))))) AND ((1 <= p98)))) AND (((1 <= p47)) AND ((1 <= p98)))))",
"processed_size": 150,
"rewrites": 57
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1629
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1629
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p60) AND (1 <= p86))))",
"processed_size": 35,
"rewrites": 57
},
"result":
{
"edges": 2400661,
"markings": 154796,
"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": "fairness",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3256
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p130) AND (1 <= p139))",
"processed_size": 74,
"rewrites": 57
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": "G (F (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))))",
"processed_size": 83,
"rewrites": 57
},
"result":
{
"edges": 8,
"markings": 8,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 92824,
"runtime": 314.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((** U X(F(**)))) AND G(*)) : (** OR (G(F(*)) AND F(G(**)))) : (G((X(**) OR (G(**) AND X(F(**))))) AND X(F(**))) : (X(G(((** U G(**)) OR F(**)))) U G(**)) : X((G(*) OR *)) : (** U X(X(G(**)))) : G((X(*) R (* R X(*)))) : (F((X(F(**)) OR **)) AND F(**)) : X((F(G(**)) AND G((((** OR (G(**) AND F(**))) AND X(G(**))) OR G(**))))) : ((X(((* R *) R *)) OR **) U (** U **)) : X(G(((F((G(**) OR **)) OR (G(**) AND F((G(**) OR **)))) AND (** AND (** AND (** AND (** AND **))))))) : (G(F(**)) OR F((G(**) OR (** OR **)))) : X((G(((** OR (G(**) AND F(**))) AND **)) AND (** AND **)))"
},
"net":
{
"arcs": 2481,
"conflict_clusters": 36,
"places": 141,
"places_significant": 117,
"singleton_clusters": 0,
"transitions": 423
},
"result":
{
"preliminary_value": "no no no no no no no no no no no yes no ",
"value": "no no no no no no no no no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 564/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 141
lola: finding significant places
lola: 141 places, 423 transitions, 117 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: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p100 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p19 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p90 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p101 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p4 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p98 <= 1)
lola: ((X (((1 <= p30) AND (1 <= p32) AND (1 <= p41) AND (1 <= p130) AND (1 <= p139))) U X (F (X (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p130) AND (1 <= p139)))))) AND NOT(F (((1 <= p83))))) : (((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p130) AND (1 <= p139)) OR (F (G (X (NOT(X (G (((p86 <= 0) OR (p88 <= 0) OR (p101 <= 0) OR (p130 <= 0) OR (p139 <= 0)))))))) AND F (G (((1 <= p2) AND (1 <= p32)))))) : (G ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p139))) U X (((p86 <= 0) OR (p88 <= 0) OR (p100 <= 0) OR (p130 <= 0) OR (p139 <= 0))))) AND F (X (((1 <= p81))))) : (G ((X ((((1 <= p86) AND (1 <= p88) AND (1 <= p103) AND (1 <= p130) AND (1 <= p139)) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p130) AND (1 <= p139))))) OR F (X (F (((1 <= p30) AND (1 <= p32) AND (1 <= p54) AND (1 <= p130) AND (1 <= p139))))))) U G (((p2 <= 0) OR (p4 <= 0) OR (p19 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) : NOT(X ((F (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139))) AND ((p86 <= 0) OR (p88 <= 0) OR (p106 <= 0) OR (p130 <= 0) OR (p139 <= 0))))) : (((1 <= p30) AND (1 <= p32) AND (1 <= p56) AND (1 <= p125)) U X (X (G (((1 <= p77)))))) : G (NOT((X (((p86 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p130 <= 0) OR (p139 <= 0))) U (((1 <= p30) AND (1 <= p32) AND (1 <= p56) AND (1 <= p133)) U X (((1 <= p86) AND (1 <= p88) AND (1 <= p90) AND (1 <= p130) AND (1 <= p139))))))) : (F ((X (F (((1 <= p104) AND ((p4 <= 0) OR (p60 <= 0))))) OR ((1 <= p104)))) AND F (((1 <= p88) AND (1 <= p93)))) : G (X ((((G (((1 <= p60) AND (1 <= p86))) U ((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139))) AND X (G (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p130) AND (1 <= p139))))) U G (((1 <= p104)))))) : ((X (NOT(((((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p34) AND (1 <= p130) AND (1 <= p139))) U ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139))))) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139) AND (1 <= p69))) U (((1 <= p69)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139)))) : X (G (((((((G (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139))) U (((1 <= p32)) U F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139)))))) AND ((1 <= p86))) AND ((1 <= p88))) AND ((1 <= p101))) AND ((1 <= p130))) AND ((1 <= p139))))) : (G (F (((1 <= p60) AND (1 <= p86)))) OR F (((G (((1 <= p4) AND (1 <= p86))) OR ((1 <= p60) AND (1 <= p86))) OR ((1 <= p32))))) : X ((((G ((G (((1 <= p47))) U ((1 <= p4) AND (1 <= p86)))) AND G (((1 <= p98)))) AND ((1 <= p47))) AND ((1 <= p98))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:251
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((((1 <= p30) AND (1 <= p32) AND (1 <= p41) AND (1 <= p130) AND (1 <= p139)) U X (F (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p130) AND (1 <= p139)))))) AND G (((p83 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p83 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p83 <= 0)))
lola: processed formula length: 16
lola: 57 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: 12 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((X (((p86 <= 0) OR (p88 <= 0) OR (p100 <= 0) OR (p130 <= 0) OR (p139 <= 0))) OR (G (((1 <= p86) AND (1 <= p88) AND (1 <= p100) AND (1 <= p130) AND (1 <= p139))) AND X (F (((p86 <= 0) OR (p88 <= 0) OR (p100 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))) AND X (F (((1 <= p81)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((1 <= p81))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((1 <= p81))))
lola: processed formula length: 20
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G (((((1 <= p86) AND (1 <= p88) AND (1 <= p103) AND (1 <= p130) AND (1 <= p139)) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p130) AND (1 <= p139)))) OR F (((1 <= p30) AND (1 <= p32) AND (1 <= p54) AND (1 <= p130) AND (1 <= p139)))))) U G (((p2 <= 0) OR (p4 <= 0) OR (p19 <= 0) OR (p130 <= 0) OR (p139 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (G (((((1 <= p86) AND (1 <= p88) AND (1 <= p103) AND (1 <= p130) AND (1 <= p139)) U G (((1 <= p2) AND (1 <= p4) AND (1 <= p19) AND (1 <= p130) AND (1 <= p139)))) OR F (((1 <= p30) AND (1 <= p32) AND (1 <= p54) AND (1 <= p130) AND (1 <= p139)))))) U G (((p2 <= 0) OR (p4 <= 0) OR (p19 <= 0) OR (p130 <= 0) OR (p139 <= 0))))
lola: processed formula length: 329
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 227512 markings, 6590331 edges, 45502 markings/sec, 0 secs
lola: 447990 markings, 13111564 edges, 44096 markings/sec, 5 secs
lola: 666870 markings, 19641822 edges, 43776 markings/sec, 10 secs
lola: 876600 markings, 26056507 edges, 41946 markings/sec, 15 secs
lola: 1078416 markings, 32459727 edges, 40363 markings/sec, 20 secs
lola: 1284218 markings, 38977948 edges, 41160 markings/sec, 25 secs
lola: 1492890 markings, 45564411 edges, 41734 markings/sec, 30 secs
lola: 1696114 markings, 51935766 edges, 40645 markings/sec, 35 secs
lola: 1894403 markings, 58219501 edges, 39658 markings/sec, 40 secs
lola: 2102871 markings, 64716415 edges, 41694 markings/sec, 45 secs
lola: 2308904 markings, 71257386 edges, 41207 markings/sec, 50 secs
lola: 2520408 markings, 77788086 edges, 42301 markings/sec, 55 secs
lola: 2721426 markings, 84090172 edges, 40204 markings/sec, 60 secs
lola: 2920576 markings, 90372960 edges, 39830 markings/sec, 65 secs
lola: 3115941 markings, 96549313 edges, 39073 markings/sec, 70 secs
lola: 3311936 markings, 102653842 edges, 39199 markings/sec, 75 secs
lola: 3502867 markings, 108594109 edges, 38186 markings/sec, 80 secs
lola: 3686448 markings, 114307126 edges, 36716 markings/sec, 85 secs
lola: 3872001 markings, 120086003 edges, 37111 markings/sec, 90 secs
lola: 4045884 markings, 125661108 edges, 34777 markings/sec, 95 secs
lola: 4236266 markings, 131552900 edges, 38076 markings/sec, 100 secs
lola: 4419612 markings, 137255139 edges, 36669 markings/sec, 105 secs
lola: 4628087 markings, 143574299 edges, 41695 markings/sec, 110 secs
lola: 4825924 markings, 149872034 edges, 39567 markings/sec, 115 secs
lola: 5019381 markings, 156096219 edges, 38691 markings/sec, 120 secs
lola: 5215086 markings, 162381652 edges, 39141 markings/sec, 125 secs
lola: 5401152 markings, 168295594 edges, 37213 markings/sec, 130 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: 5571240 markings, 173547165 edges
lola: ========================================
lola: subprocess 3 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p130 <= 0) OR (p139 <= 0))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p106) AND (1 <= p130) AND (1 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((p2 <= 0) OR (p4 <= 0) OR (p22 <= 0) OR (p130 <= 0) OR (p139 <= 0))) OR ((1 <= p86) AND (1 <= p88) AND (1 <= p106) AND (1 <= p130) AND (1 <= p139))))
lola: processed formula length: 161
lola: 57 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: 227744 markings, 6597469 edges, 45549 markings/sec, 0 secs
lola: 452240 markings, 13236646 edges, 44899 markings/sec, 5 secs
lola: 674331 markings, 19872337 edges, 44418 markings/sec, 10 secs
lola: 881923 markings, 26250718 edges, 41518 markings/sec, 15 secs
lola: 1084117 markings, 32587390 edges, 40439 markings/sec, 20 secs
lola: 1286042 markings, 39037376 edges, 40385 markings/sec, 25 secs
lola: 1493444 markings, 45582996 edges, 41480 markings/sec, 30 secs
lola: 1693702 markings, 51821931 edges, 40052 markings/sec, 35 secs
lola: 1887812 markings, 58008854 edges, 38822 markings/sec, 40 secs
lola: 2094391 markings, 64449300 edges, 41316 markings/sec, 45 secs
lola: 2300410 markings, 70982059 edges, 41204 markings/sec, 50 secs
lola: 2511930 markings, 77529565 edges, 42304 markings/sec, 55 secs
lola: 2712114 markings, 83793743 edges, 40037 markings/sec, 60 secs
lola: 2910496 markings, 90058699 edges, 39676 markings/sec, 65 secs
lola: 3108726 markings, 96315172 edges, 39646 markings/sec, 70 secs
lola: 3307711 markings, 102523472 edges, 39797 markings/sec, 75 secs
lola: 3504273 markings, 108638627 edges, 39312 markings/sec, 80 secs
lola: 3696996 markings, 114640472 edges, 38545 markings/sec, 85 secs
lola: 3889906 markings, 120634169 edges, 38582 markings/sec, 90 secs
lola: 4075563 markings, 126566822 edges, 37131 markings/sec, 95 secs
lola: 4265399 markings, 132471920 edges, 37967 markings/sec, 100 secs
lola: 4460054 markings, 138517118 edges, 38931 markings/sec, 105 secs
lola: 4673049 markings, 144960454 edges, 42599 markings/sec, 110 secs
lola: 4870832 markings, 151305836 edges, 39557 markings/sec, 115 secs
lola: 5062929 markings, 157565020 edges, 38419 markings/sec, 120 secs
lola: 5256436 markings, 163759300 edges, 38701 markings/sec, 125 secs
lola: 5441031 markings, 169639113 edges, 36919 markings/sec, 130 secs
lola: 5625250 markings, 175487906 edges, 36844 markings/sec, 135 secs
lola: 5821242 markings, 181797841 edges, 39198 markings/sec, 140 secs
lola: 6004799 markings, 187679698 edges, 36711 markings/sec, 145 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: 6055017 markings, 189271987 edges
lola: ========================================
lola: subprocess 4 will run for 363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p30) AND (1 <= p32) AND (1 <= p56) AND (1 <= p125)) U X (X (G (((1 <= p77))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p30) AND (1 <= p32) AND (1 <= p56) AND (1 <= p125)) U X (X (G (((1 <= p77))))))
lola: processed formula length: 87
lola: 57 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 5 will run for 409 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p86) AND (1 <= p88) AND (1 <= p90) AND (1 <= p130) AND (1 <= p139))) R (((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p133 <= 0)) R X (((p86 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p86) AND (1 <= p88) AND (1 <= p90) AND (1 <= p130) AND (1 <= p139))) R (((p30 <= 0) OR (p32 <= 0) OR (p56 <= 0) OR (p133 <= 0)) R X (((p86 <= 0) OR (p88 <= 0) OR (p90 <= 0) OR (p130 <= 0) OR (p139 <= 0))))))
lola: processed formula length: 228
lola: 57 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: 528 markings, 2991 edges
lola: ========================================
lola: subprocess 6 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (F (((1 <= p104) AND ((p4 <= 0) OR (p60 <= 0))))) OR ((1 <= p104)))) AND F (((1 <= p88) AND (1 <= p93))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p88) AND (1 <= p93)))
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: ((p88 <= 0) OR (p93 <= 0))
lola: processed formula length: 27
lola: 59 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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 545 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G (((1 <= p104)))) AND G ((((((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139)) OR (G (((1 <= p60) AND (1 <= p86))) AND F (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139))))) AND X (G (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p130) AND (1 <= p139))))) OR G (((1 <= p104)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G (((1 <= p104)))) AND G ((((((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139)) OR (G (((1 <= p60) AND (1 <= p86))) AND F (((1 <= p2) AND (1 <= p4) AND (1 <= p22) AND (1 <= p130) AND (1 <= p139))))) AND X (G (((1 <= p30) AND (1 <= p32) AND (1 <= p47) AND (1 <= p130) AND (1 <= p139))))) OR G (((1 <= p104)))))))
lola: processed formula length: 340
lola: 57 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: 228786 markings, 6627859 edges, 45757 markings/sec, 0 secs
lola: 454390 markings, 13299810 edges, 45121 markings/sec, 5 secs
lola: 678125 markings, 19987696 edges, 44747 markings/sec, 10 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: 784691 markings, 23126704 edges
lola: ========================================
lola: subprocess 8 will run for 651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (((((p30 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p130 <= 0) OR (p139 <= 0)) R ((p30 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p130 <= 0) OR (p139 <= 0))) R ((p30 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139) AND (1 <= p69))) U (((1 <= p69)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X (((((p30 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p130 <= 0) OR (p139 <= 0)) R ((p30 <= 0) OR (p32 <= 0) OR (p34 <= 0) OR (p130 <= 0) OR (p139 <= 0))) R ((p30 <= 0) OR (p32 <= 0) OR (p39 <= 0) OR (p130 <= 0) OR (p139 <= 0)))) OR ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 <= p130) AND (1 <= p139) AND (1 <= p69))) U (((1 <= p69)) U ((1 <= p30) AND (1 <= p32) AND (1 <= p39) AND (1 ... (shortened)
lola: processed formula length: 427
lola: 57 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: 11 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 814 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139)))) OR (G (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139))) AND F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139)))) OR (G (((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p130) AND (1 <= p139))) AND F ((G (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))) OR ((1 <= p58) AND (1 <= p60) AND (1 <= p72) AND (1 <= p1... (shortened)
lola: processed formula length: 523
lola: 57 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((((1 <= p4) AND (1 <= p86)) OR (G (((1 <= p47))) AND F (((1 <= p4) AND (1 <= p86))))) AND ((1 <= p98)))) AND (((1 <= p47)) AND ((1 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((((1 <= p4) AND (1 <= p86)) OR (G (((1 <= p47))) AND F (((1 <= p4) AND (1 <= p86))))) AND ((1 <= p98)))) AND (((1 <= p47)) AND ((1 <= p98)))))
lola: processed formula length: 150
lola: 57 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 1629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F (((1 <= p60) AND (1 <= p86)))) OR F ((G (((1 <= p4) AND (1 <= p86))) OR (((1 <= p60) AND (1 <= p86)) OR ((1 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1629 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p60) AND (1 <= p86))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p60) AND (1 <= p86))))
lola: processed formula length: 35
lola: 57 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: 154796 markings, 2400661 edges
lola: ========================================
lola: subprocess 12 will run for 3256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G (((1 <= p4) AND (1 <= p86))) OR (((1 <= p60) AND (1 <= p86)) OR ((1 <= p32)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G (((1 <= p4) AND (1 <= p86))) OR (((1 <= p60) AND (1 <= p86)) OR ((1 <= p32)))))
lola: processed formula length: 85
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 3256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p130) AND (1 <= p139)) OR (G (F (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139)))) AND F (G (((1 <= p2) AND (1 <= p32))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 3256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p130) AND (1 <= p139))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p30) AND (1 <= p32) AND (1 <= p45) AND (1 <= p130) AND (1 <= p139))
lola: processed formula length: 74
lola: 57 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 5 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: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p86) AND (1 <= p88) AND (1 <= p101) AND (1 <= p130) AND (1 <= p139))))
lola: processed formula length: 83
lola: 57 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: 8 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no yes no
lola:
preliminary result: no no no no no no no no no no no yes no
lola: memory consumption: 92824 KB
lola: time consumption: 314 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="CloudDeployment-PT-4a"
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 CloudDeployment-PT-4a, 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 r056-oct2-162038334600150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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