Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.5K Mar 26 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 660K 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 CloudReconfiguration-PT-304-00
FORMULA_NAME CloudReconfiguration-PT-304-01
FORMULA_NAME CloudReconfiguration-PT-304-02
FORMULA_NAME CloudReconfiguration-PT-304-03
FORMULA_NAME CloudReconfiguration-PT-304-04
FORMULA_NAME CloudReconfiguration-PT-304-05
FORMULA_NAME CloudReconfiguration-PT-304-06
FORMULA_NAME CloudReconfiguration-PT-304-07
FORMULA_NAME CloudReconfiguration-PT-304-08
FORMULA_NAME CloudReconfiguration-PT-304-09
FORMULA_NAME CloudReconfiguration-PT-304-10
FORMULA_NAME CloudReconfiguration-PT-304-11
FORMULA_NAME CloudReconfiguration-PT-304-12
FORMULA_NAME CloudReconfiguration-PT-304-13
FORMULA_NAME CloudReconfiguration-PT-304-14
FORMULA_NAME CloudReconfiguration-PT-304-15

=== Now, execution of the tool begins

BK_START 1591128428886

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 20:07:12] [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 20:07:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 20:07:12] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2020-06-02 20:07:12] [INFO ] Transformed 2584 places.
[2020-06-02 20:07:12] [INFO ] Transformed 3094 transitions.
[2020-06-02 20:07:12] [INFO ] Found NUPN structural information;
[2020-06-02 20:07:12] [INFO ] Parsed PT model containing 2584 places and 3094 transitions in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 178 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 792 resets, run finished after 827 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1]
// Phase 1: matrix 3094 rows 2584 cols
[2020-06-02 20:07:13] [INFO ] Computed 4 place invariants in 133 ms
[2020-06-02 20:07:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 139 ms returned sat
[2020-06-02 20:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:07:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:07:33] [INFO ] [Real]Absence check using state equation in 19037 ms returned (error "Failed to check-sat")
[2020-06-02 20:07:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-06-02 20:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:07:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:07:53] [INFO ] [Real]Absence check using state equation in 19092 ms returned unknown
[2020-06-02 20:07:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 133 ms returned sat
[2020-06-02 20:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:08:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:08:13] [INFO ] [Real]Absence check using state equation in 19383 ms returned (error "Failed to check-sat")
[2020-06-02 20:08:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 138 ms returned sat
[2020-06-02 20:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:08:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:08:33] [INFO ] [Real]Absence check using state equation in 19374 ms returned (error "Failed to check-sat")
[2020-06-02 20:08:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 132 ms returned sat
[2020-06-02 20:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:08:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:08:53] [INFO ] [Real]Absence check using state equation in 19057 ms returned (error "Failed to check-sat")
[2020-06-02 20:08:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-02 20:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:09:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:09:14] [INFO ] [Real]Absence check using state equation in 19395 ms returned (error "Failed to check-sat")
[2020-06-02 20:09:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 20:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:09:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:09:34] [INFO ] [Real]Absence check using state equation in 19420 ms returned unknown
[2020-06-02 20:09:34] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:09:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:09:54] [INFO ] [Real]Absence check using state equation in 19391 ms returned (error "Failed to check-sat")
[2020-06-02 20:09:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 118 ms returned sat
[2020-06-02 20:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:10:14] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:10:14] [INFO ] [Real]Absence check using state equation in 19451 ms returned (error "Failed to check-sat")
[2020-06-02 20:10:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 20:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:10:20] [INFO ] [Real]Absence check using state equation in 5404 ms returned unsat
[2020-06-02 20:10:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-02 20:10:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:10:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:10:40] [INFO ] [Real]Absence check using state equation in 19406 ms returned unknown
[2020-06-02 20:10:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 119 ms returned sat
[2020-06-02 20:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:11:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:11:00] [INFO ] [Real]Absence check using state equation in 19225 ms returned (error "Failed to check-sat")
[2020-06-02 20:11:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 117 ms returned sat
[2020-06-02 20:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:11:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:11:20] [INFO ] [Real]Absence check using state equation in 19263 ms returned (error "Failed to check-sat")
[2020-06-02 20:11:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:11:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:11:40] [INFO ] [Real]Absence check using state equation in 19426 ms returned unknown
[2020-06-02 20:11:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 126 ms returned sat
[2020-06-02 20:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:12:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:12:00] [INFO ] [Real]Absence check using state equation in 19399 ms returned (error "Failed to check-sat")
[2020-06-02 20:12:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:12:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:12:20] [INFO ] [Real]Absence check using state equation in 19376 ms returned unknown
[2020-06-02 20:12:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 20:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:12:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:12:40] [INFO ] [Real]Absence check using state equation in 19406 ms returned (error "Failed to check-sat")
[2020-06-02 20:12:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 113 ms returned sat
[2020-06-02 20:12:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:13:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:13:00] [INFO ] [Real]Absence check using state equation in 19420 ms returned (error "Failed to check-sat")
[2020-06-02 20:13:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 179 ms returned sat
[2020-06-02 20:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:13:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:13:20] [INFO ] [Real]Absence check using state equation in 18876 ms returned unknown
[2020-06-02 20:13:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:13:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:13:40] [INFO ] [Real]Absence check using state equation in 19465 ms returned (error "Failed to check-sat")
[2020-06-02 20:13:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 115 ms returned sat
[2020-06-02 20:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:14:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:14:00] [INFO ] [Real]Absence check using state equation in 19418 ms returned (error "Failed to check-sat")
[2020-06-02 20:14:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:14:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:14:20] [INFO ] [Real]Absence check using state equation in 19152 ms returned (error "Failed to check-sat")
[2020-06-02 20:14:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 114 ms returned sat
[2020-06-02 20:14:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:14:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:14:40] [INFO ] [Real]Absence check using state equation in 19438 ms returned unknown
[2020-06-02 20:14:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 123 ms returned sat
[2020-06-02 20:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:15:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:15:00] [INFO ] [Real]Absence check using state equation in 19425 ms returned (error "Failed to check-sat")
[2020-06-02 20:15:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 124 ms returned sat
[2020-06-02 20:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:15:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:15:20] [INFO ] [Real]Absence check using state equation in 19533 ms returned (error "Failed to check-sat")
[2020-06-02 20:15:21] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 20:15:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:15:40] [INFO ] [Real]Absence check using state equation in 19472 ms returned (error "Solver has unexpectedly terminated")
[2020-06-02 20:15:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 116 ms returned sat
[2020-06-02 20:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 20:16:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 20:16:00] [INFO ] [Real]Absence check using state equation in 19441 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-02 20:16:01] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-02 20:16:01] [INFO ] Flatten gal took : 476 ms
FORMULA CloudReconfiguration-PT-304-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudReconfiguration-PT-304-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-02 20:16:01] [INFO ] Applying decomposition
[2020-06-02 20:16:02] [INFO ] Flatten gal took : 226 ms
[2020-06-02 20:16:02] [INFO ] Decomposing Gal with order
[2020-06-02 20:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-02 20:16:03] [INFO ] Removed a total of 122 redundant transitions.
[2020-06-02 20:16:03] [INFO ] Flatten gal took : 422 ms
[2020-06-02 20:16:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 336 labels/synchronizations in 38 ms.
[2020-06-02 20:16:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 16 ms.
[2020-06-02 20:16:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 97 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ CloudReconfiguration-PT-304 @ 3570 seconds

FORMULA CloudReconfiguration-PT-304-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA CloudReconfiguration-PT-304-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudReconfiguration-PT-304-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2491
rslt: Output for LTLFireability @ CloudReconfiguration-PT-304

{
"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 20:16:04 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 316
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (X (G ((F (G ((((1 <= p2302)) OR (G (((1 <= p79))) AND F (((1 <= p2302))))))) AND ((1 <= p2355))))))",
"processed_size": 102,
"rewrites": 91
},
"result":
{
"edges": 70,
"markings": 70,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 351
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "(F ((((p1549 <= 0)) R ((p1675 <= 0)))) U (X (((1 <= p1675))) OR F (G (((p1190 <= 0))))))",
"processed_size": 88,
"rewrites": 91
},
"result":
{
"edges": 4095328,
"markings": 1124167,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 380
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F (G ((X (((1 <= p916))) AND (X (F (((1 <= p1896)))) OR ((1 <= p916))))))",
"processed_size": 73,
"rewrites": 91
},
"result":
{
"edges": 74,
"markings": 72,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 434
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G (F (((1 <= p1001)))) AND X (((1 <= p2204)))))",
"processed_size": 51,
"rewrites": 91
},
"result":
{
"edges": 65,
"markings": 65,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 507
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 608
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F (((1 <= p838))))",
"processed_size": 21,
"rewrites": 91
},
"result":
{
"edges": 115,
"markings": 115,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"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": 760
},
"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": "F (G (((1 <= p1908) AND (1 <= p2575))))",
"processed_size": 39,
"rewrites": 91
},
"result":
{
"edges": 68,
"markings": 67,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1516
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((G (((p1409 <= 0))) AND ((p965 <= 0))))",
"processed_size": 42,
"rewrites": 91
},
"result":
{
"edges": 14517,
"markings": 9218,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 10,
"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": 3032
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 2,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((F (((1 <= p1957))) AND (((p637 <= 0)) AND ((1 <= p1957)))) U (F (((1 <= p2492))) U ((1 <= p2492))))",
"processed_size": 101,
"rewrites": 91
},
"result":
{
"edges": 115,
"markings": 115,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 6,
"G": 3,
"U": 0,
"X": 1,
"aconj": 7,
"adisj": 0,
"aneg": 1,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183)))))) OR (G (F (((p816 <= 0)))) AND F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183))))))))))",
"processed_size": 172,
"rewrites": 91
},
"result":
{
"edges": 19256510,
"markings": 3120488,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 29
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 98320,
"runtime": 1079.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(*) OR F(*))) : X(F((F(G((F(**) AND (** OR **)))) OR (G(F(*)) AND F(G((F(**) AND (** OR **)))))))) : G(F(**)) : X(X(G((F(G((** OR (G(**) AND F(**))))) AND **)))) : (F((* R *)) U (X(**) OR F(G(**)))) : F(G(**)) : G(**) : G((G(*) AND *)) : ((F(**) AND (** AND **)) U (F(**) U **)) : F(G((X(**) AND (X(F(**)) OR **)))) : X((G(F(**)) AND X(**))) : (X(((X(F(**)) U **) OR (** OR **))) OR **)"
},
"net":
{
"arcs": 6459,
"conflict_clusters": 2448,
"places": 2584,
"places_significant": 2580,
"singleton_clusters": 0,
"transitions": 3094
},
"result":
{
"preliminary_value": "yes no no no no no no no no no no yes ",
"value": "yes no no no no no no no no no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5678/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2584
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 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: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1073 <= 1)
lola: LP says that atomic proposition is always true: (p572 <= 1)
lola: LP says that atomic proposition is always true: (p1073 <= 1)
lola: LP says that atomic proposition is always true: (p20 <= 1)
lola: LP says that atomic proposition is always true: (p816 <= 1)
lola: LP says that atomic proposition is always true: (p1095 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p838 <= 1)
lola: LP says that atomic proposition is always true: (p79 <= 1)
lola: LP says that atomic proposition is always true: (p2302 <= 1)
lola: LP says that atomic proposition is always true: (p2355 <= 1)
lola: LP says that atomic proposition is always true: (p1675 <= 1)
lola: LP says that atomic proposition is always true: (p1549 <= 1)
lola: LP says that atomic proposition is always true: (p1675 <= 1)
lola: LP says that atomic proposition is always true: (p1675 <= 1)
lola: LP says that atomic proposition is always true: (p1190 <= 1)
lola: LP says that atomic proposition is always true: (p1908 <= 1)
lola: LP says that atomic proposition is always true: (p2575 <= 1)
lola: LP says that atomic proposition is always true: (p1137 <= 1)
lola: LP says that atomic proposition is always true: (p1409 <= 1)
lola: LP says that atomic proposition is always true: (p794 <= 1)
lola: LP says that atomic proposition is always true: (p1409 <= 1)
lola: LP says that atomic proposition is always true: (p965 <= 1)
lola: LP says that atomic proposition is always true: (p1957 <= 1)
lola: LP says that atomic proposition is always true: (p637 <= 1)
lola: LP says that atomic proposition is always true: (p1957 <= 1)
lola: LP says that atomic proposition is always true: (p2492 <= 1)
lola: LP says that atomic proposition is always true: (p2492 <= 1)
lola: LP says that atomic proposition is always true: (p916 <= 1)
lola: LP says that atomic proposition is always true: (p1896 <= 1)
lola: LP says that atomic proposition is always true: (p916 <= 1)
lola: LP says that atomic proposition is always true: (p1001 <= 1)
lola: LP says that atomic proposition is always true: (p1001 <= 1)
lola: LP says that atomic proposition is always true: (p2204 <= 1)
lola: LP says that atomic proposition is always true: (p2242 <= 1)
lola: LP says that atomic proposition is always true: (p2559 <= 1)
lola: LP says that atomic proposition is always true: (p2485 <= 1)
lola: LP says that atomic proposition is always true: (p1576 <= 1)
lola: LP says that atomic proposition is always true: (p2242 <= 1)
lola: X ((NOT(F ((F (((1 <= p572) AND (1 <= p1073))) U ((p572 <= 0) OR (p1073 <= 0))))) OR NOT(G (((1 <= p20)))))) : F (X ((G (NOT(G (((1 <= p816))))) U F (X (F (G (X ((((1 <= p1095)) U ((1 <= p183))))))))))) : G (F (((1 <= p838)))) : NOT(X (NOT(X (G ((F (X (G ((G (((1 <= p79))) U ((1 <= p2302)))))) AND ((1 <= p2355)))))))) : (F ((((1 <= p1675)) U NOT((((1 <= p1549)) U ((1 <= p1675)))))) U (X (((1 <= p1675))) OR F (G (((p1190 <= 0)))))) : F (G (X (((1 <= p1908) AND (1 <= p2575))))) : G (((p1137 <= 0))) : NOT(((X (NOT(X (((1 <= p1409))))) AND G (((1 <= p794)))) U F ((F (((1 <= p1409))) OR ((1 <= p965)))))) : (((F (((1 <= p1957))) AND ((p637 <= 0))) AND ((1 <= p1957))) U (F (((1 <= p2492))) U ((1 <= p2492)))) : NOT(F (G (NOT(X (X (G ((X (((1 <= p916))) AND (X (F (((1 <= p1896)))) OR ((1 <= p916))))))))))) : X ((G ((((1 <= p1001)) U F (((1 <= p1001))))) AND X (((1 <= p2204))))) : (X ((((X (F (((1 <= p2242)))) U ((1 <= p2559))) OR ((p2485 <= 0))) OR ((1 <= p1576)))) OR ((1 <= p2242)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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: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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p572) AND (1 <= p1073))) OR F (((p20 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p572) AND (1 <= p1073))) OR F (((p20 <= 0)))))
lola: processed formula length: 60
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183)))))) OR (G (F (((p816 <= 0)))) AND F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183)))))) OR (G (F (((p816 <= 0)))) AND F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183))))))))))
lola: processed formula length: 172
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 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: 55420 markings, 177892 edges, 11084 markings/sec, 0 secs
lola: 88878 markings, 357653 edges, 6692 markings/sec, 5 secs
lola: 116933 markings, 540492 edges, 5611 markings/sec, 10 secs
lola: 144718 markings, 722787 edges, 5557 markings/sec, 15 secs
lola: 172093 markings, 905537 edges, 5475 markings/sec, 20 secs
lola: 198187 markings, 1088954 edges, 5219 markings/sec, 25 secs
lola: 242538 markings, 1267312 edges, 8870 markings/sec, 30 secs
lola: 295728 markings, 1444345 edges, 10638 markings/sec, 35 secs
lola: 344754 markings, 1621579 edges, 9805 markings/sec, 40 secs
lola: 377274 markings, 1802755 edges, 6504 markings/sec, 45 secs
lola: 402715 markings, 1984405 edges, 5088 markings/sec, 50 secs
lola: 430830 markings, 2167075 edges, 5623 markings/sec, 55 secs
lola: 454761 markings, 2348323 edges, 4786 markings/sec, 60 secs
lola: 487509 markings, 2525858 edges, 6550 markings/sec, 65 secs
lola: 512235 markings, 2703951 edges, 4945 markings/sec, 70 secs
lola: 539793 markings, 2886525 edges, 5512 markings/sec, 75 secs
lola: 569614 markings, 3066649 edges, 5964 markings/sec, 80 secs
lola: 595693 markings, 3245961 edges, 5216 markings/sec, 85 secs
lola: 628913 markings, 3423997 edges, 6644 markings/sec, 90 secs
lola: 670841 markings, 3601545 edges, 8386 markings/sec, 95 secs
lola: 723306 markings, 3776067 edges, 10493 markings/sec, 100 secs
lola: 774109 markings, 3950450 edges, 10161 markings/sec, 105 secs
lola: 808272 markings, 4127981 edges, 6833 markings/sec, 110 secs
lola: 831244 markings, 4308055 edges, 4594 markings/sec, 115 secs
lola: 859234 markings, 4485430 edges, 5598 markings/sec, 120 secs
lola: 888983 markings, 4663802 edges, 5950 markings/sec, 125 secs
lola: 915730 markings, 4842960 edges, 5349 markings/sec, 130 secs
lola: 940302 markings, 5022503 edges, 4914 markings/sec, 135 secs
lola: 968120 markings, 5201287 edges, 5564 markings/sec, 140 secs
lola: 997758 markings, 5379738 edges, 5928 markings/sec, 145 secs
lola: 1022193 markings, 5558161 edges, 4887 markings/sec, 150 secs
lola: 1073353 markings, 5732747 edges, 10232 markings/sec, 155 secs
lola: 1127151 markings, 5907088 edges, 10760 markings/sec, 160 secs
lola: 1171666 markings, 6083528 edges, 8903 markings/sec, 165 secs
lola: 1206020 markings, 6261614 edges, 6871 markings/sec, 170 secs
lola: 1237497 markings, 6440780 edges, 6295 markings/sec, 175 secs
lola: 1260276 markings, 6620606 edges, 4556 markings/sec, 180 secs
lola: 1284886 markings, 6800272 edges, 4922 markings/sec, 185 secs
lola: 1312156 markings, 6981130 edges, 5454 markings/sec, 190 secs
lola: 1345514 markings, 7159783 edges, 6672 markings/sec, 195 secs
lola: 1375316 markings, 7339454 edges, 5960 markings/sec, 200 secs
lola: 1399265 markings, 7518708 edges, 4790 markings/sec, 205 secs
lola: 1418934 markings, 7700199 edges, 3934 markings/sec, 210 secs
lola: 1451936 markings, 7875932 edges, 6600 markings/sec, 215 secs
lola: 1485142 markings, 8054176 edges, 6641 markings/sec, 220 secs
lola: 1518861 markings, 8232731 edges, 6744 markings/sec, 225 secs
lola: 1559276 markings, 8408885 edges, 8083 markings/sec, 230 secs
lola: 1595481 markings, 8585959 edges, 7241 markings/sec, 235 secs
lola: 1616810 markings, 8766320 edges, 4266 markings/sec, 240 secs
lola: 1637852 markings, 8946666 edges, 4208 markings/sec, 245 secs
lola: 1657829 markings, 9127397 edges, 3995 markings/sec, 250 secs
lola: 1679386 markings, 9307644 edges, 4311 markings/sec, 255 secs
lola: 1700821 markings, 9487415 edges, 4287 markings/sec, 260 secs
lola: 1720623 markings, 9668311 edges, 3960 markings/sec, 265 secs
lola: 1747482 markings, 9846141 edges, 5372 markings/sec, 270 secs
lola: 1790059 markings, 10023695 edges, 8515 markings/sec, 275 secs
lola: 1833054 markings, 10201856 edges, 8599 markings/sec, 280 secs
lola: 1868167 markings, 10378849 edges, 7023 markings/sec, 285 secs
lola: 1893096 markings, 10559844 edges, 4986 markings/sec, 290 secs
lola: 1911818 markings, 10740990 edges, 3744 markings/sec, 295 secs
lola: 1933482 markings, 10922906 edges, 4333 markings/sec, 300 secs
lola: 1955796 markings, 11106052 edges, 4463 markings/sec, 305 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 360216 KB
lola: time consumption: 410 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 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F (G ((((1 <= p2302)) OR (G (((1 <= p79))) AND F (((1 <= p2302))))))) AND ((1 <= p2355))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F (G ((((1 <= p2302)) OR (G (((1 <= p79))) AND F (((1 <= p2302))))))) AND ((1 <= p2355))))))
lola: processed formula length: 102
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 70 markings, 70 edges
lola: ========================================
lola: subprocess 3 will run for 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((((p1549 <= 0)) R ((p1675 <= 0)))) U (X (((1 <= p1675))) OR F (G (((p1190 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((((p1549 <= 0)) R ((p1675 <= 0)))) U (X (((1 <= p1675))) OR F (G (((p1190 <= 0))))))
lola: processed formula length: 88
lola: 91 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: 54848 markings, 175564 edges, 10970 markings/sec, 0 secs
lola: 109432 markings, 343328 edges, 10917 markings/sec, 5 secs
lola: 161728 markings, 518120 edges, 10459 markings/sec, 10 secs
lola: 211670 markings, 691710 edges, 9988 markings/sec, 15 secs
lola: 266796 markings, 863485 edges, 11025 markings/sec, 20 secs
lola: 321410 markings, 1035552 edges, 10923 markings/sec, 25 secs
lola: 376650 markings, 1208157 edges, 11048 markings/sec, 30 secs
lola: 431143 markings, 1382441 edges, 10899 markings/sec, 35 secs
lola: 478313 markings, 1557823 edges, 9434 markings/sec, 40 secs
lola: 527339 markings, 1732449 edges, 9805 markings/sec, 45 secs
lola: 568620 markings, 1908815 edges, 8256 markings/sec, 50 secs
lola: 613212 markings, 2084538 edges, 8918 markings/sec, 55 secs
lola: 652805 markings, 2261914 edges, 7919 markings/sec, 60 secs
lola: 693138 markings, 2438956 edges, 8067 markings/sec, 65 secs
lola: 735149 markings, 2614029 edges, 8402 markings/sec, 70 secs
lola: 776652 markings, 2789907 edges, 8301 markings/sec, 75 secs
lola: 820223 markings, 2965464 edges, 8714 markings/sec, 80 secs
lola: 858369 markings, 3141128 edges, 7629 markings/sec, 85 secs
lola: 906320 markings, 3316600 edges, 9590 markings/sec, 90 secs
lola: 946385 markings, 3492993 edges, 8013 markings/sec, 95 secs
lola: 981682 markings, 3670044 edges, 7059 markings/sec, 100 secs
lola: 1030098 markings, 3843277 edges, 9683 markings/sec, 105 secs
lola: 1083363 markings, 3999699 edges, 10653 markings/sec, 110 secs
lola: add low 1688
lola: add low 586
lola: add low 587
lola: add low 588
lola: add low 589
lola: add low 590
lola: add low 591
lola: add low 592
lola: add low 593
lola: add low 1836
lola: add low 1837
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: 1124167 markings, 4095328 edges
lola: ========================================
lola: subprocess 4 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X (((1 <= p916))) AND (X (F (((1 <= p1896)))) OR ((1 <= p916))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X (((1 <= p916))) AND (X (F (((1 <= p1896)))) OR ((1 <= p916))))))
lola: processed formula length: 73
lola: 91 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: 72 markings, 74 edges
lola: ========================================
lola: subprocess 5 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F (((1 <= p1001)))) AND X (((1 <= p2204)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F (((1 <= p1001)))) AND X (((1 <= p2204)))))
lola: processed formula length: 51
lola: 91 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: 65 markings, 65 edges
lola: ========================================
lola: subprocess 6 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((X (F (((1 <= p2242)))) U ((1 <= p2559))) OR (((p2485 <= 0)) OR ((1 <= p1576))))) OR ((1 <= p2242)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2242))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2242))
lola: processed formula length: 14
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (F (((1 <= p2242)))) U ((1 <= p2559))) OR (((p2485 <= 0)) OR ((1 <= p1576)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (F (((1 <= p2242)))) U ((1 <= p2559))) OR (((p2485 <= 0)) OR ((1 <= p1576)))))
lola: processed formula length: 85
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((1 <= p838))))
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 <= p838))))
lola: processed formula length: 21
lola: 91 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: 115 markings, 115 edges
lola: ========================================
lola: subprocess 8 will run for 760 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p1908) AND (1 <= p2575))))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((1 <= p1908) AND (1 <= p2575))))
lola: processed formula length: 39
lola: 91 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: 67 markings, 68 edges
lola: ========================================
lola: subprocess 9 will run for 1014 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p1137 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p1137 <= 0)))
lola: processed formula length: 18
lola: 91 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: 58947 markings, 158254 edges, 11789 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 106801 markings, 284477 edges
lola: ========================================
lola: subprocess 10 will run for 1516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (((p1409 <= 0))) AND ((p965 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (((p1409 <= 0))) AND ((p965 <= 0))))
lola: processed formula length: 42
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9218 markings, 14517 edges
lola: ========================================
lola: subprocess 11 will run for 3032 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((1 <= p1957))) AND (((p637 <= 0)) AND ((1 <= p1957)))) U (F (((1 <= p2492))) U ((1 <= p2492))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F (((1 <= p1957))) AND (((p637 <= 0)) AND ((1 <= p1957)))) U (F (((1 <= p2492))) U ((1 <= p2492))))
lola: processed formula length: 101
lola: 91 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: 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: 115 markings, 115 edges
lola: lola: ========================================
========================================
lola: ...considering subproblem: X (F ((F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183)))))) OR (G (F (((p816 <= 0)))) AND F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183)))))) OR (G (F (((p816 <= 0)))) AND F (G ((F (((1 <= p183))) AND (((1 <= p1095)) OR ((1 <= p183))))))))))
lola: processed formula length: 172
lola: 91 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 29 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: 53667 markings, 171155 edges, 10733 markings/sec, 0 secs
lola: 87351 markings, 348869 edges, 6737 markings/sec, 5 secs
lola: 114815 markings, 525890 edges, 5493 markings/sec, 10 secs
lola: 142095 markings, 706538 edges, 5456 markings/sec, 15 secs
lola: 168843 markings, 886493 edges, 5350 markings/sec, 20 secs
lola: 196515 markings, 1064973 edges, 5534 markings/sec, 25 secs
lola: 232402 markings, 1239983 edges, 7177 markings/sec, 30 secs
lola: 287493 markings, 1415909 edges, 11018 markings/sec, 35 secs
lola: 338062 markings, 1592576 edges, 10114 markings/sec, 40 secs
lola: 372183 markings, 1773351 edges, 6824 markings/sec, 45 secs
lola: 398044 markings, 1954094 edges, 5172 markings/sec, 50 secs
lola: 426028 markings, 2136899 edges, 5597 markings/sec, 55 secs
lola: 451761 markings, 2317975 edges, 5147 markings/sec, 60 secs
lola: 481731 markings, 2498733 edges, 5994 markings/sec, 65 secs
lola: 507823 markings, 2679082 edges, 5218 markings/sec, 70 secs
lola: 536364 markings, 2860742 edges, 5708 markings/sec, 75 secs
lola: 563898 markings, 3041859 edges, 5507 markings/sec, 80 secs
lola: 590085 markings, 3221364 edges, 5237 markings/sec, 85 secs
lola: 624902 markings, 3398402 edges, 6963 markings/sec, 90 secs
lola: 660788 markings, 3575597 edges, 7177 markings/sec, 95 secs
lola: 715435 markings, 3747990 edges, 10929 markings/sec, 100 secs
lola: 768730 markings, 3921011 edges, 10659 markings/sec, 105 secs
lola: 801891 markings, 4097908 edges, 6632 markings/sec, 110 secs
lola: 826501 markings, 4276423 edges, 4922 markings/sec, 115 secs
lola: 853605 markings, 4455142 edges, 5421 markings/sec, 120 secs
lola: 882956 markings, 4632677 edges, 5870 markings/sec, 125 secs
lola: 908866 markings, 4810366 edges, 5182 markings/sec, 130 secs
lola: 934144 markings, 4988516 edges, 5056 markings/sec, 135 secs
lola: 962772 markings, 5166830 edges, 5726 markings/sec, 140 secs
lola: 992537 markings, 5344682 edges, 5953 markings/sec, 145 secs
lola: 1014726 markings, 5522717 edges, 4438 markings/sec, 150 secs
lola: 1060209 markings, 5695699 edges, 9097 markings/sec, 155 secs
lola: 1115548 markings, 5870497 edges, 11068 markings/sec, 160 secs
lola: 1162882 markings, 6045850 edges, 9467 markings/sec, 165 secs
lola: 1198627 markings, 6224918 edges, 7149 markings/sec, 170 secs
lola: 1228723 markings, 6405033 edges, 6019 markings/sec, 175 secs
lola: 1254975 markings, 6584270 edges, 5250 markings/sec, 180 secs
lola: 1279950 markings, 6763336 edges, 4995 markings/sec, 185 secs
lola: 1304863 markings, 6944520 edges, 4983 markings/sec, 190 secs
lola: 1339145 markings, 7122859 edges, 6856 markings/sec, 195 secs
lola: 1371203 markings, 7301610 edges, 6412 markings/sec, 200 secs
lola: 1392673 markings, 7481335 edges, 4294 markings/sec, 205 secs
lola: 1417208 markings, 7660960 edges, 4907 markings/sec, 210 secs
lola: 1444240 markings, 7838446 edges, 5406 markings/sec, 215 secs
lola: 1477372 markings, 8015620 edges, 6626 markings/sec, 220 secs
lola: 1510792 markings, 8194136 edges, 6684 markings/sec, 225 secs
lola: 1550693 markings, 8371017 edges, 7980 markings/sec, 230 secs
lola: 1590111 markings, 8546758 edges, 7884 markings/sec, 235 secs
lola: 1611794 markings, 8725826 edges, 4337 markings/sec, 240 secs
lola: 1633173 markings, 8905288 edges, 4276 markings/sec, 245 secs
lola: 1653442 markings, 9085624 edges, 4054 markings/sec, 250 secs
lola: 1673914 markings, 9264639 edges, 4094 markings/sec, 255 secs
lola: 1695467 markings, 9442789 edges, 4311 markings/sec, 260 secs
lola: 1716294 markings, 9623339 edges, 4165 markings/sec, 265 secs
lola: 1739044 markings, 9800656 edges, 4550 markings/sec, 270 secs
lola: 1783452 markings, 9977717 edges, 8882 markings/sec, 275 secs
lola: 1821007 markings, 10155196 edges, 7511 markings/sec, 280 secs
lola: 1860369 markings, 10331724 edges, 7872 markings/sec, 285 secs
lola: 1886385 markings, 10512928 edges, 5203 markings/sec, 290 secs
lola: 1907433 markings, 10694549 edges, 4210 markings/sec, 295 secs
lola: 1928748 markings, 10875355 edges, 4263 markings/sec, 300 secs
lola: 1950407 markings, 11058952 edges, 4332 markings/sec, 305 secs
lola: 1972853 markings, 11238510 edges, 4489 markings/sec, 310 secs
lola: 1990352 markings, 11419532 edges, 3500 markings/sec, 315 secs
lola: 2015139 markings, 11600560 edges, 4957 markings/sec, 320 secs
lola: 2033957 markings, 11781045 edges, 3764 markings/sec, 325 secs
lola: 2055377 markings, 11962912 edges, 4284 markings/sec, 330 secs
lola: 2077437 markings, 12145393 edges, 4412 markings/sec, 335 secs
lola: 2096669 markings, 12325718 edges, 3846 markings/sec, 340 secs
lola: 2119540 markings, 12503295 edges, 4574 markings/sec, 345 secs
lola: 2145536 markings, 12681531 edges, 5199 markings/sec, 350 secs
lola: 2171538 markings, 12861919 edges, 5200 markings/sec, 355 secs
lola: 2211921 markings, 13037430 edges, 8077 markings/sec, 360 secs
lola: 2251448 markings, 13213353 edges, 7905 markings/sec, 365 secs
lola: 2292632 markings, 13388560 edges, 8237 markings/sec, 370 secs
lola: 2319456 markings, 13566559 edges, 5365 markings/sec, 375 secs
lola: 2336546 markings, 13746393 edges, 3418 markings/sec, 380 secs
lola: 2359431 markings, 13925875 edges, 4577 markings/sec, 385 secs
lola: 2380115 markings, 14105260 edges, 4137 markings/sec, 390 secs
lola: 2403238 markings, 14283956 edges, 4625 markings/sec, 395 secs
lola: 2420262 markings, 14462862 edges, 3405 markings/sec, 400 secs
lola: 2445740 markings, 14641180 edges, 5096 markings/sec, 405 secs
lola: 2463081 markings, 14819605 edges, 3468 markings/sec, 410 secs
lola: 2484420 markings, 14998773 edges, 4268 markings/sec, 415 secs
lola: 2506611 markings, 15177157 edges, 4438 markings/sec, 420 secs
lola: 2530710 markings, 15354699 edges, 4820 markings/sec, 425 secs
lola: 2547068 markings, 15533320 edges, 3272 markings/sec, 430 secs
lola: 2585351 markings, 15708967 edges, 7657 markings/sec, 435 secs
lola: 2633361 markings, 15884254 edges, 9602 markings/sec, 440 secs
lola: 2672456 markings, 16059711 edges, 7819 markings/sec, 445 secs
lola: 2699174 markings, 16240122 edges, 5344 markings/sec, 450 secs
lola: 2724469 markings, 16419497 edges, 5059 markings/sec, 455 secs
lola: 2747919 markings, 16598993 edges, 4690 markings/sec, 460 secs
lola: 2768164 markings, 16777817 edges, 4049 markings/sec, 465 secs
lola: 2788257 markings, 16957137 edges, 4019 markings/sec, 470 secs
lola: 2807459 markings, 17137829 edges, 3840 markings/sec, 475 secs
lola: 2825206 markings, 17320183 edges, 3549 markings/sec, 480 secs
lola: 2851099 markings, 17499436 edges, 5179 markings/sec, 485 secs
lola: 2875055 markings, 17679593 edges, 4791 markings/sec, 490 secs
lola: 2898133 markings, 17856899 edges, 4616 markings/sec, 495 secs
lola: 2915414 markings, 18034389 edges, 3456 markings/sec, 500 secs
lola: 2934663 markings, 18213506 edges, 3850 markings/sec, 505 secs
lola: 2951871 markings, 18390538 edges, 3442 markings/sec, 510 secs
lola: 2976251 markings, 18562927 edges, 4876 markings/sec, 515 secs
lola: 3000749 markings, 18736963 edges, 4900 markings/sec, 520 secs
lola: 3027205 markings, 18913893 edges, 5291 markings/sec, 525 secs
lola: 3062867 markings, 19089794 edges, 7132 markings/sec, 530 secs
lola: 3114891 markings, 19243588 edges, 10405 markings/sec, 535 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3120488 markings, 19256510 edges
lola: lola: RESULT
========================================lola:

SUMMARY: yes no no no no no no no no no no yes
lola:
preliminary result: yes no no no no no no no no no no yes
lola: memory consumption: 98320 KB
lola: time consumption: 1079 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="CloudReconfiguration-PT-304"
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 CloudReconfiguration-PT-304, 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 r180-ebro-158987899600026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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