Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r170-smll-158987815800370.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 FlexibleBarrier-PT-18a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-smll-158987815800370
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 3.2K Apr 4 19:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 4 19:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 08:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 4 08:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 3 21:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 3 21:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 3 13:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 3 13:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 265K Mar 24 05:37 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 FlexibleBarrier-PT-18a-00
FORMULA_NAME FlexibleBarrier-PT-18a-01
FORMULA_NAME FlexibleBarrier-PT-18a-02
FORMULA_NAME FlexibleBarrier-PT-18a-03
FORMULA_NAME FlexibleBarrier-PT-18a-04
FORMULA_NAME FlexibleBarrier-PT-18a-05
FORMULA_NAME FlexibleBarrier-PT-18a-06
FORMULA_NAME FlexibleBarrier-PT-18a-07
FORMULA_NAME FlexibleBarrier-PT-18a-08
FORMULA_NAME FlexibleBarrier-PT-18a-09
FORMULA_NAME FlexibleBarrier-PT-18a-10
FORMULA_NAME FlexibleBarrier-PT-18a-11
FORMULA_NAME FlexibleBarrier-PT-18a-12
FORMULA_NAME FlexibleBarrier-PT-18a-13
FORMULA_NAME FlexibleBarrier-PT-18a-14
FORMULA_NAME FlexibleBarrier-PT-18a-15

=== Now, execution of the tool begins

