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-162106800400130.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-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-162106800400130
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K 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.3K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 101K 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-14-00
FORMULA_NAME SmartHome-PT-14-01
FORMULA_NAME SmartHome-PT-14-02
FORMULA_NAME SmartHome-PT-14-03
FORMULA_NAME SmartHome-PT-14-04
FORMULA_NAME SmartHome-PT-14-05
FORMULA_NAME SmartHome-PT-14-06
FORMULA_NAME SmartHome-PT-14-07
FORMULA_NAME SmartHome-PT-14-08
FORMULA_NAME SmartHome-PT-14-09
FORMULA_NAME SmartHome-PT-14-10
FORMULA_NAME SmartHome-PT-14-11
FORMULA_NAME SmartHome-PT-14-12
FORMULA_NAME SmartHome-PT-14-13
FORMULA_NAME SmartHome-PT-14-14
FORMULA_NAME SmartHome-PT-14-15

=== Now, execution of the tool begins

BK_START 1621199016146

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 21:03:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 21:03:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 21:03:37] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-16 21:03:37] [INFO ] Transformed 422 places.
[2021-05-16 21:03:37] [INFO ] Transformed 448 transitions.
[2021-05-16 21:03:37] [INFO ] Found NUPN structural information;
[2021-05-16 21:03:37] [INFO ] Parsed PT model containing 422 places and 448 transitions in 109 ms.
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 104 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 438 resets, run finished after 279 ms. (steps per millisecond=358 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 344 rows 293 cols
[2021-05-16 21:03:38] [INFO ] Computed 14 place invariants in 12 ms
[2021-05-16 21:03:38] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2021-05-16 21:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 21:03:38] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2021-05-16 21:03:38] [INFO ] Computed and/alt/rep : 343/991/343 causal constraints in 23 ms.
[2021-05-16 21:03:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 21:03:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 62 ms returned sat
[2021-05-16 21:03:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 21:03:39] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2021-05-16 21:03:39] [INFO ] Computed and/alt/rep : 343/991/343 causal constraints in 20 ms.
[2021-05-16 21:03:40] [INFO ] Added : 333 causal constraints over 67 iterations in 1336 ms. Result :sat
[2021-05-16 21:03:40] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-16 21:03:40] [INFO ] Flatten gal took : 54 ms
FORMULA SmartHome-PT-14-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 21:03:40] [INFO ] Applying decomposition
[2021-05-16 21:03:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 21:03:40] [INFO ] Flatten gal took : 19 ms
[2021-05-16 21:03:40] [INFO ] Decomposing Gal with order
[2021-05-16 21:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 21:03:40] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-16 21:03:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-16 21:03:40] [INFO ] Flatten gal took : 43 ms
[2021-05-16 21:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 9 ms.
[2021-05-16 21:03:40] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-14-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 21:03:40] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2021-05-16 21:03:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLFireability @ SmartHome-PT-14 @ 3570 seconds

