Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r265-tall-162106800700389.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is SwimmingPool-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800700389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-09-00
FORMULA_NAME SwimmingPool-PT-09-01
FORMULA_NAME SwimmingPool-PT-09-02
FORMULA_NAME SwimmingPool-PT-09-03
FORMULA_NAME SwimmingPool-PT-09-04
FORMULA_NAME SwimmingPool-PT-09-05
FORMULA_NAME SwimmingPool-PT-09-06
FORMULA_NAME SwimmingPool-PT-09-07
FORMULA_NAME SwimmingPool-PT-09-08
FORMULA_NAME SwimmingPool-PT-09-09
FORMULA_NAME SwimmingPool-PT-09-10
FORMULA_NAME SwimmingPool-PT-09-11
FORMULA_NAME SwimmingPool-PT-09-12
FORMULA_NAME SwimmingPool-PT-09-13
FORMULA_NAME SwimmingPool-PT-09-14
FORMULA_NAME SwimmingPool-PT-09-15

=== Now, execution of the tool begins

BK_START 1621227429160

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-17 04:57:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-17 04:57:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 04:57:10] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2021-05-17 04:57:10] [INFO ] Transformed 9 places.
[2021-05-17 04:57:10] [INFO ] Transformed 7 transitions.
[2021-05-17 04:57:10] [INFO ] Parsed PT model containing 9 places and 7 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100016 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=1786 ) 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, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1]
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 04:57:10] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 04:57:10] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned unsat
[2021-05-17 04:57:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 04:57:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-17 04:57:10] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-17 04:57:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-17 04:57:11] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-17 04:57:11] [INFO ] Flatten gal took : 21 ms
FORMULA SwimmingPool-PT-09-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-09-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 04:57:11] [INFO ] Flatten gal took : 3 ms
[2021-05-17 04:57:11] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-17 04:57:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SwimmingPool-PT-09 @ 3570 seconds

FORMULA SwimmingPool-PT-09-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SwimmingPool-PT-09-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SwimmingPool-PT-09-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2712
rslt: Output for LTLCardinality @ SwimmingPool-PT-09