BK_START 1591389790660

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 20:43:13] [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 20:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 20:43:13] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2020-06-05 20:43:13] [INFO ] Transformed 219 places.
[2020-06-05 20:43:13] [INFO ] Transformed 886 transitions.
[2020-06-05 20:43:13] [INFO ] Found NUPN structural information;
[2020-06-05 20:43:13] [INFO ] Parsed PT model containing 219 places and 886 transitions in 233 ms.
Ensure Unique test removed 290 transitions
Reduce redundant transitions removed 290 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 2314 steps, including 0 resets, run visited all 40 properties in 40 ms. (steps per millisecond=57 )
[2020-06-05 20:43:13] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-06-05 20:43:13] [INFO ] Flatten gal took : 117 ms
FORMULA FlexibleBarrier-PT-18a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 20:43:13] [INFO ] Applying decomposition
[2020-06-05 20:43:13] [INFO ] Flatten gal took : 53 ms
[2020-06-05 20:43:13] [INFO ] Decomposing Gal with order
[2020-06-05 20:43:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-05 20:43:14] [INFO ] Removed a total of 956 redundant transitions.
[2020-06-05 20:43:14] [INFO ] Flatten gal took : 156 ms
[2020-06-05 20:43:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 17 ms.
[2020-06-05 20:43:14] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-05 20:43:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 13 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ FlexibleBarrier-PT-18a @ 3570 seconds

FORMULA FlexibleBarrier-PT-18a-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FlexibleBarrier-PT-18a-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false,
"memory": 74456,
"runtime": 3570.000000,
"signal": "User defined signal 1"
},
"result":
{
"preliminary_value": "yes no no no unknown no no no no no no no yes no "
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
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: 815/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 219
lola: finding significant places
lola: 219 places, 596 transitions, 199 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: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p95 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p186 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p47 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p11 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p179 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p168 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p107 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p108 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p143 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p53 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p84 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p119 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p71 <= 1)
lola: LP says that atomic proposition is always true: (p144 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p191 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p23 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p155 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p120 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p203 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: NOT((NOT(F ((F (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0))) AND NOT(X (((1 <= p119) AND (1 <= p156) AND (1 <= p217))))))) U ((1 <= p155) AND (1 <= p168) AND (1 <= p217)))) : X ((F (((1 <= p36) AND (1 <= p83) AND (1 <= p217))) AND G (((p60 <= 0) OR (p179 <= 0) OR (p217 <= 0))))) : (G (F ((X (F (((1 <= p77) AND (1 <= p218)))) U ((1 <= p95) AND (1 <= p120) AND (1 <= p217))))) U X (G (X (X (X (((1 <= p186) AND (1 <= p217)))))))) : NOT(F (NOT(F (NOT(G (((1 <= p47) AND (1 <= p192) AND (1 <= p217)))))))) : (F (G (((1 <= p72) AND (1 <= p119) AND (1 <= p217)))) OR (G (F (X (((1 <= p204) AND (1 <= p215) AND (1 <= p217))))) AND G (F (G (NOT(F (((1 <= p144) AND (1 <= p203) AND (1 <= p217))))))))) : (F (G (((1 <= p120) AND (1 <= p191) AND (1 <= p217) AND (1 <= p11) AND (1 <= p24) AND (1 <= p217)))) AND (G ((((1 <= p120) AND (1 <= p191) AND (1 <= p217)) OR ((1 <= p132) AND (1 <= p179) AND (1 <= p217)))) OR X (F (((p132 <= 0) OR (p179 <= 0) OR (p217 <= 0)))))) : X (G (X ((((((1 <= p84) AND (1 <= p143) AND (1 <= p217)) OR ((1 <= p36) AND (1 <= p107) AND (1 <= p217))) U NOT(F (X (((1 <= p35) AND (1 <= p168) AND (1 <= p217)))))) AND (((1 <= p84) AND (1 <= p143) AND (1 <= p217)) OR ((1 <= p36) AND (1 <= p107) AND (1 <= p217))))))) : X (G ((((1 <= p71) AND (1 <= p108) AND (1 <= p217)) OR ((1 <= p71) AND (1 <= p156) AND (1 <= p217)) OR ((1 <= p144) AND (1 <= p203) AND (1 <= p217))))) : NOT(F (X (F (((p144 <= 0) OR (p203 <= 0) OR (p217 <= 0)))))) : (F (X (X (((1 <= p24) AND (1 <= p143) AND (1 <= p217))))) OR ((1 <= p24) AND (1 <= p143) AND (1 <= p217))) : ((NOT(F (((1 <= p53) AND (1 <= p218)))) OR ((1 <= p84) AND (1 <= p155) AND (1 <= p217))) U F ((G (X (((1 <= p119) AND (1 <= p132) AND (1 <= p217)))) AND G (((1 <= p132) AND (1 <= p155) AND (1 <= p217)))))) : G ((X (((1 <= p71) AND (1 <= p144) AND (1 <= p217))) OR F (((1 <= p71) AND (1 <= p144) AND (1 <= p217))))) : ((G (((1 <= p24) AND (1 <= p191) AND (1 <= p217))) U ((1 <= p23) AND (1 <= p36) AND (1 <= p217))) U NOT(X (((1 <= p72) AND (1 <= p155) AND (1 <= p217))))) : X (X ((F (((((((NOT(G (((1 <= p120) AND (1 <= p131) AND (1 <= p217)))) OR ((p132 <= 0))) OR ((p203 <= 0))) OR ((p217 <= 0))) OR ((p131 <= 0))) OR ((p204 <= 0))) OR ((p217 <= 0)))) AND F (((1 <= p132) AND (1 <= p203) AND (1 <= p217))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0)) AND (F ((F (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0))) AND X (((p119 <= 0) OR (p156 <= 0) OR (p217 <= 0))))) OR G (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0)))
lola: processed formula length: 49
lola: 84 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: 41 markings, 107 edges
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0))
lola: processed formula length: 45
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0))) AND X (((p119 <= 0) OR (p156 <= 0) OR (p217 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (((p155 <= 0) OR (p168 <= 0) OR (p217 <= 0))) AND X (((p119 <= 0) OR (p156 <= 0) OR (p217 <= 0)))))
lola: processed formula length: 109
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((1 <= p36) AND (1 <= p83) AND (1 <= p217))) AND G (((p60 <= 0) OR (p179 <= 0) OR (p217 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((1 <= p36) AND (1 <= p83) AND (1 <= p217))) AND G (((p60 <= 0) OR (p179 <= 0) OR (p217 <= 0)))))
lola: processed formula length: 106
lola: 84 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: 19 markings, 110 edges
lola: ========================================
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (X (G (((1 <= p186) AND (1 <= p217))))))) OR (G (F (((1 <= p95) AND (1 <= p120) AND (1 <= p217)))) AND F (G (((1 <= p186) AND (1 <= p217))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p186) AND (1 <= p217))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p186) AND (1 <= p217))))
lola: processed formula length: 37
lola: 84 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: add low 543
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (G (((1 <= p186) AND (1 <= p217)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (G (((1 <= p186) AND (1 <= p217)))))))
lola: processed formula length: 49
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p120) AND (1 <= p191) AND (1 <= p217) AND (1 <= p11) AND (1 <= p24) AND (1 <= p217)))) AND (G ((((1 <= p120) AND (1 <= p191) AND (1 <= p217)) OR ((1 <= p132) AND (1 <= p179) AND (1 <= p217)))) OR X (F (((p132 <= 0) OR (p179 <= 0) OR (p217 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((((1 <= p120) AND (1 <= p191) AND (1 <= p217)) OR ((1 <= p132) AND (1 <= p179) AND (1 <= p217))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((((1 <= p120) AND (1 <= p191) AND (1 <= p217)) OR ((1 <= p132) AND (1 <= p179) AND (1 <= p217))))
lola: processed formula length: 101
lola: 84 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p120) AND (1 <= p191) AND (1 <= p217) AND (1 <= p11) AND (1 <= p24) AND (1 <= p217))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p120) AND (1 <= p191) AND (1 <= p217) AND (1 <= p11) AND (1 <= p24) AND (1 <= p217))))
lola: processed formula length: 99
lola: 84 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: add low 543
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((((1 <= p84) AND (1 <= p143) AND (1 <= p217)) OR ((1 <= p36) AND (1 <= p107) AND (1 <= p217))) U X (G (((p35 <= 0) OR (p168 <= 0) OR (p217 <= 0))))) AND (((1 <= p84) AND (1 <= p143) AND (1 <= p217)) OR ((1 <= p36) AND (1 <= p107) AND (1 <= p217)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((((1 <= p84) AND (1 <= p143) AND (1 <= p217)) OR ((1 <= p36) AND (1 <= p107) AND (1 <= p217))) U X (G (((p35 <= 0) OR (p168 <= 0) OR (p217 <= 0))))) AND (((1 <= p84) AND (1 <= p143) AND (1 <= p217)) OR ((1 <= p36) AND (1 <= p107) AND (1 <= p217)))))))
lola: processed formula length: 266
lola: 84 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p71) AND (1 <= p108) AND (1 <= p217)) OR ((1 <= p71) AND (1 <= p156) AND (1 <= p217)) OR ((1 <= p144) AND (1 <= p203) AND (1 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p71) AND (1 <= p108) AND (1 <= p217)) OR ((1 <= p71) AND (1 <= p156) AND (1 <= p217)) OR ((1 <= p144) AND (1 <= p203) AND (1 <= p217)))))
lola: processed formula length: 153
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((1 <= p144) AND (1 <= p203) AND (1 <= p217))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((1 <= p144) AND (1 <= p203) AND (1 <= p217))))
lola: processed formula length: 53
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F (((1 <= p24) AND (1 <= p143) AND (1 <= p217))))) OR ((1 <= p24) AND (1 <= p143) AND (1 <= p217)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p24) AND (1 <= p143) AND (1 <= p217))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p24) AND (1 <= p143) AND (1 <= p217))
lola: processed formula length: 44
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F (((1 <= p24) AND (1 <= p143) AND (1 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F (((1 <= p24) AND (1 <= p143) AND (1 <= p217)))))
lola: processed formula length: 56
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (G (((1 <= p119) AND (1 <= p132) AND (1 <= p217)))) AND G (((1 <= p132) AND (1 <= p155) AND (1 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (G (((1 <= p119) AND (1 <= p132) AND (1 <= p217)))) AND G (((1 <= p132) AND (1 <= p155) AND (1 <= p217)))))
lola: processed formula length: 113
lola: 84 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (((1 <= p71) AND (1 <= p144) AND (1 <= p217))) OR F (((1 <= p71) AND (1 <= p144) AND (1 <= p217)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (((1 <= p71) AND (1 <= p144) AND (1 <= p217))) OR F (((1 <= p71) AND (1 <= p144) AND (1 <= p217)))))
lola: processed formula length: 106
lola: 84 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p23) AND (1 <= p36) AND (1 <= p217)) OR (G (((1 <= p24) AND (1 <= p191) AND (1 <= p217))) AND F (((1 <= p23) AND (1 <= p36) AND (1 <= p217))))) U X (((p72 <= 0) OR (p155 <= 0) OR (p217 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p23) AND (1 <= p36) AND (1 <= p217)) OR (G (((1 <= p24) AND (1 <= p191) AND (1 <= p217))) AND F (((1 <= p23) AND (1 <= p36) AND (1 <= p217))))) U X (((p72 <= 0) OR (p155 <= 0) OR (p217 <= 0))))
lola: processed formula length: 204
lola: 84 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 11 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((F (((p120 <= 0) OR (p131 <= 0) OR (p217 <= 0))) OR (((p132 <= 0)) OR (((p203 <= 0)) OR (((p217 <= 0)) OR (((p131 <= 0)) OR (((p204 <= 0)) OR ((p217 <= 0))))))))) AND F (((1 <= p132) AND (1 <= p203) AND (1 <= p217))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((F (((p120 <= 0) OR (p131 <= 0) OR (p217 <= 0))) OR (((p132 <= 0)) OR (((p203 <= 0)) OR (((p217 <= 0)) OR (((p131 <= 0)) OR (((p204 <= 0)) OR ((p217 <= 0))))))))) AND F (((1 <= p132) AND (1 <= p203) AND (1 <= p217))))))
lola: processed formula length: 231
lola: 84 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p47 <= 0) OR (p192 <= 0) OR (p217 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((p47 <= 0) OR (p192 <= 0) OR (p217 <= 0))))
lola: processed formula length: 52
lola: 84 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: 206 markings, 1107 edges
lola: ========================================
lola: subprocess 13 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p72) AND (1 <= p119) AND (1 <= p217)))) OR (G (F (((1 <= p204) AND (1 <= p215) AND (1 <= p217)))) AND F (G (((p144 <= 0) OR (p203 <= 0) OR (p217 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: time limit reached - aborting
lola:
preliminary result: yes no no no unknown no no no no no no no yes no
lola:
preliminary result: yes no no no unknown no no no no no no no yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes no no no unknown no no no no no no no yes no
lola: memory consumption: 74456 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: yes no no no unknown no no no no no no no yes no
lola: memory consumption: 74456 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: caught signal User defined signal 1 - aborting LoLA
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 16087152 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16087096 kB

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-18a"
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 FlexibleBarrier-PT-18a, 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 r170-smll-158987815800370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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