FORMULA SmartHome-PT-14-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-14-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-14-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-14-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLFireability @ SmartHome-PT-14

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sun May 16 21:03:41 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 2,
"adisj": 0,
"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 (X (X (G ((X (X (F (((1 <= p187))))) OR ((1 <= p62)))))))",
"processed_size": 59,
"rewrites": 73
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "X (TRUE)",
"processed_size": 8,
"rewrites": 73
},
"result":
{
"edges": 1,
"markings": 2,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(X (F (((1 <= p248)))) U ((1 <= p135)))",
"processed_size": 39,
"rewrites": 73
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 1,
"aconj": 5,
"adisj": 0,
"aneg": 4,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 3,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (G ((((p269 <= 0)) AND ((F (((1 <= p221))) OR G (((p269 <= 0)))) AND (F (((p194 <= 0))) AND ((p194 <= 0)))))))",
"processed_size": 112,
"rewrites": 73
},
"result":
{
"edges": 54168960,
"markings": 9583908,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 377
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 2,
"aconj": 4,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (((((1 <= p58)) U X (F (((1 <= p230) AND (1 <= p291))))) AND (((1 <= p2)) AND ((1 <= p64)))))",
"processed_size": 95,
"rewrites": 73
},
"result":
{
"edges": 15,
"markings": 15,
"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": 30040,
"runtime": 3570.000000,
"signal": null,
"timelimitreached": true
},
"files":
{
"formula": "LTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G((F(G(*)) OR *)) : X(X(X(G((X(X(F(**))) OR **))))) : (X(TRUE) AND (X(F(**)) U **)) : F((** OR (G(**) AND F(**)))) : G((G(**) OR **)) : F(**) : X(G((* AND ((F(**) OR G(*)) AND (F(*) AND *))))) : X(((** U X(F(**))) AND (** AND **))) : (** OR (F(**) AND X(**))) : X((G(*) AND (X(*) R *))) : F(G(**)) : G(F(**))"
},
"net":
{
"arcs": 768,
"conflict_clusters": 272,
"places": 293,
"places_significant": 279,
"singleton_clusters": 0,
"transitions": 344
},
"result":
{
"interim_value": "unknown no no unknown unknown unknown no no unknown unknown unknown unknown ",
"preliminary_value": "unknown no no unknown unknown unknown no no unknown unknown unknown unknown "
},
"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: 637/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 293
lola: finding significant places
lola: 293 places, 344 transitions, 279 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLFireability.xml
lola: LP says that atomic proposition is always true: (p151 <= 1)
lola: LP says that atomic proposition is always true: (p118 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p103 <= 1)
lola: LP says that atomic proposition is always true: (p248 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p218 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p3 <= 1)
lola: LP says that atomic proposition is always true: (p172 <= 1)
lola: LP says that atomic proposition is always true: (p124 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p269 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p194 <= 1)
lola: LP says that atomic proposition is always true: (p58 <= 1)
lola: LP says that atomic proposition is always true: (p230 <= 1)
lola: LP says that atomic proposition is always true: (p291 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p240 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p27 <= 1)
lola: LP says that atomic proposition is always true: (p135 <= 1)
lola: LP says that atomic proposition is always true: (p215 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: LP says that atomic proposition is always true: (p233 <= 1)
lola: LP says that atomic proposition is always true: (p188 <= 1)
lola: NOT(F ((NOT(F (NOT(G (F (((1 <= p151))))))) AND ((1 <= p118))))) : G (X (X (X ((F (X (X (((1 <= p187))))) OR ((1 <= p62))))))) : (X (NOT(X ((((1 <= p103)) U (1 <= 0))))) AND (F (X (((1 <= p248)))) U ((1 <= p135)))) : ((0 <= 0) U (G (((1 <= p218))) U ((1 <= p218)))) : G ((G (((1 <= p230) AND (1 <= p78) AND (1 <= p3))) OR ((p172 <= 0)))) : F (((1 <= p124))) : X (NOT(F ((((NOT(F (((1 <= p221)))) U ((1 <= p269))) OR G (((1 <= p194)))) OR ((1 <= p194)))))) : X ((((((1 <= p58)) U X (F (((1 <= p230) AND (1 <= p291))))) AND ((1 <= p2))) AND ((1 <= p64)))) : (((1 <= p64) AND (1 <= p277)) OR (F (((1 <= p240))) AND X (((1 <= p244))))) : NOT(X (((1 <= 0) U (F (((1 <= p27))) OR (X (((1 <= p135))) U ((1 <= p215))))))) : G (X (((0 <= 0) U G (((1 <= p133)))))) : NOT(X ((F (((1 <= p188))) U F (G (NOT((F (((1 <= p233))) U ((1 <= p188)))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:341
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (G ((X (X (F (((1 <= p187))))) OR ((1 <= p62)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (G ((X (X (F (((1 <= p187))))) OR ((1 <= p62)))))))
lola: processed formula length: 59
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (TRUE) AND (X (F (((1 <= p248)))) U ((1 <= p135))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (TRUE)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (TRUE)
lola: processed formula length: 8
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F (((1 <= p248)))) U ((1 <= p135)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (F (((1 <= p248)))) U ((1 <= p135)))
lola: processed formula length: 39
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((p269 <= 0)) AND ((F (((1 <= p221))) OR G (((p269 <= 0)))) AND (F (((p194 <= 0))) AND ((p194 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((p269 <= 0)) AND ((F (((1 <= p221))) OR G (((p269 <= 0)))) AND (F (((p194 <= 0))) AND ((p194 <= 0)))))))
lola: processed formula length: 112
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 469026 markings, 1805312 edges, 93805 markings/sec, 0 secs
lola: 829698 markings, 3505339 edges, 72134 markings/sec, 5 secs
lola: 1079428 markings, 5228763 edges, 49946 markings/sec, 10 secs
lola: 1486486 markings, 6810596 edges, 81412 markings/sec, 15 secs
lola: 1746522 markings, 8429611 edges, 52007 markings/sec, 20 secs
lola: 2066523 markings, 10053732 edges, 64000 markings/sec, 25 secs
lola: 2363527 markings, 11649167 edges, 59401 markings/sec, 30 secs
lola: 2572600 markings, 13289436 edges, 41815 markings/sec, 35 secs
lola: 2871917 markings, 14930687 edges, 59863 markings/sec, 40 secs
lola: 3167712 markings, 16533554 edges, 59159 markings/sec, 45 secs
lola: 3386303 markings, 18197269 edges, 43718 markings/sec, 50 secs
lola: 3682082 markings, 19807900 edges, 59156 markings/sec, 55 secs
lola: 3961603 markings, 21340734 edges, 55904 markings/sec, 60 secs
lola: 4160959 markings, 22914141 edges, 39871 markings/sec, 65 secs
lola: 4410242 markings, 24503104 edges, 49857 markings/sec, 70 secs
lola: 4698404 markings, 26054811 edges, 57632 markings/sec, 75 secs
lola: 4907881 markings, 27720121 edges, 41895 markings/sec, 80 secs
lola: 5056557 markings, 29363555 edges, 29735 markings/sec, 85 secs
lola: 5426771 markings, 30991584 edges, 74043 markings/sec, 90 secs
lola: 5696938 markings, 32682120 edges, 54033 markings/sec, 95 secs
lola: 5864072 markings, 34274040 edges, 33427 markings/sec, 100 secs
lola: 6228361 markings, 35830714 edges, 72858 markings/sec, 105 secs
lola: 6490227 markings, 37455769 edges, 52373 markings/sec, 110 secs
lola: 6655017 markings, 39024745 edges, 32958 markings/sec, 115 secs
lola: 7028844 markings, 40514776 edges, 74765 markings/sec, 120 secs
lola: 7315877 markings, 42035754 edges, 57407 markings/sec, 125 secs
lola: 7504840 markings, 43503452 edges, 37793 markings/sec, 130 secs
lola: 7894130 markings, 44957774 edges, 77858 markings/sec, 135 secs
lola: 8175952 markings, 46433762 edges, 56364 markings/sec, 140 secs
lola: 8352170 markings, 47831216 edges, 35244 markings/sec, 145 secs
lola: 8752754 markings, 49380444 edges, 80117 markings/sec, 150 secs
lola: 9016051 markings, 50983925 edges, 52659 markings/sec, 155 secs
lola: 9279299 markings, 52605587 edges, 52650 markings/sec, 160 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: 9583908 markings, 54168960 edges
lola: ========================================
lola: subprocess 3 will run for 377 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((((1 <= p58)) U X (F (((1 <= p230) AND (1 <= p291))))) AND (((1 <= p2)) AND ((1 <= p64)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((((1 <= p58)) U X (F (((1 <= p230) AND (1 <= p291))))) AND (((1 <= p2)) AND ((1 <= p64)))))
lola: processed formula length: 95
lola: 73 rewrites
lola: closed formula file LTLFireability.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 424 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p64) AND (1 <= p277)) OR (F (((1 <= p240))) AND X (((1 <= p244)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown unknown no no unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 30040 KB
lola: time consumption: 598 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
lola: time limit reached - aborting
lola:
preliminary result: unknown no no unknown unknown unknown no no unknown unknown unknown unknown
lola:
preliminary result: unknown no no unknown unknown unknown no no unknown unknown unknown unknown
lola: memory consumption: 30040 KB
lola: time consumption: 3570 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLFireability.json
lola: closed JSON file LTLFireability.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427364 kB
MemFree: 16116760 kB
After kill :
MemTotal: 16427364 kB
MemFree: 16116768 kB

--------------------
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-14"
export BK_EXAMINATION="LTLFireability"
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-14, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800400130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-14.tgz
mv SmartHome-PT-14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;