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-159033547100081.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-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r228-oct2-159033547100081
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 3.0K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 71K 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-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 1591288436797

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:33:59] [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 16:33:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:33:59] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2020-06-04 16:33:59] [INFO ] Transformed 290 places.
[2020-06-04 16:33:59] [INFO ] Transformed 315 transitions.
[2020-06-04 16:33:59] [INFO ] Found NUPN structural information;
[2020-06-04 16:33:59] [INFO ] Parsed PT model containing 290 places and 315 transitions in 137 ms.
Deduced a syphon composed of 66 places in 4 ms
Reduce places removed 66 places and 55 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 569 resets, run finished after 184 ms. (steps per millisecond=543 ) properties seen :[1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0]
// Phase 1: matrix 260 rows 224 cols
[2020-06-04 16:33:59] [INFO ] Computed 12 place invariants in 8 ms
[2020-06-04 16:33:59] [INFO ] [Real]Absence check using 12 positive place invariants in 19 ms returned sat
[2020-06-04 16:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:33:59] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2020-06-04 16:33:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 18 ms returned unsat
[2020-06-04 16:34:00] [INFO ] [Real]Absence check using 12 positive place invariants in 10 ms returned sat
[2020-06-04 16:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:00] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2020-06-04 16:34:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 102 ms returned sat
[2020-06-04 16:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:00] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-06-04 16:34:00] [INFO ] Deduced a trap composed of 45 places in 129 ms
[2020-06-04 16:34:00] [INFO ] Deduced a trap composed of 32 places in 160 ms
[2020-06-04 16:34:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 409 ms
[2020-06-04 16:34:01] [INFO ] Computed and/alt/rep : 259/747/259 causal constraints in 69 ms.
[2020-06-04 16:34:02] [INFO ] Added : 251 causal constraints over 51 iterations in 1540 ms. Result :sat
[2020-06-04 16:34:02] [INFO ] [Real]Absence check using 12 positive place invariants in 43 ms returned sat
[2020-06-04 16:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:03] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2020-06-04 16:34:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned unsat
[2020-06-04 16:34:03] [INFO ] [Real]Absence check using 12 positive place invariants in 44 ms returned sat
[2020-06-04 16:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:03] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-06-04 16:34:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 26 ms returned unsat
[2020-06-04 16:34:03] [INFO ] [Real]Absence check using 12 positive place invariants in 34 ms returned sat
[2020-06-04 16:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:03] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-04 16:34:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:03] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned unsat
[2020-06-04 16:34:03] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2020-06-04 16:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:04] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2020-06-04 16:34:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 15 ms returned unsat
[2020-06-04 16:34:04] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2020-06-04 16:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:04] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2020-06-04 16:34:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 25 ms returned unsat
[2020-06-04 16:34:04] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2020-06-04 16:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:04] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2020-06-04 16:34:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:04] [INFO ] [Nat]Absence check using 12 positive place invariants in 19 ms returned sat
[2020-06-04 16:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:04] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2020-06-04 16:34:04] [INFO ] Computed and/alt/rep : 259/747/259 causal constraints in 16 ms.
[2020-06-04 16:34:05] [INFO ] Added : 221 causal constraints over 45 iterations in 1010 ms. Result :sat
[2020-06-04 16:34:05] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2020-06-04 16:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:06] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2020-06-04 16:34:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 48 ms returned unsat
[2020-06-04 16:34:06] [INFO ] [Real]Absence check using 12 positive place invariants in 30 ms returned sat
[2020-06-04 16:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:06] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2020-06-04 16:34:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 34 ms returned unsat
[2020-06-04 16:34:06] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2020-06-04 16:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:06] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2020-06-04 16:34:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:06] [INFO ] [Nat]Absence check using 12 positive place invariants in 66 ms returned unsat
[2020-06-04 16:34:06] [INFO ] [Real]Absence check using 12 positive place invariants in 9 ms returned sat
[2020-06-04 16:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:34:07] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2020-06-04 16:34:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:34:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 31 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 15 simplifications.
[2020-06-04 16:34:08] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-04 16:34:08] [INFO ] Flatten gal took : 83 ms
FORMULA SmartHome-PT-11-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-11-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 16:34:08] [INFO ] Applying decomposition
[2020-06-04 16:34:08] [INFO ] Flatten gal took : 19 ms
[2020-06-04 16:34:08] [INFO ] Decomposing Gal with order
[2020-06-04 16:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-06-04 16:34:08] [INFO ] Removed a total of 15 redundant transitions.
[2020-06-04 16:34:08] [INFO ] Flatten gal took : 81 ms
[2020-06-04 16:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2020-06-04 16:34:08] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2020-06-04 16:34:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 3 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-11 @ 3570 seconds

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

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

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

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

