Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287200173.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-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 gold2020
Input is PolyORBLF-PT-S06J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287200173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 97K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 410K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.6M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.4K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Mar 27 09:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 09:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 29K Mar 25 12:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Mar 25 12:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 09:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Mar 22 09:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 10 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 15M May 5 16:51 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 PolyORBLF-PT-S06J06T06-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-15

=== Now, execution of the tool begins

BK_START 1621383842295

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 00:24:03] [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-19 00:24:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:24:04] [INFO ] Load time of PNML (sax parser for PT used): 551 ms
[2021-05-19 00:24:04] [INFO ] Transformed 700 places.
[2021-05-19 00:24:04] [INFO ] Transformed 10740 transitions.
[2021-05-19 00:24:04] [INFO ] Parsed PT model containing 700 places and 10740 transitions in 757 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 188 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 581 resets, run finished after 1033 ms. (steps per millisecond=96 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1]
[2021-05-19 00:24:05] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 700 cols
[2021-05-19 00:24:05] [INFO ] Computed 58 place invariants in 144 ms
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 47 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 22 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 24 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 6 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 28 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 21 ms returned unsat
[2021-05-19 00:24:06] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 22 ms returned sat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 22 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned sat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 21 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 17 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 33 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 16 ms returned sat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 21 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 33 ms returned unsat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive place invariants in 19 ms returned sat
[2021-05-19 00:24:07] [INFO ] [Real]Absence check using 22 positive and 36 generalized place invariants in 27 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 20 simplifications.
[2021-05-19 00:24:08] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2021-05-19 00:24:08] [INFO ] Flatten gal took : 240 ms
FORMULA PolyORBLF-PT-S06J06T06-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:24:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-19 00:24:08] [INFO ] Flatten gal took : 154 ms
[2021-05-19 00:24:08] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S06J06T06-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 00:24:08] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-19 00:24:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 27 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J06T06 @ 3570 seconds

FORMULA PolyORBLF-PT-S06J06T06-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T06-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T06-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-PT-S06J06T06-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3433
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J06T06

