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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 2.7K May 14 03:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 14 03:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 21:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 21:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.2K May 13 15:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 15:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 10:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 68K 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-10-CTLCardinality-00
FORMULA_NAME SmartHome-PT-10-CTLCardinality-01
FORMULA_NAME SmartHome-PT-10-CTLCardinality-02
FORMULA_NAME SmartHome-PT-10-CTLCardinality-03
FORMULA_NAME SmartHome-PT-10-CTLCardinality-04
FORMULA_NAME SmartHome-PT-10-CTLCardinality-05
FORMULA_NAME SmartHome-PT-10-CTLCardinality-06
FORMULA_NAME SmartHome-PT-10-CTLCardinality-07
FORMULA_NAME SmartHome-PT-10-CTLCardinality-08
FORMULA_NAME SmartHome-PT-10-CTLCardinality-09
FORMULA_NAME SmartHome-PT-10-CTLCardinality-10
FORMULA_NAME SmartHome-PT-10-CTLCardinality-11
FORMULA_NAME SmartHome-PT-10-CTLCardinality-12
FORMULA_NAME SmartHome-PT-10-CTLCardinality-13
FORMULA_NAME SmartHome-PT-10-CTLCardinality-14
FORMULA_NAME SmartHome-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591288338585

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 16:32:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 16:32:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 16:32:21] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2020-06-04 16:32:21] [INFO ] Transformed 273 places.
[2020-06-04 16:32:21] [INFO ] Transformed 308 transitions.
[2020-06-04 16:32:21] [INFO ] Found NUPN structural information;
[2020-06-04 16:32:21] [INFO ] Parsed PT model containing 273 places and 308 transitions in 108 ms.
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 45 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Incomplete random walk after 100000 steps, including 655 resets, run finished after 152 ms. (steps per millisecond=657 ) properties seen :[0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1]
// Phase 1: matrix 263 rows 233 cols
[2020-06-04 16:32:21] [INFO ] Computed 12 place invariants in 8 ms
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 16:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2020-06-04 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:32:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned unsat
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 16:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-04 16:32:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:32:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned unsat
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-04 16:32:21] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 16:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:22] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2020-06-04 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:32:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned unsat
[2020-06-04 16:32:22] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2020-06-04 16:32:22] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-04 16:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:22] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-04 16:32:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:32:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 3381 ms returned sat
[2020-06-04 16:32:25] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 29 ms returned sat
[2020-06-04 16:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:25] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 32 places in 217 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 51 places in 65 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 56 places in 141 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 52 places in 109 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 51 places in 42 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 50 places in 40 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 59 places in 51 ms
[2020-06-04 16:32:26] [INFO ] Deduced a trap composed of 39 places in 37 ms
[2020-06-04 16:32:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 867 ms
[2020-06-04 16:32:26] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 31 ms.
[2020-06-04 16:32:28] [INFO ] Added : 262 causal constraints over 53 iterations in 1254 ms. Result :sat
[2020-06-04 16:32:28] [INFO ] Deduced a trap composed of 40 places in 41 ms
[2020-06-04 16:32:28] [INFO ] Deduced a trap composed of 42 places in 35 ms
[2020-06-04 16:32:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2020-06-04 16:32:28] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2020-06-04 16:32:28] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2020-06-04 16:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:28] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2020-06-04 16:32:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 16:32:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 294 ms returned sat
[2020-06-04 16:32:28] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 16:32:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 16:32:28] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2020-06-04 16:32:28] [INFO ] Computed and/alt/rep : 262/679/262 causal constraints in 15 ms.
[2020-06-04 16:32:30] [INFO ] Added : 260 causal constraints over 52 iterations in 1138 ms. Result :sat
[2020-06-04 16:32:30] [INFO ] Deduced a trap composed of 42 places in 84 ms
[2020-06-04 16:32:30] [INFO ] Deduced a trap composed of 34 places in 49 ms
[2020-06-04 16:32:30] [INFO ] Deduced a trap composed of 41 places in 30 ms
[2020-06-04 16:32:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 316 ms
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
[2020-06-04 16:32:30] [INFO ] Initial state reduction rules for CTL removed 10 formulas.
[2020-06-04 16:32:30] [INFO ] Flatten gal took : 85 ms
[2020-06-04 16:32:30] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-06-04 16:32:30] [INFO ] Flatten gal took : 32 ms
FORMULA SmartHome-PT-10-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 16:32:30] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-04 16:32:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ SmartHome-PT-10 @ 3570 seconds