FORMULA SmartHome-PT-11-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
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",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 16:34:08 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 (((p112 <= 0)))",
"processed_size": 17,
"rewrites": 15
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 2,
"aconj": 9,
"adisj": 2,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "F (G ((F ((X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))) AND (((p105 <= 0)) OR (X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))))))",
"processed_size": 188,
"rewrites": 15
},
"result":
{
"edges": 1388608,
"markings": 308578,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 1188
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((((p63 <= 0)) OR ((1 <= p35)))))",
"processed_size": 39,
"rewrites": 15
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 2,
"adisj": 4,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X ((X (G ((((1 <= p83)) AND ((p46 <= 0))))) U (((1 <= p134)) AND ((p1 <= 0)))))",
"processed_size": 79,
"rewrites": 15
},
"result":
{
"edges": 18,
"markings": 18,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"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": "F (G ((((p80 <= 0)) OR ((1 <= p152)))))",
"processed_size": 40,
"rewrites": 15
},
"result":
{
"edges": 136,
"markings": 117,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 22328,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(**) : F(G((F((X(F(**)) OR **)) AND (** OR (X(F(**)) OR **))))) : F(G(**)) : X(F(**)) : X((X(G(**)) U **))"
},
"net":
{
"arcs": 588,
"conflict_clusters": 205,
"places": 224,
"places_significant": 212,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "yes no no yes no ",
"value": "yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 484/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 7168
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: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p66 <= 1)
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p35 <= 1)
lola: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: X (((p112 <= 0))) : F (G (X (G ((((p105 <= 0)) U (X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))))))) : X (F (G (X (X (G ((((p80 <= 0)) OR ((1 <= p152))))))))) : X (F ((((p63 <= 0)) OR ((1 <= p35))))) : X ((G (X ((((1 <= p83)) AND ((p46 <= 0))))) U (((1 <= p134)) AND ((p1 <= 0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p112 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p112 <= 0)))
lola: processed formula length: 17
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))) AND (((p105 <= 0)) OR (X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))) AND (((p105 <= 0)) OR (X (F (((p105 <= 0)))) OR ((1 <= p72) AND (((p76 <= 0)) OR ((1 <= p66)))))))))
lola: processed formula length: 188
lola: 15 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: 308578 markings, 1388608 edges
lola: ========================================
lola: subprocess 2 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((((p63 <= 0)) OR ((1 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((((p63 <= 0)) OR ((1 <= p35)))))
lola: processed formula length: 39
lola: 15 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: 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 3 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((X (G ((((1 <= p83)) AND ((p46 <= 0))))) U (((1 <= p134)) AND ((p1 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((X (G ((((1 <= p83)) AND ((p46 <= 0))))) U (((1 <= p134)) AND ((p1 <= 0)))))
lola: processed formula length: 79
lola: 15 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: 18 markings, 18 edges
lola: ========================================
lola: subprocess 4 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((((p80 <= 0)) OR ((1 <= p152)))))
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 ((((p80 <= 0)) OR ((1 <= p152)))))
lola: processed formula length: 40
lola: 15 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: 117 markings, 136 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes no
lola:
preliminary result: yes no no yes no
lola: memory consumption: 22328 KB
lola: time consumption: 5 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="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-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 r228-oct2-159033547100081"
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 ;