{
"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": "Wed May 19 00:24:08 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 866
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "G ((1 <= p2 + p261 + p343 + p448 + p512 + p22))",
"processed_size": 47,
"rewrites": 5
},
"result":
{
"edges": 197,
"markings": 197,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 0,
"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": 1155
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p238 <= p246)",
"processed_size": 14,
"rewrites": 5
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1733
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(1 <= p134 + p180 + p385 + p441 + p584 + p59)",
"processed_size": 45,
"rewrites": 7
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 54
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "((1 <= p134 + p180 + p385 + p441 + p584 + p59) U X ((p238 <= p246)))",
"processed_size": 68,
"rewrites": 5
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"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": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1155
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 13,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 13,
"visible_transitions": 0
},
"processed": "X ((p168 + p248 + p329 + p628 + p646 + p78 <= p136 + p249 + p330 + p506 + p578 + p630 + p76))",
"processed_size": 93,
"rewrites": 5
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"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": 1733
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 42,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 42,
"visible_transitions": 0
},
"processed": "X ((1 <= p3 + p106 + p122 + p129 + p142 + p150 + p176 + p184 + p208 + p235 + p242 + p257 + p267 + p289 + p296 + p300 + p311 + p334 + p346 + p360 + p386 + p389 + p404 + p529 + p564 + p568 + p569 + p577 + p581 + p617 + p635 + p637 + p639 + p655 + p53 + p667 + p696 + p16 + p19 + p24 + p25 + p88))",
"processed_size": 294,
"rewrites": 5
},
"result":
{
"edges": 159,
"markings": 159,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 3466
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "((3 <= p442) U X (G ((F ((p442 <= 2)) AND (p442 <= 2)))))",
"processed_size": 57,
"rewrites": 5
},
"result":
{
"edges": 8089266,
"markings": 2080233,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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":
{
"error": null,
"memory": 69156,
"runtime": 137.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(F(**) AND (** AND ((** U X(**)) OR G(**)))) : X(**) : X(**) : (** U X(G((F(**) AND *))))"
},
"net":
{
"arcs": 15888,
"conflict_clusters": 247,
"places": 700,
"places_significant": 642,
"singleton_clusters": 0,
"transitions": 2670
},
"result":
{
"preliminary_value": "yes yes no no ",
"value": "yes yes no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 3370/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 22400
lola: finding significant places
lola: 700 places, 2670 transitions, 642 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: ((F ((p134 + p180 + p385 + p441 + p584 + p59 <= 0)) AND (p238 <= p246)) AND (((1 <= p134 + p180 + p385 + p441 + p584 + p59) U X ((p238 <= p246))) OR G ((1 <= p2 + p261 + p343 + p448 + p512 + p22)))) : X ((p168 + p248 + p329 + p628 + p646 + p78 <= p136 + p249 + p330 + p506 + p578 + p630 + p76)) : X ((1 <= p3 + p106 + p122 + p129 + p142 + p150 + p176 + p184 + p208 + p235 + p242 + p257 + p267 + p289 + p296 + p300 + p311 + p334 + p346 + p360 + p386 + p389 + p404 + p529 + p564 + p568 + p569 + p577 + p581 + p617 + p635 + p637 + p639 + p655 + p53 + p667 + p696 + p16 + p19 + p24 + p25 + p88)) : ((3 <= p442) U G ((X (F ((p442 <= 2))) AND NOT(X ((3 <= p442))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((p134 + p180 + p385 + p441 + p584 + p59 <= 0)) AND ((p238 <= p246) AND (((1 <= p134 + p180 + p385 + p441 + p584 + p59) U X ((p238 <= p246))) OR G ((1 <= p2 + p261 + p343 + p448 + p512 + p22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 866 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p2 + p261 + p343 + p448 + p512 + p22))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p2 + p261 + p343 + p448 + p512 + p22))
lola: processed formula length: 47
lola: 5 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: 197 markings, 197 edges
lola: ========================================
lola: subprocess 1 will run for 1155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p238 <= p246)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p238 <= p246)
lola: processed formula length: 14
lola: 5 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 1733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p134 + p180 + p385 + p441 + p584 + p59 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (1 <= p134 + p180 + p385 + p441 + p584 + p59)
lola: processed formula length: 45
lola: 7 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 3466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p134 + p180 + p385 + p441 + p584 + p59) U X ((p238 <= p246)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((1 <= p134 + p180 + p385 + p441 + p584 + p59) U X ((p238 <= p246)))
lola: processed formula length: 68
lola: 5 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 12 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 1155 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p168 + p248 + p329 + p628 + p646 + p78 <= p136 + p249 + p330 + p506 + p578 + p630 + p76))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p168 + p248 + p329 + p628 + p646 + p78 <= p136 + p249 + p330 + p506 + p578 + p630 + p76))
lola: processed formula length: 93
lola: 5 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 2 will run for 1733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((1 <= p3 + p106 + p122 + p129 + p142 + p150 + p176 + p184 + p208 + p235 + p242 + p257 + p267 + p289 + p296 + p300 + p311 + p334 + p346 + p360 + p386 + p389 + p404 + p529 + p564 + p568 + p569 + p577 + p581 + p617 + p635 + p637 + p639 + p655 + p53 + p667 + p696 + p16 + p19 + p24 + p25 + p88))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((1 <= p3 + p106 + p122 + p129 + p142 + p150 + p176 + p184 + p208 + p235 + p242 + p257 + p267 + p289 + p296 + p300 + p311 + p334 + p346 + p360 + p386 + p389 + p404 + p529 + p564 + p568 + p569 + p577 + p581 + p617 + p635 + p637 + p639 + p655 + p53 + p667 + p696 + p16 + p19 + p24 + p25 + p88))
lola: processed formula length: 294
lola: 5 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: 159 markings, 159 edges
lola: ========================================
lola: subprocess 3 will run for 3466 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((3 <= p442) U X (G ((F ((p442 <= 2)) AND (p442 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((3 <= p442) U X (G ((F ((p442 <= 2)) AND (p442 <= 2)))))
lola: processed formula length: 57
lola: 5 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: 319216 markings, 1264576 edges, 63843 markings/sec, 0 secs
lola: 633366 markings, 2506975 edges, 62830 markings/sec, 5 secs
lola: 941873 markings, 3721871 edges, 61701 markings/sec, 10 secs
lola: 1253833 markings, 4926567 edges, 62392 markings/sec, 15 secs
lola: 1576115 markings, 6154992 edges, 64456 markings/sec, 20 secs
lola: 1890926 markings, 7368389 edges, 62962 markings/sec, 25 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: 2080233 markings, 8089266 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no
lola:
preliminary result: yes yes no no
lola: memory consumption: 69156 KB
lola: time consumption: 137 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="PolyORBLF-PT-S06J06T06"
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 PolyORBLF-PT-S06J06T06, 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 r170-oct2-162089287200173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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