fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r194-csrt-159033390400722
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ResAllocation-PT-R020C002

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.460 3600000.00 124230.00 74.90 FFFFFFTFFFFFFTFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.3K May 14 00:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 00:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 17:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 17:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 12 20:53 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 12 20:53 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 14 10:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 14 10:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 13 13:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 13 13:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 07:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 07:35 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:53 equiv_col
-rw-r--r-- 1 mcc users 9 May 12 20:53 instance
-rw-r--r-- 1 mcc users 6 May 12 20:53 iscolored
-rw-r--r-- 1 mcc users 85K May 12 20:53 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 ResAllocation-PT-R020C002-00
FORMULA_NAME ResAllocation-PT-R020C002-01
FORMULA_NAME ResAllocation-PT-R020C002-02
FORMULA_NAME ResAllocation-PT-R020C002-03
FORMULA_NAME ResAllocation-PT-R020C002-04
FORMULA_NAME ResAllocation-PT-R020C002-05
FORMULA_NAME ResAllocation-PT-R020C002-06
FORMULA_NAME ResAllocation-PT-R020C002-07
FORMULA_NAME ResAllocation-PT-R020C002-08
FORMULA_NAME ResAllocation-PT-R020C002-09
FORMULA_NAME ResAllocation-PT-R020C002-10
FORMULA_NAME ResAllocation-PT-R020C002-11
FORMULA_NAME ResAllocation-PT-R020C002-12
FORMULA_NAME ResAllocation-PT-R020C002-13
FORMULA_NAME ResAllocation-PT-R020C002-14
FORMULA_NAME ResAllocation-PT-R020C002-15

=== Now, execution of the tool begins

BK_START 1591238926433

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 02:48:48] [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 02:48:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 02:48:48] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2020-06-04 02:48:48] [INFO ] Transformed 80 places.
[2020-06-04 02:48:48] [INFO ] Transformed 42 transitions.
[2020-06-04 02:48:48] [INFO ] Parsed PT model containing 80 places and 42 transitions in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 861 resets, run finished after 270 ms. (steps per millisecond=370 ) properties seen :[0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1]
// Phase 1: matrix 42 rows 80 cols
[2020-06-04 02:48:49] [INFO ] Computed 40 place invariants in 6 ms
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 36 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2020-06-04 02:48:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 6 ms.
[2020-06-04 02:48:49] [INFO ] Added : 16 causal constraints over 4 iterations in 48 ms. Result :sat
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-04 02:48:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 4 ms.
[2020-06-04 02:48:49] [INFO ] Added : 33 causal constraints over 7 iterations in 47 ms. Result :sat
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-04 02:48:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:48:49] [INFO ] [Nat]Absence check using 40 positive place invariants in 16 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2020-06-04 02:48:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 7 ms.
[2020-06-04 02:48:49] [INFO ] Added : 17 causal constraints over 4 iterations in 36 ms. Result :sat
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-06-04 02:48:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 7 ms.
[2020-06-04 02:48:49] [INFO ] Added : 16 causal constraints over 4 iterations in 31 ms. Result :sat
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:48:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 4 ms.
[2020-06-04 02:48:49] [INFO ] Added : 19 causal constraints over 4 iterations in 28 ms. Result :sat
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 16 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:48:49] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2020-06-04 02:48:49] [INFO ] Added : 18 causal constraints over 4 iterations in 24 ms. Result :sat
[2020-06-04 02:48:49] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2020-06-04 02:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-06-04 02:48:50] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 7 ms.
[2020-06-04 02:48:50] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2020-06-04 02:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:48:50] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2020-06-04 02:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2020-06-04 02:48:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 02:48:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2020-06-04 02:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:50] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2020-06-04 02:48:50] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-06-04 02:48:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2020-06-04 02:48:50] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 3 ms.
[2020-06-04 02:48:50] [INFO ] Added : 29 causal constraints over 6 iterations in 82 ms. Result :sat
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2020-06-04 02:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2020-06-04 02:48:50] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 2 ms.
[2020-06-04 02:48:50] [INFO ] Added : 19 causal constraints over 4 iterations in 25 ms. Result :sat
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2020-06-04 02:48:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 02:48:50] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2020-06-04 02:48:50] [INFO ] Computed and/alt/rep : 40/40/40 causal constraints in 6 ms.
[2020-06-04 02:48:50] [INFO ] Added : 16 causal constraints over 4 iterations in 34 ms. Result :sat
[2020-06-04 02:48:50] [INFO ] Flatten gal took : 54 ms
[2020-06-04 02:48:50] [INFO ] Flatten gal took : 21 ms
[2020-06-04 02:48:50] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2020-06-04 02:48:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ ResAllocation-PT-R020C002 @ 3570 seconds