{
"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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Mon May 17 04:57:12 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((p0 + 1 <= p5))))",
"processed_size": 26,
"rewrites": 81
},
"result":
{
"edges": 186,
"markings": 186,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 360
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 360
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "(F ((3 <= p5)) U (p6 <= p1))",
"processed_size": 28,
"rewrites": 81
},
"result":
{
"edges": 636,
"markings": 636,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"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": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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": "X ((p8 <= 0))",
"processed_size": 13,
"rewrites": 81
},
"result":
{
"edges": 186,
"markings": 186,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 405
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X ((G ((p6 <= 0)) AND (p6 + 1 <= p2))) AND F ((p1 <= p0))))",
"processed_size": 63,
"rewrites": 81
},
"result":
{
"edges": 187,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 463
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((F ((1 <= p6)) OR X ((G ((p0 <= 0)) AND X ((p7 + 1 <= p1)))))))",
"processed_size": 69,
"rewrites": 81
},
"result":
{
"edges": 1,
"markings": 2,
"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": 540
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"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": "F (G ((X ((p8 <= p2)) AND (p6 <= p2))))",
"processed_size": 39,
"rewrites": 81
},
"result":
{
"edges": 188,
"markings": 187,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 648
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 648
},
"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": "(p6 <= 0)",
"processed_size": 9,
"rewrites": 81
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 811
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F ((p1 <= p5)) AND X ((3 <= p4)))))",
"processed_size": 42,
"rewrites": 81
},
"result":
{
"edges": 186,
"markings": 186,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 811
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G ((1 <= p0)))",
"processed_size": 17,
"rewrites": 81
},
"result":
{
"edges": 2149,
"markings": 1614,
"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": "stabilization",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1610
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((G ((F ((p3 + 1 <= p1)) AND (p3 + 1 <= p1))) OR (p3 + 1 <= p1)))",
"processed_size": 67,
"rewrites": 81
},
"result":
{
"edges": 2337,
"markings": 1081,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3221
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G ((p1 + 1 <= p8)) OR ((2 <= p7) AND (p1 + 1 <= p8)))))",
"processed_size": 62,
"rewrites": 81
},
"result":
{
"edges": 42039534,
"markings": 24612421,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

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

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((p8 <= 0)))",
"processed_size": 17,
"rewrites": 81
},
"result":
{
"edges": 186,
"markings": 186,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3836,
"runtime": 858.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(X(G(**)) OR (X(G(*)) AND (** U **))) : X(X(F(**))) : F((G((F(*) AND *)) OR *)) : ((F(**) U **) OR X(*)) : X((X((G(*) AND *)) AND F(**))) : G(F((G(*) OR (** AND *)))) : G(F(**)) : X(F((F(*) OR X((G(*) AND X(*)))))) : F(G((X(**) AND **))) : F(G(**)) : (X(F((F(**) AND X(**)))) OR **)"
},
"net":
{
"arcs": 20,
"conflict_clusters": 6,
"places": 9,
"places_significant": 6,
"singleton_clusters": 0,
"transitions": 7
},
"result":
{
"preliminary_value": "unknown no yes no no no no yes no no no ",
"value": "unknown no yes no no no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 16/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: (G (X ((p8 <= 0))) OR (X (NOT(F ((p8 <= 1)))) AND ((p8 <= 2) U (2 <= p8)))) : F (X (X ((p0 + 1 <= p5)))) : NOT(G ((((p1 <= p3) U (F (G ((p1 <= p3))) OR F ((p1 <= p3)))) AND (p1 <= p3)))) : ((F ((3 <= p5)) U (p6 <= p1)) OR NOT(X ((1 <= p8)))) : X ((NOT(X ((F ((1 <= p6)) OR (p2 <= p6)))) AND F ((p1 <= p0)))) : NOT(X (X (F (G ((NOT(X ((2 <= p7))) U X ((p8 <= p1)))))))) : G (X (F ((X ((1 <= p5)) U (p7 <= p8))))) : NOT(X (G ((G ((p6 <= 0)) AND X ((F ((1 <= p0)) OR X ((p1 <= p7)))))))) : X (F (G ((X ((p8 <= p2)) AND (p6 <= p2))))) : G (F (G (NOT(F (NOT(G ((((p0 <= p2) U (0 <= 0)) AND (1 <= p0))))))))) : (NOT(G (NOT(X (F ((F ((p1 <= p5)) AND X ((3 <= p4)))))))) OR (p6 <= 0))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:519
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:318
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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: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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p8 <= 0))) OR (X (G ((2 <= p8))) AND ((p8 <= 2) U (2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p8 <= 2) U (2 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p8 <= 2) U (2 <= p8))
lola: processed formula length: 23
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p8)))
lola: processed formula length: 17
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 2213198 markings, 7364697 edges, 442640 markings/sec, 0 secs
lola: 3977633 markings, 13559633 edges, 352887 markings/sec, 5 secs
lola: 5642755 markings, 19478368 edges, 333024 markings/sec, 10 secs
lola: 7246321 markings, 25211101 edges, 320713 markings/sec, 15 secs
lola: 8801863 markings, 30796477 edges, 311108 markings/sec, 20 secs
lola: 10326773 markings, 36291856 edges, 304982 markings/sec, 25 secs
lola: 11824960 markings, 41710700 edges, 299637 markings/sec, 30 secs
lola: 13305546 markings, 47068214 edges, 296117 markings/sec, 35 secs
lola: 14760183 markings, 52347384 edges, 290927 markings/sec, 40 secs
lola: 16201942 markings, 57592448 edges, 288352 markings/sec, 45 secs
lola: 17628467 markings, 62788328 edges, 285305 markings/sec, 50 secs
lola: 19069127 markings, 68037796 edges, 288132 markings/sec, 55 secs
lola: 20468975 markings, 73153904 edges, 279970 markings/sec, 60 secs
lola: 21877126 markings, 78286245 edges, 281630 markings/sec, 65 secs
lola: 23241780 markings, 83284172 edges, 272931 markings/sec, 70 secs
lola: 24605769 markings, 88278784 edges, 272798 markings/sec, 75 secs
lola: 25974902 markings, 93294999 edges, 273827 markings/sec, 80 secs
lola: 27316221 markings, 98217415 edges, 268264 markings/sec, 85 secs
lola: 28655511 markings, 103129523 edges, 267858 markings/sec, 90 secs
lola: 29996100 markings, 108048973 edges, 268118 markings/sec, 95 secs
lola: 31334963 markings, 112966210 edges, 267773 markings/sec, 100 secs
lola: 32664008 markings, 117855576 edges, 265809 markings/sec, 105 secs
lola: 33985378 markings, 122718070 edges, 264274 markings/sec, 110 secs
lola: 35301510 markings, 127561650 edges, 263226 markings/sec, 115 secs
lola: 36608687 markings, 132378017 edges, 261435 markings/sec, 120 secs
lola: 37925288 markings, 137220213 edges, 263320 markings/sec, 125 secs
lola: 39216534 markings, 141981434 edges, 258249 markings/sec, 130 secs
lola: 40514376 markings, 146762113 edges, 259568 markings/sec, 135 secs
lola: 41802125 markings, 151518690 edges, 257550 markings/sec, 140 secs
lola: 43094698 markings, 156290634 edges, 258515 markings/sec, 145 secs
lola: 44381741 markings, 161040591 edges, 257409 markings/sec, 150 secs
lola: 45657856 markings, 165759754 edges, 255223 markings/sec, 155 secs
lola: 46936757 markings, 170486656 edges, 255780 markings/sec, 160 secs
lola: 48204731 markings, 175175419 edges, 253595 markings/sec, 165 secs
lola: 49470513 markings, 179859126 edges, 253156 markings/sec, 170 secs
lola: 50742090 markings, 184558890 edges, 254315 markings/sec, 175 secs
lola: 52011519 markings, 189253895 edges, 253886 markings/sec, 180 secs
lola: 53274743 markings, 193933374 edges, 252645 markings/sec, 185 secs
lola: 54542583 markings, 198629918 edges, 253568 markings/sec, 190 secs
lola: 55804983 markings, 203306178 edges, 252480 markings/sec, 195 secs
lola: 57060920 markings, 207959009 edges, 251187 markings/sec, 200 secs
lola: 58322032 markings, 212630036 edges, 252222 markings/sec, 205 secs
lola: 59564427 markings, 217243226 edges, 248479 markings/sec, 210 secs
lola: 60819586 markings, 221894639 edges, 251032 markings/sec, 215 secs
lola: 62059506 markings, 226496853 edges, 247984 markings/sec, 220 secs
lola: 63307606 markings, 231122399 edges, 249620 markings/sec, 225 secs
lola: 64537718 markings, 235693791 edges, 246022 markings/sec, 230 secs
lola: 65776894 markings, 240293474 edges, 247835 markings/sec, 235 secs
lola: 67010790 markings, 244880733 edges, 246779 markings/sec, 240 secs
lola: 68243219 markings, 249454571 edges, 246486 markings/sec, 245 secs
lola: 69467043 markings, 254002844 edges, 244765 markings/sec, 250 secs
lola: 70704646 markings, 258591193 edges, 247521 markings/sec, 255 secs
lola: 71931954 markings, 263147698 edges, 245462 markings/sec, 260 secs
lola: 73153397 markings, 267686894 edges, 244289 markings/sec, 265 secs
lola: 74382027 markings, 272249793 edges, 245726 markings/sec, 270 secs
lola: 75598955 markings, 276776004 edges, 243386 markings/sec, 275 secs
lola: 76807716 markings, 281272423 edges, 241752 markings/sec, 280 secs
lola: 78022874 markings, 285791751 edges, 243032 markings/sec, 285 secs
lola: 79224999 markings, 290267882 edges, 240425 markings/sec, 290 secs
lola: 80420348 markings, 294720793 edges, 239070 markings/sec, 295 secs
lola: 81632610 markings, 299232876 edges, 242452 markings/sec, 300 secs
lola: 82834703 markings, 303707698 edges, 240419 markings/sec, 305 secs
lola: 84040348 markings, 308194238 edges, 241129 markings/sec, 310 secs
lola: 85241471 markings, 312668842 edges, 240225 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 20204 KB
lola: time consumption: 326 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((p0 + 1 <= p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((p0 + 1 <= p5))))
lola: processed formula length: 26
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 186 markings, 186 edges
lola: ========================================
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((3 <= p5)) U (p6 <= p1)) OR X ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p5)) U (p6 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (F ((3 <= p5)) U (p6 <= p1))
lola: processed formula length: 28
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 636 markings, 636 edges
lola: ========================================
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p8 <= 0))
lola: processed formula length: 13
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 186 markings, 186 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X ((G ((p6 <= 0)) AND (p6 + 1 <= p2))) AND F ((p1 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X ((G ((p6 <= 0)) AND (p6 + 1 <= p2))) AND F ((p1 <= p0))))
lola: processed formula length: 63
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 187 markings, 187 edges
lola: ========================================
lola: subprocess 4 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((1 <= p6)) OR X ((G ((p0 <= 0)) AND X ((p7 + 1 <= p1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((1 <= p6)) OR X ((G ((p0 <= 0)) AND X ((p7 + 1 <= p1)))))))
lola: processed formula length: 69
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((X ((p8 <= p2)) AND (p6 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((X ((p8 <= p2)) AND (p6 <= p2))))
lola: processed formula length: 39
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 187 markings, 188 edges
lola: ========================================
lola: subprocess 6 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F ((p1 <= p5)) AND X ((3 <= p4))))) OR (p6 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p6 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 <= 0)
lola: processed formula length: 9
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p1 <= p5)) AND X ((3 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p1 <= p5)) AND X ((3 <= p4)))))
lola: processed formula length: 42
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 186 markings, 186 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 811 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((1 <= p0)))
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 <= p0)))
lola: processed formula length: 17
lola: 81 rewrites
lola: closed formula file LTLCardinality.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 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
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: 1614 markings, 2149 edges
lola: ========================================
lola: subprocess 8 will run for 1081 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p7 <= p8)))
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 ((p7 <= p8)))
lola: processed formula length: 18
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 3166746 markings, 6688538 edges, 633349 markings/sec, 0 secs
lola: 5901384 markings, 12580158 edges, 546928 markings/sec, 5 secs
lola: 8497275 markings, 18197447 edges, 519178 markings/sec, 10 secs
lola: 11020484 markings, 23672632 edges, 504642 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 12271314 markings, 26391576 edges
lola: ========================================
lola: subprocess 9 will run for 1610 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((G ((F ((p3 + 1 <= p1)) AND (p3 + 1 <= p1))) OR (p3 + 1 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((G ((F ((p3 + 1 <= p1)) AND (p3 + 1 <= p1))) OR (p3 + 1 <= p1)))
lola: processed formula length: 67
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1081 markings, 2337 edges
lola: ========================================
lola: subprocess 10 will run for 3221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G ((p1 + 1 <= p8)) OR ((2 <= p7) AND (p1 + 1 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G ((p1 + 1 <= p8)) OR ((2 <= p7) AND (p1 + 1 <= p8)))))
lola: processed formula length: 62
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 3374380 markings, 5549882 edges, 674876 markings/sec, 0 secs
lola: 6362011 markings, 10680522 edges, 597526 markings/sec, 5 secs
lola: 9287113 markings, 15707140 edges, 585020 markings/sec, 10 secs
lola: 12225632 markings, 20757229 edges, 587704 markings/sec, 15 secs
lola: 15171026 markings, 25817268 edges, 589079 markings/sec, 20 secs
lola: 18116645 markings, 30879356 edges, 589124 markings/sec, 25 secs
lola: 21063408 markings, 35942066 edges, 589353 markings/sec, 30 secs
lola: 24015132 markings, 41012931 edges, 590345 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24612421 markings, 42039534 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (X (G ((p8 <= 0))) OR (X (G ((2 <= p8))) AND ((p8 <= 2) U (2 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((p8 <= 2) U (2 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((p8 <= 2) U (2 <= p8))
lola: processed formula length: 23
lola: 81 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((2 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((2 <= p8)))
lola: processed formula length: 17
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 2216189 markings, 7375271 edges, 443238 markings/sec, 0 secs
lola: 3985573 markings, 13587975 edges, 353877 markings/sec, 5 secs
lola: 5654802 markings, 19521161 edges, 333846 markings/sec, 10 secs
lola: 7257122 markings, 25249029 edges, 320464 markings/sec, 15 secs
lola: 8815464 markings, 30845451 edges, 311668 markings/sec, 20 secs
lola: 10351207 markings, 36379675 edges, 307149 markings/sec, 25 secs
lola: 11861277 markings, 41841794 edges, 302014 markings/sec, 30 secs
lola: 13349041 markings, 47226125 edges, 297553 markings/sec, 35 secs
lola: 14810448 markings, 52529849 edges, 292281 markings/sec, 40 secs
lola: 16255224 markings, 57787829 edges, 288955 markings/sec, 45 secs
lola: 17689930 markings, 63013586 edges, 286941 markings/sec, 50 secs
lola: 19112213 markings, 68194603 edges, 284457 markings/sec, 55 secs
lola: 20508122 markings, 73295997 edges, 279182 markings/sec, 60 secs
lola: 21906050 markings, 78392556 edges, 279586 markings/sec, 65 secs
lola: 23283539 markings, 83437939 edges, 275498 markings/sec, 70 secs
lola: 24655424 markings, 88460297 edges, 274377 markings/sec, 75 secs
lola: 26030956 markings, 93498943 edges, 275106 markings/sec, 80 secs
lola: 27386693 markings, 98477667 edges, 271147 markings/sec, 85 secs
lola: 28731376 markings, 103406937 edges, 268937 markings/sec, 90 secs
lola: 30084707 markings, 108374837 edges, 270666 markings/sec, 95 secs
lola: 31433146 markings, 113325958 edges, 269688 markings/sec, 100 secs
lola: 32767532 markings, 118237541 edges, 266877 markings/sec, 105 secs
lola: 34108649 markings, 123170089 edges, 268223 markings/sec, 110 secs
lola: 35435602 markings, 128055709 edges, 265391 markings/sec, 115 secs
lola: 36759010 markings, 132932068 edges, 264682 markings/sec, 120 secs
lola: 38091111 markings, 137829024 edges, 266420 markings/sec, 125 secs
lola: 39397883 markings, 142649996 edges, 261354 markings/sec, 130 secs
lola: 40707886 markings, 147477526 edges, 262001 markings/sec, 135 secs
lola: 41996095 markings, 152236751 edges, 257642 markings/sec, 140 secs
lola: 43024243 markings, 156031003 edges, 205630 markings/sec, 145 secs
lola: 44050442 markings, 159816735 edges, 205240 markings/sec, 150 secs
lola: 45059456 markings, 163548049 edges, 201803 markings/sec, 155 secs
lola: 46074955 markings, 167302913 edges, 203100 markings/sec, 160 secs
lola: 47232225 markings, 171577994 edges, 231454 markings/sec, 165 secs
lola: 48507141 markings, 176293318 edges, 254983 markings/sec, 170 secs
lola: 49797491 markings, 181065508 edges, 258070 markings/sec, 175 secs
lola: 51083673 markings, 185825414 edges, 257236 markings/sec, 180 secs
lola: 52372614 markings, 190589673 edges, 257788 markings/sec, 185 secs
lola: 53651024 markings, 195326937 edges, 255682 markings/sec, 190 secs
lola: 54932453 markings, 200075139 edges, 256286 markings/sec, 195 secs
lola: 56204709 markings, 204790213 edges, 254451 markings/sec, 200 secs
lola: 57477698 markings, 209501927 edges, 254598 markings/sec, 205 secs
lola: 58745260 markings, 214200518 edges, 253512 markings/sec, 210 secs
lola: 60010841 markings, 218895049 edges, 253116 markings/sec, 215 secs
lola: 61289199 markings, 223628321 edges, 255672 markings/sec, 220 secs
lola: 62543352 markings, 228287162 edges, 250831 markings/sec, 225 secs
lola: 63803350 markings, 232961130 edges, 252000 markings/sec, 230 secs
lola: 65048039 markings, 237589630 edges, 248938 markings/sec, 235 secs
lola: 66301184 markings, 242242991 edges, 250629 markings/sec, 240 secs
lola: 67546249 markings, 246867020 edges, 249013 markings/sec, 245 secs
lola: 68789026 markings, 251481254 edges, 248555 markings/sec, 250 secs
lola: 70041976 markings, 256132908 edges, 250590 markings/sec, 255 secs
lola: 71292265 markings, 260767859 edges, 250058 markings/sec, 260 secs
lola: 72528368 markings, 265366312 edges, 247221 markings/sec, 265 secs
lola: 73774049 markings, 269987531 edges, 249136 markings/sec, 270 secs
lola: 75008275 markings, 274576985 edges, 246845 markings/sec, 275 secs
lola: 76242649 markings, 279169616 edges, 246875 markings/sec, 280 secs
lola: 77476255 markings, 283757030 edges, 246721 markings/sec, 285 secs
lola: 78694338 markings, 288292996 edges, 243617 markings/sec, 290 secs
lola: 79921999 markings, 292864146 edges, 245532 markings/sec, 295 secs
lola: 81139890 markings, 297399338 edges, 243578 markings/sec, 300 secs
lola: 82364133 markings, 301955414 edges, 244849 markings/sec, 305 secs
lola: 83576896 markings, 306470289 edges, 242553 markings/sec, 310 secs
lola: 84796599 markings, 311007428 edges, 243941 markings/sec, 315 secs
lola: 86019426 markings, 315565777 edges, 244565 markings/sec, 320 secs
lola: 87232118 markings, 320084101 edges, 242538 markings/sec, 325 secs
lola: 88288142 markings, 324018413 edges, 211205 markings/sec, 330 secs
lola: 89276775 markings, 327702838 edges, 197727 markings/sec, 335 secs
lola: 90213755 markings, 331188107 edges, 187396 markings/sec, 340 secs
lola: 91355123 markings, 335442195 edges, 228274 markings/sec, 345 secs
lola: 92150766 markings, 338410553 edges, 159129 markings/sec, 350 secs
lola: 92910279 markings, 341244506 edges, 151903 markings/sec, 355 secs
lola: 93722413 markings, 344266552 edges, 162427 markings/sec, 360 secs
lola: 94597245 markings, 347532570 edges, 174966 markings/sec, 365 secs
lola: 95194432 markings, 349763185 edges, 119437 markings/sec, 370 secs
lola: 96182362 markings, 353446445 edges, 197586 markings/sec, 375 secs
lola: 96724698 markings, 355469000 edges, 108467 markings/sec, 380 secs
lola: 97634463 markings, 358862018 edges, 181953 markings/sec, 385 secs
lola: 98528011 markings, 362195540 edges, 178710 markings/sec, 390 secs
lola: 99503989 markings, 365836162 edges, 195196 markings/sec, 395 secs
lola: 100290143 markings, 368774166 edges, 157231 markings/sec, 400 secs
lola: 101076575 markings, 371705198 edges, 157286 markings/sec, 405 secs
lola: 101957040 markings, 374988767 edges, 176093 markings/sec, 410 secs
lola: 103006797 markings, 378909787 edges, 209951 markings/sec, 415 secs
lola: 104154683 markings, 383196496 edges, 229577 markings/sec, 420 secs
lola: 104893550 markings, 385948647 edges, 147773 markings/sec, 425 secs
lola: 105727595 markings, 389062469 edges, 166809 markings/sec, 430 secs
lola: 106838016 markings, 393212623 edges, 222084 markings/sec, 435 secs
lola: 107768378 markings, 396688008 edges, 186072 markings/sec, 440 secs
lola: 108837734 markings, 400684882 edges, 213871 markings/sec, 445 secs
lola: 109878537 markings, 404569215 edges, 208161 markings/sec, 450 secs
lola: 110293037 markings, 406116846 edges, 82900 markings/sec, 455 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: X (G ((p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p8 <= 0)))
lola: processed formula length: 17
lola: 81 rewrites
lola: closed formula file LTLCardinality.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: 186 markings, 186 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no no no no yes no no no
lola:
preliminary result: unknown no yes no no no no yes no no no
lola: memory consumption: 3836 KB
lola: time consumption: 858 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.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="SwimmingPool-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is SwimmingPool-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800700389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-09.tgz
mv SwimmingPool-PT-09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;