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.r011-tall-162038006200297.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 BART-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006200297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 4.2K Mar 20 13:27 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 20 13:27 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Jun 8 09:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 8 09:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jun 8 09:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 8 09:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 8 09:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Jun 8 09:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Jun 8 09:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 8 09:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 8 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 8 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 20 13:27 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 20 13:27 instance
-rw-r--r-- 1 mcc users 6 Mar 20 13:27 iscolored
-rw-r--r-- 1 mcc users 534K Mar 20 13:27 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 BART-PT-002-00
FORMULA_NAME BART-PT-002-01
FORMULA_NAME BART-PT-002-02
FORMULA_NAME BART-PT-002-03
FORMULA_NAME BART-PT-002-04
FORMULA_NAME BART-PT-002-05
FORMULA_NAME BART-PT-002-06
FORMULA_NAME BART-PT-002-07
FORMULA_NAME BART-PT-002-08
FORMULA_NAME BART-PT-002-09
FORMULA_NAME BART-PT-002-10
FORMULA_NAME BART-PT-002-11
FORMULA_NAME BART-PT-002-12
FORMULA_NAME BART-PT-002-13
FORMULA_NAME BART-PT-002-14
FORMULA_NAME BART-PT-002-15

=== Now, execution of the tool begins

BK_START 1623181614129

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-06-08 19:46:55] [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-06-08 19:46:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-08 19:46:55] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2021-06-08 19:46:55] [INFO ] Transformed 474 places.
[2021-06-08 19:46:55] [INFO ] Transformed 404 transitions.
[2021-06-08 19:46:55] [INFO ] Found NUPN structural information;
[2021-06-08 19:46:55] [INFO ] Parsed PT model containing 474 places and 404 transitions in 142 ms.
Reduce places removed 210 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 135 ms. (steps per millisecond=740 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 404 rows 264 cols
[2021-06-08 19:46:56] [INFO ] Computed 2 place invariants in 23 ms
[2021-06-08 19:46:56] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2021-06-08 19:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:46:56] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2021-06-08 19:46:56] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:46:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned unsat
[2021-06-08 19:46:56] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-06-08 19:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:46:56] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2021-06-08 19:46:56] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:46:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned unsat
[2021-06-08 19:46:57] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-06-08 19:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:46:57] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2021-06-08 19:46:57] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:46:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned unsat
[2021-06-08 19:46:57] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-06-08 19:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:46:57] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2021-06-08 19:46:57] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:46:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned unsat
[2021-06-08 19:46:57] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-06-08 19:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:46:57] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2021-06-08 19:46:57] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:46:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned unsat
[2021-06-08 19:46:58] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2021-06-08 19:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-08 19:46:58] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2021-06-08 19:46:58] [INFO ] Solution in real domain found non-integer solution.
[2021-06-08 19:46:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2021-06-08 19:46:58] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-06-08 19:46:58] [INFO ] Flatten gal took : 53 ms
FORMULA BART-PT-002-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-08 19:46:58] [INFO ] Applying decomposition
[2021-06-08 19:46:58] [INFO ] Flatten gal took : 20 ms
[2021-06-08 19:46:58] [INFO ] Decomposing Gal with order
[2021-06-08 19:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-08 19:46:58] [INFO ] Flatten gal took : 17 ms
[2021-06-08 19:46:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-06-08 19:46:58] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-06-08 19:46:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 7 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ BART-PT-002 @ 3570 seconds

FORMULA BART-PT-002-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-002-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-002-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-002-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-002-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA BART-PT-002-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for LTLCardinality @ BART-PT-002

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 8 19:46:59 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (G ((((p40 <= 0)) OR ((1 <= p174)))))",
"processed_size": 40,
"rewrites": 9
},
"result":
{
"edges": 21366,
"markings": 10068,
"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": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (G ((((p120 <= 0)) OR ((1 <= p1))))))",
"processed_size": 43,
"rewrites": 9
},
"result":
{
"edges": 10748,
"markings": 5349,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (X (F ((((p123 <= 0)) OR ((1 <= p26))))))",
"processed_size": 44,
"rewrites": 9
},
"result":
{
"edges": 2806,
"markings": 1511,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"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 <= p153))))",
"processed_size": 21,
"rewrites": 9
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p181))) AND ((1 <= p109)))))",
"processed_size": 45,
"rewrites": 9
},
"result":
{
"edges": 7,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 21860,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G(**) AND **))) : X((F(**) OR **)) : X(G(**)) : X(X(G(**))) : X(X(F(**))) : F(G(**))"
},
"net":
{
"arcs": 808,
"conflict_clusters": 264,
"places": 264,
"places_significant": 262,
"singleton_clusters": 0,
"transitions": 404
},
"result":
{
"preliminary_value": "no yes no no yes no ",
"value": "no yes no no yes 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: 668/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 264
lola: finding significant places
lola: 264 places, 404 transitions, 262 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: LP says that atomic proposition is always true: (p181 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p174 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p26 <= 1)
lola: LP says that atomic proposition is always true: (p153 <= 1)
lola: F (G (X (G (F ((G (((1 <= p181))) AND ((1 <= p109)))))))) : X ((((0 <= 0) U ((p48 <= 0))) OR ((1 <= p121)))) : X (G ((((p40 <= 0)) OR ((1 <= p174))))) : G (X (X ((((p120 <= 0)) OR ((1 <= p1)))))) : X (X (((0 <= 0) U (((p123 <= 0)) OR ((1 <= p26)))))) : F (G (((1 <= p153))))
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (((p48 <= 0))) OR ((1 <= p121))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (((p48 <= 0))) OR ((1 <= p121))))
lola: processed formula length: 39
lola: 9 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: 73 markings, 72 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p40 <= 0)) OR ((1 <= p174)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p40 <= 0)) OR ((1 <= p174)))))
lola: processed formula length: 40
lola: 9 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: 10068 markings, 21366 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p120 <= 0)) OR ((1 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p120 <= 0)) OR ((1 <= p1))))))
lola: processed formula length: 43
lola: 9 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: 5349 markings, 10748 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (F ((((p123 <= 0)) OR ((1 <= p26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (F ((((p123 <= 0)) OR ((1 <= p26))))))
lola: processed formula length: 44
lola: 9 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: 1511 markings, 2806 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((1 <= p153))))
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 <= p153))))
lola: processed formula length: 21
lola: 9 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p181))) AND ((1 <= p109)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p181))) AND ((1 <= p109)))))
lola: processed formula length: 45
lola: 9 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 7 markings, 7 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no
lola:
preliminary result: no yes no no yes no
lola: memory consumption: 21860 KB
lola: time consumption: 3 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="BART-PT-002"
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 BART-PT-002, 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 r011-tall-162038006200297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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