fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r186-oct2-158987938500066
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for RefineWMG-PT-015015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15801.680 3600000.00 552556.00 285771.50 T?FFTTFTTFFF?FFT normal

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-158987938500066.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-015015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938500066
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 200K
-rw-r--r-- 1 mcc users 3.0K Apr 12 10:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 10:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 12:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:00 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.1K Apr 14 12:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 9 22:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 35K 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-015015-00
FORMULA_NAME RefineWMG-PT-015015-01
FORMULA_NAME RefineWMG-PT-015015-02
FORMULA_NAME RefineWMG-PT-015015-03
FORMULA_NAME RefineWMG-PT-015015-04
FORMULA_NAME RefineWMG-PT-015015-05
FORMULA_NAME RefineWMG-PT-015015-06
FORMULA_NAME RefineWMG-PT-015015-07
FORMULA_NAME RefineWMG-PT-015015-08
FORMULA_NAME RefineWMG-PT-015015-09
FORMULA_NAME RefineWMG-PT-015015-10
FORMULA_NAME RefineWMG-PT-015015-11
FORMULA_NAME RefineWMG-PT-015015-12
FORMULA_NAME RefineWMG-PT-015015-13
FORMULA_NAME RefineWMG-PT-015015-14
FORMULA_NAME RefineWMG-PT-015015-15

=== Now, execution of the tool begins

BK_START 1591224859939

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 22:54:30] [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:54:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 22:54:30] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2020-06-03 22:54:30] [INFO ] Transformed 79 places.
[2020-06-03 22:54:30] [INFO ] Transformed 63 transitions.
[2020-06-03 22:54:30] [INFO ] Parsed PT model containing 79 places and 63 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100005 steps, including 0 resets, run finished after 205 ms. (steps per millisecond=487 ) properties seen :[1, 1, 1, 1, 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, 1, 1]
// Phase 1: matrix 63 rows 79 cols
[2020-06-03 22:54:30] [INFO ] Computed 32 place invariants in 3 ms
[2020-06-03 22:54:31] [INFO ] [Real]Absence check using 32 positive place invariants in 87 ms returned sat
[2020-06-03 22:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:31] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-06-03 22:54:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 22:54:31] [INFO ] [Nat]Absence check using 32 positive place invariants in 46 ms returned sat
[2020-06-03 22:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 22:54:31] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2020-06-03 22:54:31] [INFO ] Computed and/alt/rep : 47/62/47 causal constraints in 35 ms.
[2020-06-03 22:54:31] [INFO ] Added : 30 causal constraints over 6 iterations in 215 ms. Result :sat
[2020-06-03 22:54:31] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-03 22:54:31] [INFO ] Flatten gal took : 38 ms
FORMULA RefineWMG-PT-015015-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 22:54:31] [INFO ] Flatten gal took : 16 ms
[2020-06-03 22:54:31] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2020-06-03 22:54:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ RefineWMG-PT-015015 @ 3570 seconds

FORMULA RefineWMG-PT-015015-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-015015-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

