Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r228-oct2-159033547100105.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is SmartHome-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547100105
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 3.8K May 14 03:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 03:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 21:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 21:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.2K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 10:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 101K May 12 20:42 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 1591291896235

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:31:37] [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]
[2020-06-04 17:31:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:31:37] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-06-04 17:31:37] [INFO ] Transformed 422 places.
[2020-06-04 17:31:37] [INFO ] Transformed 448 transitions.
[2020-06-04 17:31:37] [INFO ] Found NUPN structural information;
[2020-06-04 17:31:37] [INFO ] Parsed PT model containing 422 places and 448 transitions in 94 ms.
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 104 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 439 resets, run finished after 170 ms. (steps per millisecond=588 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1]
// Phase 1: matrix 344 rows 293 cols
[2020-06-04 17:31:37] [INFO ] Computed 14 place invariants in 9 ms
[2020-06-04 17:31:38] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2020-06-04 17:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:38] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2020-06-04 17:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned unsat
[2020-06-04 17:31:38] [INFO ] [Real]Absence check using 14 positive place invariants in 10 ms returned sat
[2020-06-04 17:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:38] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2020-06-04 17:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned unsat
[2020-06-04 17:31:38] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2020-06-04 17:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:38] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2020-06-04 17:31:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned unsat
[2020-06-04 17:31:39] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2020-06-04 17:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:39] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2020-06-04 17:31:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned unsat
[2020-06-04 17:31:39] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-06-04 17:31:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:39] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2020-06-04 17:31:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
[2020-06-04 17:31:39] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-06-04 17:31:39] [INFO ] Flatten gal took : 46 ms
FORMULA SmartHome-PT-14-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 17:31:39] [INFO ] Applying decomposition
[2020-06-04 17:31:39] [INFO ] Flatten gal took : 15 ms
[2020-06-04 17:31:39] [INFO ] Decomposing Gal with order
[2020-06-04 17:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 17:31:39] [INFO ] Removed a total of 17 redundant transitions.
[2020-06-04 17:31:39] [INFO ] Flatten gal took : 40 ms
[2020-06-04 17:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2020-06-04 17:31:39] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 17:31:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-14 @ 3570 seconds

FORMULA SmartHome-PT-14-00 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

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

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

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

