fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r265-tall-162106800400117
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for SmartHome-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4282.132 3600000.00 11820.00 276.40 TFFTTFFFFTTFTFFT normal

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-162106800400117.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 SmartHome-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800400117
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 19:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 71K 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 SmartHome-PT-11-00
FORMULA_NAME SmartHome-PT-11-01
FORMULA_NAME SmartHome-PT-11-02
FORMULA_NAME SmartHome-PT-11-03
FORMULA_NAME SmartHome-PT-11-04
FORMULA_NAME SmartHome-PT-11-05
FORMULA_NAME SmartHome-PT-11-06
FORMULA_NAME SmartHome-PT-11-07
FORMULA_NAME SmartHome-PT-11-08
FORMULA_NAME SmartHome-PT-11-09
FORMULA_NAME SmartHome-PT-11-10
FORMULA_NAME SmartHome-PT-11-11
FORMULA_NAME SmartHome-PT-11-12
FORMULA_NAME SmartHome-PT-11-13
FORMULA_NAME SmartHome-PT-11-14
FORMULA_NAME SmartHome-PT-11-15

=== Now, execution of the tool begins

BK_START 1621198165061

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:49:26] [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-16 20:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:49:26] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-16 20:49:26] [INFO ] Transformed 290 places.
[2021-05-16 20:49:26] [INFO ] Transformed 315 transitions.
[2021-05-16 20:49:26] [INFO ] Found NUPN structural information;
[2021-05-16 20:49:26] [INFO ] Parsed PT model containing 290 places and 315 transitions in 99 ms.
Deduced a syphon composed of 66 places in 5 ms
Reduce places removed 66 places and 55 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 585 resets, run finished after 304 ms. (steps per millisecond=328 ) properties seen :[1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0]
// Phase 1: matrix 260 rows 224 cols
[2021-05-16 20:49:27] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using 12 positive place invariants in 18 ms returned sat
[2021-05-16 20:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-16 20:49:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 21 ms returned unsat
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2021-05-16 20:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-16 20:49:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned unsat
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2021-05-16 20:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-16 20:49:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned unsat
[2021-05-16 20:49:27] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2021-05-16 20:49:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2021-05-16 20:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned unsat
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2021-05-16 20:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-16 20:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned unsat
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2021-05-16 20:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-16 20:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned unsat
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2021-05-16 20:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:49:28] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-16 20:49:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:49:28] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2021-05-16 20:49:28] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2021-05-16 20:49:29] [INFO ] Flatten gal took : 46 ms
FORMULA SmartHome-PT-11-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:49:29] [INFO ] Applying decomposition
[2021-05-16 20:49:29] [INFO ] Flatten gal took : 17 ms
[2021-05-16 20:49:29] [INFO ] Decomposing Gal with order
[2021-05-16 20:49:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:49:29] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-16 20:49:29] [INFO ] Flatten gal took : 37 ms
[2021-05-16 20:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 7 ms.
[2021-05-16 20:49:29] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-16 20:49:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-11 @ 3570 seconds

FORMULA SmartHome-PT-11-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-11-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-11-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3568
rslt: Output for LTLCardinality @ SmartHome-PT-11

{
"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": "Sun May 16 20:49:30 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 1,
"aconj": 6,
"adisj": 4,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "((((1 <= p184)) AND ((p48 <= 0))) U (X ((((p191 <= 0)) OR ((1 <= p25)))) OR G ((((1 <= p27)) AND (((p184 <= 0)) OR ((1 <= p48)))))))",
"processed_size": 134,
"rewrites": 23
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1784
},
"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 ((((p46 <= 0)) OR ((1 <= p217))))))",
"processed_size": 44,
"rewrites": 23
},
"result":
{
"edges": 69,
"markings": 62,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 14,
"adisj": 7,
"aneg": 7,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((X ((((((1 <= p23)) AND ((p76 <= 0))) R (((1 <= p167)) AND ((p180 <= 0)))) OR (((1 <= p23)) AND ((p76 <= 0))))) AND (F ((((1 <= p167)) AND ((p180 <= 0)))) OR X (G ((((((1 <= p23)) AND ((p76 <= 0))) R (((1 <= p167)) AND ((p180 <= 0)))) OR (((1 <= p23)) AND ((p76 <= 0)))))))))",
"processed_size": 278,
"rewrites": 23
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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"
}
}
],
"exit":
{
"error": null,
"memory": 23044,
"runtime": 2.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "(** U (X(**) OR G((** AND **)))) : X(X(G(**))) : G((X(((* R *) OR *)) AND (F(*) OR X(G(((* R *) OR *))))))"
},
"net":
{
"arcs": 588,
"conflict_clusters": 205,
"places": 224,
"places_significant": 212,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "yes no no ",
"value": "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: 484/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 224
lola: finding significant places
lola: 224 places, 260 transitions, 212 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: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p180 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: ((((1 <= p184)) AND ((p48 <= 0))) U (X ((((p191 <= 0)) OR ((1 <= p25)))) OR (G (((1 <= p27))) AND G ((((p184 <= 0)) OR ((1 <= p48))))))) : X (G (X ((((p46 <= 0)) OR ((1 <= p217)))))) : G (NOT(F ((G ((((p167 <= 0)) OR ((1 <= p180)))) U X ((((((p23 <= 0)) OR ((1 <= p76))) U (((p167 <= 0)) OR ((1 <= p180)))) AND (((p23 <= 0)) OR ((1 <= p76)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p184)) AND ((p48 <= 0))) U (X ((((p191 <= 0)) OR ((1 <= p25)))) OR G ((((1 <= p27)) AND (((p184 <= 0)) OR ((1 <= p48)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((((1 <= p184)) AND ((p48 <= 0))) U (X ((((p191 <= 0)) OR ((1 <= p25)))) OR G ((((1 <= p27)) AND (((p184 <= 0)) OR ((1 <= p48)))))))
lola: processed formula length: 134
lola: 23 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((((p46 <= 0)) OR ((1 <= p217))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((((p46 <= 0)) OR ((1 <= p217))))))
lola: processed formula length: 44
lola: 23 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: 62 markings, 69 edges
lola: ========================================
lola: subprocess 2 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((((((1 <= p23)) AND ((p76 <= 0))) R (((1 <= p167)) AND ((p180 <= 0)))) OR (((1 <= p23)) AND ((p76 <= 0))))) AND (F ((((1 <= p167)) AND ((p180 <= 0)))) OR X (G ((((((1 <= p23)) AND ((p76 <= 0))) R (((1 <= p167)) AND ((p180 <= 0)))) OR (((1 <= p23)) AND ((p76 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((((((1 <= p23)) AND ((p76 <= 0))) R (((1 <= p167)) AND ((p180 <= 0)))) OR (((1 <= p23)) AND ((p76 <= 0))))) AND (F ((((1 <= p167)) AND ((p180 <= 0)))) OR X (G ((((((1 <= p23)) AND ((p76 <= 0))) R (((1 <= p167)) AND ((p180 <= 0)))) OR (((1 <= p23)) AND ((p76 <= 0)))))))))
lola: processed formula length: 278
lola: 23 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no
lola:
preliminary result: yes no no
lola: memory consumption: 23044 KB
lola: time consumption: 2 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="SmartHome-PT-11"
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 SmartHome-PT-11, 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-162106800400117"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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