FORMULA ResAllocation-PT-R020C002-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ResAllocation-PT-R020C002-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ResAllocation-PT-R020C002-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3459
rslt: Output for LTLFireability @ ResAllocation-PT-R020C002

{
"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": "Thu Jun 4 02:48:51 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (((X (((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))) U (G ((F ((1 <= p38)) AND (((1 <= p28) AND (1 <= p31)) OR (1 <= p38)))) OR ((1 <= p0) AND (1 <= p3)))) AND ((1 <= p5) AND ((1 <= p45) AND (1 <= p46)))))",
"processed_size": 203,
"rewrites": 96
},
"result":
{
"edges": 212,
"markings": 212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 13
},
"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": 237
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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 <= p10) AND (1 <= p13))))",
"processed_size": 35,
"rewrites": 96
},
"result":
{
"edges": 114,
"markings": 113,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"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": 1,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"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": 5,
"visible_transitions": 0
},
"processed": "X ((G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))) AND ((1 <= p22) AND (1 <= p25))))",
"processed_size": 84,
"rewrites": 96
},
"result":
{
"edges": 211,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 3,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 1,
"aneg": 3,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 4,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "X ((G (((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) R (p40 <= 0)) AND G (((p1 <= 0) OR (p41 <= 0) OR (p42 <= 0))))) AND ((1 <= p31) AND ((1 <= p71) AND (1 <= p72)))))",
"processed_size": 172,
"rewrites": 96
},
"result":
{
"edges": 212,
"markings": 212,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 12
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))))",
"processed_size": 50,
"rewrites": 96
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) OR (G (((1 <= p1) OR ((1 <= p34) AND (1 <= p37)))) AND F (((1 <= p1) AND (1 <= p41) AND (1 <= p42))))))",
"processed_size": 150,
"rewrites": 96
},
"result":
{
"edges": 193,
"markings": 193,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 7,
"comp": 10,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "X (F ((G (((p0 <= 0) OR (p3 <= 0))) AND ((F (((p7 <= 0) OR (p47 <= 0) OR (p48 <= 0))) AND ((1 <= p9) AND ((1 <= p49) AND (1 <= p50)))) OR ((p0 <= 0) OR (p3 <= 0))))))",
"processed_size": 169,
"rewrites": 96
},
"result":
{
"edges": 119173997,
"markings": 16545026,
"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": 384
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 0,
"X": 8,
"aconj": 4,
"adisj": 0,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (G ((X (X (X (G (((1 <= p2) AND (1 <= p5)))))) AND (X (X (((p36 <= 0) OR (p39 <= 0)))) AND (F (((p36 <= 0) OR (p39 <= 0))) OR X (X (G (((p36 <= 0) OR (p39 <= 0))))))))))",
"processed_size": 174,
"rewrites": 96
},
"result":
{
"edges": 215,
"markings": 215,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 11
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 494
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0)))",
"processed_size": 46,
"rewrites": 96
},
"result":
{
"edges": 23,
"markings": 23,
"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"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 9,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 576
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "(F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))) U (1 <= p1))",
"processed_size": 60,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"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": 692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (((p0 <= 0) OR (p3 <= 0) OR (p24 <= 0) OR (p27 <= 0)))",
"processed_size": 59,
"rewrites": 96
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"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": 10,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 692
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "((p40 <= 0) R ((p40 <= 0) OR (p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))",
"processed_size": 72,
"rewrites": 96
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"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": 865
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 3,
"adisj": 0,
"aneg": 3,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "G ((X (G (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))) AND (((p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0)))))",
"processed_size": 136,
"rewrites": 96
},
"result":
{
"edges": 211,
"markings": 211,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 865
},
"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": "G (F ((1 <= p1)))",
"processed_size": 17,
"rewrites": 96
},
"result":
{
"edges": 309,
"markings": 252,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1153
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "(F (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0))) U ((1 <= p2) AND (1 <= p5)))",
"processed_size": 76,
"rewrites": 96
},
"result":
{
"edges": 1639574,
"markings": 656399,
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1729
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "((F ((1 <= p40)) OR (1 <= p40)) U G ((((p25 <= 0) OR (p65 <= 0) OR (p66 <= 0)) AND ((p26 <= 0) OR (p29 <= 0)))))",
"processed_size": 115,
"rewrites": 96
},
"result":
{
"edges": 193,
"markings": 193,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 3459
},
"child":
[

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

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"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": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p0) AND (1 <= p3))) OR ((1 <= p2) AND (1 <= p5)))))",
"processed_size": 68,
"rewrites": 96
},
"result":
{
"edges": 192,
"markings": 192,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 17,
"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": 16,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 37432,
"runtime": 111.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(((X(**) U (G((F(**) AND (** OR **))) OR **)) AND (** AND (** AND **)))) : (G(F((G(**) OR **))) OR **) : (F(G(**)) AND X(G(**))) : (X((G(**) AND (** AND **))) OR F(**)) : X((G(((G(*) R *) AND G(*))) AND (** AND (** AND **)))) : (F(*) U **) : X(F(**)) : G(F(**)) : X((** OR (G(**) AND F(**)))) : X(F((G(*) AND ((F(*) AND (* AND (* AND *))) OR (* OR *))))) : X(G((X(X(X(G(**)))) AND (X(X(*)) AND (F(*) OR X(X(G(*)))))))) : X(G((F((X(**) AND **)) AND (F(**) OR (X(**) AND **))))) : (G(*) AND X((X(X(F(**))) AND G(**)))) : ((F(*) U **) AND X(**)) : ((* R *) AND G((X(G(*)) AND (* AND *)))) : ((F(**) OR **) U G(**))"
},
"net":
{
"arcs": 200,
"conflict_clusters": 22,
"places": 80,
"places_significant": 40,
"singleton_clusters": 0,
"transitions": 42
},
"result":
{
"preliminary_value": "no no no no no no yes no no no no no no yes no no ",
"value": "no no no no no no yes no no no no no no yes 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: 122/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 80
lola: finding significant places
lola: 80 places, 42 transitions, 40 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 (((((X (((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))) U (G ((((1 <= p28) AND (1 <= p31)) U (1 <= p38))) OR ((1 <= p0) AND (1 <= p3)))) AND (1 <= p5)) AND (1 <= p45)) AND (1 <= p46))) : (G (X ((F (G (F (G (((1 <= p0) AND (1 <= p3)))))) OR F (((1 <= p2) AND (1 <= p5)))))) OR ((1 <= p2) AND (1 <= p5))) : (F (G (((1 <= p10) AND (1 <= p13)))) AND G (X (((1 <= p31) AND (1 <= p71) AND (1 <= p72))))) : (X (((G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))) AND (1 <= p22)) AND (1 <= p25))) OR F (((1 <= p15) AND (1 <= p55) AND (1 <= p56)))) : X ((((G ((NOT((F (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0))) U (1 <= p40))) AND NOT(F (((1 <= p1) AND (1 <= p41) AND (1 <= p42)))))) AND (1 <= p31)) AND (1 <= p71)) AND (1 <= p72))) : (F (NOT(G (((1 <= p37) AND (1 <= p77) AND (1 <= p78))))) U ((1 <= p2) AND (1 <= p5))) : F (((F ((((1 <= p32) AND (1 <= p35)) U ((1 <= p11) AND (1 <= p51) AND (1 <= p52)))) AND (1 <= p40)) U X (((1 <= p40) U ((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0)))))) : G (F ((NOT((X (((1 <= p1) U ((1 <= p2) AND (1 <= p5)))) U ((p2 <= 0) OR (p5 <= 0)))) U F ((1 <= p1))))) : X ((G (((1 <= p1) OR ((1 <= p34) AND (1 <= p37)))) U ((1 <= p1) AND (1 <= p41) AND (1 <= p42)))) : NOT(X (G ((F (((1 <= p0) AND (1 <= p3))) OR (((((G (((1 <= p7) AND (1 <= p47) AND (1 <= p48))) OR (p9 <= 0)) OR (p49 <= 0)) OR (p50 <= 0)) AND (1 <= p0)) AND (1 <= p3)))))) : X (G ((X (X (X (G (((1 <= p2) AND (1 <= p5)))))) AND NOT((G (((1 <= p36) AND (1 <= p39))) U X (X (((1 <= p36) AND (1 <= p39))))))))) : G (X ((F (((1 <= p0) AND (1 <= p3))) U (X ((1 <= p1)) AND (1 <= p1))))) : (NOT((((1 <= p21) AND (1 <= p61) AND (1 <= p62)) U F (((1 <= p37) AND (1 <= p77) AND (1 <= p78))))) AND X ((F (X (F (X (((1 <= p18) AND (1 <= p21)))))) AND G (((1 <= p8) AND (1 <= p11)))))) : ((NOT(G (((1 <= p11) AND (1 <= p51) AND (1 <= p52)))) U (1 <= p1)) AND X (((p0 <= 0) OR (p3 <= 0) OR (p24 <= 0) OR (p27 <= 0)))) : (NOT(((1 <= p40) U ((1 <= p40) AND (1 <= p35) AND (1 <= p75) AND (1 <= p76)))) AND NOT(F (((X (F (((1 <= p35) AND (1 <= p75) AND (1 <= p76)))) OR ((1 <= p20) AND (1 <= p23))) OR ((1 <= p5) AND (1 <= p45) AND (1 <= p46)))))) : ((F ((1 <= p40)) OR (1 <= p40)) U G ((((p25 <= 0) OR (p65 <= 0) OR (p66 <= 0)) AND ((p26 <= 0) OR (p29 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:519
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:315
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))) U (G ((F ((1 <= p38)) AND (((1 <= p28) AND (1 <= p31)) OR (1 <= p38)))) OR ((1 <= p0) AND (1 <= p3)))) AND ((1 <= p5) AND ((1 <= p45) AND (1 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))) U (G ((F ((1 <= p38)) AND (((1 <= p28) AND (1 <= p31)) OR (1 <= p38)))) OR ((1 <= p0) AND (1 <= p3)))) AND ((1 <= p5) AND ((1 <= p45) AND (1 <= p46)))))
lola: processed formula length: 203
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 13 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: 212 markings, 212 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G (((1 <= p10) AND (1 <= p13)))) AND X (G (((1 <= p31) AND (1 <= p71) AND (1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p10) AND (1 <= p13))))
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 <= p10) AND (1 <= p13))))
lola: processed formula length: 35
lola: 96 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: 113 markings, 114 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))) AND ((1 <= p22) AND (1 <= p25)))) OR F (((1 <= p15) AND (1 <= p55) AND (1 <= p56))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p15) AND (1 <= p55) AND (1 <= p56)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p15 <= 0) OR (p55 <= 0) OR (p56 <= 0))
lola: processed formula length: 42
lola: 98 rewrites
lola: closed formula file LTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 115 markings, 114 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))) AND ((1 <= p22) AND (1 <= p25))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((1 <= p21) AND (1 <= p61) AND (1 <= p62))) AND ((1 <= p22) AND (1 <= p25))))
lola: processed formula length: 84
lola: 96 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: 211 markings, 211 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G (((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) R (p40 <= 0)) AND G (((p1 <= 0) OR (p41 <= 0) OR (p42 <= 0))))) AND ((1 <= p31) AND ((1 <= p71) AND (1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G (((G (((1 <= p35) AND (1 <= p75) AND (1 <= p76))) R (p40 <= 0)) AND G (((p1 <= 0) OR (p41 <= 0) OR (p42 <= 0))))) AND ((1 <= p31) AND ((1 <= p71) AND (1 <= p72)))))
lola: processed formula length: 172
lola: 96 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: 212 markings, 212 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))))
lola: processed formula length: 50
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) OR (G (((1 <= p1) OR ((1 <= p34) AND (1 <= p37)))) AND F (((1 <= p1) AND (1 <= p41) AND (1 <= p42))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((((1 <= p1) AND (1 <= p41) AND (1 <= p42)) OR (G (((1 <= p1) OR ((1 <= p34) AND (1 <= p37)))) AND F (((1 <= p1) AND (1 <= p41) AND (1 <= p42))))))
lola: processed formula length: 150
lola: 96 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: 193 markings, 193 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G (((p0 <= 0) OR (p3 <= 0))) AND ((F (((p7 <= 0) OR (p47 <= 0) OR (p48 <= 0))) AND ((1 <= p9) AND ((1 <= p49) AND (1 <= p50)))) OR ((p0 <= 0) OR (p3 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G (((p0 <= 0) OR (p3 <= 0))) AND ((F (((p7 <= 0) OR (p47 <= 0) OR (p48 <= 0))) AND ((1 <= p9) AND ((1 <= p49) AND (1 <= p50)))) OR ((p0 <= 0) OR (p3 <= 0))))))
lola: processed formula length: 169
lola: 96 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: 1224461 markings, 6560591 edges, 244892 markings/sec, 0 secs
lola: 2247211 markings, 12897697 edges, 204550 markings/sec, 5 secs
lola: 3119726 markings, 18721820 edges, 174503 markings/sec, 10 secs
lola: 4035623 markings, 24873178 edges, 183179 markings/sec, 15 secs
lola: 4852161 markings, 30545954 edges, 163308 markings/sec, 20 secs
lola: 5654190 markings, 36178825 edges, 160406 markings/sec, 25 secs
lola: 6421593 markings, 41805044 edges, 153481 markings/sec, 30 secs
lola: 7212203 markings, 47614466 edges, 158122 markings/sec, 35 secs
lola: 7969866 markings, 53289293 edges, 151533 markings/sec, 40 secs
lola: 8692920 markings, 58747531 edges, 144611 markings/sec, 45 secs
lola: 9413180 markings, 64282803 edges, 144052 markings/sec, 50 secs
lola: 10189095 markings, 70141733 edges, 155183 markings/sec, 55 secs
lola: 10865968 markings, 75524391 edges, 135375 markings/sec, 60 secs
lola: 11574861 markings, 80887407 edges, 141779 markings/sec, 65 secs
lola: 12270845 markings, 86395787 edges, 139197 markings/sec, 70 secs
lola: 12987627 markings, 91858048 edges, 143356 markings/sec, 75 secs
lola: 13712422 markings, 97328053 edges, 144959 markings/sec, 80 secs
lola: 14433150 markings, 102820889 edges, 144146 markings/sec, 85 secs
lola: 15117533 markings, 108130710 edges, 136877 markings/sec, 90 secs
lola: 15757726 markings, 113335389 edges, 128039 markings/sec, 95 secs
lola: 16423884 markings, 118218550 edges, 133232 markings/sec, 100 secs
lola: add low 41
lola: add low 40
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: 16545026 markings, 119173997 edges
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (X (X (G (((1 <= p2) AND (1 <= p5)))))) AND (X (X (((p36 <= 0) OR (p39 <= 0)))) AND (F (((p36 <= 0) OR (p39 <= 0))) OR X (X (G (((p36 <= 0) OR (p39 <= 0))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (X (X (G (((1 <= p2) AND (1 <= p5)))))) AND (X (X (((p36 <= 0) OR (p39 <= 0)))) AND (F (((p36 <= 0) OR (p39 <= 0))) OR X (X (G (((p36 <= 0) OR (p39 <= 0))))))))))
lola: processed formula length: 174
lola: 96 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: 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: 215 markings, 215 edges
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((F ((X ((1 <= p1)) AND (1 <= p1))) AND (F (((1 <= p0) AND (1 <= p3))) OR (X ((1 <= p1)) AND (1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((F ((X ((1 <= p1)) AND (1 <= p1))) AND (F (((1 <= p0) AND (1 <= p3))) OR (X ((1 <= p1)) AND (1 <= p1))))))
lola: processed formula length: 112
lola: 96 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: 590 markings, 591 edges
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0))) AND X ((X (X (F (((1 <= p18) AND (1 <= p21))))) AND G (((1 <= p8) AND (1 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0)))
lola: processed formula length: 46
lola: 96 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: 23 markings, 23 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))) U (1 <= p1)) AND X (((p0 <= 0) OR (p3 <= 0) OR (p24 <= 0) OR (p27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))) U (1 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p11 <= 0) OR (p51 <= 0) OR (p52 <= 0))) U (1 <= p1))
lola: processed formula length: 60
lola: 96 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p0 <= 0) OR (p3 <= 0) OR (p24 <= 0) OR (p27 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p0 <= 0) OR (p3 <= 0) OR (p24 <= 0) OR (p27 <= 0)))
lola: processed formula length: 59
lola: 96 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p40 <= 0) R ((p40 <= 0) OR (p35 <= 0) OR (p75 <= 0) OR (p76 <= 0))) AND G ((X (G (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))) AND (((p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p40 <= 0) R ((p40 <= 0) OR (p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p40 <= 0) R ((p40 <= 0) OR (p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))
lola: processed formula length: 72
lola: 96 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X (G (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))) AND (((p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X (G (((p35 <= 0) OR (p75 <= 0) OR (p76 <= 0)))) AND (((p20 <= 0) OR (p23 <= 0)) AND ((p5 <= 0) OR (p45 <= 0) OR (p46 <= 0)))))
lola: processed formula length: 136
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 211 markings, 211 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: lola: ========================================
========================================
lola: subprocess 12 will run for 865 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p1)))
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 <= p1)))
lola: processed formula length: 17
lola: 96 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: 252 markings, 309 edges
lola: ========================================
lola: subprocess 13 will run for 1153 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0))) U ((1 <= p2) AND (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F (((p37 <= 0) OR (p77 <= 0) OR (p78 <= 0))) U ((1 <= p2) AND (1 <= p5)))
lola: processed formula length: 76
lola: 96 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: 656399 markings, 1639574 edges
lola: ========================================
lola: subprocess 14 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((1 <= p40)) OR (1 <= p40)) U G ((((p25 <= 0) OR (p65 <= 0) OR (p66 <= 0)) AND ((p26 <= 0) OR (p29 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((1 <= p40)) OR (1 <= p40)) U G ((((p25 <= 0) OR (p65 <= 0) OR (p66 <= 0)) AND ((p26 <= 0) OR (p29 <= 0)))))
lola: processed formula length: 115
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 193 markings, 193 edges
lola: ========================================
lola: subprocess 15 will run for 3459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((G (((1 <= p0) AND (1 <= p3))) OR ((1 <= p2) AND (1 <= p5))))) OR ((1 <= p2) AND (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (G (F ((G (((1 <= p0) AND (1 <= p3))) OR ((1 <= p2) AND (1 <= p5))))) OR ((1 <= p2) AND (1 <= p5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p2) AND (1 <= p5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p2) AND (1 <= p5))
lola: processed formula length: 25
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p0) AND (1 <= p3))) OR ((1 <= p2) AND (1 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p0) AND (1 <= p3))) OR ((1 <= p2) AND (1 <= p5)))))
lola: processed formula length: 68
lola: 96 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 192 markings, 192 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: no no no no no no yes no no no no no no yes no no
lola:
preliminary result: no no no no no no yes no no no no no no yes no no
lola: ========================================
lola: memory consumption: 37432 KB
lola: time consumption: 111 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="ResAllocation-PT-R020C002"
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 ResAllocation-PT-R020C002, 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 r194-csrt-159033390400722"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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