Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871600234.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871600234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 87K Apr 27 15:14 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 PhilosophersDyn-PT-03-00
FORMULA_NAME PhilosophersDyn-PT-03-01
FORMULA_NAME PhilosophersDyn-PT-03-02
FORMULA_NAME PhilosophersDyn-PT-03-03
FORMULA_NAME PhilosophersDyn-PT-03-04
FORMULA_NAME PhilosophersDyn-PT-03-05
FORMULA_NAME PhilosophersDyn-PT-03-06
FORMULA_NAME PhilosophersDyn-PT-03-07
FORMULA_NAME PhilosophersDyn-PT-03-08
FORMULA_NAME PhilosophersDyn-PT-03-09
FORMULA_NAME PhilosophersDyn-PT-03-10
FORMULA_NAME PhilosophersDyn-PT-03-11
FORMULA_NAME PhilosophersDyn-PT-03-12
FORMULA_NAME PhilosophersDyn-PT-03-13
FORMULA_NAME PhilosophersDyn-PT-03-14
FORMULA_NAME PhilosophersDyn-PT-03-15

=== Now, execution of the tool begins

BK_START 1591136992645

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:29:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 22:29:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:29:54] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2020-06-02 22:29:54] [INFO ] Transformed 30 places.
[2020-06-02 22:29:54] [INFO ] Transformed 84 transitions.
[2020-06-02 22:29:54] [INFO ] Parsed PT model containing 30 places and 84 transitions in 77 ms.
[2020-06-02 22:29:54] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:29:54] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:29:54] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:29:54] [INFO ] Reduced 5 identical enabling conditions.
[2020-06-02 22:29:54] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 14335 resets, run finished after 336 ms. (steps per millisecond=297 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-02 22:29:54] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2020-06-02 22:29:54] [INFO ] Computed 11 place invariants in 4 ms
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2020-06-02 22:29:54] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned unsat
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
[2020-06-02 22:29:55] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 22:29:55] [INFO ] Flatten gal took : 42 ms
FORMULA PhilosophersDyn-PT-03-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 22:29:55] [INFO ] Flatten gal took : 14 ms
[2020-06-02 22:29:55] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2020-06-02 22:29:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ PhilosophersDyn-PT-03 @ 3570 seconds

