fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033476900026
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for SatelliteMemory-PT-X03000Y0094

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15794.510 3600000.00 432758.00 11849.80 FFF?TFFFTTTFFFTF normal

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.r211-tajo-159033476900026.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 SatelliteMemory-PT-X03000Y0094, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033476900026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.2K May 14 00:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 17:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 17:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 07:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 12 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rwxr-xr-x 1 mcc users 5.5K May 12 20:42 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 SatelliteMemory-PT-X03000Y0094-00
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-01
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-02
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-03
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-04
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-05
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-06
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-07
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-08
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-09
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-10
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-11
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-12
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-13
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-14
FORMULA_NAME SatelliteMemory-PT-X03000Y0094-15

=== Now, execution of the tool begins

BK_START 1591284180731

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 15:23:02] [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-04 15:23:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 15:23:02] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2020-06-04 15:23:02] [INFO ] Transformed 13 places.
[2020-06-04 15:23:02] [INFO ] Transformed 10 transitions.
[2020-06-04 15:23:02] [INFO ] Parsed PT model containing 13 places and 10 transitions in 66 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 150 ms. (steps per millisecond=666 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 10 rows 12 cols
[2020-06-04 15:23:03] [INFO ] Computed 6 place invariants in 3 ms
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-04 15:23:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 15:23:03] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 7 ms.
[2020-06-04 15:23:03] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 15:23:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2020-06-04 15:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2020-06-04 15:23:03] [INFO ] Computed and/alt/rep : 8/13/8 causal constraints in 1 ms.
[2020-06-04 15:23:03] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
[2020-06-04 15:23:03] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-04 15:23:03] [INFO ] Flatten gal took : 25 ms
FORMULA SatelliteMemory-PT-X03000Y0094-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SatelliteMemory-PT-X03000Y0094-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 15:23:03] [INFO ] Flatten gal took : 3 ms
[2020-06-04 15:23:03] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2020-06-04 15:23:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SatelliteMemory-PT-X03000Y0094 @ 3570 seconds