FORMULA RefineWMG-PT-015015-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA RefineWMG-PT-015015-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RefineWMG-PT-015015-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2548
rslt: Output for LTLFireability @ RefineWMG-PT-015015

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 301
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 7,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 1,
"tdisj": 4,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X ((X (G ((p27 <= 0))) OR (((((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) R (p75 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))) OR ((p6 <= 0) OR ((p7 <= 0) OR (p9 <= 0))))))",
"processed_size": 173,
"rewrites": 81
},
"result":
{
"edges": 32,
"markings": 33,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 331
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((1 <= p78)))",
"processed_size": 18,
"rewrites": 81
},
"result":
{
"edges": 32,
"markings": 32,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 368
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"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": "(((p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)) R X (G ((p17 <= 0))))",
"processed_size": 65,
"rewrites": 81
},
"result":
{
"edges": 16,
"markings": 16,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 436
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G ((G ((p58 <= 0)) OR (3 <= p3))) OR (X (F ((p3 <= 2))) AND (G ((p58 <= 0)) OR (3 <= p3))))))",
"processed_size": 100,
"rewrites": 81
},
"result":
{
"edges": 135443,
"markings": 99546,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 19
},
"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": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X ((G ((X ((1 <= p67)) OR (G ((1 <= p53)) AND X (F ((1 <= p67)))))) OR (F ((1 <= p67)) OR (p53 <= 0))))",
"processed_size": 103,
"rewrites": 81
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 9
},
"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": 610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "G (F (((p51 <= 0) OR (p52 <= 0) OR (p54 <= 0))))",
"processed_size": 50,
"rewrites": 81
},
"result":
{
"edges": 140,
"markings": 111,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 763
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 3,
"U": 1,
"X": 0,
"aconj": 0,
"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": "(((F (G ((1 <= p37))) AND G ((1 <= p37))) OR (G ((1 <= p47)) AND ((1 <= p47) AND (1 <= p37)))) U (3 <= p3))",
"processed_size": 107,
"rewrites": 81
},
"result":
{
"edges": 718,
"markings": 466,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1017
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"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": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((G ((G (F (((p1 <= 1) OR (p2 <= 1)))) OR (5 <= p4))) OR (G ((1 <= p53)) OR (1 <= p53))))",
"processed_size": 92,
"rewrites": 81
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1526
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F ((G (F ((p53 <= 0))) OR G (((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0))))))",
"processed_size": 78,
"rewrites": 81
},
"result":
{
"edges": 707,
"markings": 425,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 3052
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3052
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p36) AND (1 <= p37) AND (1 <= p39))",
"processed_size": 42,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"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": "((1 <= p36) AND (1 <= p37) AND (1 <= p39))",
"processed_size": 42,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(((2 <= p1) AND (2 <= p2)) U ((1 <= p47) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39))))",
"processed_size": 87,
"rewrites": 81
},
"result":
{
"edges": 2,
"markings": 2,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 15,
"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": 14,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3728,
"runtime": 1022.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "F(G((G((X(G(**)) OR **)) OR **))) : G(F((G(F(**)) OR G(*)))) : G(F(**)) : G((G((G(F(*)) OR *)) OR (G(**) OR **))) : X((X(G(*)) OR (((* R *) AND *) OR (* OR (* OR *))))) : ((** U (** U **)) OR **) : X(F(**)) : (* R X(G(*))) : (X(X(X(G((F(*) AND *))))) U G(**)) : G(F((G((G(*) OR *)) OR (X(F(*)) AND (G(*) OR *))))) : (((F(G(**)) AND G(**)) OR (G(**) AND (** AND **))) U **) : X((G((X(**) OR (G(**) AND X(F(**))))) OR (F(**) OR **)))"
},
"net":
{
"arcs": 188,
"conflict_clusters": 48,
"places": 79,
"places_significant": 47,
"singleton_clusters": 0,
"transitions": 63
},
"result":
{
"preliminary_value": "unknown no no no yes no no no unknown no no yes ",
"value": "unknown no no no yes no no no unknown no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 142/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2528
lola: finding significant places
lola: 79 places, 63 transitions, 47 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: F (G ((G ((X (G (((2 <= p1) AND (2 <= p2)))) OR (1 <= p67))) OR ((2 <= p1) AND (2 <= p2))))) : G (F ((NOT(F (X (NOT(X (F ((p53 <= 0))))))) OR NOT(F (((1 <= p21) AND (1 <= p22) AND (1 <= p24))))))) : G (F (((p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)))) : G (((NOT(F ((X (F (G (((2 <= p1) AND (2 <= p2))))) AND (p4 <= 4)))) OR G ((1 <= p53))) OR (1 <= p53))) : NOT(X (((((F (X ((1 <= p27))) AND ((((1 <= p6) AND (1 <= p7) AND (1 <= p9)) U (1 <= p75)) OR ((1 <= p6) AND (1 <= p7) AND (1 <= p9)))) AND (1 <= p6)) AND (1 <= p7)) AND (1 <= p9)))) : ((((2 <= p1) AND (2 <= p2)) U ((1 <= p47) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p39))) : F (X ((1 <= p78))) : NOT((((1 <= p51) AND (1 <= p52) AND (1 <= p54)) U F (X ((1 <= p17))))) : (X (X (X ((NOT(F (G ((1 <= p10)))) AND NOT(F ((1 <= p10))))))) U G ((1 <= p27))) : NOT(F (X (G ((G (X ((3 <= p3))) U (F ((1 <= p58)) AND (p3 <= 2))))))) : (((F (G ((1 <= p37))) AND G ((1 <= p37))) OR ((G ((1 <= p47)) AND (1 <= p47)) AND (1 <= p37))) U (3 <= p3)) : X (((G ((G ((1 <= p53)) U X ((1 <= p67)))) OR F ((1 <= p67))) OR (p53 <= 0)))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:315
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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((G ((X (G (((2 <= p1) AND (2 <= p2)))) OR (1 <= p67))) 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 ((G ((X (G (((2 <= p1) AND (2 <= p2)))) OR (1 <= p67))) OR ((2 <= p1) AND (2 <= p2)))))
lola: processed formula length: 92
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4296220 markings, 6587520 edges, 859244 markings/sec, 0 secs
lola: 8431462 markings, 12928220 edges, 827048 markings/sec, 5 secs
lola: 12597970 markings, 19316862 edges, 833302 markings/sec, 10 secs
lola: 16800029 markings, 25760020 edges, 840412 markings/sec, 15 secs
lola: 20865173 markings, 31993243 edges, 813029 markings/sec, 20 secs
lola: 24662362 markings, 37815593 edges, 759438 markings/sec, 25 secs
lola: 28434493 markings, 43599540 edges, 754426 markings/sec, 30 secs
lola: 32318033 markings, 49554289 edges, 776708 markings/sec, 35 secs
lola: 36298932 markings, 55658340 edges, 796180 markings/sec, 40 secs
lola: 40154706 markings, 61570521 edges, 771155 markings/sec, 45 secs
lola: 43920372 markings, 67344549 edges, 753133 markings/sec, 50 secs
lola: 47827044 markings, 73334777 edges, 781334 markings/sec, 55 secs
lola: 51753047 markings, 79354640 edges, 785201 markings/sec, 60 secs
lola: 55558960 markings, 85190371 edges, 761183 markings/sec, 65 secs
lola: 59318240 markings, 90954613 edges, 751856 markings/sec, 70 secs
lola: 63067391 markings, 96703309 edges, 749830 markings/sec, 75 secs
lola: 66636387 markings, 102175943 edges, 713799 markings/sec, 80 secs
lola: 67309918 markings, 103210023 edges, 134706 markings/sec, 85 secs
lola: 68977292 markings, 105770711 edges, 333475 markings/sec, 90 secs
lola: 70502925 markings, 108105768 edges, 305127 markings/sec, 95 secs
lola: 72269340 markings, 110825001 edges, 353283 markings/sec, 100 secs
lola: 72875548 markings, 111742492 edges, 121242 markings/sec, 105 secs
lola: 74571577 markings, 114343059 edges, 339206 markings/sec, 110 secs
lola: 74692334 markings, 114528209 edges, 24151 markings/sec, 115 secs
lola: 75078419 markings, 115120210 edges, 77217 markings/sec, 120 secs
lola: 76125722 markings, 116726083 edges, 209461 markings/sec, 125 secs
lola: 76125722 markings, 116726083 edges, 0 markings/sec, 130 secs
lola: 77051683 markings, 118145886 edges, 185192 markings/sec, 135 secs
lola: 77077610 markings, 118185645 edges, 5185 markings/sec, 140 secs
lola: 77973839 markings, 119559856 edges, 179246 markings/sec, 145 secs
lola: 78164505 markings, 119852212 edges, 38133 markings/sec, 150 secs
lola: 78164505 markings, 119852212 edges, 0 markings/sec, 155 secs
lola: 78164505 markings, 119852212 edges, 0 markings/sec, 160 secs
lola: 78164562 markings, 119852294 edges, 11 markings/sec, 165 secs
lola: 78728381 markings, 120716813 edges, 112764 markings/sec, 170 secs
lola: 79814681 markings, 122382496 edges, 217260 markings/sec, 175 secs
lola: 79816046 markings, 122384578 edges, 273 markings/sec, 180 secs
lola: 80045707 markings, 122736721 edges, 45932 markings/sec, 185 secs
lola: 80659606 markings, 123678028 edges, 122780 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((p27 <= 0))) OR (((((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) R (p75 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))) OR ((p6 <= 0) OR ((p7 <= 0) OR (p9 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((p27 <= 0))) OR (((((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0)) R (p75 <= 0)) AND ((p6 <= 0) OR (p7 <= 0) OR (p9 <= 0))) OR ((p6 <= 0) OR ((p7 <= 0) OR (p9 <= 0))))))
lola: processed formula length: 173
lola: 81 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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((1 <= p78)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((1 <= p78)))
lola: processed formula length: 18
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 32 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)) R X (G ((p17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((p51 <= 0) OR (p52 <= 0) OR (p54 <= 0)) R X (G ((p17 <= 0))))
lola: processed formula length: 65
lola: 81 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: 16 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 414 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (X (G ((F ((p10 <= 0)) AND (p10 <= 0)))))) U G ((1 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (X (G ((F ((p10 <= 0)) AND (p10 <= 0)))))) U G ((1 <= p27)))
lola: processed formula length: 66
lola: 81 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: 4185951 markings, 6418445 edges, 837190 markings/sec, 0 secs
lola: 8249988 markings, 12649967 edges, 812807 markings/sec, 5 secs
lola: 12314074 markings, 18881562 edges, 812817 markings/sec, 10 secs
lola: 16384121 markings, 25122299 edges, 814009 markings/sec, 15 secs
lola: 20347517 markings, 31199501 edges, 792679 markings/sec, 20 secs
lola: 24215022 markings, 37129671 edges, 773501 markings/sec, 25 secs
lola: 27956583 markings, 42866732 edges, 748312 markings/sec, 30 secs
lola: 31672628 markings, 48564667 edges, 743209 markings/sec, 35 secs
lola: 35683090 markings, 54714047 edges, 802092 markings/sec, 40 secs
lola: 39524856 markings, 60604755 edges, 768353 markings/sec, 45 secs
lola: 43275097 markings, 66355116 edges, 750048 markings/sec, 50 secs
lola: 47137445 markings, 72277385 edges, 772470 markings/sec, 55 secs
lola: 51105132 markings, 78361167 edges, 793537 markings/sec, 60 secs
lola: 55108511 markings, 84499690 edges, 800676 markings/sec, 65 secs
lola: 58966418 markings, 90415151 edges, 771581 markings/sec, 70 secs
lola: 62656781 markings, 96073701 edges, 738073 markings/sec, 75 secs
lola: 65800261 markings, 100893714 edges, 628696 markings/sec, 80 secs
lola: 66454676 markings, 101897481 edges, 130883 markings/sec, 85 secs
lola: 68066052 markings, 104367920 edges, 322275 markings/sec, 90 secs
lola: 69590221 markings, 106705913 edges, 304834 markings/sec, 95 secs
lola: 69592833 markings, 106708992 edges, 522 markings/sec, 100 secs
lola: 69859576 markings, 107117990 edges, 53349 markings/sec, 105 secs
lola: 72623636 markings, 111359732 edges, 552812 markings/sec, 110 secs
lola: 75151653 markings, 115232507 edges, 505603 markings/sec, 115 secs
lola: 75219236 markings, 115336141 edges, 13517 markings/sec, 120 secs
lola: 75219236 markings, 115336141 edges, 0 markings/sec, 125 secs
lola: 75219236 markings, 115336141 edges, 0 markings/sec, 130 secs
lola: 75747301 markings, 116145839 edges, 105613 markings/sec, 135 secs
lola: 75945441 markings, 116449652 edges, 39628 markings/sec, 140 secs
lola: 76380123 markings, 117116161 edges, 86936 markings/sec, 145 secs
lola: 77505287 markings, 118841414 edges, 225033 markings/sec, 150 secs
lola: 77505287 markings, 118841414 edges, 0 markings/sec, 155 secs
lola: 77505287 markings, 118841414 edges, 0 markings/sec, 160 secs
lola: 78633731 markings, 120571692 edges, 225689 markings/sec, 165 secs
lola: 79610109 markings, 122068806 edges, 195276 markings/sec, 170 secs
lola: 79610109 markings, 122068806 edges, 0 markings/sec, 175 secs
lola: 79610109 markings, 122068806 edges, 0 markings/sec, 180 secs
lola: 79610109 markings, 122068806 edges, 0 markings/sec, 185 secs
lola: 79650202 markings, 122130284 edges, 8019 markings/sec, 190 secs
lola: 80904897 markings, 124054146 edges, 250939 markings/sec, 195 secs
lola: 80953578 markings, 124128785 edges, 9736 markings/sec, 200 secs
lola: 80953578 markings, 124128785 edges, 0 markings/sec, 205 secs
lola: 80953578 markings, 124128785 edges, 0 markings/sec, 210 secs
lola: 81361333 markings, 124754014 edges, 81551 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 436 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((G ((p58 <= 0)) OR (3 <= p3))) OR (X (F ((p3 <= 2))) AND (G ((p58 <= 0)) OR (3 <= p3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((G ((p58 <= 0)) OR (3 <= p3))) OR (X (F ((p3 <= 2))) AND (G ((p58 <= 0)) OR (3 <= p3))))))
lola: processed formula length: 100
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 19 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: 99546 markings, 135443 edges
lola: ========================================
lola: subprocess 6 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((G ((X ((1 <= p67)) OR (G ((1 <= p53)) AND X (F ((1 <= p67)))))) OR (F ((1 <= p67)) OR (p53 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((G ((X ((1 <= p67)) OR (G ((1 <= p53)) AND X (F ((1 <= p67)))))) OR (F ((1 <= p67)) OR (p53 <= 0))))
lola: processed formula length: 103
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p51 <= 0) OR (p52 <= 0) OR (p54 <= 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 (((p51 <= 0) OR (p52 <= 0) OR (p54 <= 0))))
lola: processed formula length: 50
lola: 81 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: 111 markings, 140 edges
lola: ========================================
lola: subprocess 8 will run for 763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((F (G ((1 <= p37))) AND G ((1 <= p37))) OR (G ((1 <= p47)) AND ((1 <= p47) AND (1 <= p37)))) U (3 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((F (G ((1 <= p37))) AND G ((1 <= p37))) OR (G ((1 <= p47)) AND ((1 <= p47) AND (1 <= p37)))) U (3 <= p3))
lola: processed formula length: 107
lola: 81 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: 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: 466 markings, 718 edges
lola: ========================================
lola: subprocess 9 will run for 1017 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((G ((G (F (((p1 <= 1) OR (p2 <= 1)))) OR (5 <= p4))) OR (G ((1 <= p53)) OR (1 <= p53))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((G ((G (F (((p1 <= 1) OR (p2 <= 1)))) OR (5 <= p4))) OR (G ((1 <= p53)) OR (1 <= p53))))
lola: processed formula length: 92
lola: 81 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 1526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (F ((p53 <= 0))) OR G (((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (F ((p53 <= 0))) OR G (((p21 <= 0) OR (p22 <= 0) OR (p24 <= 0))))))
lola: processed formula length: 78
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 425 markings, 707 edges
lola: ========================================
lola: subprocess 11 will run for 3052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1) AND (2 <= p2)) U ((1 <= p47) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p36) AND (1 <= p37) AND (1 <= p39))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36) AND (1 <= p37) AND (1 <= p39))
lola: processed formula length: 42
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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: F (G ((G ((X (G (((2 <= p1) AND (2 <= p2)))) OR (1 <= p67))) 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 ((G ((X (G (((2 <= p1) AND (2 <= p2)))) OR (1 <= p67))) OR ((2 <= p1) AND (2 <= p2)))))
lola: processed formula length: 92
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 4335825 markings, 6648242 edges, 867165 markings/sec, 0 secs
lola: 8518191 markings, 13061208 edges, 836473 markings/sec, 5 secs
lola: 12692061 markings, 19461140 edges, 834774 markings/sec, 10 secs
lola: 16964374 markings, 26012007 edges, 854463 markings/sec, 15 secs
lola: 21129823 markings, 32399042 edges, 833090 markings/sec, 20 secs
lola: 25176770 markings, 38604362 edges, 809389 markings/sec, 25 secs
lola: 29110594 markings, 44636221 edges, 786765 markings/sec, 30 secs
lola: 33034053 markings, 50652192 edges, 784692 markings/sec, 35 secs
lola: 36994758 markings, 56725272 edges, 792141 markings/sec, 40 secs
lola: 40890454 markings, 62698668 edges, 779139 markings/sec, 45 secs
lola: 44759123 markings, 68630622 edges, 773734 markings/sec, 50 secs
lola: 48722001 markings, 74707034 edges, 792576 markings/sec, 55 secs
lola: 52763740 markings, 80904374 edges, 808348 markings/sec, 60 secs
lola: 56707966 markings, 86952189 edges, 788845 markings/sec, 65 secs
lola: 60475826 markings, 92729569 edges, 753572 markings/sec, 70 secs
lola: 64306048 markings, 98602584 edges, 766044 markings/sec, 75 secs
lola: 67491451 markings, 103486997 edges, 637081 markings/sec, 80 secs
lola: 70210958 markings, 107657705 edges, 543901 markings/sec, 85 secs
lola: 70398476 markings, 107944303 edges, 37504 markings/sec, 90 secs
lola: 72053795 markings, 110482463 edges, 331064 markings/sec, 95 secs
lola: 73187020 markings, 112220069 edges, 226645 markings/sec, 100 secs
lola: 73279834 markings, 112362391 edges, 18563 markings/sec, 105 secs
lola: 75330990 markings, 115507488 edges, 410231 markings/sec, 110 secs
lola: 76347361 markings, 117065926 edges, 203274 markings/sec, 115 secs
lola: 76347361 markings, 117065926 edges, 0 markings/sec, 120 secs
lola: 77757985 markings, 119228894 edges, 282125 markings/sec, 125 secs
lola: 78284143 markings, 120035653 edges, 105232 markings/sec, 130 secs
lola: 78284143 markings, 120035653 edges, 0 markings/sec, 135 secs
lola: 78284143 markings, 120035653 edges, 0 markings/sec, 140 secs
lola: 78284200 markings, 120035746 edges, 11 markings/sec, 145 secs
lola: 78537077 markings, 120423489 edges, 50575 markings/sec, 150 secs
lola: 80097566 markings, 122816237 edges, 312098 markings/sec, 155 secs
lola: 80165515 markings, 122920424 edges, 13590 markings/sec, 160 secs
lola: 80165515 markings, 122920424 edges, 0 markings/sec, 165 secs
lola: 80165515 markings, 122920424 edges, 0 markings/sec, 170 secs
lola: 80165515 markings, 122920424 edges, 0 markings/sec, 175 secs
lola: 80165515 markings, 122920424 edges, 0 markings/sec, 180 secs
lola: 80165515 markings, 122920424 edges, 0 markings/sec, 185 secs
lola: 81451905 markings, 124892894 edges, 257278 markings/sec, 190 secs
lola: 81453192 markings, 124905905 edges, 257 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (X (X (G ((F ((p10 <= 0)) AND (p10 <= 0)))))) U G ((1 <= p27)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (X (X (G ((F ((p10 <= 0)) AND (p10 <= 0)))))) U G ((1 <= p27)))
lola: processed formula length: 66
lola: 81 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: 4218035 markings, 6467632 edges, 843607 markings/sec, 0 secs
lola: 8231676 markings, 12621880 edges, 802728 markings/sec, 5 secs
lola: 12235817 markings, 18761558 edges, 800828 markings/sec, 10 secs
lola: 16294701 markings, 24985174 edges, 811777 markings/sec, 15 secs
lola: 20227097 markings, 31014856 edges, 786479 markings/sec, 20 secs
lola: 24063113 markings, 36896736 edges, 767203 markings/sec, 25 secs
lola: 27857632 markings, 42715004 edges, 758904 markings/sec, 30 secs
lola: 31686009 markings, 48585195 edges, 765675 markings/sec, 35 secs
lola: 35701198 markings, 54741818 edges, 803038 markings/sec, 40 secs
lola: 39548814 markings, 60641487 edges, 769523 markings/sec, 45 secs
lola: 43381324 markings, 66518001 edges, 766502 markings/sec, 50 secs
lola: 47278139 markings, 72493116 edges, 779363 markings/sec, 55 secs
lola: 51192423 markings, 78495017 edges, 782857 markings/sec, 60 secs
lola: 55061826 markings, 84428106 edges, 773881 markings/sec, 65 secs
lola: 58860339 markings, 90252495 edges, 759703 markings/sec, 70 secs
lola: 62608432 markings, 95999568 edges, 749619 markings/sec, 75 secs
lola: 66297656 markings, 101656719 edges, 737845 markings/sec, 80 secs
lola: 67928704 markings, 104158738 edges, 326210 markings/sec, 85 secs
lola: 67952612 markings, 104193985 edges, 4782 markings/sec, 90 secs
lola: 69247483 markings, 106180576 edges, 258974 markings/sec, 95 secs
lola: 70918201 markings, 108753774 edges, 334144 markings/sec, 100 secs
lola: 73589127 markings, 112836734 edges, 534185 markings/sec, 105 secs
lola: 73589562 markings, 112837303 edges, 87 markings/sec, 110 secs
lola: 74799792 markings, 114692981 edges, 242046 markings/sec, 115 secs
lola: 75842131 markings, 116291242 edges, 208468 markings/sec, 120 secs
lola: 77979771 markings, 119568966 edges, 427528 markings/sec, 125 secs
lola: 77982239 markings, 119572748 edges, 494 markings/sec, 130 secs
lola: 77982239 markings, 119572748 edges, 0 markings/sec, 135 secs
lola: 78012732 markings, 119619499 edges, 6099 markings/sec, 140 secs
lola: 79691914 markings, 122194250 edges, 335836 markings/sec, 145 secs
lola: 79691914 markings, 122194250 edges, 0 markings/sec, 150 secs
lola: 79691914 markings, 122194250 edges, 0 markings/sec, 155 secs
lola: 79691914 markings, 122194250 edges, 0 markings/sec, 160 secs
lola: 79691914 markings, 122194250 edges, 0 markings/sec, 165 secs
lola: 79692085 markings, 122194509 edges, 34 markings/sec, 170 secs
lola: 81357831 markings, 124748645 edges, 333149 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1) AND (2 <= p2)) U ((1 <= p47) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))) OR ((1 <= p36) AND (1 <= p37) AND (1 <= p39)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= p36) AND (1 <= p37) AND (1 <= p39))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p36) AND (1 <= p37) AND (1 <= p39))
lola: processed formula length: 42
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: processed formula with 3 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: (((2 <= p1) AND (2 <= p2)) U ((1 <= p47) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (((2 <= p1) AND (2 <= p2)) U ((1 <= p47) U ((1 <= p36) AND (1 <= p37) AND (1 <= p39))))
lola: processed formula length: 87
lola: 81 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2 markings, 2 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: RESULT
lola:
SUMMARY: unknown no no no yes no no no unknown no no yes
lola:
preliminary result: unknown no no no yes no no no unknown no no yes
lola: ========================================
lola: ========================================
lola: memory consumption: 3728 KB
lola: time consumption: 1022 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-015015"
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-015015, 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-158987938500066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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