FORMULA PhilosophersDyn-PT-03-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA PhilosophersDyn-PT-03-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-PT-03-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for LTLFireability @ PhilosophersDyn-PT-03

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 34,
"adisj": 26,
"aneg": 3,
"comp": 219,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 219,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 21,
"visible_transitions": 0
},
"processed": "G ((G ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)))) OR ((((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p19 <= 0))) OR (((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0))))))",
"processed_size": 3337,
"rewrites": 133
},
"result":
{
"edges": 810,
"markings": 325,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (G ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))",
"processed_size": 417,
"rewrites": 133
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 34,
"adisj": 2,
"aneg": 0,
"comp": 126,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 126,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "X (X (X (G ((F ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) OR (((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19))))))))",
"processed_size": 1938,
"rewrites": 133
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 9,
"aneg": 1,
"comp": 30,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 30,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (G ((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) OR (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p19 <= 0))))))",
"processed_size": 474,
"rewrites": 133
},
"result":
{
"edges": 1683,
"markings": 649,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G (((1 <= p3) OR (1 <= p7) OR (1 <= p10)))))",
"processed_size": 52,
"rewrites": 133
},
"result":
{
"edges": 6,
"markings": 6,
"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": 445
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 13,
"aneg": 2,
"comp": 78,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 78,
"taut": 0,
"tconj": 12,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 24,
"visible_transitions": 0
},
"processed": "G (((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) R (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p19 <= 0)))) AND (((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND (((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND (((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND (((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND (((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND (((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND (((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND (((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND (((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND (((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)))))))))))))))",
"processed_size": 1221,
"rewrites": 133
},
"result":
{
"edges": 854,
"markings": 346,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 9,
"adisj": 1,
"aneg": 0,
"comp": 27,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 27,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (F ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19))))))",
"processed_size": 427,
"rewrites": 133
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 27,
"adisj": 3,
"aneg": 0,
"comp": 81,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 15,
"visible_transitions": 0
},
"processed": "X (X (F ((G ((X (X (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))))",
"processed_size": 1269,
"rewrites": 133
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 2,
"X": 3,
"aconj": 37,
"adisj": 4,
"aneg": 2,
"comp": 111,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 111,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "X (((((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) U (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))) AND (F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))) AND X ((((p6 <= 0) OR (p9 <= 0) OR (p12 <= 0)) AND ((p5 <= 0) OR (p14 <= 0) OR (p22 <= 0)) AND ((p4 <= 0) OR (p21 <= 0) OR (p27 <= 0)) AND ((p12 <= 0) OR (p21 <= 0) OR (p25 <= 0)) AND ((p14 <= 0) OR (p15 <= 0) OR (p21 <= 0)) AND ((p9 <= 0) OR (p14 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p5 <= 0) OR (p12 <= 0)) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p5 <= 0) OR (p16 <= 0)))))) U X (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)))))",
"processed_size": 1717,
"rewrites": 133
},
"result":
{
"edges": 93,
"markings": 79,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((G (F (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)))) OR ((p4 <= 0) OR ((p14 <= 0) OR ((p22 <= 0) OR (p28 <= 0)))))))",
"processed_size": 120,
"rewrites": 133
},
"result":
{
"edges": 1108,
"markings": 437,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((G (((p1 <= 0) OR (p12 <= 0))) AND ((p1 <= 0) OR (p12 <= 0)))))",
"processed_size": 71,
"rewrites": 133
},
"result":
{
"edges": 11,
"markings": 10,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 1,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 1,
"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": 6,
"visible_transitions": 0
},
"processed": "(X (F ((X (F (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)))) OR F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) U G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))))",
"processed_size": 173,
"rewrites": 133
},
"result":
{
"edges": 1103,
"markings": 341,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 4,
"aconj": 3,
"adisj": 2,
"aneg": 0,
"comp": 18,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 18,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "F (G ((F ((X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))) AND ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) U (1 <= p7)) OR (X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))))))",
"processed_size": 298,
"rewrites": 133
},
"result":
{
"edges": 10,
"markings": 9,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F (((1 <= p12) AND (1 <= p21) AND (1 <= p25))) AND (F (((1 <= p1) AND (1 <= p12))) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25))))))",
"processed_size": 139,
"rewrites": 133
},
"result":
{
"edges": 9,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 151676,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(G((G(*) OR (* OR *))) AND X(G(**))) : X(X(X(G((F(**) OR **))))) : X(G((G(*) OR **))) : X(X(G(**))) : (X(X(F(**))) OR G(((G(*) R *) AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND (** AND **)))))))))))))) : X(X(F((G((X(X(X(**))) AND **)) AND **)))) : X((((** U **) AND (F(**) AND X(*))) U X(*))) : F(G((F(**) AND (F(**) OR **)))) : X(G((G(F(**)) OR (* OR (* OR (* OR *)))))) : X(F((G(*) AND **))) : (X(F((X(F(**)) OR F(**)))) U G(*)) : F(G((F((X(X(**)) OR **)) AND ((** U **) OR (X(X(**)) OR **)))))"
},
"net":
{
"arcs": 534,
"conflict_clusters": 1,
"places": 30,
"places_significant": 19,
"singleton_clusters": 0,
"transitions": 81
},
"result":
{
"preliminary_value": "no no yes no no no yes no yes no no no ",
"value": "no no yes no no no yes no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 111/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 81 transitions, 19 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 false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: LP says that atomic proposition is always false: (2 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p6)
lola: LP says that atomic proposition is always false: (2 <= p15)
lola: (NOT(F (((F ((((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p16 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p17 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p15 <= 0) OR (p22 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p0 <= 0) OR (p6 <= 0) OR (p7 <= 0) OR (p12 <= 0)) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0)) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0)) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0)) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p16 <= 0)) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p25 <= 0)))) AND (((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)))) AND (((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)))))) AND G (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) : X (G (X (((F (X (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) U X (F ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p17)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p19) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p27)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p6) AND (1 <= p7) AND (1 <= p12)) OR ((1 <= p0) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p22) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p19)) OR ((1 <= p7) AND (1 <= p12) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p17)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p19) AND (1 <= p22)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p17) AND (1 <= p25)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p16)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p22) AND (1 <= p27)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p12) AND (1 <= p25)) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) OR X ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)))))))) : G (X ((NOT(F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))) OR (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 <= 0) OR (p26 <= 0)) AND ((p2 <= 0) OR (p11 <= 0) OR (p19 <= 0)))))) : G (X (X (((1 <= p3) OR (1 <= p7) OR (1 <= p10))))) : (X (X (F ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19)))))) OR G (((((((((((((NOT((F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))) U (((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 <= p11) AND (1 <= p19))))) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p19 <= 0))) AND ((p7 <= 0) OR (p12 <= 0) OR (p19 <= 0) OR (p25 <= 0))) AND ((p0 <= 0) OR (p4 <= 0) OR (p10 <= 0) OR (p27 <= 0))) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p17 <= 0))) AND ((p0 <= 0) OR (p7 <= 0) OR (p12 <= 0) OR (p19 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p27 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p22 <= 0) OR (p25 <= 0))) AND ((p7 <= 0) OR (p12 <= 0) OR (p17 <= 0) OR (p25 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p27 <= 0))) AND ((p4 <= 0) OR (p10 <= 0) OR (p19 <= 0) OR (p22 <= 0))) AND ((p3 <= 0) OR (p14 <= 0) OR (p17 <= 0) OR (p25 <= 0))) AND ((p4 <= 0) OR (p10 <= 0) OR (p22 <= 0) OR (p27 <= 0))))) : X (F (X ((G ((X (X (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) AND (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))))) : X ((((((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))) U (((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))) AND F ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16))))) AND NOT(X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) AND (1 <= p16)))))) U NOT(X (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) : F (G ((F (((1 <= p1) AND (1 <= p12))) U ((1 <= p12) AND (1 <= p21) AND (1 <= p25))))) : G (NOT(X (F (((((NOT(G (F (X (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)))))) AND (1 <= p4)) AND (1 <= p14)) AND (1 <= p22)) AND (1 <= p28)))))) : X (F ((NOT(F (((1 <= p1) AND (1 <= p12)))) AND ((p1 <= 0) OR (p12 <= 0))))) : (X (F ((F (X (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)))) OR F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) U NOT(F (((1 <= p8) AND (1 <= p28) AND (1 <= p29))))) : X (F (G (((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) U (1 <= p7)) U (X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: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: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: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: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: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: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: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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 <= p14) A... (shortened)
lola: processed formula length: 3337
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 325 markings, 810 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: processed formula length: 417
lola: 133 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((F ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((F ((((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p19)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p25)) OR ((1 <= p3) AND (1 <= p14) AND (1 <= p15) AND (1 <= p27)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p22)) OR ((1 <= p0) AND (1 <= p4) AND (1 <= p10) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p10) AND (1 <= p16) AND (1 <= p27)) OR ((1 <= p3) AND (1 ... (shortened)
lola: processed formula length: 1938
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) OR (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) OR (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p... (shortened)
lola: processed formula length: 474
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 649 markings, 1683 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G (((1 <= p3) OR (1 <= p7) OR (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G (((1 <= p3) OR (1 <= p7) OR (1 <= p10)))))
lola: processed formula length: 52
lola: 133 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (F ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) R (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))) R (((p2 <= 0) OR (p11 <= 0) OR (p17 <= 0)) AND ((p16 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p18 <= 0) OR (p22 <= 0) OR (p23 <= 0)) AND ((p2 <= 0) OR (p6 <= 0) OR (p11 <= 0)) AND ((p13 <= 0) OR (p26 <= 0) OR (p27 <= 0)) AND ((p13 <= 0) OR (p25 <= 0) OR (p26 <= 0)) AND ((p0 <= 0) OR (p18 <= 0) OR (p23 <= 0)) AND ((p13 <= 0) OR (p15 ... (shortened)
lola: processed formula length: 1221
lola: 133 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: 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: 346 markings, 854 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((1 <= p2) AND (1 <= p11) AND (1 <= p17)) OR ((1 <= p16) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p18) AND (1 <= p22) AND (1 <= p23)) OR ((1 <= p2) AND (1 <= p6) AND (1 <= p11)) OR ((1 <= p13) AND (1 <= p26) AND (1 <= p27)) OR ((1 <= p13) AND (1 <= p25) AND (1 <= p26)) OR ((1 <= p0) AND (1 <= p18) AND (1 <= p23)) OR ((1 <= p13) AND (1 <= p15) AND (1 <= p26)) OR ((1 <= p2) AND (1 ... (shortened)
lola: processed formula length: 427
lola: 133 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((G ((X (X (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((G ((X (X (X ((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4... (shortened)
lola: processed formula length: 1269
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((((1 <= p6) AND (1 <= p9) AND (1 <= p12)) OR ((1 <= p5) AND (1 <= p14) AND (1 <= p22)) OR ((1 <= p4) AND (1 <= p21) AND (1 <= p27)) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25)) OR ((1 <= p14) AND (1 <= p15) AND (1 <= p21)) OR ((1 <= p9) AND (1 <= p14) AND (1 <= p17)) OR ((1 <= p0) AND (1 <= p5) AND (1 <= p12)) OR ((1 <= p4) AND (1 <= p9) AND (1 <= p19)) OR ((1 <= p4) AND (1 <= p5) A... (shortened)
lola: processed formula length: 1717
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 79 markings, 93 edges
lola: ========================================
lola: subprocess 7 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G (F (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)))) OR ((p4 <= 0) OR ((p14 <= 0) OR ((p22 <= 0) OR (p28 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G (F (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0)))) OR ((p4 <= 0) OR ((p14 <= 0) OR ((p22 <= 0) OR (p28 <= 0)))))))
lola: processed formula length: 120
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 437 markings, 1108 edges
lola: ========================================
lola: subprocess 8 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p1 <= 0) OR (p12 <= 0))) AND ((p1 <= 0) OR (p12 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p1 <= 0) OR (p12 <= 0))) AND ((p1 <= 0) OR (p12 <= 0)))))
lola: processed formula length: 71
lola: 133 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: 10 markings, 11 edges
lola: ========================================
lola: subprocess 9 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((X (F (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)))) OR F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) U G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F ((X (F (((1 <= p4) AND (1 <= p14) AND (1 <= p22) AND (1 <= p28)))) OR F (((1 <= p8) AND (1 <= p28) AND (1 <= p29)))))) U G (((p8 <= 0) OR (p28 <= 0) OR (p29 <= 0))))
lola: processed formula length: 173
lola: 133 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: 341 markings, 1103 edges
lola: ========================================
lola: subprocess 10 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))) AND ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) U (1 <= p7)) OR (X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))) AND ((((1 <= p8) AND (1 <= p28) AND (1 <= p29)) U (1 <= p7)) OR (X (X ((1 <= p7))) OR ((1 <= p8) AND (1 <= p28) AND (1 <= p29) AND ((p4 <= 0) OR (p9 <= 0) OR (p19 <= 0))))))))
lola: processed formula length: 298
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 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: 9 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((1 <= p12) AND (1 <= p21) AND (1 <= p25))) AND (F (((1 <= p1) AND (1 <= p12))) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((1 <= p12) AND (1 <= p21) AND (1 <= p25))) AND (F (((1 <= p1) AND (1 <= p12))) OR ((1 <= p12) AND (1 <= p21) AND (1 <= p25))))))
lola: processed formula length: 139
lola: 133 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 7 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no no yes no yes no no no
lola:
preliminary result: no no yes no no no yes no yes no no no
lola: memory consumption: 151676 KB
lola: time consumption: 4 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="PhilosophersDyn-PT-03"
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 PhilosophersDyn-PT-03, 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 r176-tajo-158987871600234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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