FORMULA SmartHome-PT-14-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3413
rslt: Output for LTLCardinality @ 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=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:31:40 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 2,
"adisj": 1,
"aneg": 1,
"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 (X (X (F ((((1 <= p64)) AND ((p261 <= 0))))))))",
"processed_size": 52,
"rewrites": 55
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 5,
"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": "X (X (X (X (X (G (((p146 <= 0))))))))",
"processed_size": 37,
"rewrites": 55
},
"result":
{
"edges": 635,
"markings": 504,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"aconj": 2,
"adisj": 0,
"aneg": 2,
"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": 1,
"visible_transitions": 0
},
"processed": "X (G ((X (((p139 <= 0))) OR ((p139 <= 0)))))",
"processed_size": 44,
"rewrites": 55
},
"result":
{
"edges": 65666142,
"markings": 11291988,
"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": 853
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (((1 <= p292)))",
"processed_size": 17,
"rewrites": 55
},
"result":
{
"edges": 15,
"markings": 15,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1706
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "F (G (((1 <= p153))))",
"processed_size": 21,
"rewrites": 55
},
"result":
{
"edges": 49,
"markings": 48,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"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": 3413
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 2,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "F ((F (G ((((1 <= p84)) AND ((p246 <= 0))))) OR G ((((1 <= p84)) AND ((p246 <= 0))))))",
"processed_size": 86,
"rewrites": 55
},
"result":
{
"edges": 56,
"markings": 55,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"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": 22480,
"runtime": 157.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(X(X(X(F(*))))) : F((F(G(*)) OR G(*))) : F(G(*)) : X(X(X(X(X(G(**)))))) : X(G((X(*) OR *))) : F(**) : X(*)"
},
"net":
{
"arcs": 768,
"conflict_clusters": 272,
"places": 293,
"places_significant": 279,
"singleton_clusters": 0,
"transitions": 344
},
"result":
{
"preliminary_value": "no no no no no no no ",
"value": "no no no no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 637/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9376
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 LTLCardinality.xml
lola: LP says that atomic proposition is always true: (p261 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p246 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p139 <= 1)
lola: LP says that atomic proposition is always true: (p160 <= 1)
lola: NOT(G (X (X (X (X ((((p64 <= 0)) OR ((1 <= p261))))))))) : F ((NOT(G (X (F ((((p84 <= 0)) OR ((1 <= p246))))))) OR NOT(F ((((p84 <= 0)) OR ((1 <= p246))))))) : NOT(G (((1 <= 0) U F (((p153 <= 0)))))) : X (G (X (X (X (X (((p146 <= 0)))))))) : NOT(((0 <= 0) U NOT(G (NOT(X ((X (((1 <= p139))) AND ((1 <= p139))))))))) : F (F (((1 <= p160)))) : X (NOT((NOT(((1 <= 0) U (0 <= 0))) U ((p292 <= 0)))))
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
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:353
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (F ((((1 <= p64)) AND ((p261 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (F ((((1 <= p64)) AND ((p261 <= 0))))))))
lola: processed formula length: 52
lola: 55 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (X (X (G (((p146 <= 0))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (X (X (G (((p146 <= 0))))))))
lola: processed formula length: 37
lola: 55 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: 504 markings, 635 edges
lola: ========================================
lola: subprocess 2 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (((p139 <= 0))) OR ((p139 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (((p139 <= 0))) OR ((p139 <= 0)))))
lola: processed formula length: 44
lola: 55 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: 643061 markings, 2500334 edges, 128612 markings/sec, 0 secs
lola: 1071965 markings, 4971130 edges, 85781 markings/sec, 5 secs
lola: 1542878 markings, 7264400 edges, 94183 markings/sec, 10 secs
lola: 1992516 markings, 9637961 edges, 89928 markings/sec, 15 secs
lola: 2360338 markings, 11860139 edges, 73564 markings/sec, 20 secs
lola: 2733708 markings, 13785503 edges, 74674 markings/sec, 25 secs
lola: 3025098 markings, 15983191 edges, 58278 markings/sec, 30 secs
lola: 3382416 markings, 18043683 edges, 71464 markings/sec, 35 secs
lola: 3764615 markings, 20212693 edges, 76440 markings/sec, 40 secs
lola: 4023521 markings, 22369606 edges, 51781 markings/sec, 45 secs
lola: 4409695 markings, 24313924 edges, 77235 markings/sec, 50 secs
lola: 4760382 markings, 26423553 edges, 70137 markings/sec, 55 secs
lola: 4989429 markings, 28455055 edges, 45809 markings/sec, 60 secs
lola: 5365441 markings, 30440045 edges, 75202 markings/sec, 65 secs
lola: 5667100 markings, 32662868 edges, 60332 markings/sec, 70 secs
lola: 5901477 markings, 34874240 edges, 46875 markings/sec, 75 secs
lola: 6274011 markings, 36954729 edges, 74507 markings/sec, 80 secs
lola: 6615115 markings, 39100362 edges, 68221 markings/sec, 85 secs
lola: 6888604 markings, 41302369 edges, 54698 markings/sec, 90 secs
lola: 7311385 markings, 43342858 edges, 84556 markings/sec, 95 secs
lola: 7672827 markings, 45573593 edges, 72288 markings/sec, 100 secs
lola: 7874416 markings, 47582410 edges, 40318 markings/sec, 105 secs
lola: 8345730 markings, 49502730 edges, 94263 markings/sec, 110 secs
lola: 8684962 markings, 51555924 edges, 67846 markings/sec, 115 secs
lola: 9051556 markings, 53567014 edges, 73319 markings/sec, 120 secs
lola: 9474658 markings, 55446180 edges, 84620 markings/sec, 125 secs
lola: 9773997 markings, 57437464 edges, 59868 markings/sec, 130 secs
lola: 10213854 markings, 59402722 edges, 87971 markings/sec, 135 secs
lola: 10609363 markings, 61633681 edges, 79102 markings/sec, 140 secs
lola: 10935976 markings, 63784812 edges, 65323 markings/sec, 145 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: 11291988 markings, 65666142 edges
lola: ========================================
lola: subprocess 3 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((1 <= p292)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((1 <= p292)))
lola: processed formula length: 17
lola: 55 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 1137 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p160)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((p160 <= 0))
lola: processed formula length: 13
lola: 57 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 47 markings, 47 edges
lola: ========================================
lola: subprocess 5 will run for 1706 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: 55 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: 48 markings, 49 edges
lola: ========================================
lola: subprocess 6 will run for 3413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((F (G ((((1 <= p84)) AND ((p246 <= 0))))) OR G ((((1 <= p84)) AND ((p246 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((F (G ((((1 <= p84)) AND ((p246 <= 0))))) OR G ((((1 <= p84)) AND ((p246 <= 0))))))
lola: processed formula length: 86
lola: 55 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: 55 markings, 56 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no
lola:
preliminary result: no no no no no no no
lola: memory consumption: 22480 KB
lola: time consumption: 157 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-14"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is SmartHome-PT-14, 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 r228-oct2-159033547100105"
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 [ "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 ;