FORMULA SatelliteMemory-PT-X03000Y0094-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SatelliteMemory-PT-X03000Y0094-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3171
rslt: Output for LTLFireability @ SatelliteMemory-PT-X03000Y0094

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X ((G (F ((X (((1 <= p0) AND (1 <= p8))) AND ((1 <= p2) OR ((2812 <= p3) AND (188 <= p6)))))) OR (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)) OR ((2812 <= p3) AND (188 <= p6)))))",
"processed_size": 190,
"rewrites": 76
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 324
},
"child":
[

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 374
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 4,
"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": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((F ((G ((p5 <= 2999)) R (p7 <= 0))) AND (((1 <= p7) OR (3000 <= p5)) OR (G ((p5 <= 2999)) R (p7 <= 0)))))))",
"processed_size": 117,
"rewrites": 76
},
"result":
{
"edges": 33003,
"markings": 24004,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 14
},
"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": 421
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"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": 3,
"visible_transitions": 0
},
"processed": "((1 <= p2) U X ((X ((p11 <= 2999)) OR G ((F ((p7 <= 0)) OR (p7 <= 0))))))",
"processed_size": 73,
"rewrites": 76
},
"result":
{
"edges": 12,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 14
},
"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": 481
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 3,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((((p3 <= 0) OR (p9 <= 0)) AND (F ((p2 <= 0)) OR G (((p3 <= 0) OR (p9 <= 0))))) OR (p2 <= 0)))",
"processed_size": 99,
"rewrites": 76
},
"result":
{
"edges": 11259,
"markings": 11257,
"produced_by": "LTL model checker",
"value": true
},
"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": 561
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 3,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))) OR ((p3 <= 2811) OR (p6 <= 187))) U X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)))))",
"processed_size": 160,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 674
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "(((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U G ((F (((1 <= p0) AND (1 <= p8))) AND ((p0 <= 0) OR (p8 <= 0)))))",
"processed_size": 109,
"rewrites": 76
},
"result":
{
"edges": 5,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 7,
"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": 842
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "(((2812 <= p3) AND (2812 <= p5)) U (F ((3000 <= p5)) AND F (((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))",
"processed_size": 102,
"rewrites": 76
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 8,
"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": 1123
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 4,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "F ((G ((G ((3000 <= p5)) OR G ((1 <= p2)))) AND ((1 <= p1) AND ((1 <= p3) AND ((1 <= p7) AND (1 <= p10))))))",
"processed_size": 108,
"rewrites": 76
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"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": 1685
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1685
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p2)",
"processed_size": 9,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 10,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "G (((2812 <= p3) AND (2812 <= p5)))",
"processed_size": 35,
"rewrites": 76
},
"result":
{
"edges": 5626,
"markings": 5626,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3370
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p5 <= 2999))",
"processed_size": 16,
"rewrites": 76
},
"result":
{
"edges": 35623,
"markings": 26625,
"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": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 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": "F (G ((1 <= p7)))",
"processed_size": 17,
"rewrites": 76
},
"result":
{
"edges": 5627,
"markings": 5626,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((1 <= p4) AND (1 <= p6) AND (1 <= p8))",
"processed_size": 39,
"rewrites": 79
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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 <= p2)",
"processed_size": 9,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"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": "(p2 <= 0)",
"processed_size": 9,
"rewrites": 76
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p11 <= 2999))",
"processed_size": 17,
"rewrites": 76
},
"result":
{
"edges": 6381,
"markings": 6192,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"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": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"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": "G (((2812 <= p3) AND (2812 <= p5)))",
"processed_size": 35,
"rewrites": 76
},
"result":
{
"edges": 5626,
"markings": 5626,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 4100,
"runtime": 399.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((G(F((X(**) AND **))) OR (** OR **))) : (F(G(**)) AND (G(**) OR (G(*) AND F(G(**))))) : (G(*) OR (** OR (G(*) AND **))) : (G((G(F((X(X(**)) OR (** OR **)))) AND (** AND (** AND **)))) AND (** AND (** AND **))) : X((F(**) AND **)) : (** U (F(**) AND F(**))) : X(X(G((F((G(*) R *)) AND (** OR (G(*) R *)))))) : (** U X((X(**) OR G((F(*) OR *))))) : X(((* AND (F(*) OR G(*))) OR **)) : F((G((G(**) OR G(**))) AND (* AND (* AND (* AND *))))) : X(((X(*) OR (** OR **)) U X(**))) : (** U G((F(**) AND **)))"
},
"net":
{
"arcs": 38,
"conflict_clusters": 3,
"places": 12,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 10
},
"result":
{
"preliminary_value": "no no no unknown no no no yes yes no no no ",
"value": "no no no unknown no no no yes yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 22/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 384
lola: finding significant places
lola: 12 places, 10 transitions, 6 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: X (((G (F (X (F ((X (((1 <= p0) AND (1 <= p8))) AND ((1 <= p2) OR ((2812 <= p3) AND (188 <= p6)))))))) OR ((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))) OR ((2812 <= p3) AND (188 <= p6)))) : (F (G ((1 <= p7))) AND (G (NOT(F ((3000 <= p5)))) U G (((2812 <= p3) AND (188 <= p6))))) : ((NOT(F (((p3 <= 2811) OR (p5 <= 2811)))) OR (p2 <= 0)) OR (NOT(F ((F (((2812 <= p3) AND (2812 <= p5))) U (3000 <= p11)))) AND (1 <= p2))) : (((G ((((G (F (X (((X (X (((1 <= p3) AND (1 <= p9)))) OR (p3 <= 0)) OR (p9 <= 0))))) AND (1 <= p4)) AND (1 <= p6)) AND (1 <= p8))) AND (1 <= p4)) AND (1 <= p6)) AND (1 <= p8)) : (X ((X (X (X ((((1 <= p0) AND (1 <= p8)) OR ((1 <= p3) AND (1 <= p9)))))) U F ((3000 <= p11)))) AND X (((1 <= p3) AND (1 <= p9)))) : (((2812 <= p3) AND (2812 <= p5)) U (F ((3000 <= p5)) AND F (((1 <= p4) AND (1 <= p6) AND (1 <= p8))))) : X (G ((X (((1 <= p7) OR (3000 <= p5))) U X (NOT((F ((3000 <= p5)) U (1 <= p7))))))) : ((1 <= p2) U X ((X ((p11 <= 2999)) OR NOT(F ((G ((1 <= p7)) AND (1 <= p7))))))) : X ((NOT((G ((1 <= p2)) U ((1 <= p3) AND (1 <= p9)))) OR (p2 <= 0))) : NOT(G (((((F ((NOT(G ((3000 <= p5))) AND NOT(G ((1 <= p2))))) OR (p1 <= 0)) OR (p3 <= 0)) OR (p7 <= 0)) OR (p10 <= 0)))) : X ((((NOT(X (((p1 <= 0) OR (p3 <= 0) OR (p7 <= 0) OR (p10 <= 0)))) OR (p3 <= 2811)) OR (p6 <= 187)) U X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))))) : (((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U G ((F (((1 <= p0) AND (1 <= p8))) AND ((p0 <= 0) OR (p8 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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:332
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:318
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:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (F ((X (((1 <= p0) AND (1 <= p8))) AND ((1 <= p2) OR ((2812 <= p3) AND (188 <= p6)))))) OR (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)) OR ((2812 <= p3) AND (188 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (F ((X (((1 <= p0) AND (1 <= p8))) AND ((1 <= p2) OR ((2812 <= p3) AND (188 <= p6)))))) OR (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)) OR ((2812 <= p3) AND (188 <= p6)))))
lola: processed formula length: 190
lola: 76 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((G (F ((X (X (((1 <= p3) AND (1 <= p9)))) OR ((p3 <= 0) OR (p9 <= 0))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND ((1 <= p6) AND (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p4) AND (1 <= p6) AND (1 <= p8))
lola: processed formula length: 39
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G (F ((X (X (((1 <= p3) AND (1 <= p9)))) OR ((p3 <= 0) OR (p9 <= 0))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((X (X (((1 <= p3) AND (1 <= p9)))) OR ((p3 <= 0) OR (p9 <= 0))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8)))))
lola: processed formula length: 123
lola: 76 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: 5651841 markings, 7879679 edges, 1130368 markings/sec, 0 secs
lola: 10466013 markings, 14597452 edges, 962834 markings/sec, 5 secs
lola: 14832284 markings, 20689999 edges, 873254 markings/sec, 10 secs
lola: 19359360 markings, 27007123 edges, 905415 markings/sec, 15 secs
lola: 23756844 markings, 33143643 edges, 879497 markings/sec, 20 secs
lola: 28150912 markings, 39275324 edges, 878814 markings/sec, 25 secs
lola: 32267840 markings, 45019878 edges, 823386 markings/sec, 30 secs
lola: 35753292 markings, 49883552 edges, 697090 markings/sec, 35 secs
lola: 39423631 markings, 55005445 edges, 734068 markings/sec, 40 secs
lola: 43104992 markings, 60142132 edges, 736272 markings/sec, 45 secs
lola: 46602293 markings, 65022592 edges, 699460 markings/sec, 50 secs
lola: 50195895 markings, 70036735 edges, 718720 markings/sec, 55 secs
lola: 53914678 markings, 75226079 edges, 743757 markings/sec, 60 secs
lola: 57643446 markings, 80429331 edges, 745754 markings/sec, 65 secs
lola: 61109353 markings, 85265839 edges, 693181 markings/sec, 70 secs
lola: 64617921 markings, 90161525 edges, 701714 markings/sec, 75 secs
lola: 68430629 markings, 95482296 edges, 762542 markings/sec, 80 secs
lola: 72195417 markings, 100735527 edges, 752958 markings/sec, 85 secs
lola: 76280043 markings, 106435277 edges, 816925 markings/sec, 90 secs
lola: 79729221 markings, 111247897 edges, 689836 markings/sec, 95 secs
lola: 83640386 markings, 116706044 edges, 782233 markings/sec, 100 secs
lola: 87753251 markings, 122444899 edges, 822573 markings/sec, 105 secs
lola: 91779911 markings, 128064153 edges, 805332 markings/sec, 110 secs
lola: 95517706 markings, 133279906 edges, 747559 markings/sec, 115 secs
lola: 99355557 markings, 138634667 edges, 767570 markings/sec, 120 secs
lola: 103517256 markings, 144442560 edges, 832340 markings/sec, 125 secs
lola: 107389362 markings, 149845758 edges, 774421 markings/sec, 130 secs
lola: 110695317 markings, 154458291 edges, 661191 markings/sec, 135 secs
lola: 113339812 markings, 158149787 edges, 528899 markings/sec, 140 secs
lola: 115905514 markings, 161729279 edges, 513140 markings/sec, 145 secs
lola: 117833907 markings, 164420057 edges, 385679 markings/sec, 150 secs
lola: 119990477 markings, 167428803 edges, 431314 markings/sec, 155 secs
lola: 122841549 markings, 171407345 edges, 570214 markings/sec, 160 secs
lola: 125503684 markings, 175122257 edges, 532427 markings/sec, 165 secs
lola: 128081047 markings, 178718748 edges, 515473 markings/sec, 170 secs
lola: 130709681 markings, 182386566 edges, 525727 markings/sec, 175 secs
lola: 133598263 markings, 186417796 edges, 577716 markings/sec, 180 secs
lola: 136529533 markings, 190507937 edges, 586254 markings/sec, 185 secs
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: subprocess 2 will run for 337 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((3000 <= p11)) AND ((1 <= p3) AND (1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((3000 <= p11)) AND ((1 <= p3) AND (1 <= p9))))
lola: processed formula length: 53
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 374 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((F ((G ((p5 <= 2999)) R (p7 <= 0))) AND (((1 <= p7) OR (3000 <= p5)) OR (G ((p5 <= 2999)) R (p7 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((F ((G ((p5 <= 2999)) R (p7 <= 0))) AND (((1 <= p7) OR (3000 <= p5)) OR (G ((p5 <= 2999)) R (p7 <= 0)))))))
lola: processed formula length: 117
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24004 markings, 33003 edges
lola: ========================================
lola: subprocess 4 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) U X ((X ((p11 <= 2999)) OR G ((F ((p7 <= 0)) OR (p7 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p2) U X ((X ((p11 <= 2999)) OR G ((F ((p7 <= 0)) OR (p7 <= 0))))))
lola: processed formula length: 73
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 14 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 5 will run for 481 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((p3 <= 0) OR (p9 <= 0)) AND (F ((p2 <= 0)) OR G (((p3 <= 0) OR (p9 <= 0))))) OR (p2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((p3 <= 0) OR (p9 <= 0)) AND (F ((p2 <= 0)) OR G (((p3 <= 0) OR (p9 <= 0))))) OR (p2 <= 0)))
lola: processed formula length: 99
lola: 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11257 markings, 11259 edges
lola: ========================================
lola: subprocess 6 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))) OR ((p3 <= 2811) OR (p6 <= 187))) U X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10))) OR ((p3 <= 2811) OR (p6 <= 187))) U X (((1 <= p1) AND (1 <= p3) AND (1 <= p7) AND (1 <= p10)))))
lola: processed formula length: 160
lola: 76 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 674 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U G ((F (((1 <= p0) AND (1 <= p8))) AND ((p0 <= 0) OR (p8 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((1 <= p4) AND (1 <= p6) AND (1 <= p8)) U G ((F (((1 <= p0) AND (1 <= p8))) AND ((p0 <= 0) OR (p8 <= 0)))))
lola: processed formula length: 109
lola: 76 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 842 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2812 <= p3) AND (2812 <= p5)) U (F ((3000 <= p5)) AND F (((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((2812 <= p3) AND (2812 <= p5)) U (F ((3000 <= p5)) AND F (((1 <= p4) AND (1 <= p6) AND (1 <= p8)))))
lola: processed formula length: 102
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 9 will run for 1123 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((G ((3000 <= p5)) OR G ((1 <= p2)))) AND ((1 <= p1) AND ((1 <= p3) AND ((1 <= p7) AND (1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((G ((3000 <= p5)) OR G ((1 <= p2)))) AND ((1 <= p1) AND ((1 <= p3) AND ((1 <= p7) AND (1 <= p10))))))
lola: processed formula length: 108
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 3 markings, 3 edges
lola: ========================================
lola: subprocess 10 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((2812 <= p3) AND (2812 <= p5))) OR ((p2 <= 0) OR (G ((p11 <= 2999)) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 1685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2)
lola: processed formula length: 9
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 3370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
lola: 76 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: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((2812 <= p3) AND (2812 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((2812 <= p3) AND (2812 <= p5)))
lola: processed formula length: 35
lola: 76 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: 5626 markings, 5626 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 3370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((1 <= p7))) AND (G (((2812 <= p3) AND (188 <= p6))) OR (G ((p5 <= 2999)) AND F (G (((2812 <= p3) AND (188 <= p6)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p5 <= 2999))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p5 <= 2999))
lola: processed formula length: 16
lola: 76 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: 26625 markings, 35623 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p7)))
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 <= p7)))
lola: processed formula length: 17
lola: 76 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: 5626 markings, 5627 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G ((G (F ((X (X (((1 <= p3) AND (1 <= p9)))) OR ((p3 <= 0) OR (p9 <= 0))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p4) AND ((1 <= p6) AND (1 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:793
lola: rewrite Frontend/Parser/formula_rewrite.k:794
lola: processed formula: ((1 <= p4) AND (1 <= p6) AND (1 <= p8))
lola: processed formula length: 39
lola: 79 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ...considering subproblem: G ((G (F ((X (X (((1 <= p3) AND (1 <= p9)))) OR ((p3 <= 0) OR (p9 <= 0))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G (F ((X (X (((1 <= p3) AND (1 <= p9)))) OR ((p3 <= 0) OR (p9 <= 0))))) AND ((1 <= p4) AND ((1 <= p6) AND (1 <= p8)))))
lola: processed formula length: 123
lola: 76 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: ========================================
lola: 4943223 markings, 6891384 edges, 988645 markings/sec, 0 secs
lola: 9850382 markings, 13738861 edges, 981432 markings/sec, 5 secs
lola: 14455514 markings, 20164225 edges, 921026 markings/sec, 10 secs
lola: 18849191 markings, 26295353 edges, 878735 markings/sec, 15 secs
lola: 23250033 markings, 32436632 edges, 880168 markings/sec, 20 secs
lola: 27842966 markings, 38845413 edges, 918587 markings/sec, 25 secs
lola: 31535814 markings, 43998883 edges, 738570 markings/sec, 30 secs
lola: 35359488 markings, 49333891 edges, 764735 markings/sec, 35 secs
lola: 39463740 markings, 55061081 edges, 820850 markings/sec, 40 secs
lola: 42846365 markings, 59781230 edges, 676525 markings/sec, 45 secs
lola: 46486693 markings, 64861485 edges, 728066 markings/sec, 50 secs
lola: 50054188 markings, 69839044 edges, 713499 markings/sec, 55 secs
lola: 53707169 markings, 74936991 edges, 730596 markings/sec, 60 secs
lola: 57065120 markings, 79622699 edges, 671590 markings/sec, 65 secs
lola: 60439985 markings, 84332000 edges, 674973 markings/sec, 70 secs
lola: 63785058 markings, 88999827 edges, 669015 markings/sec, 75 secs
lola: 66965598 markings, 93437320 edges, 636108 markings/sec, 80 secs
lola: 70534999 markings, 98418425 edges, 713880 markings/sec, 85 secs
lola: 73951576 markings, 103185983 edges, 683315 markings/sec, 90 secs
lola: 77550082 markings, 108207074 edges, 719701 markings/sec, 95 secs
lola: 80642093 markings, 112521639 edges, 618402 markings/sec, 100 secs
lola: 83977572 markings, 117176150 edges, 667096 markings/sec, 105 secs
lola: 87747442 markings, 122436670 edges, 753974 markings/sec, 110 secs
lola: 91164590 markings, 127205279 edges, 683430 markings/sec, 115 secs
lola: 94711331 markings, 132154080 edges, 709348 markings/sec, 120 secs
lola: 98216983 markings, 137046355 edges, 701130 markings/sec, 125 secs
lola: 102159651 markings, 142547667 edges, 788534 markings/sec, 130 secs
lola: 105977158 markings, 147875096 edges, 763501 markings/sec, 135 secs
lola: 109545748 markings, 152854105 edges, 713718 markings/sec, 140 secs
lola: 112928969 markings, 157577373 edges, 676644 markings/sec, 145 secs
lola: 115368377 markings, 160981084 edges, 487882 markings/sec, 150 secs
lola: 118064703 markings, 164741624 edges, 539265 markings/sec, 155 secs
lola: 120694118 markings, 168411225 edges, 525883 markings/sec, 160 secs
lola: 123233790 markings, 171954787 edges, 507934 markings/sec, 165 secs
lola: 125941430 markings, 175733015 edges, 541528 markings/sec, 170 secs
lola: 128466330 markings, 179257209 edges, 504980 markings/sec, 175 secs
lola: 131115169 markings, 182952751 edges, 529768 markings/sec, 180 secs
lola: 133861177 markings, 186784614 edges, 549202 markings/sec, 185 secs
lola: 136788370 markings, 190869136 edges, 585439 markings/sec, 190 secs
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: (G (((2812 <= p3) AND (2812 <= p5))) OR ((p2 <= 0) OR (G ((p11 <= 2999)) AND (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (1 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p2)
lola: processed formula length: 9
lola: 76 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2 <= 0)
lola: processed formula length: 9
lola: 76 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: ========================================
lola: ...considering subproblem: G ((p11 <= 2999))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p11 <= 2999))
lola: processed formula length: 17
lola: 76 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: 6192 markings, 6381 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (((2812 <= p3) AND (2812 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((2812 <= p3) AND (2812 <= p5)))
lola: processed formula length: 35
lola: 76 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: 5626 markings, 5626 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown no no no yes yes no no no
lola:
preliminary result: no no no unknown no no no yes yes no no no
lola: memory consumption: 4100 KB
lola: time consumption: 399 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="SatelliteMemory-PT-X03000Y0094"
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 SatelliteMemory-PT-X03000Y0094, 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 r211-tajo-159033476900026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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