Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853100362.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is NoC3x3-PT-3A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100362
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.2K Apr 8 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 7 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 7 18:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 6 03:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 6 03:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 133K 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 NoC3x3-PT-3A-00
FORMULA_NAME NoC3x3-PT-3A-01
FORMULA_NAME NoC3x3-PT-3A-02
FORMULA_NAME NoC3x3-PT-3A-03
FORMULA_NAME NoC3x3-PT-3A-04
FORMULA_NAME NoC3x3-PT-3A-05
FORMULA_NAME NoC3x3-PT-3A-06
FORMULA_NAME NoC3x3-PT-3A-07
FORMULA_NAME NoC3x3-PT-3A-08
FORMULA_NAME NoC3x3-PT-3A-09
FORMULA_NAME NoC3x3-PT-3A-10
FORMULA_NAME NoC3x3-PT-3A-11
FORMULA_NAME NoC3x3-PT-3A-12
FORMULA_NAME NoC3x3-PT-3A-13
FORMULA_NAME NoC3x3-PT-3A-14
FORMULA_NAME NoC3x3-PT-3A-15

=== Now, execution of the tool begins

BK_START 1591141817503

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:50:19] [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 23:50:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:50:19] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-06-02 23:50:19] [INFO ] Transformed 370 places.
[2020-06-02 23:50:19] [INFO ] Transformed 450 transitions.
[2020-06-02 23:50:19] [INFO ] Found NUPN structural information;
[2020-06-02 23:50:19] [INFO ] Parsed PT model containing 370 places and 450 transitions in 134 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 442 ms. (steps per millisecond=226 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-06-02 23:50:20] [INFO ] Flow matrix only has 394 transitions (discarded 55 similar events)
// Phase 1: matrix 394 rows 370 cols
[2020-06-02 23:50:20] [INFO ] Computed 127 place invariants in 43 ms
[2020-06-02 23:50:20] [INFO ] [Real]Absence check using 76 positive place invariants in 51 ms returned sat
[2020-06-02 23:50:20] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 12 ms returned unsat
[2020-06-02 23:50:20] [INFO ] [Real]Absence check using 76 positive place invariants in 39 ms returned sat
[2020-06-02 23:50:20] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 22 ms returned sat
[2020-06-02 23:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:21] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2020-06-02 23:50:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2020-06-02 23:50:21] [INFO ] [Real]Added 36 Read/Feed constraints in 8 ms returned sat
[2020-06-02 23:50:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:50:21] [INFO ] [Nat]Absence check using 76 positive place invariants in 57 ms returned sat
[2020-06-02 23:50:21] [INFO ] [Nat]Absence check using 76 positive and 51 generalized place invariants in 21 ms returned sat
[2020-06-02 23:50:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:21] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2020-06-02 23:50:21] [INFO ] [Nat]Added 36 Read/Feed constraints in 16 ms returned sat
[2020-06-02 23:50:21] [INFO ] Computed and/alt/rep : 448/2589/393 causal constraints in 44 ms.
[2020-06-02 23:50:26] [INFO ] Added : 385 causal constraints over 77 iterations in 4325 ms. Result :sat
[2020-06-02 23:50:26] [INFO ] [Real]Absence check using 76 positive place invariants in 42 ms returned sat
[2020-06-02 23:50:26] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 21 ms returned sat
[2020-06-02 23:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:26] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2020-06-02 23:50:27] [INFO ] [Real]Added 36 Read/Feed constraints in 8 ms returned sat
[2020-06-02 23:50:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:50:27] [INFO ] [Nat]Absence check using 76 positive place invariants in 36 ms returned sat
[2020-06-02 23:50:27] [INFO ] [Nat]Absence check using 76 positive and 51 generalized place invariants in 20 ms returned sat
[2020-06-02 23:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:27] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2020-06-02 23:50:27] [INFO ] [Nat]Added 36 Read/Feed constraints in 17 ms returned sat
[2020-06-02 23:50:27] [INFO ] Computed and/alt/rep : 448/2589/393 causal constraints in 45 ms.
[2020-06-02 23:50:31] [INFO ] Added : 386 causal constraints over 78 iterations in 4139 ms. Result :sat
[2020-06-02 23:50:31] [INFO ] [Real]Absence check using 76 positive place invariants in 46 ms returned sat
[2020-06-02 23:50:31] [INFO ] [Real]Absence check using 76 positive and 51 generalized place invariants in 25 ms returned sat
[2020-06-02 23:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:32] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2020-06-02 23:50:32] [INFO ] [Real]Added 36 Read/Feed constraints in 15 ms returned sat
[2020-06-02 23:50:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:50:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 45 ms returned sat
[2020-06-02 23:50:32] [INFO ] [Nat]Absence check using 76 positive and 51 generalized place invariants in 22 ms returned sat
[2020-06-02 23:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:50:33] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2020-06-02 23:50:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2020-06-02 23:50:33] [INFO ] Computed and/alt/rep : 448/2589/393 causal constraints in 32 ms.
[2020-06-02 23:50:35] [INFO ] Added : 293 causal constraints over 59 iterations in 2314 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 23:50:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-06-02 23:50:35] [INFO ] Flatten gal took : 124 ms
FORMULA NoC3x3-PT-3A-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 23:50:35] [INFO ] Applying decomposition
[2020-06-02 23:50:35] [INFO ] Flatten gal took : 42 ms
[2020-06-02 23:50:35] [INFO ] Decomposing Gal with order
[2020-06-02 23:50:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 23:50:36] [INFO ] Removed a total of 238 redundant transitions.
[2020-06-02 23:50:36] [INFO ] Flatten gal took : 194 ms
[2020-06-02 23:50:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 331 labels/synchronizations in 53 ms.
[2020-06-02 23:50:36] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 20 ms.
[2020-06-02 23:50:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ NoC3x3-PT-3A @ 3570 seconds

FORMULA NoC3x3-PT-3A-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-09 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NoC3x3-PT-3A-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1909
rslt: Output for LTLFireability @ NoC3x3-PT-3A

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "X ((X (((p159 <= 0) OR (p194 <= 0))) AND ((1 <= p141) AND (1 <= p205))))",
"processed_size": 73,
"rewrites": 112
},
"result":
{
"edges": 15,
"markings": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 2,
"aneg": 4,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "F (G ((((((p140 <= 0) OR (p213 <= 0)) R ((1 <= p54))) AND X (((p223 <= 0) OR (p258 <= 0)))) R ((1 <= p140) AND (1 <= p213)))))",
"processed_size": 128,
"rewrites": 112
},
"result":
{
"edges": 17,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 275
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 2,
"aneg": 2,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((F ((X (G (((1 <= p230) AND (1 <= p266) AND ((p227 <= 0) OR (p253 <= 0))))) OR ((1 <= p230) AND (1 <= p266)))) U G (((1 <= p291)))))",
"processed_size": 136,
"rewrites": 112
},
"result":
{
"edges": 17,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 300
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (X ((X (G (((1 <= p145) AND (1 <= p193)))) OR (F (((1 <= p132) AND (1 <= p194))) AND (((p132 <= 0) OR (p194 <= 0)) AND (((1 <= p269)) AND ((1 <= p289))))))))",
"processed_size": 160,
"rewrites": 112
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 10
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((F ((((1 <= p18) AND (1 <= p93)) OR ((1 <= p308) AND (1 <= p360)))) AND ((1 <= p308) AND (1 <= p360)))))",
"processed_size": 111,
"rewrites": 112
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 420
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 3,
"aconj": 6,
"adisj": 0,
"aneg": 4,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((X (F ((X ((G (((p106 <= 0) OR (p113 <= 0))) OR (((p307 <= 0)) OR ((p326 <= 0))))) AND ((p288 <= 0) OR (p301 <= 0))))) AND (((1 <= p307)) AND ((1 <= p326)))))",
"processed_size": 163,
"rewrites": 112
},
"result":
{
"edges": 1869,
"markings": 820,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 490
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p159) AND (1 <= p215))) AND (((1 <= p159)) AND (((1 <= p215)) AND (F (((1 <= p24) AND (1 <= p56))) OR ((1 <= p136) AND (1 <= p190)))))))",
"processed_size": 150,
"rewrites": 112
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 588
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "F ((X (((p104 <= 0) OR (p121 <= 0))) AND ((p278 <= 0) OR (p280 <= 0))))",
"processed_size": 73,
"rewrites": 112
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 735
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p162) AND (1 <= p322))))",
"processed_size": 37,
"rewrites": 112
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1471
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((p165 <= 0) OR (p178 <= 0))) OR (((p147 <= 0) OR (p201 <= 0)) AND ((p165 <= 0) OR (p178 <= 0))))))",
"processed_size": 112,
"rewrites": 112
},
"result":
{
"edges": 14028,
"markings": 6543,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 2942
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2942
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p267) AND (1 <= p287))",
"processed_size": 29,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((1 <= p267) AND (1 <= p287))",
"processed_size": 29,
"rewrites": 112
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "((p164 <= 0) OR (p322 <= 0))",
"processed_size": 29,
"rewrites": 114
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 15
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3508,
"runtime": 1661.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) AND G(**)) OR X((X(*) AND **))) : X(F((* AND (G(*) OR G(F(**)))))) : G(F(**)) : G(F((G(*) OR (* AND *)))) : F(G((((* R *) AND X(*)) R *))) : X((F((X(G(*)) OR *)) U G(**))) : X(X((X(G(**)) OR (F(**) AND (** AND (** AND **)))))) : X(G((F(**) AND **))) : X(X(((* R X(*)) R *))) : (F((X(*) AND (* AND *))) AND F(**)) : (F(**) OR **) : X((X(F((X((G(*) OR (* OR *))) AND *))) AND (** AND **))) : G(F(**)) : X((G(**) AND (** AND (** AND (F(**) OR **))))) : F((X(*) AND *))"
},
"net":
{
"arcs": 1771,
"conflict_clusters": 95,
"places": 370,
"places_significant": 243,
"singleton_clusters": 0,
"transitions": 449
},
"result":
{
"preliminary_value": "no unknown no no no no no no unknown no no no no no yes ",
"value": "no unknown no no no no no no unknown no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 819/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 370
lola: finding significant places
lola: 370 places, 449 transitions, 243 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: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p141 <= 1)
lola: LP says that atomic proposition is always true: (p205 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p314 <= 1)
lola: LP says that atomic proposition is always true: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p131 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p147 <= 1)
lola: LP says that atomic proposition is always true: (p201 <= 1)
lola: LP says that atomic proposition is always true: (p165 <= 1)
lola: LP says that atomic proposition is always true: (p178 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p223 <= 1)
lola: LP says that atomic proposition is always true: (p258 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p213 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p227 <= 1)
lola: LP says that atomic proposition is always true: (p253 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p266 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p193 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p132 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p289 <= 1)
lola: LP says that atomic proposition is always true: (p18 <= 1)
lola: LP says that atomic proposition is always true: (p93 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p283 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p337 <= 1)
lola: LP says that atomic proposition is always true: (p308 <= 1)
lola: LP says that atomic proposition is always true: (p360 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p157 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p321 <= 1)
lola: LP says that atomic proposition is always true: (p164 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p267 <= 1)
lola: LP says that atomic proposition is always true: (p287 <= 1)
lola: LP says that atomic proposition is always true: (p106 <= 1)
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p288 <= 1)
lola: LP says that atomic proposition is always true: (p301 <= 1)
lola: LP says that atomic proposition is always true: (p307 <= 1)
lola: LP says that atomic proposition is always true: (p326 <= 1)
lola: LP says that atomic proposition is always true: (p166 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p350 <= 1)
lola: LP says that atomic proposition is always true: (p358 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: LP says that atomic proposition is always true: (p56 <= 1)
lola: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p278 <= 1)
lola: LP says that atomic proposition is always true: (p280 <= 1)
lola: ((F (((p105 <= 1) AND (1 <= p105) AND (1 <= p292))) AND G (((1 <= p141) AND (1 <= p205)))) OR (X (NOT(X (((1 <= p159) AND (1 <= p194))))) AND X (((1 <= p141) AND (1 <= p205))))) : X (NOT(G (((1 <= 0) U (NOT(G (F (((1 <= p33) AND (1 <= p51))))) U ((1 <= p314) AND (1 <= p337))))))) : ((F (((1 <= p79))) OR ((1 <= p104) AND (1 <= p131))) U G (F (X (((1 <= p162) AND (1 <= p322)))))) : G (F (NOT(G ((((1 <= p147) AND (1 <= p201)) U ((1 <= p165) AND (1 <= p178))))))) : F (X (F (G (NOT((((((1 <= p140) AND (1 <= p213)) U ((p54 <= 0))) OR X (((1 <= p223) AND (1 <= p258)))) U ((p140 <= 0) OR (p213 <= 0)))))))) : X ((NOT(G ((F (X (((p230 <= 0) OR (p266 <= 0) OR ((1 <= p227) AND (1 <= p253))))) AND ((p230 <= 0) OR (p266 <= 0))))) U G (((1 <= p291))))) : (G (X (X (X (((1 <= p145) AND (1 <= p193)))))) OR X (X ((((F (((1 <= p132) AND (1 <= p194))) AND ((p132 <= 0) OR (p194 <= 0))) AND ((1 <= p269))) AND ((1 <= p289)))))) : G (X (G ((G (F ((((1 <= p18) AND (1 <= p93)) OR ((1 <= p308) AND (1 <= p360))))) AND G (((1 <= p308) AND (1 <= p360))))))) : X (X (NOT(((((1 <= p267) AND (1 <= p283)) U X (((1 <= p307) AND (1 <= p337)))) U ((1 <= p308) AND (1 <= p360)))))) : (F (NOT(G (((X (((1 <= p321))) OR ((1 <= p157) AND (1 <= p249))) OR ((1 <= p321)))))) AND F (((1 <= p321)))) : (F (((1 <= p164) AND (1 <= p322))) OR ((1 <= p267) AND (1 <= p287))) : X (((NOT(G (X ((X (((F (((1 <= p106) AND (1 <= p113))) AND ((1 <= p307))) AND ((1 <= p326)))) OR ((1 <= p288) AND (1 <= p301)))))) AND ((1 <= p307))) AND ((1 <= p326)))) : NOT(F (NOT(X ((F (X (((1 <= p166) AND (1 <= p194)))) U X (F (((1 <= p350) AND (1 <= p358))))))))) : X ((((G (((1 <= p159) AND (1 <= p215))) AND ((1 <= p159))) AND ((1 <= p215))) AND (F (((1 <= p24) AND (1 <= p56))) OR ((1 <= p136) AND (1 <= p190))))) : NOT(G ((X (((1 <= p104) AND (1 <= p121))) OR ((1 <= p278) AND (1 <= p280)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:335
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((p105 <= 1) AND (1 <= p105) AND (1 <= p292))) AND G (((1 <= p141) AND (1 <= p205)))) OR X ((X (((p159 <= 0) OR (p194 <= 0))) AND ((1 <= p141) AND (1 <= p205)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((1 <= p141) AND (1 <= p205)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((1 <= p141) AND (1 <= p205)))
lola: processed formula length: 33
lola: 112 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (((p159 <= 0) OR (p194 <= 0))) AND ((1 <= p141) AND (1 <= p205))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (((p159 <= 0) OR (p194 <= 0))) AND ((1 <= p141) AND (1 <= p205))))
lola: processed formula length: 73
lola: 112 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: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p314 <= 0) OR (p337 <= 0)) AND (G (((p314 <= 0) OR (p337 <= 0))) OR G (F (((1 <= p33) AND (1 <= p51))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p314 <= 0) OR (p337 <= 0)) AND (G (((p314 <= 0) OR (p337 <= 0))) OR G (F (((1 <= p33) AND (1 <= p51))))))))
lola: processed formula length: 118
lola: 112 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: 735617 markings, 1950976 edges, 147123 markings/sec, 0 secs
lola: 1430368 markings, 3795743 edges, 138950 markings/sec, 5 secs
lola: 2234847 markings, 5722672 edges, 160896 markings/sec, 10 secs
lola: 3042059 markings, 7686352 edges, 161442 markings/sec, 15 secs
lola: 3861763 markings, 9636539 edges, 163941 markings/sec, 20 secs
lola: 4627033 markings, 11494827 edges, 153054 markings/sec, 25 secs
lola: 5359399 markings, 13231258 edges, 146473 markings/sec, 30 secs
lola: 6073777 markings, 14991019 edges, 142876 markings/sec, 35 secs
lola: 6799135 markings, 16743388 edges, 145072 markings/sec, 40 secs
lola: 7531158 markings, 18520921 edges, 146405 markings/sec, 45 secs
lola: 8235000 markings, 20199086 edges, 140768 markings/sec, 50 secs
lola: 8913485 markings, 21825842 edges, 135697 markings/sec, 55 secs
lola: 9590043 markings, 23492007 edges, 135312 markings/sec, 60 secs
lola: 10262704 markings, 25181487 edges, 134532 markings/sec, 65 secs
lola: 10929914 markings, 26886801 edges, 133442 markings/sec, 70 secs
lola: 11623807 markings, 28536465 edges, 138779 markings/sec, 75 secs
lola: 12304450 markings, 30203079 edges, 136129 markings/sec, 80 secs
lola: 12994021 markings, 31862045 edges, 137914 markings/sec, 85 secs
lola: 13670554 markings, 33502704 edges, 135307 markings/sec, 90 secs
lola: 14343858 markings, 35142788 edges, 134661 markings/sec, 95 secs
lola: 15036403 markings, 36820392 edges, 138509 markings/sec, 100 secs
lola: 15681966 markings, 38465332 edges, 129113 markings/sec, 105 secs
lola: 16317840 markings, 40129548 edges, 127175 markings/sec, 110 secs
lola: 17073856 markings, 41958115 edges, 151203 markings/sec, 115 secs
lola: 17835245 markings, 43799985 edges, 152278 markings/sec, 120 secs
lola: 18550740 markings, 45608237 edges, 143099 markings/sec, 125 secs
lola: 19259448 markings, 47408449 edges, 141742 markings/sec, 130 secs
lola: 19987319 markings, 49236601 edges, 145574 markings/sec, 135 secs
lola: 20746603 markings, 51043588 edges, 151857 markings/sec, 140 secs
lola: 21488502 markings, 52826467 edges, 148380 markings/sec, 145 secs
lola: 22225144 markings, 54592266 edges, 147328 markings/sec, 150 secs
lola: 22945389 markings, 56330456 edges, 144049 markings/sec, 155 secs
lola: 23646126 markings, 58091527 edges, 140147 markings/sec, 160 secs
lola: 24349192 markings, 59847698 edges, 140613 markings/sec, 165 secs
lola: 25056989 markings, 61566110 edges, 141559 markings/sec, 170 secs
lola: 25744288 markings, 63308579 edges, 137460 markings/sec, 175 secs
lola: 26417897 markings, 65030594 edges, 134722 markings/sec, 180 secs
lola: 27087896 markings, 66747977 edges, 134000 markings/sec, 185 secs
lola: 27743939 markings, 68455694 edges, 131209 markings/sec, 190 secs
lola: 28401754 markings, 70162998 edges, 131563 markings/sec, 195 secs
lola: 29114454 markings, 71861356 edges, 142540 markings/sec, 200 secs
lola: 29804492 markings, 73537526 edges, 138008 markings/sec, 205 secs
lola: 30481832 markings, 75206237 edges, 135468 markings/sec, 210 secs
lola: 31143283 markings, 76857587 edges, 132290 markings/sec, 215 secs
lola: 31790292 markings, 78529004 edges, 129402 markings/sec, 220 secs
lola: 32478503 markings, 80196927 edges, 137642 markings/sec, 225 secs
lola: 33165181 markings, 81872792 edges, 137336 markings/sec, 230 secs
lola: 33792941 markings, 83514513 edges, 125552 markings/sec, 235 secs
lola: 34428944 markings, 85147473 edges, 127201 markings/sec, 240 secs
lola: 35148008 markings, 86839832 edges, 143813 markings/sec, 245 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 10872252 KB
lola: time consumption: 260 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((((p140 <= 0) OR (p213 <= 0)) R ((1 <= p54))) AND X (((p223 <= 0) OR (p258 <= 0)))) R ((1 <= p140) AND (1 <= p213)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((((((p140 <= 0) OR (p213 <= 0)) R ((1 <= p54))) AND X (((p223 <= 0) OR (p258 <= 0)))) R ((1 <= p140) AND (1 <= p213)))))
lola: processed formula length: 128
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================
lola: subprocess 3 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((X (G (((1 <= p230) AND (1 <= p266) AND ((p227 <= 0) OR (p253 <= 0))))) OR ((1 <= p230) AND (1 <= p266)))) U G (((1 <= p291)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((X (G (((1 <= p230) AND (1 <= p266) AND ((p227 <= 0) OR (p253 <= 0))))) OR ((1 <= p230) AND (1 <= p266)))) U G (((1 <= p291)))))
lola: processed formula length: 136
lola: 112 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: 16 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 300 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((X (G (((1 <= p145) AND (1 <= p193)))) OR (F (((1 <= p132) AND (1 <= p194))) AND (((p132 <= 0) OR (p194 <= 0)) AND (((1 <= p269)) AND ((1 <= p289))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((X (G (((1 <= p145) AND (1 <= p193)))) OR (F (((1 <= p132) AND (1 <= p194))) AND (((p132 <= 0) OR (p194 <= 0)) AND (((1 <= p269)) AND ((1 <= p289))))))))
lola: processed formula length: 160
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((((1 <= p18) AND (1 <= p93)) OR ((1 <= p308) AND (1 <= p360)))) AND ((1 <= p308) AND (1 <= p360)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((((1 <= p18) AND (1 <= p93)) OR ((1 <= p308) AND (1 <= p360)))) AND ((1 <= p308) AND (1 <= p360)))))
lola: processed formula length: 111
lola: 112 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (((((p267 <= 0) OR (p283 <= 0)) R X (((p307 <= 0) OR (p337 <= 0)))) R ((p308 <= 0) OR (p360 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((((p267 <= 0) OR (p283 <= 0)) R X (((p307 <= 0) OR (p337 <= 0)))) R ((p308 <= 0) OR (p360 <= 0)))))
lola: processed formula length: 109
lola: 112 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: 727110 markings, 1968841 edges, 145422 markings/sec, 0 secs
lola: 1449708 markings, 3889384 edges, 144520 markings/sec, 5 secs
lola: 2177064 markings, 5786633 edges, 145471 markings/sec, 10 secs
lola: 2909877 markings, 7708709 edges, 146563 markings/sec, 15 secs
lola: 3685884 markings, 9555309 edges, 155201 markings/sec, 20 secs
lola: 4443548 markings, 11362054 edges, 151533 markings/sec, 25 secs
lola: 5239918 markings, 13259372 edges, 159274 markings/sec, 30 secs
lola: 6022189 markings, 15186860 edges, 156454 markings/sec, 35 secs
lola: 6809897 markings, 17118784 edges, 157542 markings/sec, 40 secs
lola: 7584118 markings, 18977629 edges, 154844 markings/sec, 45 secs
lola: 8301219 markings, 20780969 edges, 143420 markings/sec, 50 secs
lola: 9037794 markings, 22615327 edges, 147315 markings/sec, 55 secs
lola: 9779259 markings, 24432857 edges, 148293 markings/sec, 60 secs
lola: 10493467 markings, 26224831 edges, 142842 markings/sec, 65 secs
lola: 11289177 markings, 28134832 edges, 159142 markings/sec, 70 secs
lola: 12071099 markings, 30037542 edges, 156384 markings/sec, 75 secs
lola: 12822130 markings, 31903779 edges, 150206 markings/sec, 80 secs
lola: 13576063 markings, 33717874 edges, 150787 markings/sec, 85 secs
lola: 14339859 markings, 35538407 edges, 152759 markings/sec, 90 secs
lola: 15038927 markings, 37364059 edges, 139814 markings/sec, 95 secs
lola: 15745203 markings, 39236701 edges, 141255 markings/sec, 100 secs
lola: 16447437 markings, 41080487 edges, 140447 markings/sec, 105 secs
lola: 17199976 markings, 42883025 edges, 150508 markings/sec, 110 secs
lola: 17940346 markings, 44667512 edges, 148074 markings/sec, 115 secs
lola: 18670774 markings, 46469487 edges, 146086 markings/sec, 120 secs
lola: 19378897 markings, 48257927 edges, 141625 markings/sec, 125 secs
lola: 20098444 markings, 50073180 edges, 143909 markings/sec, 130 secs
lola: 20807689 markings, 51855312 edges, 141849 markings/sec, 135 secs
lola: 21534639 markings, 53646354 edges, 145390 markings/sec, 140 secs
lola: 22238128 markings, 55409326 edges, 140698 markings/sec, 145 secs
lola: 22936856 markings, 57129047 edges, 139746 markings/sec, 150 secs
lola: 23635122 markings, 58847518 edges, 139653 markings/sec, 155 secs
lola: 24366348 markings, 60597262 edges, 146245 markings/sec, 160 secs
lola: 25104478 markings, 62340900 edges, 147626 markings/sec, 165 secs
lola: 25813115 markings, 64062956 edges, 141727 markings/sec, 170 secs
lola: 26516610 markings, 65795849 edges, 140699 markings/sec, 175 secs
lola: 27249807 markings, 67551462 edges, 146639 markings/sec, 180 secs
lola: 27952940 markings, 69310865 edges, 140627 markings/sec, 185 secs
lola: 28633277 markings, 71058453 edges, 136067 markings/sec, 190 secs
lola: 29277278 markings, 72803711 edges, 128800 markings/sec, 195 secs
lola: 29939190 markings, 74583792 edges, 132382 markings/sec, 200 secs
lola: 30644002 markings, 76328120 edges, 140962 markings/sec, 205 secs
lola: 31365506 markings, 78089078 edges, 144301 markings/sec, 210 secs
lola: 32064185 markings, 79868026 edges, 139736 markings/sec, 215 secs
lola: 32812525 markings, 81636817 edges, 149668 markings/sec, 220 secs
lola: 33524616 markings, 83383736 edges, 142418 markings/sec, 225 secs
lola: 34237386 markings, 85137735 edges, 142554 markings/sec, 230 secs
lola: 34981156 markings, 86937332 edges, 148754 markings/sec, 235 secs
lola: 35702132 markings, 88686932 edges, 144195 markings/sec, 240 secs
lola: 36424889 markings, 90464616 edges, 144551 markings/sec, 245 secs
lola: 37156820 markings, 92245674 edges, 146386 markings/sec, 250 secs
lola: 37864954 markings, 93989004 edges, 141627 markings/sec, 255 secs
lola: 38582178 markings, 95737768 edges, 143445 markings/sec, 260 secs
lola: 39325090 markings, 97498579 edges, 148582 markings/sec, 265 secs
lola: 40037575 markings, 99247686 edges, 142497 markings/sec, 270 secs
lola: 40733567 markings, 101011945 edges, 139198 markings/sec, 275 secs
lola: 41451644 markings, 102767228 edges, 143615 markings/sec, 280 secs
lola: 42123706 markings, 104496604 edges, 134412 markings/sec, 285 secs
lola: 42798747 markings, 106269610 edges, 135008 markings/sec, 290 secs
lola: 43477935 markings, 108018462 edges, 135838 markings/sec, 295 secs
lola: 44124182 markings, 109779544 edges, 129249 markings/sec, 300 secs
lola: 44788026 markings, 111529972 edges, 132769 markings/sec, 305 secs
lola: 45511060 markings, 113257468 edges, 144607 markings/sec, 310 secs
lola: 46206063 markings, 114975696 edges, 139001 markings/sec, 315 secs
lola: 46884152 markings, 116688196 edges, 135618 markings/sec, 320 secs
lola: 47586502 markings, 118420761 edges, 140470 markings/sec, 325 secs
lola: 48303056 markings, 120153370 edges, 143311 markings/sec, 330 secs
lola: 49035136 markings, 121905045 edges, 146416 markings/sec, 335 secs
lola: 49753386 markings, 123630755 edges, 143650 markings/sec, 340 secs
lola: 50447165 markings, 125296156 edges, 138756 markings/sec, 345 secs
lola: 51120137 markings, 126968348 edges, 134594 markings/sec, 350 secs
lola: 51801395 markings, 128631270 edges, 136252 markings/sec, 355 secs
lola: 52500538 markings, 130320225 edges, 139829 markings/sec, 360 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown unknown no no no no unknown unknown unknown unknown unknown unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((X (((p321 <= 0))) AND (((p157 <= 0) OR (p249 <= 0)) AND ((p321 <= 0))))) AND F (((1 <= p321))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p321)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p321 <= 0))
lola: processed formula length: 13
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (F ((X ((G (((p106 <= 0) OR (p113 <= 0))) OR (((p307 <= 0)) OR ((p326 <= 0))))) AND ((p288 <= 0) OR (p301 <= 0))))) AND (((1 <= p307)) AND ((1 <= p326)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (F ((X ((G (((p106 <= 0) OR (p113 <= 0))) OR (((p307 <= 0)) OR ((p326 <= 0))))) AND ((p288 <= 0) OR (p301 <= 0))))) AND (((1 <= p307)) AND ((1 <= p326)))))
lola: processed formula length: 163
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 820 markings, 1869 edges
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p159) AND (1 <= p215))) AND (((1 <= p159)) AND (((1 <= p215)) AND (F (((1 <= p24) AND (1 <= p56))) OR ((1 <= p136) AND (1 <= p190)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p159) AND (1 <= p215))) AND (((1 <= p159)) AND (((1 <= p215)) AND (F (((1 <= p24) AND (1 <= p56))) OR ((1 <= p136) AND (1 <= p190)))))))
lola: processed formula length: 150
lola: 112 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (((p104 <= 0) OR (p121 <= 0))) AND ((p278 <= 0) OR (p280 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (((p104 <= 0) OR (p121 <= 0))) AND ((p278 <= 0) OR (p280 <= 0))))
lola: processed formula length: 73
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 735 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p162) AND (1 <= p322))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p162) AND (1 <= p322))))
lola: processed formula length: 37
lola: 112 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 981 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p350) AND (1 <= p358))))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F (((1 <= p350) AND (1 <= p358))))
lola: processed formula length: 37
lola: 112 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 1471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((p165 <= 0) OR (p178 <= 0))) OR (((p147 <= 0) OR (p201 <= 0)) AND ((p165 <= 0) OR (p178 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((p165 <= 0) OR (p178 <= 0))) OR (((p147 <= 0) OR (p201 <= 0)) AND ((p165 <= 0) OR (p178 <= 0))))))
lola: processed formula length: 112
lola: 112 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: 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: 6543 markings, 14028 edges
lola: ========================================
lola: subprocess 14 will run for 2942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p164) AND (1 <= p322))) OR ((1 <= p267) AND (1 <= p287)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 2942 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p267) AND (1 <= p287))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p267) AND (1 <= p287))
lola: processed formula length: 29
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (F ((((p314 <= 0) OR (p337 <= 0)) AND (G (((p314 <= 0) OR (p337 <= 0))) OR G (F (((1 <= p33) AND (1 <= p51))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p314 <= 0) OR (p337 <= 0)) AND (G (((p314 <= 0) OR (p337 <= 0))) OR G (F (((1 <= p33) AND (1 <= p51))))))))
lola: processed formula length: 118
lola: 112 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: 735337 markings, 1950082 edges, 147067 markings/sec, 0 secs
lola: 1450499 markings, 3844986 edges, 143032 markings/sec, 5 secs
lola: 2231507 markings, 5714816 edges, 156202 markings/sec, 10 secs
lola: 2989470 markings, 7540227 edges, 151593 markings/sec, 15 secs
lola: 3757499 markings, 9383017 edges, 153606 markings/sec, 20 secs
lola: 4474255 markings, 11135589 edges, 143351 markings/sec, 25 secs
lola: 5211589 markings, 12869227 edges, 147467 markings/sec, 30 secs
lola: 5953358 markings, 14687466 edges, 148354 markings/sec, 35 secs
lola: 6732870 markings, 16568309 edges, 155902 markings/sec, 40 secs
lola: 7483138 markings, 18404769 edges, 150054 markings/sec, 45 secs
lola: 8236304 markings, 20202596 edges, 150633 markings/sec, 50 secs
lola: 8959216 markings, 21933749 edges, 144582 markings/sec, 55 secs
lola: 9648271 markings, 23639082 edges, 137811 markings/sec, 60 secs
lola: 10337872 markings, 25380485 edges, 137920 markings/sec, 65 secs
lola: 11029859 markings, 27129514 edges, 138397 markings/sec, 70 secs
lola: 11740397 markings, 28834098 edges, 142108 markings/sec, 75 secs
lola: 12460505 markings, 30574413 edges, 144022 markings/sec, 80 secs
lola: 13165717 markings, 32290668 edges, 141042 markings/sec, 85 secs
lola: 13871902 markings, 33986110 edges, 141237 markings/sec, 90 secs
lola: 14555494 markings, 35664296 edges, 136718 markings/sec, 95 secs
lola: 15249900 markings, 37370285 edges, 138881 markings/sec, 100 secs
lola: 15912433 markings, 39063115 edges, 132507 markings/sec, 105 secs
lola: 16612824 markings, 40851668 edges, 140078 markings/sec, 110 secs
lola: 17395677 markings, 42751804 edges, 156571 markings/sec, 115 secs
lola: 18181562 markings, 44654689 edges, 157177 markings/sec, 120 secs
lola: 18902525 markings, 46532360 edges, 144193 markings/sec, 125 secs
lola: 19658919 markings, 48403024 edges, 151279 markings/sec, 130 secs
lola: 20406351 markings, 50243977 edges, 149486 markings/sec, 135 secs
lola: 21174060 markings, 52084144 edges, 153542 markings/sec, 140 secs
lola: 21929671 markings, 53879402 edges, 151122 markings/sec, 145 secs
lola: 22638146 markings, 55590186 edges, 141695 markings/sec, 150 secs
lola: 23353925 markings, 57354137 edges, 143156 markings/sec, 155 secs
lola: 24074806 markings, 59153739 edges, 144176 markings/sec, 160 secs
lola: 24780023 markings, 60899959 edges, 141043 markings/sec, 165 secs
lola: 25472048 markings, 62604691 edges, 138405 markings/sec, 170 secs
lola: 26138980 markings, 64320635 edges, 133386 markings/sec, 175 secs
lola: 26821339 markings, 66050167 edges, 136472 markings/sec, 180 secs
lola: 27480202 markings, 67766273 edges, 131773 markings/sec, 185 secs
lola: 28124584 markings, 69475394 edges, 128876 markings/sec, 190 secs
lola: 28818250 markings, 71165293 edges, 138733 markings/sec, 195 secs
lola: 29524714 markings, 72835394 edges, 141293 markings/sec, 200 secs
lola: 30187846 markings, 74480411 edges, 132626 markings/sec, 205 secs
lola: 30847346 markings, 76122422 edges, 131900 markings/sec, 210 secs
lola: 31507914 markings, 77773698 edges, 132114 markings/sec, 215 secs
lola: 32133106 markings, 79383947 edges, 125038 markings/sec, 220 secs
lola: 32818403 markings, 81023695 edges, 137059 markings/sec, 225 secs
lola: 33473491 markings, 82691046 edges, 131018 markings/sec, 230 secs
lola: 34101422 markings, 84324636 edges, 125586 markings/sec, 235 secs
lola: 34795520 markings, 86005388 edges, 138820 markings/sec, 240 secs
lola: 35488020 markings, 87667989 edges, 138500 markings/sec, 245 secs
lola: 36141645 markings, 89282111 edges, 130725 markings/sec, 250 secs
lola: 36816985 markings, 90951689 edges, 135068 markings/sec, 255 secs
lola: 37478428 markings, 92564911 edges, 132289 markings/sec, 260 secs
lola: 38145867 markings, 94223982 edges, 133488 markings/sec, 265 secs
lola: 38773676 markings, 95836748 edges, 125562 markings/sec, 270 secs
lola: 39436919 markings, 97455541 edges, 132649 markings/sec, 275 secs
lola: 40097375 markings, 99068793 edges, 132091 markings/sec, 280 secs
lola: 40752659 markings, 100648869 edges, 131057 markings/sec, 285 secs
lola: 41394525 markings, 102232496 edges, 128373 markings/sec, 290 secs
lola: 42048063 markings, 103836483 edges, 130708 markings/sec, 295 secs
lola: 42710978 markings, 105472057 edges, 132583 markings/sec, 300 secs
lola: 43401159 markings, 107119000 edges, 138036 markings/sec, 305 secs
lola: 44075355 markings, 108738406 edges, 134839 markings/sec, 310 secs
lola: 44706816 markings, 110301846 edges, 126292 markings/sec, 315 secs
lola: 45340382 markings, 111889405 edges, 126713 markings/sec, 320 secs
lola: 45978310 markings, 113490818 edges, 127586 markings/sec, 325 secs
lola: 46636068 markings, 115083615 edges, 131552 markings/sec, 330 secs
lola: 47288472 markings, 116715810 edges, 130481 markings/sec, 335 secs
lola: 47925205 markings, 118330735 edges, 127347 markings/sec, 340 secs
lola: 48539287 markings, 119909797 edges, 122816 markings/sec, 345 secs
lola: 49173685 markings, 121499910 edges, 126880 markings/sec, 350 secs
lola: 49861338 markings, 123148281 edges, 137531 markings/sec, 355 secs
lola: 50511507 markings, 124756230 edges, 130034 markings/sec, 360 secs
lola: 51188511 markings, 126378409 edges, 135401 markings/sec, 365 secs
lola: 51839395 markings, 127983831 edges, 130177 markings/sec, 370 secs
lola: 52506109 markings, 129634118 edges, 133343 markings/sec, 375 secs
lola: 53128697 markings, 131248397 edges, 124518 markings/sec, 380 secs
lola: 53784776 markings, 132833386 edges, 131216 markings/sec, 385 secs
lola: 54388918 markings, 134351243 edges, 120828 markings/sec, 390 secs
lola: 54966158 markings, 135860430 edges, 115448 markings/sec, 395 secs
lola: 55573545 markings, 137415514 edges, 121477 markings/sec, 400 secs
lola: 56120584 markings, 138876236 edges, 109408 markings/sec, 405 secs
lola: 56740147 markings, 140458218 edges, 123913 markings/sec, 410 secs
lola: 57344075 markings, 141980526 edges, 120786 markings/sec, 415 secs
lola: 57928546 markings, 143484872 edges, 116894 markings/sec, 420 secs
lola: 58560374 markings, 145002242 edges, 126366 markings/sec, 425 secs
lola: 59179737 markings, 146508286 edges, 123873 markings/sec, 430 secs
lola: 59789092 markings, 147992590 edges, 121871 markings/sec, 435 secs
lola: 60399591 markings, 149475303 edges, 122100 markings/sec, 440 secs
lola: 61005561 markings, 151015550 edges, 121194 markings/sec, 445 secs
lola: 61572709 markings, 152504471 edges, 113430 markings/sec, 450 secs
lola: 62221562 markings, 154054587 edges, 129771 markings/sec, 455 secs
lola: 62830980 markings, 155530251 edges, 121884 markings/sec, 460 secs
lola: 63446359 markings, 156999357 edges, 123076 markings/sec, 465 secs
lola: 64074367 markings, 158508953 edges, 125602 markings/sec, 470 secs
lola: 64681823 markings, 160011284 edges, 121491 markings/sec, 475 secs
lola: 65303682 markings, 161522809 edges, 124372 markings/sec, 480 secs
lola: 65914547 markings, 163033745 edges, 122173 markings/sec, 485 secs
lola: 66534116 markings, 164581479 edges, 123914 markings/sec, 490 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (X (((((p267 <= 0) OR (p283 <= 0)) R X (((p307 <= 0) OR (p337 <= 0)))) R ((p308 <= 0) OR (p360 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (((((p267 <= 0) OR (p283 <= 0)) R X (((p307 <= 0) OR (p337 <= 0)))) R ((p308 <= 0) OR (p360 <= 0)))))
lola: processed formula length: 109
lola: 112 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: 691381 markings, 1876265 edges, 138276 markings/sec, 0 secs
lola: 1409778 markings, 3775444 edges, 143679 markings/sec, 5 secs
lola: 2139234 markings, 5677789 edges, 145891 markings/sec, 10 secs
lola: 2852866 markings, 7577896 edges, 142726 markings/sec, 15 secs
lola: 3636815 markings, 9438661 edges, 156790 markings/sec, 20 secs
lola: 4412648 markings, 11292035 edges, 155167 markings/sec, 25 secs
lola: 5194444 markings, 13147425 edges, 156359 markings/sec, 30 secs
lola: 5932688 markings, 14960358 edges, 147649 markings/sec, 35 secs
lola: 6685690 markings, 16805680 edges, 150600 markings/sec, 40 secs
lola: 7437116 markings, 18619540 edges, 150285 markings/sec, 45 secs
lola: 8159620 markings, 20410974 edges, 144501 markings/sec, 50 secs
lola: 8887010 markings, 22223701 edges, 145478 markings/sec, 55 secs
lola: 9609458 markings, 24027130 edges, 144490 markings/sec, 60 secs
lola: 10326850 markings, 25794392 edges, 143478 markings/sec, 65 secs
lola: 11091091 markings, 27651774 edges, 152848 markings/sec, 70 secs
lola: 11842696 markings, 29508866 edges, 150321 markings/sec, 75 secs
lola: 12611026 markings, 31364042 edges, 153666 markings/sec, 80 secs
lola: 13362043 markings, 33194956 edges, 150203 markings/sec, 85 secs
lola: 14129279 markings, 35026391 edges, 153447 markings/sec, 90 secs
lola: 14856427 markings, 36864053 edges, 145430 markings/sec, 95 secs
lola: 15534681 markings, 38693825 edges, 135651 markings/sec, 100 secs
lola: 16242683 markings, 40555634 edges, 141600 markings/sec, 105 secs
lola: 16986575 markings, 42389979 edges, 148778 markings/sec, 110 secs
lola: 17739165 markings, 44186752 edges, 150518 markings/sec, 115 secs
lola: 18440419 markings, 45938727 edges, 140251 markings/sec, 120 secs
lola: 19157886 markings, 47745824 edges, 143493 markings/sec, 125 secs
lola: 19882183 markings, 49524341 edges, 144859 markings/sec, 130 secs
lola: 20604120 markings, 51343950 edges, 144387 markings/sec, 135 secs
lola: 21358810 markings, 53215746 edges, 150938 markings/sec, 140 secs
lola: 22077205 markings, 55037368 edges, 143679 markings/sec, 145 secs
lola: 22800730 markings, 56802013 edges, 144705 markings/sec, 150 secs
lola: 23517542 markings, 58554899 edges, 143362 markings/sec, 155 secs
lola: 24255102 markings, 60325737 edges, 147512 markings/sec, 160 secs
lola: 24993026 markings, 62083966 edges, 147585 markings/sec, 165 secs
lola: 25719466 markings, 63841673 edges, 145288 markings/sec, 170 secs
lola: 26429504 markings, 65595529 edges, 142008 markings/sec, 175 secs
lola: 27171864 markings, 67365365 edges, 148472 markings/sec, 180 secs
lola: 27877774 markings, 69135388 edges, 141182 markings/sec, 185 secs
lola: 28575010 markings, 70908137 edges, 139447 markings/sec, 190 secs
lola: 29216093 markings, 72623469 edges, 128217 markings/sec, 195 secs
lola: 29860200 markings, 74362612 edges, 128821 markings/sec, 200 secs
lola: 30540632 markings, 76070497 edges, 136086 markings/sec, 205 secs
lola: 31263826 markings, 77838903 edges, 144639 markings/sec, 210 secs
lola: 31972013 markings, 79661644 edges, 141637 markings/sec, 215 secs
lola: 32744616 markings, 81473585 edges, 154521 markings/sec, 220 secs
lola: 33480406 markings, 83267985 edges, 147158 markings/sec, 225 secs
lola: 34207494 markings, 85067816 edges, 145418 markings/sec, 230 secs
lola: 34964679 markings, 86896453 edges, 151437 markings/sec, 235 secs
lola: 35713769 markings, 88715089 edges, 149818 markings/sec, 240 secs
lola: 36444830 markings, 90510000 edges, 146212 markings/sec, 245 secs
lola: 37170976 markings, 92282175 edges, 145229 markings/sec, 250 secs
lola: 37882951 markings, 94030281 edges, 142395 markings/sec, 255 secs
lola: 38610458 markings, 95803718 edges, 145501 markings/sec, 260 secs
lola: 39358502 markings, 97583296 edges, 149609 markings/sec, 265 secs
lola: 40088952 markings, 99376381 edges, 146090 markings/sec, 270 secs
lola: 40796344 markings, 101165143 edges, 141478 markings/sec, 275 secs
lola: 41517398 markings, 102922499 edges, 144211 markings/sec, 280 secs
lola: 42197943 markings, 104684629 edges, 136109 markings/sec, 285 secs
lola: 42886266 markings, 106488002 edges, 137665 markings/sec, 290 secs
lola: 43571111 markings, 108271280 edges, 136969 markings/sec, 295 secs
lola: 44221036 markings, 110049675 edges, 129985 markings/sec, 300 secs
lola: 44915143 markings, 111824593 edges, 138821 markings/sec, 305 secs
lola: 45643380 markings, 113589277 edges, 145647 markings/sec, 310 secs
lola: 46349008 markings, 115343620 edges, 141126 markings/sec, 315 secs
lola: 47048728 markings, 117091899 edges, 139944 markings/sec, 320 secs
lola: 47754902 markings, 118863267 edges, 141235 markings/sec, 325 secs
lola: 48523121 markings, 120666069 edges, 153644 markings/sec, 330 secs
lola: 49265716 markings, 122445044 edges, 148519 markings/sec, 335 secs
lola: 49982529 markings, 124174405 edges, 143363 markings/sec, 340 secs
lola: 50675957 markings, 125889500 edges, 138686 markings/sec, 345 secs
lola: 51349041 markings, 127556534 edges, 134617 markings/sec, 350 secs
lola: 52046136 markings, 129234713 edges, 139419 markings/sec, 355 secs
lola: 52744504 markings, 130941119 edges, 139674 markings/sec, 360 secs
lola: 53461757 markings, 132678861 edges, 143451 markings/sec, 365 secs
lola: 54190192 markings, 134388833 edges, 145687 markings/sec, 370 secs
lola: 54868018 markings, 136079459 edges, 135565 markings/sec, 375 secs
lola: 55517389 markings, 137783791 edges, 129874 markings/sec, 380 secs
lola: 56209829 markings, 139507449 edges, 138488 markings/sec, 385 secs
lola: 56880041 markings, 141205916 edges, 134042 markings/sec, 390 secs
lola: 57573203 markings, 142899977 edges, 138632 markings/sec, 395 secs
lola: 58265291 markings, 144614544 edges, 138418 markings/sec, 400 secs
lola: 58866833 markings, 146115768 edges, 120308 markings/sec, 405 secs
lola: 59494622 markings, 147717036 edges, 125558 markings/sec, 410 secs
lola: 60164227 markings, 149286699 edges, 133921 markings/sec, 415 secs
lola: 60813980 markings, 150851422 edges, 129951 markings/sec, 420 secs
lola: 61454222 markings, 152416312 edges, 128048 markings/sec, 425 secs
lola: 62099844 markings, 153998265 edges, 129124 markings/sec, 430 secs
lola: 62730892 markings, 155564062 edges, 126210 markings/sec, 435 secs
lola: 63385482 markings, 157165255 edges, 130918 markings/sec, 440 secs
lola: 64054825 markings, 158774159 edges, 133869 markings/sec, 445 secs
lola: 64671162 markings, 160272298 edges, 123267 markings/sec, 450 secs
lola: 65337473 markings, 161881131 edges, 133262 markings/sec, 455 secs
lola: 66011786 markings, 163497924 edges, 134863 markings/sec, 460 secs
lola: 66637700 markings, 165079635 edges, 125183 markings/sec, 465 secs
lola: 67277533 markings, 166746677 edges, 127967 markings/sec, 470 secs
lola: 67887596 markings, 168294922 edges, 122013 markings/sec, 475 secs
lola: 68513689 markings, 169824403 edges, 125219 markings/sec, 480 secs
lola: 69133684 markings, 171363474 edges, 123999 markings/sec, 485 secs
lola: 69791667 markings, 172940110 edges, 131597 markings/sec, 490 secs
lola: 70436039 markings, 174494287 edges, 128874 markings/sec, 495 secs
lola: 71046021 markings, 175920822 edges, 121996 markings/sec, 500 secs
lola: 71607489 markings, 177277770 edges, 112294 markings/sec, 505 secs
lola: 72236703 markings, 178804485 edges, 125843 markings/sec, 510 secs
lola: 72852625 markings, 180354072 edges, 123184 markings/sec, 515 secs
lola: 73328701 markings, 181587608 edges, 95215 markings/sec, 520 secs
lola: 73600319 markings, 182270645 edges, 54324 markings/sec, 525 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F (((1 <= p164) AND (1 <= p322))) OR ((1 <= p267) AND (1 <= p287)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p267) AND (1 <= p287))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p267) AND (1 <= p287))
lola: processed formula length: 29
lola: 112 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 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: ========================================
lola: ...considering subproblem: F (((1 <= p164) AND (1 <= p322)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p164 <= 0) OR (p322 <= 0))
lola: processed formula length: 29
lola: 114 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2 markings, 2 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no no no unknown no no no no no yes
lola:
preliminary result: no unknown no no no no no no unknown no no no no no yes
lola: memory consumption: 3508 KB
lola: time consumption: 1661 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="NoC3x3-PT-3A"
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 NoC3x3-PT-3A, 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 r174-csrt-158987853100362"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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