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.r186-oct2-158987938700252.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 RwMutex-PT-r0010w0020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-oct2-158987938700252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.3K Apr 12 11:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 11:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 11 12:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 11 12:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 23:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 23:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 40K Mar 24 05:38 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 RwMutex-PT-r0010w0020-CTLFireability-00
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-01
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-02
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-03
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-04
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-05
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-06
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-07
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-08
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-09
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-10
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-11
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-12
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-13
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-14
FORMULA_NAME RwMutex-PT-r0010w0020-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1591232741884

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 01:05:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 01:05:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 01:05:44] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2020-06-04 01:05:44] [INFO ] Transformed 70 places.
[2020-06-04 01:05:44] [INFO ] Transformed 60 transitions.
[2020-06-04 01:05:44] [INFO ] Parsed PT model containing 70 places and 60 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 407 ms. (steps per millisecond=245 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 60 rows 70 cols
[2020-06-04 01:05:44] [INFO ] Computed 40 place invariants in 6 ms
[2020-06-04 01:05:45] [INFO ] [Real]Absence check using 40 positive place invariants in 141 ms returned unsat
[2020-06-04 01:05:45] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
[2020-06-04 01:05:45] [INFO ] [Real]Absence check using 40 positive place invariants in 27 ms returned unsat
[2020-06-04 01:05:45] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned unsat
[2020-06-04 01:05:45] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned unsat
[2020-06-04 01:05:45] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 6 simplifications.
[2020-06-04 01:05:45] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-04 01:05:45] [INFO ] Flatten gal took : 81 ms
[2020-06-04 01:05:45] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-06-04 01:05:45] [INFO ] Flatten gal took : 14 ms
FORMULA RwMutex-PT-r0010w0020-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RwMutex-PT-r0010w0020-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-04 01:05:45] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2020-06-04 01:05:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLFireability @ RwMutex-PT-r0010w0020 @ 3570 seconds

FORMULA RwMutex-PT-r0010w0020-CTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0020-CTLFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RwMutex-PT-r0010w0020-CTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLFireability @ RwMutex-PT-r0010w0020

{
"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=CTLFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 01:05:46 2020
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((1 <= p15) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))",
"processed_size": 162,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 11,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 11,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 11,
"visible_transitions": 0
},
"processed": "((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))",
"processed_size": 161,
"rewrites": 2
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "state space /EXEG",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "invisibility based",
"visible": 30
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 11,
"problems": 11
},
"type": "reachability_from_a_successor",
"workflow": "stateequation"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1784
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 1,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "((1 <= p57) OR ((1 <= p8) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))",
"processed_size": 178,
"rewrites": 4
},
"result":
{
"edges": 60,
"markings": 31,
"produced_by": "parallel",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "tscc preserving/always up"
}
},
"store":
{
"type": "dfs/tscc"
},
"type": "possible_invariance",
"workflow": "stateequation"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3568
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 2,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 0,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "EG((EG(((1 <= p14) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))) OR ((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))))",
"processed_size": 337,
"rewrites": 2
},
"net":
{
"conflict_clusters": 31,
"singleton_clusters": 0
},
"result":
{
"edges": 91,
"markings": 31,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 26436,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(G((E(G(**)) OR **))) : E(F(A(G(**)))) : (** AND E(X(E(G(**)))))"
},
"net":
{
"arcs": 540,
"conflict_clusters": 31,
"places": 70,
"places_significant": 30,
"singleton_clusters": 0,
"transitions": 60
},
"result":
{
"preliminary_value": "no no no ",
"value": "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: 130/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 70
lola: finding significant places
lola: 70 places, 60 transitions, 30 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 CTLFireability.xml
lola: E (G ((E (G (((1 <= p14) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))) OR ((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))))) : E (F (A (G (((p57 <= 0) AND ((p8 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p40 <= 0) OR (p41 <= 0) OR (p42 <= 0) OR (p43 <= 0) OR (p45 <= 0) OR (p46 <= 0))))))) : (((1 <= p15) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)) AND E (X (E (G (((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= p15) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)) AND E (X (E (G (((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= p15) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p15) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))
lola: processed formula length: 162
lola: 0 rewrites
lola: closed formula file CTLFireability.xml
lola: processed formula with 11 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: ((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))
lola: processed formula length: 161
lola: 2 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: state equation task get result unparse finished++ id 0
lola: The predicate is not possibly preserved from any successor.
lola: formula 0: ((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))
lola: state equation task get result unparse finished id 0
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 11 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p57 <= 0) AND ((p8 <= 0) OR (p36 <= 0) OR (p37 <= 0) OR (p38 <= 0) OR (p39 <= 0) OR (p40 <= 0) OR (p41 <= 0) OR (p42 <= 0) OR (p43 <= 0) OR (p45 <= 0) OR (p46 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:604
lola: rewrite Frontend/Parser/formula_rewrite.k:614
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((1 <= p57) OR ((1 <= p8) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))
lola: processed formula length: 178
lola: 4 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
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:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 0
lola: state equation task get result unparse finished++ id 1
lola: SUBRESULT
lola: result: no
lola: produced by: parallel
lola: The predicate is not possibly invariant.
lola: 31 markings, 60 edges
lola: ========================================
lola: subprocess 2 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (G (((1 <= p14) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))) OR ((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG((EG(((1 <= p14) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))) OR ((1 <= p4) AND (1 <= p36) AND (1 <= p37) AND (1 <= p38) AND (1 <= p39) AND (1 <= p40) AND (1 <= p41) AND (1 <= p42) AND (1 <= p43) AND (1 <= p45) AND (1 <= p46))))
lola: processed formula length: 337
lola: 2 rewrites
lola: closed formula file CTLFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 31 markings, 91 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no
lola:
preliminary result: no no no
lola: memory consumption: 26436 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to CTLFireability.json
lola: closed JSON file CTLFireability.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="RwMutex-PT-r0010w0020"
export BK_EXAMINATION="CTLFireability"
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 RwMutex-PT-r0010w0020, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-oct2-158987938700252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0010w0020.tgz
mv RwMutex-PT-r0010w0020 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;