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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K 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 100K 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 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.6K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 68K 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-10-00
FORMULA_NAME SmartHome-PT-10-01
FORMULA_NAME SmartHome-PT-10-02
FORMULA_NAME SmartHome-PT-10-03
FORMULA_NAME SmartHome-PT-10-04
FORMULA_NAME SmartHome-PT-10-05
FORMULA_NAME SmartHome-PT-10-06
FORMULA_NAME SmartHome-PT-10-07
FORMULA_NAME SmartHome-PT-10-08
FORMULA_NAME SmartHome-PT-10-09
FORMULA_NAME SmartHome-PT-10-10
FORMULA_NAME SmartHome-PT-10-11
FORMULA_NAME SmartHome-PT-10-12
FORMULA_NAME SmartHome-PT-10-13
FORMULA_NAME SmartHome-PT-10-14
FORMULA_NAME SmartHome-PT-10-15

=== Now, execution of the tool begins

BK_START 1621198065248

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-16 20:47:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-16 20:47:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:47:46] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2021-05-16 20:47:46] [INFO ] Transformed 273 places.
[2021-05-16 20:47:46] [INFO ] Transformed 308 transitions.
[2021-05-16 20:47:46] [INFO ] Found NUPN structural information;
[2021-05-16 20:47:46] [INFO ] Parsed PT model containing 273 places and 308 transitions in 99 ms.
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 45 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 642 resets, run finished after 300 ms. (steps per millisecond=333 ) properties seen :[1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1]
// Phase 1: matrix 263 rows 233 cols
[2021-05-16 20:47:47] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-16 20:47:47] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2021-05-16 20:47:47] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 20:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:47] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-16 20:47:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 23 ms returned unsat
[2021-05-16 20:47:47] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:47:47] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:47] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2021-05-16 20:47:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 402 ms returned sat
[2021-05-16 20:47:48] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-16 20:47:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:48] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-16 20:47:48] [INFO ] Deduced a trap composed of 41 places in 112 ms
[2021-05-16 20:47:48] [INFO ] Deduced a trap composed of 44 places in 76 ms
[2021-05-16 20:47:48] [INFO ] Deduced a trap composed of 66 places in 48 ms
[2021-05-16 20:47:48] [INFO ] Deduced a trap composed of 69 places in 38 ms
[2021-05-16 20:47:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 344 ms
[2021-05-16 20:47:48] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 22 ms.
[2021-05-16 20:47:49] [INFO ] Added : 262 causal constraints over 53 iterations in 847 ms. Result :sat
[2021-05-16 20:47:49] [INFO ] Deduced a trap composed of 48 places in 44 ms
[2021-05-16 20:47:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2021-05-16 20:47:49] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2021-05-16 20:47:49] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:49] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-16 20:47:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-16 20:47:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6542 ms returned sat
[2021-05-16 20:47:56] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 5 ms returned sat
[2021-05-16 20:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:56] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-16 20:47:56] [INFO ] Deduced a trap composed of 27 places in 36 ms
[2021-05-16 20:47:56] [INFO ] Deduced a trap composed of 32 places in 27 ms
[2021-05-16 20:47:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2021-05-16 20:47:56] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 53 ms.
[2021-05-16 20:47:58] [INFO ] Added : 259 causal constraints over 52 iterations in 1210 ms. Result :sat
[2021-05-16 20:47:58] [INFO ] Deduced a trap composed of 34 places in 36 ms
[2021-05-16 20:47:58] [INFO ] Deduced a trap composed of 28 places in 24 ms
[2021-05-16 20:47:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2021-05-16 20:47:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned unsat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-16 20:47:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 22 ms returned unsat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2021-05-16 20:47:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned unsat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 20:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:59] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-16 20:47:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 20:47:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 516 ms returned sat
[2021-05-16 20:47:59] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 20:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 20:47:59] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2021-05-16 20:47:59] [INFO ] Deduced a trap composed of 28 places in 46 ms
[2021-05-16 20:47:59] [INFO ] Deduced a trap composed of 44 places in 47 ms
[2021-05-16 20:47:59] [INFO ] Deduced a trap composed of 32 places in 35 ms
[2021-05-16 20:47:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 158 ms
[2021-05-16 20:47:59] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 15 ms.
[2021-05-16 20:48:00] [INFO ] Added : 259 causal constraints over 53 iterations in 774 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-16 20:48:00] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2021-05-16 20:48:00] [INFO ] Flatten gal took : 51 ms
FORMULA SmartHome-PT-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:48:00] [INFO ] Applying decomposition
[2021-05-16 20:48:00] [INFO ] Flatten gal took : 19 ms
[2021-05-16 20:48:01] [INFO ] Decomposing Gal with order
[2021-05-16 20:48:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-16 20:48:01] [INFO ] Removed a total of 17 redundant transitions.
[2021-05-16 20:48:01] [INFO ] Flatten gal took : 39 ms
[2021-05-16 20:48:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2021-05-16 20:48:01] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-16 20:48:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmartHome-PT-10 @ 3570 seconds

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

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

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

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

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 2,
"aconj": 3,
"adisj": 3,
"aneg": 1,
"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": "X (G ((G ((((1 <= p91)) AND ((p87 <= 0)))) OR X ((((1 <= p91)) AND ((p87 <= 0)))))))",
"processed_size": 84,
"rewrites": 45
},
"result":
{
"edges": 14,
"markings": 14,
"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": 713
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (G ((((1 <= p72)) AND ((p206 <= 0)))))",
"processed_size": 40,
"rewrites": 45
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 6,
"adisj": 3,
"aneg": 6,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 4,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "X (G ((((G ((((p211 <= 0)) OR ((1 <= p130)))) AND (((1 <= p93)) AND ((p150 <= 0)))) OR (((p17 <= 0)) OR ((1 <= p12)))) AND (((1 <= p93)) AND ((p150 <= 0))))))",
"processed_size": 159,
"rewrites": 45
},
"result":
{
"edges": 14,
"markings": 14,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 4,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G ((F (((1 <= p81) OR ((1 <= p41)))) AND (X (F ((((p96 <= 0)) OR ((1 <= p12))))) OR ((1 <= p81) OR ((1 <= p41))))))",
"processed_size": 118,
"rewrites": 45
},
"result":
{
"edges": 14,
"markings": 14,
"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": 1783
},
"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": "((p122 <= 0))",
"processed_size": 13,
"rewrites": 47
},
"result":
{
"edges": 37,
"markings": 37,
"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": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 3,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G (F ((G (((1 <= p44))) OR ((((1 <= p99)) AND ((p177 <= 0))) AND ((1 <= p44))))))",
"processed_size": 81,
"rewrites": 45
},
"result":
{
"edges": 39,
"markings": 39,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 27280,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(F((G(*) OR (* AND *)))) : X(G((G(**) OR X(*)))) : X(G(*)) : F(**) : X(G((((G(**) AND (* AND *)) OR (* OR *)) AND (* AND *)))) : G((F(**) AND (X(F(**)) OR **)))"
},
"net":
{
"arcs": 609,
"conflict_clusters": 200,
"places": 233,
"places_significant": 221,
"singleton_clusters": 0,
"transitions": 263
},
"result":
{
"preliminary_value": "no no no no no no ",
"value": "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: 496/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 233
lola: finding significant places
lola: 233 places, 263 transitions, 221 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: (p177 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p87 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p122 <= 1)
lola: LP says that atomic proposition is always true: (p130 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p12 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: X (X (G (X (NOT(F (G (((((p99 <= 0)) OR ((1 <= p177))) U ((p44 <= 0)))))))))) : X (G ((G ((((1 <= p91)) AND ((p87 <= 0)))) OR NOT(X ((((p91 <= 0)) OR ((1 <= p87)))))))) : G (NOT(X ((((p72 <= 0)) OR ((1 <= p206)))))) : F (((F ((((p141 <= 0)) OR ((1 <= p156)))) U (((1 <= p141)) AND ((p156 <= 0)))) U ((1 <= p122)))) : G (NOT(X (((((((NOT(G ((((p211 <= 0)) OR ((1 <= p130))))) OR ((p93 <= 0))) OR ((1 <= p150))) AND ((1 <= p17))) AND ((p12 <= 0))) OR ((p93 <= 0))) OR ((1 <= p150)))))) : G ((F (X ((((p41 <= 0)) U (((p96 <= 0)) OR ((1 <= p12)))))) U ((1 <= p81) OR ((1 <= p41)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((((1 <= p91)) AND ((p87 <= 0)))) OR X ((((1 <= p91)) AND ((p87 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((((1 <= p91)) AND ((p87 <= 0)))) OR X ((((1 <= p91)) AND ((p87 <= 0)))))))
lola: processed formula length: 84
lola: 45 rewrites
lola: closed formula file LTLCardinality.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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((1 <= p72)) AND ((p206 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((1 <= p72)) AND ((p206 <= 0)))))
lola: processed formula length: 40
lola: 45 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((((G ((((p211 <= 0)) OR ((1 <= p130)))) AND (((1 <= p93)) AND ((p150 <= 0)))) OR (((p17 <= 0)) OR ((1 <= p12)))) AND (((1 <= p93)) AND ((p150 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((((G ((((p211 <= 0)) OR ((1 <= p130)))) AND (((1 <= p93)) AND ((p150 <= 0)))) OR (((p17 <= 0)) OR ((1 <= p12)))) AND (((1 <= p93)) AND ((p150 <= 0))))))
lola: processed formula length: 159
lola: 45 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 3 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (((1 <= p81) OR ((1 <= p41)))) AND (X (F ((((p96 <= 0)) OR ((1 <= p12))))) OR ((1 <= p81) OR ((1 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (((1 <= p81) OR ((1 <= p41)))) AND (X (F ((((p96 <= 0)) OR ((1 <= p12))))) OR ((1 <= p81) OR ((1 <= p41))))))
lola: processed formula length: 118
lola: 45 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (((1 <= p122)))
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: ((p122 <= 0))
lola: processed formula length: 13
lola: 47 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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 5 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((G (((1 <= p44))) OR ((((1 <= p99)) AND ((p177 <= 0))) AND ((1 <= p44))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((G (((1 <= p44))) OR ((((1 <= p99)) AND ((p177 <= 0))) AND ((1 <= p44))))))
lola: processed formula length: 81
lola: 45 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: 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: 39 markings, 39 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no
lola:
preliminary result: no no no no no no
lola: memory consumption: 27280 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is SmartHome-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-tall-162106800400113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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