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.r184-oct2-158987928800643.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 LamportFastMutEx-PT-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928800643
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 3.7K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 13:04 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 46K Apr 30 13:04 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 LamportFastMutEx-PT-2-CTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-2-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1591218000703

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:00:02] [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-03 21:00:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:00:03] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2020-06-03 21:00:03] [INFO ] Transformed 69 places.
[2020-06-03 21:00:03] [INFO ] Transformed 96 transitions.
[2020-06-03 21:00:03] [INFO ] Parsed PT model containing 69 places and 96 transitions in 136 ms.
Deduced a syphon composed of 25 places in 9 ms
Reduce places removed 25 places and 34 transitions.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 34 ms.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 229 ms. (steps per millisecond=436 ) properties seen :[0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0]
[2020-06-03 21:00:03] [INFO ] Flow matrix only has 56 transitions (discarded 6 similar events)
// Phase 1: matrix 56 rows 44 cols
[2020-06-03 21:00:03] [INFO ] Computed 10 place invariants in 3 ms
[2020-06-03 21:00:03] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2020-06-03 21:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:03] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2020-06-03 21:00:03] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-06-03 21:00:03] [INFO ] [Real]Added 20 Read/Feed constraints in 8 ms returned sat
[2020-06-03 21:00:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2020-06-03 21:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:03] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2020-06-03 21:00:03] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2020-06-03 21:00:03] [INFO ] Deduced a trap composed of 9 places in 119 ms
[2020-06-03 21:00:03] [INFO ] Deduced a trap composed of 10 places in 70 ms
[2020-06-03 21:00:03] [INFO ] Deduced a trap composed of 10 places in 40 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 9 places in 241 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-06-03 21:00:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 563 ms
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 26 ms returned unsat
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2020-06-03 21:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-06-03 21:00:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 21:00:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2020-06-03 21:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 21:00:04] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-03 21:00:04] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 10 places in 37 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 9 places in 36 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 8 places in 179 ms
[2020-06-03 21:00:04] [INFO ] Deduced a trap composed of 12 places in 30 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 11 places in 36 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 11 places in 212 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 4 places in 47 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2020-06-03 21:00:05] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-06-03 21:00:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 907 ms
[2020-06-03 21:00:05] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned unsat
Successfully simplified 11 atomic propositions for a total of 11 simplifications.
[2020-06-03 21:00:05] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-03 21:00:05] [INFO ] Flatten gal took : 27 ms
[2020-06-03 21:00:05] [INFO ] Initial state reduction rules for CTL removed 12 formulas.
[2020-06-03 21:00:05] [INFO ] Flatten gal took : 11 ms
FORMULA LamportFastMutEx-PT-2-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LamportFastMutEx-PT-2-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-03 21:00:05] [INFO ] Export to MCC properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2020-06-03 21:00:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ LamportFastMutEx-PT-2 @ 3570 seconds

FORMULA LamportFastMutEx-PT-2-CTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-CTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-CTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA LamportFastMutEx-PT-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for CTLCardinality @ LamportFastMutEx-PT-2

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--quickchecks",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ctl",
"--json=CTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 21:00:06 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 892
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "NOT DEADLOCK",
"processed_size": 12,
"rewrites": 10
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "AX((1 <= p26 + p27 + p28 + p29))",
"processed_size": 32,
"rewrites": 11
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "CTL model checker",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((p26 + p27 + p28 + p29 <= p37 + p36)))",
"processed_size": 44,
"rewrites": 12
},
"result":
{
"edges": 9,
"markings": 10,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"formula":
{
"count":
{
"A": 0,
"E": 2,
"F": 0,
"G": 1,
"U": 1,
"X": 0,
"aconj": 0,
"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": "EG(E((p3 <= 0) U (1 <= p41)))",
"processed_size": 29,
"rewrites": 12
},
"net":
{
"conflict_clusters": 5,
"singleton_clusters": 0
},
"result":
{
"edges": 26,
"markings": 9,
"produced_by": "CTL model checker",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ctl preserving"
},
"type": "ctl model checker"
},
"type": "CTL"
}
}
],
"exit":
{
"error": null,
"memory": 16968,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "CTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(**)) : NODEADLOCK : A(G(**)) : E(G(E((** U **))))"
},
"net":
{
"arcs": 256,
"conflict_clusters": 5,
"places": 44,
"places_significant": 34,
"singleton_clusters": 0,
"transitions": 62
},
"result":
{
"preliminary_value": "no yes no yes ",
"value": "no yes no 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: 106/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 44
lola: finding significant places
lola: 44 places, 62 transitions, 34 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: A (X ((1 <= p26 + p27 + p28 + p29))) : E (X ((E (X ((0 <= 0))) OR A (X ((1 <= 0)))))) : (E (((p30 + p31 + 1 <= p26 + p27 + p28 + p29) U (1 <= 0))) OR A (G ((p26 + p27 + p28 + p29 <= p37 + p36)))) : E (G (E (((p3 <= 0) U (1 <= p41)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:227
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 10 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 0 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 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX((1 <= p26 + p27 + p28 + p29))
lola: processed formula length: 32
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p26 + p27 + p28 + p29 <= p37 + p36)))
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 ((p26 + p27 + p28 + p29 <= p37 + p36)))
lola: processed formula length: 44
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)
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: (p37 + p36 + 1 <= p26 + p27 + p28 + p29)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (((p3 <= 0) U (1 <= p41)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(E((p3 <= 0) U (1 <= p41)))
lola: processed formula length: 29
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: 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9 markings, 26 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes
lola:
preliminary result: no yes no yes
lola: memory consumption: 16968 KB
lola: time consumption: 3 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="LamportFastMutEx-PT-2"
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 LamportFastMutEx-PT-2, 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 r184-oct2-158987928800643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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