Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r186-oct2-158987938400050.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RefineWMG-PT-010010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938400050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.3K Apr 12 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 10 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 22:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 24K Mar 24 05:38 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 RefineWMG-PT-010010-00
FORMULA_NAME RefineWMG-PT-010010-01
FORMULA_NAME RefineWMG-PT-010010-02
FORMULA_NAME RefineWMG-PT-010010-03
FORMULA_NAME RefineWMG-PT-010010-04
FORMULA_NAME RefineWMG-PT-010010-05
FORMULA_NAME RefineWMG-PT-010010-06
FORMULA_NAME RefineWMG-PT-010010-07
FORMULA_NAME RefineWMG-PT-010010-08
FORMULA_NAME RefineWMG-PT-010010-09
FORMULA_NAME RefineWMG-PT-010010-10
FORMULA_NAME RefineWMG-PT-010010-11
FORMULA_NAME RefineWMG-PT-010010-12
FORMULA_NAME RefineWMG-PT-010010-13
FORMULA_NAME RefineWMG-PT-010010-14
FORMULA_NAME RefineWMG-PT-010010-15

=== Now, execution of the tool begins

BK_START 1591223824712

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:37:06] [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-03 22:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:37:07] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-03 22:37:07] [INFO ] Transformed 54 places.
[2020-06-03 22:37:07] [INFO ] Transformed 43 transitions.
[2020-06-03 22:37:07] [INFO ] Parsed PT model containing 54 places and 43 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 123 ms. (steps per millisecond=813 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 43 rows 54 cols
[2020-06-03 22:37:07] [INFO ] Computed 22 place invariants in 3 ms
[2020-06-03 22:37:07] [INFO ] [Real]Absence check using 22 positive place invariants in 65 ms returned sat
[2020-06-03 22:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:07] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-06-03 22:37:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:07] [INFO ] [Nat]Absence check using 22 positive place invariants in 31 ms returned sat
[2020-06-03 22:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:07] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-03 22:37:07] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 40 ms.
[2020-06-03 22:37:07] [INFO ] Added : 21 causal constraints over 5 iterations in 106 ms. Result :sat
[2020-06-03 22:37:07] [INFO ] [Real]Absence check using 22 positive place invariants in 71 ms returned sat
[2020-06-03 22:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:08] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-06-03 22:37:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:37:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 22 ms returned sat
[2020-06-03 22:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:37:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2020-06-03 22:37:08] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints in 24 ms.
[2020-06-03 22:37:08] [INFO ] Added : 21 causal constraints over 5 iterations in 52 ms. Result :sat
[2020-06-03 22:37:08] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2020-06-03 22:37:08] [INFO ] Flatten gal took : 41 ms
FORMULA RefineWMG-PT-010010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:37:08] [INFO ] Flatten gal took : 6 ms
[2020-06-03 22:37:08] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 14 ms.
[2020-06-03 22:37:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-010010 @ 3570 seconds

FORMULA RefineWMG-PT-010010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-010010-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-010010-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2095
rslt: Output for LTLFireability @ RefineWMG-PT-010010

{
"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": "Wed Jun 3 22:37:08 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": "(p47 <= 0)",
"processed_size": 10,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((X ((X (G ((1 <= p47))) OR (G ((1 <= p47)) OR (1 <= p47)))) OR F ((1 <= p17))))",
"processed_size": 82,
"rewrites": 89
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 372
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 372
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"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 ((1 <= p35))",
"processed_size": 14,
"rewrites": 89
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"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": 3,
"visible_transitions": 0
},
"processed": "G (F ((((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND (p52 <= 0))))",
"processed_size": 66,
"rewrites": 89
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 425
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (((p45 <= 0) OR F ((1 <= p42))))",
"processed_size": 34,
"rewrites": 89
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 496
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (((X (G ((1 <= p40))) AND ((1 <= p52) OR (1 <= p28))) U (1 <= p40)))",
"processed_size": 71,
"rewrites": 89
},
"result":
{
"edges": 11,
"markings": 11,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 710
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((p30 <= 0)))",
"processed_size": 18,
"rewrites": 89
},
"result":
{
"edges": 145,
"markings": 116,
"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": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 946
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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": "F (G (((1 <= p5) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))",
"processed_size": 65,
"rewrites": 89
},
"result":
{
"edges": 13,
"markings": 12,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1420
},
"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 <= p23)",
"processed_size": 10,
"rewrites": 89
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p23 <= 0)",
"processed_size": 10,
"rewrites": 91
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 3
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2840
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(p4 <= 4)",
"processed_size": 9,
"rewrites": 91
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 2
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3548,
"runtime": 1475.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X((X(*) AND (F(*) OR X(G(*))))) OR **) : F((G(*) OR (X(G(*)) AND *))) : F(G((F(**) AND (X((G(*) OR (** OR (** OR **)))) OR **)))) : F(G(**)) : X((X(X(X(X(F((F(*) OR *)))))) AND (* R *))) : X((X((X(G(**)) OR (G(**) OR **))) OR F(**))) : (G(F(*)) AND (X(**) OR G(**))) : (F(**) OR **) : X((* OR F(**))) : X(((X(G(**)) AND **) U **)) : G(F(*)) : (F(G(*)) AND F(**)) : X(G(*))"
},
"net":
{
"arcs": 128,
"conflict_clusters": 33,
"places": 54,
"places_significant": 32,
"singleton_clusters": 0,
"transitions": 43
},
"result":
{
"preliminary_value": "no unknown unknown no unknown yes no no yes no no no unknown ",
"value": "no unknown unknown no unknown yes no no yes no no no unknown "
},
"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: 97/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1728
lola: finding significant places
lola: 54 places, 43 transitions, 32 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: (NOT(X ((G ((1 <= p32)) U X ((p10 <= 0))))) OR (p47 <= 0)) : NOT(G ((X (F (((1 <= p7) U ((p8 <= 0) OR (p10 <= 0))))) U (1 <= p8)))) : X (G (F (G ((X ((((NOT(F ((5 <= p4))) OR (p36 <= 0)) OR (p37 <= 0)) OR (p39 <= 0))) U ((2 <= p1) AND (2 <= p2))))))) : X (F (G (((1 <= p5) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))) : NOT(X ((X (X (G (X (X ((G ((5 <= p4)) AND (5 <= p4))))))) OR ((1 <= p17) U (5 <= p4))))) : X ((X (((G (X (G ((1 <= p47)))) OR G ((1 <= p47))) OR (1 <= p47))) OR F ((1 <= p17)))) : (F (NOT(F (G ((((1 <= p0) AND (1 <= p51) AND (1 <= p52)) OR (1 <= p52)))))) AND (X ((1 <= p53)) OR G ((1 <= p35)))) : (((p53 <= 0) U ((1 <= p23) U F ((1 <= p23)))) OR (1 <= p23)) : (NOT(X ((1 <= p45))) OR X (F ((X ((1 <= p42)) U (1 <= p42))))) : X (((X (NOT(F (NOT(G ((1 <= p40)))))) AND ((1 <= p52) OR (1 <= p28))) U (1 <= p40))) : G (F (G (((p27 <= 0) U NOT(F (G ((1 <= p30)))))))) : (NOT(F (G (X (((5 <= p4) U F ((1 <= p8))))))) AND F (((1 <= p20) U (5 <= p4)))) : NOT(F (X (((3 <= p3) U F (((1 <= p41) AND (1 <= p42) AND (1 <= p44)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k: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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((X ((1 <= p10)) AND (F ((p32 <= 0)) OR X (G ((1 <= p10)))))) OR (p47 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p47 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p47 <= 0)
lola: processed formula length: 10
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((1 <= p10)) AND (F ((p32 <= 0)) OR X (G ((1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((1 <= p10)) AND (F ((p32 <= 0)) OR X (G ((1 <= p10))))))
lola: processed formula length: 63
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((p8 <= 0)) OR (X (G (((1 <= p8) AND (1 <= p10)))) AND (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p8 <= 0)) OR (X (G (((1 <= p8) AND (1 <= p10)))) AND (p8 <= 0))))
lola: processed formula length: 73
lola: 89 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: 4822753 markings, 7475250 edges, 964551 markings/sec, 0 secs
lola: 9457278 markings, 14658758 edges, 926905 markings/sec, 5 secs
lola: 14106391 markings, 21864887 edges, 929823 markings/sec, 10 secs
lola: 18750429 markings, 29063143 edges, 928808 markings/sec, 15 secs
lola: 23318215 markings, 36143206 edges, 913557 markings/sec, 20 secs
lola: 27815120 markings, 43113414 edges, 899381 markings/sec, 25 secs
lola: 32232749 markings, 49960745 edges, 883526 markings/sec, 30 secs
lola: 36573562 markings, 56689025 edges, 868163 markings/sec, 35 secs
lola: 40986905 markings, 63529714 edges, 882669 markings/sec, 40 secs
lola: 45367913 markings, 70320245 edges, 876202 markings/sec, 45 secs
lola: 49698350 markings, 77032425 edges, 866087 markings/sec, 50 secs
lola: 54048202 markings, 83774685 edges, 869970 markings/sec, 55 secs
lola: 58452020 markings, 90600606 edges, 880764 markings/sec, 60 secs
lola: 63004603 markings, 97657106 edges, 910517 markings/sec, 65 secs
lola: 67397371 markings, 104465903 edges, 878554 markings/sec, 70 secs
lola: 71289823 markings, 110500666 edges, 778490 markings/sec, 75 secs
lola: 72877851 markings, 112978444 edges, 317606 markings/sec, 80 secs
lola: 74745654 markings, 115857610 edges, 373561 markings/sec, 85 secs
lola: 76612308 markings, 118761062 edges, 373331 markings/sec, 90 secs
lola: 79043847 markings, 122531133 edges, 486308 markings/sec, 95 secs
lola: 79573428 markings, 123338801 edges, 105916 markings/sec, 100 secs
lola: 80633857 markings, 124982453 edges, 212086 markings/sec, 105 secs
lola: 82358471 markings, 127655604 edges, 344923 markings/sec, 110 secs
lola: 84659730 markings, 131222560 edges, 460252 markings/sec, 115 secs
lola: 87361011 markings, 135409546 edges, 540256 markings/sec, 120 secs
lola: 88180709 markings, 136680079 edges, 163940 markings/sec, 125 secs
lola: 88391989 markings, 137007559 edges, 42256 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F (((2 <= p1) AND (2 <= p2))) AND (X ((G ((p4 <= 4)) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))) OR ((2 <= p1) AND (2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((2 <= p1) AND (2 <= p2))) AND (X ((G ((p4 <= 4)) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))) OR ((2 <= p1) AND (2 <= p2))))))
lola: processed formula length: 140
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5022639 markings, 7785064 edges, 1004528 markings/sec, 0 secs
lola: 10010745 markings, 15516637 edges, 997621 markings/sec, 5 secs
lola: 14978915 markings, 23217294 edges, 993634 markings/sec, 10 secs
lola: 19930464 markings, 30892198 edges, 990310 markings/sec, 15 secs
lola: 24873975 markings, 38554645 edges, 988702 markings/sec, 20 secs
lola: 29614790 markings, 45902907 edges, 948163 markings/sec, 25 secs
lola: 34407447 markings, 53331523 edges, 958531 markings/sec, 30 secs
lola: 39136901 markings, 60662181 edges, 945891 markings/sec, 35 secs
lola: 44085355 markings, 68332281 edges, 989691 markings/sec, 40 secs
lola: 48876584 markings, 75758684 edges, 958246 markings/sec, 45 secs
lola: 53478129 markings, 82891084 edges, 920309 markings/sec, 50 secs
lola: 58280401 markings, 90334597 edges, 960454 markings/sec, 55 secs
lola: 63276356 markings, 98078327 edges, 999191 markings/sec, 60 secs
lola: 68036824 markings, 105457056 edges, 952094 markings/sec, 65 secs
lola: 71636265 markings, 111046262 edges, 719888 markings/sec, 70 secs
lola: 72343808 markings, 112132873 edges, 141509 markings/sec, 75 secs
lola: 73236460 markings, 113516497 edges, 178530 markings/sec, 80 secs
lola: 73303357 markings, 113620178 edges, 13379 markings/sec, 85 secs
lola: 73303357 markings, 113620178 edges, 0 markings/sec, 90 secs
lola: 75596075 markings, 117173891 edges, 458544 markings/sec, 95 secs
lola: 77686381 markings, 120413877 edges, 418061 markings/sec, 100 secs
lola: 77842611 markings, 120656025 edges, 31246 markings/sec, 105 secs
lola: 77842611 markings, 120656025 edges, 0 markings/sec, 110 secs
lola: 79413527 markings, 123090947 edges, 314183 markings/sec, 115 secs
lola: 82237807 markings, 127468577 edges, 564856 markings/sec, 120 secs
lola: 82237807 markings, 127468577 edges, 0 markings/sec, 125 secs
lola: 82237807 markings, 127468577 edges, 0 markings/sec, 130 secs
lola: 82237807 markings, 127468577 edges, 0 markings/sec, 135 secs
lola: 82237807 markings, 127468577 edges, 0 markings/sec, 140 secs
lola: 84845308 markings, 131510203 edges, 521500 markings/sec, 145 secs
lola: 85895066 markings, 133137329 edges, 209952 markings/sec, 150 secs
lola: 86591947 markings, 134217497 edges, 139376 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (X (F ((F ((p4 <= 4)) OR (p4 <= 4))))))) AND ((p17 <= 0) R (p4 <= 4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (X (F ((F ((p4 <= 4)) OR (p4 <= 4))))))) AND ((p17 <= 0) R (p4 <= 4))))
lola: processed formula length: 83
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5047917 markings, 7824250 edges, 1009583 markings/sec, 0 secs
lola: 10031416 markings, 15548672 edges, 996700 markings/sec, 5 secs
lola: 15045796 markings, 23320964 edges, 1002876 markings/sec, 10 secs
lola: 20093298 markings, 31144616 edges, 1009500 markings/sec, 15 secs
lola: 25051736 markings, 38830168 edges, 991688 markings/sec, 20 secs
lola: 29920014 markings, 46375995 edges, 973656 markings/sec, 25 secs
lola: 34670130 markings, 53738691 edges, 950023 markings/sec, 30 secs
lola: 39390502 markings, 61055258 edges, 944074 markings/sec, 35 secs
lola: 44277079 markings, 68629452 edges, 977315 markings/sec, 40 secs
lola: 48990771 markings, 75935678 edges, 942738 markings/sec, 45 secs
lola: 53681993 markings, 83207065 edges, 938244 markings/sec, 50 secs
lola: 58430804 markings, 90567713 edges, 949762 markings/sec, 55 secs
lola: 63306851 markings, 98125594 edges, 975209 markings/sec, 60 secs
lola: 67983036 markings, 105373686 edges, 935237 markings/sec, 65 secs
lola: 72276864 markings, 112029389 edges, 858766 markings/sec, 70 secs
lola: 75311002 markings, 116742192 edges, 606828 markings/sec, 75 secs
lola: 79213915 markings, 122781739 edges, 780583 markings/sec, 80 secs
lola: 82047361 markings, 127173388 edges, 566689 markings/sec, 85 secs
lola: 82047361 markings, 127173388 edges, 0 markings/sec, 90 secs
lola: 82047361 markings, 127173388 edges, 0 markings/sec, 95 secs
lola: 82047361 markings, 127173388 edges, 0 markings/sec, 100 secs
lola: 82047361 markings, 127173388 edges, 0 markings/sec, 105 secs
lola: 83219570 markings, 128990314 edges, 234442 markings/sec, 110 secs
lola: 84045728 markings, 130270854 edges, 165232 markings/sec, 115 secs
lola: 84079123 markings, 130322619 edges, 6679 markings/sec, 120 secs
lola: 86351216 markings, 133844363 edges, 454419 markings/sec, 125 secs
lola: 87070762 markings, 134959652 edges, 143909 markings/sec, 130 secs
lola: 87556618 markings, 135712736 edges, 97171 markings/sec, 135 secs
lola: 87669528 markings, 135887745 edges, 22582 markings/sec, 140 secs
lola: 87851377 markings, 136169613 edges, 36370 markings/sec, 145 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((X (G ((1 <= p47))) OR (G ((1 <= p47)) OR (1 <= p47)))) OR F ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((X (G ((1 <= p47))) OR (G ((1 <= p47)) OR (1 <= p47)))) OR F ((1 <= p17))))
lola: processed formula length: 82
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G (F ((((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND (p52 <= 0)))) AND (X ((1 <= p53)) OR G ((1 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 372 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p35))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p35))
lola: processed formula length: 14
lola: 89 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND (p52 <= 0))))
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 ((((p0 <= 0) OR (p51 <= 0) OR (p52 <= 0)) AND (p52 <= 0))))
lola: processed formula length: 66
lola: 89 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: 11 markings, 11 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 6 will run for 425 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p45 <= 0) OR F ((1 <= p42))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p45 <= 0) OR F ((1 <= p42))))
lola: processed formula length: 34
lola: 89 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((X (G ((1 <= p40))) AND ((1 <= p52) OR (1 <= p28))) U (1 <= p40)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((X (G ((1 <= p40))) AND ((1 <= p52) OR (1 <= p28))) U (1 <= p40)))
lola: processed formula length: 71
lola: 89 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: 11 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))))
lola: processed formula length: 50
lola: 89 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: 4990661 markings, 7735498 edges, 998132 markings/sec, 0 secs
lola: 9844014 markings, 15258203 edges, 970671 markings/sec, 5 secs
lola: 14789894 markings, 22924321 edges, 989176 markings/sec, 10 secs
lola: 19628648 markings, 30424380 edges, 967751 markings/sec, 15 secs
lola: 24508765 markings, 37988569 edges, 976023 markings/sec, 20 secs
lola: 29095853 markings, 45098552 edges, 917418 markings/sec, 25 secs
lola: 33773555 markings, 52348986 edges, 935540 markings/sec, 30 secs
lola: 38304060 markings, 59371277 edges, 906101 markings/sec, 35 secs
lola: 43065589 markings, 66751645 edges, 952306 markings/sec, 40 secs
lola: 47683873 markings, 73909981 edges, 923657 markings/sec, 45 secs
lola: 52436146 markings, 81276006 edges, 950455 markings/sec, 50 secs
lola: 57046491 markings, 88422041 edges, 922069 markings/sec, 55 secs
lola: 61818457 markings, 95818584 edges, 954393 markings/sec, 60 secs
lola: 66442304 markings, 102985550 edges, 924769 markings/sec, 65 secs
lola: 71094877 markings, 110197037 edges, 930515 markings/sec, 70 secs
lola: 73636352 markings, 114137699 edges, 508295 markings/sec, 75 secs
lola: 76831279 markings, 119100205 edges, 638985 markings/sec, 80 secs
lola: 79429767 markings, 123116113 edges, 519698 markings/sec, 85 secs
lola: 82281883 markings, 127536897 edges, 570423 markings/sec, 90 secs
lola: 84305818 markings, 130673998 edges, 404787 markings/sec, 95 secs
lola: 84305818 markings, 130673998 edges, 0 markings/sec, 100 secs
lola: 84305818 markings, 130673998 edges, 0 markings/sec, 105 secs
lola: 84305818 markings, 130673998 edges, 0 markings/sec, 110 secs
lola: 84457728 markings, 130909458 edges, 30382 markings/sec, 115 secs
lola: 85979581 markings, 133268330 edges, 304371 markings/sec, 120 secs
lola: 86014771 markings, 133322875 edges, 7038 markings/sec, 125 secs
lola: 87844351 markings, 136158723 edges, 365916 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p30 <= 0)))
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 ((p30 <= 0)))
lola: processed formula length: 18
lola: 89 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: 116 markings, 145 edges
lola: subprocess 10 will run for 946 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p5) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))
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 <= p5) OR ((1 <= p0) AND (1 <= p51) AND (1 <= p52)))))
lola: processed formula length: 65
lola: 89 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: add low 41
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: 12 markings, 13 edges
lola: ========================================
lola: subprocess 11 will run for 1420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((1 <= p23)) OR (1 <= p23))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 1420 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p23)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p23)
lola: processed formula length: 10
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 2840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((1 <= p23))
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: (p23 <= 0)
lola: processed formula length: 10
lola: 91 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 2840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p8 <= 0))) AND F ((5 <= p4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 2840 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((5 <= p4))
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: (p4 <= 4)
lola: processed formula length: 9
lola: 91 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: 7 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((G ((p8 <= 0)) OR (X (G (((1 <= p8) AND (1 <= p10)))) AND (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((p8 <= 0)) OR (X (G (((1 <= p8) AND (1 <= p10)))) AND (p8 <= 0))))
lola: processed formula length: 73
lola: 89 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: 4592947 markings, 7119048 edges, 918589 markings/sec, 0 secs
lola: 9052693 markings, 14031656 edges, 891949 markings/sec, 5 secs
lola: 13565259 markings, 21026132 edges, 902513 markings/sec, 10 secs
lola: 17806131 markings, 27599486 edges, 848174 markings/sec, 15 secs
lola: 22184422 markings, 34385832 edges, 875658 markings/sec, 20 secs
lola: 26517826 markings, 41102599 edges, 866681 markings/sec, 25 secs
lola: 30682254 markings, 47557476 edges, 832886 markings/sec, 30 secs
lola: 34940108 markings, 54157141 edges, 851571 markings/sec, 35 secs
lola: 39072353 markings, 60562136 edges, 826449 markings/sec, 40 secs
lola: 43446107 markings, 67341448 edges, 874751 markings/sec, 45 secs
lola: 47589207 markings, 73763245 edges, 828620 markings/sec, 50 secs
lola: 51884406 markings, 80420808 edges, 859040 markings/sec, 55 secs
lola: 56038608 markings, 86859815 edges, 830840 markings/sec, 60 secs
lola: 60306217 markings, 93474609 edges, 853522 markings/sec, 65 secs
lola: 64492945 markings, 99964039 edges, 837346 markings/sec, 70 secs
lola: 68899067 markings, 106793530 edges, 881224 markings/sec, 75 secs
lola: 71924127 markings, 111484931 edges, 605012 markings/sec, 80 secs
lola: 73709631 markings, 114260738 edges, 357101 markings/sec, 85 secs
lola: 75259099 markings, 116651586 edges, 309894 markings/sec, 90 secs
lola: 76730589 markings, 118932389 edges, 294298 markings/sec, 95 secs
lola: 76907077 markings, 119205946 edges, 35298 markings/sec, 100 secs
lola: 76907077 markings, 119205946 edges, 0 markings/sec, 105 secs
lola: 79944128 markings, 123962885 edges, 607410 markings/sec, 110 secs
lola: 81045525 markings, 125620540 edges, 220279 markings/sec, 115 secs
lola: 81173586 markings, 125819042 edges, 25612 markings/sec, 120 secs
lola: 81830754 markings, 126837647 edges, 131434 markings/sec, 125 secs
lola: 82457106 markings, 127808495 edges, 125270 markings/sec, 130 secs
lola: 84627593 markings, 131172754 edges, 434097 markings/sec, 135 secs
lola: 84704038 markings, 131291236 edges, 15289 markings/sec, 140 secs
lola: 85779929 markings, 132958867 edges, 215178 markings/sec, 145 secs
lola: 88207361 markings, 136721384 edges, 485486 markings/sec, 150 secs
lola: 88207361 markings, 136721384 edges, 0 markings/sec, 155 secs
lola: 88207361 markings, 136721384 edges, 0 markings/sec, 160 secs
lola: 88207361 markings, 136721384 edges, 0 markings/sec, 165 secs
lola: 88207361 markings, 136721384 edges, 0 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: F (G ((F (((2 <= p1) AND (2 <= p2))) AND (X ((G ((p4 <= 4)) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))) OR ((2 <= p1) AND (2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F (((2 <= p1) AND (2 <= p2))) AND (X ((G ((p4 <= 4)) OR ((p36 <= 0) OR ((p37 <= 0) OR (p39 <= 0))))) OR ((2 <= p1) AND (2 <= p2))))))
lola: processed formula length: 140
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5021021 markings, 7782561 edges, 1004204 markings/sec, 0 secs
lola: 9975474 markings, 15461965 edges, 990891 markings/sec, 5 secs
lola: 15035043 markings, 23304296 edges, 1011914 markings/sec, 10 secs
lola: 20159279 markings, 31246857 edges, 1024847 markings/sec, 15 secs
lola: 25022635 markings, 38785061 edges, 972671 markings/sec, 20 secs
lola: 29714553 markings, 46057527 edges, 938384 markings/sec, 25 secs
lola: 34442258 markings, 53385478 edges, 945541 markings/sec, 30 secs
lola: 39246366 markings, 60831854 edges, 960822 markings/sec, 35 secs
lola: 44073758 markings, 68314302 edges, 965478 markings/sec, 40 secs
lola: 48663708 markings, 75428729 edges, 917990 markings/sec, 45 secs
lola: 53271805 markings, 82571273 edges, 921619 markings/sec, 50 secs
lola: 57833547 markings, 89641966 edges, 912348 markings/sec, 55 secs
lola: 62591639 markings, 97017015 edges, 951618 markings/sec, 60 secs
lola: 67238388 markings, 104219474 edges, 929350 markings/sec, 65 secs
lola: 71675325 markings, 111097662 edges, 887387 markings/sec, 70 secs
lola: 71789989 markings, 111274458 edges, 22933 markings/sec, 75 secs
lola: 74171966 markings, 114966802 edges, 476395 markings/sec, 80 secs
lola: 75885791 markings, 117636129 edges, 342765 markings/sec, 85 secs
lola: 79733359 markings, 123586680 edges, 769514 markings/sec, 90 secs
lola: 80633753 markings, 124982291 edges, 180079 markings/sec, 95 secs
lola: 82261626 markings, 127505504 edges, 325575 markings/sec, 100 secs
lola: 83453659 markings, 129353159 edges, 238407 markings/sec, 105 secs
lola: 85210135 markings, 132075692 edges, 351295 markings/sec, 110 secs
lola: 86535070 markings, 134129333 edges, 264987 markings/sec, 115 secs
lola: 88479390 markings, 137143030 edges, 388864 markings/sec, 120 secs
lola: 88479390 markings, 137143030 edges, 0 markings/sec, 125 secs
lola: 88479390 markings, 137143030 edges, 0 markings/sec, 130 secs
lola: 88479390 markings, 137143030 edges, 0 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X ((X (X (X (X (F ((F ((p4 <= 4)) OR (p4 <= 4))))))) AND ((p17 <= 0) R (p4 <= 4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (X (X (X (F ((F ((p4 <= 4)) OR (p4 <= 4))))))) AND ((p17 <= 0) R (p4 <= 4))))
lola: processed formula length: 83
lola: 89 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4923457 markings, 7631334 edges, 984691 markings/sec, 0 secs
lola: 9726055 markings, 15075362 edges, 960520 markings/sec, 5 secs
lola: 14542176 markings, 22540353 edges, 963224 markings/sec, 10 secs
lola: 19285065 markings, 29891823 edges, 948578 markings/sec, 15 secs
lola: 24190316 markings, 37494973 edges, 981050 markings/sec, 20 secs
lola: 28773503 markings, 44598908 edges, 916637 markings/sec, 25 secs
lola: 33504283 markings, 51931621 edges, 946156 markings/sec, 30 secs
lola: 38348626 markings, 59440351 edges, 968869 markings/sec, 35 secs
lola: 43161605 markings, 66900476 edges, 962596 markings/sec, 40 secs
lola: 47831885 markings, 74139386 edges, 934056 markings/sec, 45 secs
lola: 52579139 markings, 81497644 edges, 949451 markings/sec, 50 secs
lola: 57346151 markings, 88886507 edges, 953402 markings/sec, 55 secs
lola: 62149976 markings, 96332442 edges, 960765 markings/sec, 60 secs
lola: 67099154 markings, 104003662 edges, 989836 markings/sec, 65 secs
lola: 71827504 markings, 111332694 edges, 945670 markings/sec, 70 secs
lola: 73172111 markings, 113431761 edges, 268921 markings/sec, 75 secs
lola: 74054606 markings, 114784622 edges, 176499 markings/sec, 80 secs
lola: 75267210 markings, 116664148 edges, 242521 markings/sec, 85 secs
lola: 75267210 markings, 116664148 edges, 0 markings/sec, 90 secs
lola: 77857023 markings, 120678365 edges, 517963 markings/sec, 95 secs
lola: 79286674 markings, 122894323 edges, 285930 markings/sec, 100 secs
lola: 79711735 markings, 123553161 edges, 85012 markings/sec, 105 secs
lola: 82727015 markings, 128226856 edges, 603056 markings/sec, 110 secs
lola: 86267040 markings, 133713893 edges, 708005 markings/sec, 115 secs
lola: 86410711 markings, 133936580 edges, 28734 markings/sec, 120 secs
lola: 86410711 markings, 133936580 edges, 0 markings/sec, 125 secs
lola: 86410711 markings, 133936580 edges, 0 markings/sec, 130 secs
lola: 86429823 markings, 133966204 edges, 3822 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p41 <= 0) OR (p42 <= 0) OR (p44 <= 0))))
lola: processed formula length: 50
lola: 89 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: 5222022 markings, 8094108 edges, 1044404 markings/sec, 0 secs
lola: 10199130 markings, 15808631 edges, 995422 markings/sec, 5 secs
lola: 15096941 markings, 23400235 edges, 979562 markings/sec, 10 secs
lola: 20100789 markings, 31156200 edges, 1000770 markings/sec, 15 secs
lola: 25055907 markings, 38836634 edges, 991024 markings/sec, 20 secs
lola: 29857318 markings, 46278819 edges, 960282 markings/sec, 25 secs
lola: 34640662 markings, 53693008 edges, 956669 markings/sec, 30 secs
lola: 39183226 markings, 60733982 edges, 908513 markings/sec, 35 secs
lola: 43949224 markings, 68121276 edges, 953200 markings/sec, 40 secs
lola: 48641257 markings, 75393931 edges, 938407 markings/sec, 45 secs
lola: 53323193 markings, 82650928 edges, 936387 markings/sec, 50 secs
lola: 57994014 markings, 89890695 edges, 934164 markings/sec, 55 secs
lola: 62840354 markings, 97402526 edges, 969268 markings/sec, 60 secs
lola: 67548316 markings, 104699873 edges, 941592 markings/sec, 65 secs
lola: 72068677 markings, 111707829 edges, 904072 markings/sec, 70 secs
lola: 75298213 markings, 116712991 edges, 645907 markings/sec, 75 secs
lola: 75732008 markings, 117384593 edges, 86759 markings/sec, 80 secs
lola: 78811910 markings, 122158437 edges, 615980 markings/sec, 85 secs
lola: 78855315 markings, 122225713 edges, 8681 markings/sec, 90 secs
lola: 78873802 markings, 122254372 edges, 3697 markings/sec, 95 secs
lola: 82027213 markings, 127142156 edges, 630682 markings/sec, 100 secs
lola: 83381030 markings, 129240572 edges, 270763 markings/sec, 105 secs
lola: 85542713 markings, 132591181 edges, 432337 markings/sec, 110 secs
lola: 88256476 markings, 136797527 edges, 542753 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown unknown no unknown yes no no yes no no no unknown
lola:
preliminary result: no unknown unknown no unknown yes no no yes no no no unknown
lola: memory consumption: 3548 KB
lola: time consumption: 1475 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="RefineWMG-PT-010010"
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 RefineWMG-PT-010010, 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 r186-oct2-158987938400050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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