FORMULA SmartHome-PT-10-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-10-CTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA SmartHome-PT-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA SmartHome-PT-10-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3455
rslt: Output for CTLCardinality @ 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=CTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 16:32:31 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"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": "E (F ((((1 <= p20)) AND ((p40 <= 0)))))",
"processed_size": 39,
"rewrites": 10
},
"result":
{
"edges": 22,
"markings": 23,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"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": "E (F ((((1 <= p81)) AND ((p187 <= 0)))))",
"processed_size": 40,
"rewrites": 10
},
"result":
{
"produced_by": "state equation",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1151
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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": "A (G ((((p170 <= 0)) OR ((1 <= p72)))))",
"processed_size": 40,
"rewrites": 11
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1727
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"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": "E (F ((((1 <= p37)) AND ((p81 <= 0)))))",
"processed_size": 39,
"rewrites": 10
},
"result":
{
"edges": 16,
"markings": 17,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3455
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 0,
"G": 0,
"U": 1,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E ((((p176 <= 0)) U ((1 <= p60))))",
"processed_size": 34,
"rewrites": 12
},
"result":
{
"edges": 24,
"markings": 23,
"produced_by": "state space /EU",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "eu preserving",
"visible": 1
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "existential_until",
"workflow": "stateequation"
}
}
],
"exit":
{
"error": null,
"memory": 22152,
"runtime": 115.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E((** U **)) : A(G(**)) : E(F(**)) : (E(F(*)) OR E(X(*))) : E(F(*))"
},
"net":
{
"arcs": 609,
"conflict_clusters": 200,
"places": 233,
"places_significant": 221,
"singleton_clusters": 0,
"transitions": 263
},
"result":
{
"preliminary_value": "yes no yes yes yes ",
"value": "yes no yes yes yes "
},
"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: 7456
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 CTLCardinality.xml
lola: LP says that atomic proposition is always true: (p60 <= 1)
lola: LP says that atomic proposition is always true: (p72 <= 1)
lola: LP says that atomic proposition is always true: (p187 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p81 <= 1)
lola: E ((((p176 <= 0)) U ((1 <= p60)))) : A (G ((((p170 <= 0)) OR ((1 <= p72))))) : E (F ((((1 <= p81)) AND ((p187 <= 0))))) : (NOT(A (G ((((p20 <= 0)) OR ((1 <= p40)))))) OR NOT(A (X ((((p231 <= 0)) OR ((1 <= p15)) OR ((p189 <= 0)) OR ((1 <= p145))))))) : NOT(A (G ((((p37 <= 0)) OR ((1 <= p81))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((((1 <= p20)) AND ((p40 <= 0))))) OR E (X ((((1 <= p231)) AND ((p15 <= 0)) AND ((1 <= p189)) AND ((p145 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p20)) AND ((p40 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p20)) AND ((p40 <= 0)))))
lola: processed formula length: 39
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p20)) AND ((p40 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p81)) AND ((p187 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p81)) AND ((p187 <= 0)))))
lola: processed formula length: 40
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p81)) AND ((p187 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2084818 markings, 2627865 edges, 416964 markings/sec, 0 secs
lola: sara is running 5 secs || 4211433 markings, 5316310 edges, 425323 markings/sec, 5 secs
sara: warning, failure of lp_solve (at job 11635)
lola: sara is running 10 secs || 6470849 markings, 8120173 edges, 451883 markings/sec, 10 secs
lola: sara is running 15 secs || 8718965 markings, 10907765 edges, 449623 markings/sec, 15 secs
lola: sara is running 20 secs || 10794614 markings, 13686494 edges, 415130 markings/sec, 20 secs
lola: sara is running 25 secs || 12936781 markings, 16495254 edges, 428433 markings/sec, 25 secs
lola: sara is running 30 secs || 14853466 markings, 19194366 edges, 383337 markings/sec, 30 secs
lola: sara is running 35 secs || 16984588 markings, 21943836 edges, 426224 markings/sec, 35 secs
lola: sara is running 40 secs || 19079513 markings, 24606101 edges, 418985 markings/sec, 40 secs
lola: sara is running 45 secs || 21194641 markings, 27266947 edges, 423026 markings/sec, 45 secs
lola: sara is running 50 secs || 23287393 markings, 29898966 edges, 418550 markings/sec, 50 secs
lola: sara is running 55 secs || 25382887 markings, 32534946 edges, 419099 markings/sec, 55 secs
lola: sara is running 60 secs || 27470513 markings, 35160778 edges, 417525 markings/sec, 60 secs
lola: sara is running 65 secs || 29561974 markings, 37791822 edges, 418292 markings/sec, 65 secs
lola: sara is running 70 secs || 31632664 markings, 40397762 edges, 414138 markings/sec, 70 secs
lola: sara is running 75 secs || 33656822 markings, 42952183 edges, 404832 markings/sec, 75 secs
lola: sara is running 80 secs || 35629941 markings, 45467362 edges, 394624 markings/sec, 80 secs
lola: sara is running 85 secs || 37549180 markings, 48012254 edges, 383848 markings/sec, 85 secs
lola: sara is running 90 secs || 39612275 markings, 50710917 edges, 412619 markings/sec, 90 secs
lola: sara is running 95 secs || 41561954 markings, 53353133 edges, 389936 markings/sec, 95 secs
lola: sara is running 100 secs || 42579418 markings, 54859088 edges, 203493 markings/sec, 100 secs
lola: sara is running 105 secs || 44325420 markings, 57367381 edges, 349200 markings/sec, 105 secs

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 2 will run for 1151 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p170 <= 0)) OR ((1 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p170 <= 0)) OR ((1 <= p72)))))
lola: processed formula length: 40
lola: 11 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p170)) AND ((p72 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: ========================================
lola: SUBRESULT
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-2-0.sara.
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 1727 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p37)) AND ((p81 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p37)) AND ((p81 <= 0)))))
lola: processed formula length: 39
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
sara: place or transition ordering is non-deterministic

lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p37)) AND ((p81 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 4 will run for 3455 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p176 <= 0)) U ((1 <= p60))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p176 <= 0)) U ((1 <= p60))))
lola: processed formula length: 34
lola: 12 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p60))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 23 markings, 24 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes
lola:
preliminary result: yes no yes yes yes
lola: memory consumption: 22152 KB
lola: time consumption: 115 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLCardinality.json
lola: closed JSON file CTLCardinality.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="CTLCardinality"
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-10, examination is CTLCardinality"
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-159033547100075"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;