fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r158-ebro-149443464100174
Last Updated
June 27, 2017

About the Execution of LoLA for S_SwimmingPool-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15951.570 1234902.00 1243488.00 430.10 ?FFF?FTTTFFTTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_SwimmingPool-PT-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100174
=====================================================================


--------------------
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 SwimmingPool-PT-08-CTLCardinality-0
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-1
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-15
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-2
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-3
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-4
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-5
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-6
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-7
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-8
FORMULA_NAME SwimmingPool-PT-08-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496564037082


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SwimmingPool-PT-08: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_SwimmingPool-PT-08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_SwimmingPool-PT-08 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-08-CTLCardinality.task
lola: A (G (A (X ((Dressed + 1 <= Bags))))) : (A (G (E (G ((Dressed <= Cabins))))) AND (2 <= Out)) : A (F (E (F ((Bags <= Dress))))) : A (G ((A (G ((InBath <= Bags))) OR E (G ((1 <= WaitBag)))))) : NOT(E (F (((Out <= Cabins) AND (1 <= Dressed) AND (Entered + 1 <= Dressed))))) : NOT(((A (G ((Entered <= Cabins))) AND (((3 <= Bags) OR (Undress <= Out)) AND ((Undress <= Cabins) OR (3 <= Undress)))) AND (E (X (TRUE)) OR ((Undress <= 2) OR (Undress <= 1))))) : E ((A (G (TRUE)) U A (X ((1 <= Undress))))) : NOT(((E (F ((3 <= WaitBag))) AND A (X ((1 <= WaitBag)))) OR A (G (((1 <= Out)))))) : (((Undress <= Cabins) OR E (((Out <= Dress) U (3 <= Dress)))) AND ((2 <= Bags) AND A (G ((1 <= Bags))))) : E (F (((Cabins <= Dress) AND E (X ((1 <= Undress)))))) : A (G (E (X (((Dressed <= Out)))))) : NOT((E (F ((Cabins <= 1))) AND ((Dressed <= Entered) AND ((Undress <= Cabins) OR (2 <= Bags))))) : A (X (NOT(A (G ((3 <= Bags)))))) : E (G ((WaitBag <= Dress))) : A (G (A (F (())))) : E (F ((E (G ((1 <= WaitBag))) AND ((Entered <= 2) AND (Out <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((Dressed + 1 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((Dressed + 1 <= Bags)))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1056390 markings, 2826119 edges, 3224335165761257472 markings/sec, 0 secs
lola: 1982722 markings, 5593351 edges, 185266 markings/sec, 5 secs
lola: 2834625 markings, 8226706 edges, 170381 markings/sec, 10 secs
lola: 3663692 markings, 10833459 edges, 165813 markings/sec, 15 secs
lola: 4458360 markings, 13373494 edges, 158934 markings/sec, 20 secs
lola: 5228861 markings, 15862229 edges, 154100 markings/sec, 25 secs
lola: 5980253 markings, 18299911 edges, 150278 markings/sec, 30 secs
lola: 6715584 markings, 20693641 edges, 147066 markings/sec, 35 secs
lola: 7443069 markings, 23076805 edges, 145497 markings/sec, 40 secs
lola: 8157530 markings, 25437248 edges, 142892 markings/sec, 45 secs
lola: 8865919 markings, 27795881 edges, 141678 markings/sec, 50 secs
lola: 9574135 markings, 30148057 edges, 141643 markings/sec, 55 secs
lola: 10275653 markings, 32487879 edges, 140304 markings/sec, 60 secs
lola: 10973898 markings, 34813784 edges, 139649 markings/sec, 65 secs
lola: 11670156 markings, 37129543 edges, 139252 markings/sec, 70 secs
lola: 12360345 markings, 39434291 edges, 138038 markings/sec, 75 secs
lola: 13045134 markings, 41725920 edges, 136958 markings/sec, 80 secs
lola: 13721373 markings, 44003973 edges, 135248 markings/sec, 85 secs
lola: 14394916 markings, 46269956 edges, 134709 markings/sec, 90 secs
lola: 15063111 markings, 48528521 edges, 133639 markings/sec, 95 secs
lola: 15730683 markings, 50777854 edges, 133514 markings/sec, 100 secs
lola: 16390089 markings, 53016097 edges, 131881 markings/sec, 105 secs
lola: 17047692 markings, 55240400 edges, 131521 markings/sec, 110 secs
lola: 17698877 markings, 57467415 edges, 130237 markings/sec, 115 secs
lola: 18347840 markings, 59686982 edges, 129793 markings/sec, 120 secs
lola: 18994549 markings, 61895534 edges, 129342 markings/sec, 125 secs
lola: 19635035 markings, 64093686 edges, 128097 markings/sec, 130 secs
lola: 20276941 markings, 66291254 edges, 128381 markings/sec, 135 secs
lola: 20916058 markings, 68481412 edges, 127823 markings/sec, 140 secs
lola: 21549962 markings, 70663498 edges, 126781 markings/sec, 145 secs
lola: 22180859 markings, 72837547 edges, 126179 markings/sec, 150 secs
lola: 22805532 markings, 74997975 edges, 124935 markings/sec, 155 secs
lola: 23426157 markings, 77153152 edges, 124125 markings/sec, 160 secs
lola: 24048257 markings, 79309084 edges, 124420 markings/sec, 165 secs
lola: 24669209 markings, 81457548 edges, 124190 markings/sec, 170 secs
lola: 25288333 markings, 83600229 edges, 123825 markings/sec, 175 secs
lola: 25906303 markings, 85741104 edges, 123594 markings/sec, 180 secs
lola: 26526143 markings, 87880340 edges, 123968 markings/sec, 185 secs
lola: 27139578 markings, 90007990 edges, 122687 markings/sec, 190 secs
lola: 27750848 markings, 92132008 edges, 122254 markings/sec, 195 secs
lola: 28365680 markings, 94262057 edges, 122966 markings/sec, 200 secs
lola: 28976782 markings, 96380058 edges, 122220 markings/sec, 205 secs
lola: 29583523 markings, 98490645 edges, 121348 markings/sec, 210 secs
lola: 30192276 markings, 100607185 edges, 121751 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((Dressed <= Cabins))))) AND (2 <= Out))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((Dressed <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (Cabins + 1 <= Dressed))))
lola: processed formula length: 48
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((Bags <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Bags <= Dress)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((InBath <= Bags))) OR E (G ((1 <= WaitBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (Bags + 1 <= InBath)) AND A(TRUE U (WaitBag <= 0)))))
lola: processed formula length: 76
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((Out <= Cabins) AND (1 <= Dressed) AND (Entered + 1 <= Dressed)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: RUNNING
lola: lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas========================================

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-4.sara
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (G ((Entered <= Cabins))) AND (((3 <= Bags) OR (Undress <= Out)) AND ((Undress <= Cabins) OR (3 <= Undress)))) AND (E (X (TRUE)) OR ((Undress <= 2) OR (Undress <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: lola: state equation: calling and running sara========================================

lola: ...considering subproblem: E (F ((Cabins + 1 <= Entered)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: lola: result: yes========================================

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: state equation: calling and running sara
lola: ...considering subproblem: E ((A (G (TRUE)) U A (X ((1 <= Undress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= Undress)))
lola: processed formula length: 28
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 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: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (F ((3 <= WaitBag))) AND A (X ((1 <= WaitBag)))) OR A (G (((1 <= Out))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((WaitBag <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
sara: try reading problem file SwimmingPool-PT-08-CTLCardinality-5.sara.
lola: ========================================
sara: try reading problem file SwimmingPool-PT-08-CTLCardinality-4.sara.
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((WaitBag <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((WaitBag <= 0))
lola: processed formula length: 18
lola: 12 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Out <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: sara: place or transition ordering is non-deterministic
using 24 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
lola: ...considering subproblem: (((Undress <= Cabins) OR E (((Out <= Dress) U (3 <= Dress)))) AND ((2 <= Bags) AND A (G ((1 <= Bags)))))
lola: ========================================
lola: SUBTASK

lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file SwimmingPool-PT-08-CTLCardinality-9.sara.
lola: subprocess 8 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Undress <= Cabins)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction

lola: processed formula: (Undress <= Cabins)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Bags)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Bags)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Bags)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: SUBRESULT
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-10.sara
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)lola: lola: ========================================state equation: calling and running sara


lola: ========================================
lola: ...considering subproblem: E (F (((Cabins <= Dress) AND E (X ((1 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((Cabins <= Dress) AND EX((1 <= Undress))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 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: ========================================
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((Dressed <= Out))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((Dressed <= Out))))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
sara: lola: try reading problem file SwimmingPool-PT-08-CTLCardinality-10.sara.
CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((Cabins <= 1))) AND ((Dressed <= Entered) AND ((Undress <= Cabins) OR (2 <= Bags)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 663 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Cabins)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to SwimmingPool-PT-08-CTLCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Entered + 1 <= Dressed) OR ((Cabins + 1 <= Undress) AND (Bags <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Entered + 1 <= Dressed) OR ((Cabins + 1 <= Undress) AND (Bags <= 1)))
lola: processed formula length: 72
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (G ((3 <= Bags))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (Bags <= 2)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1439570 markings, 3967364 edges, 287914 markings/sec, 0 secs
lola: 2572893 markings, 7415723 edges, 226665 markings/sec, 5 secs
lola: 3619763 markings, 10690882 edges, 209374 markings/sec, 10 secs
lola: 4607335 markings, 13848843 edges, 197514 markings/sec, 15 secs
lola: 5543357 markings, 16875588 edges, 187204 markings/sec, 20 secs
lola: 6445979 markings, 19815222 edges, 180524 markings/sec, 25 secs
lola: 7332427 markings, 22713115 edges, 177290 markings/sec, 30 secs
lola: 8199401 markings, 25576831 edges, 173395 markings/sec, 35 secs
lola: 9042448 markings, 28383452 edges, 168609 markings/sec, 40 secs
lola: 9881761 markings, 31170109 edges, 167863 markings/sec, 45 secs
lola: 10706810 markings, 33922074 edges, 165010 markings/sec, 50 secs
lola: 11533461 markings, 36675153 edges, 165330 markings/sec, 55 secs
lola: 12354319 markings, 39413725 edges, 164172 markings/sec, 60 secs
lola: 13167816 markings, 42137655 edges, 162699 markings/sec, 65 secs
lola: 13964868 markings, 44821141 edges, 159410 markings/sec, 70 secs
lola: 14756963 markings, 47496033 edges, 158419 markings/sec, 75 secs
lola: 15548661 markings, 50161047 edges, 158340 markings/sec, 80 secs
lola: 16332060 markings, 52817758 edges, 156680 markings/sec, 85 secs
lola: 17110988 markings, 55455461 edges, 155786 markings/sec, 90 secs
lola: 17877466 markings, 58074619 edges, 153296 markings/sec, 95 secs
lola: 18639285 markings, 60683015 edges, 152364 markings/sec, 100 secs
lola: 19396915 markings, 63280789 edges, 151526 markings/sec, 105 secs
lola: 20154336 markings, 65869153 edges, 151484 markings/sec, 110 secs
lola: 20905830 markings, 68446841 edges, 150299 markings/sec, 115 secs
lola: 21650631 markings, 71008991 edges, 148960 markings/sec, 120 secs
lola: 22389659 markings, 73557238 edges, 147806 markings/sec, 125 secs
lola: 23118866 markings, 76088704 edges, 145841 markings/sec, 130 secs
lola: 23846344 markings, 78610636 edges, 145496 markings/sec, 135 secs
lola: 24574619 markings, 81131719 edges, 145655 markings/sec, 140 secs
lola: 25301024 markings, 83642833 edges, 145281 markings/sec, 145 secs
lola: 26023302 markings, 86147985 edges, 144456 markings/sec, 150 secs
lola: 26745660 markings, 88643618 edges, 144472 markings/sec, 155 secs
lola: 27462216 markings, 91126600 edges, 143311 markings/sec, 160 secs
lola: 28178118 markings, 93608765 edges, 143180 markings/sec, 165 secs
lola: 28887407 markings, 96070666 edges, 141858 markings/sec, 170 secs
lola: 29594086 markings, 98528269 edges, 141336 markings/sec, 175 secs
lola: 30305530 markings, 101000644 edges, 142289 markings/sec, 180 secs
lola: 31016908 markings, 103462763 edges, 142276 markings/sec, 185 secs
lola: 31725901 markings, 105921650 edges, 141799 markings/sec, 190 secs
lola: 32416391 markings, 108334788 edges, 138098 markings/sec, 195 secs
lola: 33113098 markings, 110757975 edges, 139341 markings/sec, 200 secs
lola: 33814453 markings, 113195369 edges, 140271 markings/sec, 205 secs
lola: 34513809 markings, 115628559 edges, 139871 markings/sec, 210 secs
lola: 35212360 markings, 118058993 edges, 139710 markings/sec, 215 secs
lola: 35908424 markings, 120480892 edges, 139213 markings/sec, 220 secs
lola: 36603498 markings, 122901983 edges, 139015 markings/sec, 225 secs
lola: 37285435 markings, 125292591 edges, 136387 markings/sec, 230 secs
lola: 37975425 markings, 127692568 edges, 137998 markings/sec, 235 secs
lola: 38653934 markings, 130070967 edges, 135702 markings/sec, 240 secs
lola: 39337582 markings, 132456736 edges, 136730 markings/sec, 245 secs
lola: 40016988 markings, 134835501 edges, 135881 markings/sec, 250 secs
lola: 40686286 markings, 137194310 edges, 133860 markings/sec, 255 secs
lola: 41366688 markings, 139574799 edges, 136080 markings/sec, 260 secs
lola: 42044399 markings, 141950105 edges, 135542 markings/sec, 265 secs
lola: 42723148 markings, 144327489 edges, 135750 markings/sec, 270 secs
lola: 43396711 markings, 146691988 edges, 134713 markings/sec, 275 secs
lola: 44064259 markings, 149042711 edges, 133510 markings/sec, 280 secs
lola: 44738502 markings, 151402969 edges, 134849 markings/sec, 285 secs
lola: 45401557 markings, 153748518 edges, 132611 markings/sec, 290 secs
lola: 46064421 markings, 156092545 edges, 132573 markings/sec, 295 secs
lola: 46738039 markings, 158462576 edges, 134724 markings/sec, 300 secs
lola: 47405801 markings, 160813327 edges, 133552 markings/sec, 305 secs
lola: 48062783 markings, 163141112 edges, 131396 markings/sec, 310 secs
lola: 48719415 markings, 165466519 edges, 131326 markings/sec, 315 secs
lola: 49375031 markings, 167796923 edges, 131123 markings/sec, 320 secs
lola: 50028753 markings, 170127621 edges, 130744 markings/sec, 325 secs
lola: 50679710 markings, 172438115 edges, 130191 markings/sec, 330 secs
lola: 51333634 markings, 174750688 edges, 130785 markings/sec, 335 secs
lola: 51995165 markings, 177090468 edges, 132306 markings/sec, 340 secs
lola: 52648085 markings, 179404424 edges, 130584 markings/sec, 345 secs
lola: 53299102 markings, 181714330 edges, 130203 markings/sec, 350 secs
lola: 53946293 markings, 184016959 edges, 129438 markings/sec, 355 secs
lola: 54589638 markings, 186314243 edges, 128669 markings/sec, 360 secs
lola: 55229052 markings, 188592972 edges, 127883 markings/sec, 365 secs
lola: 55875379 markings, 190882391 edges, 129265 markings/sec, 370 secs
lola: 56525159 markings, 193177418 edges, 129956 markings/sec, 375 secs
lola: 57158919 markings, 195435525 edges, 126752 markings/sec, 380 secs
lola: 57801893 markings, 197719227 edges, 128595 markings/sec, 385 secs
lola: 58440891 markings, 199991853 edges, 127800 markings/sec, 390 secs
lola: 59070627 markings, 202248514 edges, 125947 markings/sec, 395 secs
lola: 59709429 markings, 204516908 edges, 127760 markings/sec, 400 secs
lola: 60349578 markings, 206791719 edges, 128030 markings/sec, 405 secs
lola: 60982663 markings, 209045403 edges, 126617 markings/sec, 410 secs
lola: 61616039 markings, 211301076 edges, 126675 markings/sec, 415 secs
lola: 62247036 markings, 213550187 edges, 126199 markings/sec, 420 secs
lola: 62873147 markings, 215790424 edges, 125222 markings/sec, 425 secs
lola: 63500238 markings, 218031246 edges, 125418 markings/sec, 430 secs
lola: 64127847 markings, 220273263 edges, 125522 markings/sec, 435 secs
lola: 64760231 markings, 222522191 edges, 126477 markings/sec, 440 secs
lola: 65391429 markings, 224765401 edges, 126240 markings/sec, 445 secs
lola: 66023132 markings, 227011517 edges, 126341 markings/sec, 450 secs
lola: 66660503 markings, 229277706 edges, 127474 markings/sec, 455 secs
lola: 67295489 markings, 231545190 edges, 126997 markings/sec, 460 secs
lola: 67934985 markings, 233816126 edges, 127899 markings/sec, 465 secs
lola: 68568211 markings, 236076479 edges, 126645 markings/sec, 470 secs
lola: 69205497 markings, 238347616 edges, 127457 markings/sec, 475 secs
lola: 69831496 markings, 240590160 edges, 125200 markings/sec, 480 secs
lola: 70461805 markings, 242839486 edges, 126062 markings/sec, 485 secs
lola: 71089036 markings, 245086913 edges, 125446 markings/sec, 490 secs
lola: 71716020 markings, 247333422 edges, 125397 markings/sec, 495 secs
lola: 72338703 markings, 249568288 edges, 124537 markings/sec, 500 secs
lola: 72960424 markings, 251803195 edges, 124344 markings/sec, 505 secs
lola: 73587892 markings, 254045004 edges, 125494 markings/sec, 510 secs
lola: 74220678 markings, 256301247 edges, 126557 markings/sec, 515 secs
lola: 74844596 markings, 258539269 edges, 124784 markings/sec, 520 secs
lola: 75470680 markings, 260781801 edges, 125217 markings/sec, 525 secs
lola: 76100103 markings, 263031144 edges, 125885 markings/sec, 530 secs
lola: 76725210 markings, 265273303 edges, 125021 markings/sec, 535 secs
lola: 77343599 markings, 267498816 edges, 123678 markings/sec, 540 secs
lola: 77964500 markings, 269728764 edges, 124180 markings/sec, 545 secs
lola: 78585761 markings, 271955712 edges, 124252 markings/sec, 550 secs
lola: 79209920 markings, 274190372 edges, 124832 markings/sec, 555 secs
lola: 79829701 markings, 276424396 edges, 123956 markings/sec, 560 secs
lola: 80451219 markings, 278653840 edges, 124304 markings/sec, 565 secs
lola: 81068065 markings, 280875805 edges, 123369 markings/sec, 570 secs
lola: 81683640 markings, 283089188 edges, 123115 markings/sec, 575 secs
lola: 82306000 markings, 285308769 edges, 124472 markings/sec, 580 secs
lola: 82908447 markings, 287486801 edges, 120489 markings/sec, 585 secs
lola: 83525742 markings, 289692849 edges, 123459 markings/sec, 590 secs
lola: 84137563 markings, 291889503 edges, 122364 markings/sec, 595 secs
lola: 84747017 markings, 294075309 edges, 121891 markings/sec, 600 secs
lola: 85354477 markings, 296256445 edges, 121492 markings/sec, 605 secs
lola: 85964141 markings, 298454856 edges, 121933 markings/sec, 610 secs
lola: 86575805 markings, 300645296 edges, 122333 markings/sec, 615 secs
lola: 87187274 markings, 302842883 edges, 122294 markings/sec, 620 secs
lola: 87796391 markings, 305025786 edges, 121823 markings/sec, 625 secs
lola: 88410824 markings, 307221355 edges, 122887 markings/sec, 630 secs
lola: 89016911 markings, 309403834 edges, 121217 markings/sec, 635 secs
lola: 89632319 markings, 311601464 edges, 123082 markings/sec, 640 secs
lola: 90241164 markings, 313788389 edges, 121769 markings/sec, 645 secs
lola: 90841948 markings, 315947496 edges, 120157 markings/sec, 650 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((WaitBag <= Dress)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Dress + 1 <= WaitBag)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 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: ========================================
lola: subprocess 14 will run for 1327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (()))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
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: ========================================
lola: subprocess 15 will run for 2654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((1 <= WaitBag))) AND ((Entered <= 2) AND (Out <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (WaitBag <= 0))) AND ((Entered <= 2) AND (Out <= 1))))
lola: processed formula length: 77
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 0 unused bits
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: 627924 markings, 2399733 edges, 2286526788936925184 markings/sec, 0 secs
lola: 1205045 markings, 4623548 edges, 115424 markings/sec, 5 secs
lola: 1761403 markings, 6773411 edges, 111272 markings/sec, 10 secs
lola: 2310708 markings, 8896379 edges, 109861 markings/sec, 15 secs
lola: 2854542 markings, 10999877 edges, 108767 markings/sec, 20 secs
lola: 3390005 markings, 13073336 edges, 107093 markings/sec, 25 secs
lola: 3933011 markings, 15177348 edges, 108601 markings/sec, 30 secs
lola: 4493986 markings, 17350040 edges, 112195 markings/sec, 35 secs
lola: 5055071 markings, 19523122 edges, 112217 markings/sec, 40 secs
lola: 5612825 markings, 21684747 edges, 111551 markings/sec, 45 secs
lola: 6170089 markings, 23843932 edges, 111453 markings/sec, 50 secs
lola: 6720440 markings, 25976307 edges, 110070 markings/sec, 55 secs
lola: 7271918 markings, 28112913 edges, 110296 markings/sec, 60 secs
lola: 7823638 markings, 30249328 edges, 110344 markings/sec, 65 secs
lola: 8371687 markings, 32374428 edges, 109610 markings/sec, 70 secs
lola: 8917978 markings, 34490351 edges, 109258 markings/sec, 75 secs
lola: 9463753 markings, 36606883 edges, 109155 markings/sec, 80 secs
lola: 10009659 markings, 38722997 edges, 109181 markings/sec, 85 secs
lola: 10554371 markings, 40832705 edges, 108942 markings/sec, 90 secs
lola: 11102326 markings, 42957505 edges, 109591 markings/sec, 95 secs
lola: 11653962 markings, 45094464 edges, 110327 markings/sec, 100 secs
lola: 12203095 markings, 47223696 edges, 109827 markings/sec, 105 secs
lola: 12752533 markings, 49352722 edges, 109888 markings/sec, 110 secs
lola: 13302799 markings, 51483923 edges, 110053 markings/sec, 115 secs
lola: 13851073 markings, 53609144 edges, 109655 markings/sec, 120 secs
lola: 14400724 markings, 55737085 edges, 109930 markings/sec, 125 secs
lola: 14948699 markings, 57861551 edges, 109595 markings/sec, 130 secs
lola: 15498748 markings, 59990394 edges, 110010 markings/sec, 135 secs
lola: 16045192 markings, 62108595 edges, 109289 markings/sec, 140 secs
lola: 16593663 markings, 64232710 edges, 109694 markings/sec, 145 secs
lola: 17141477 markings, 66353783 edges, 109563 markings/sec, 150 secs
lola: 17688376 markings, 68471964 edges, 109380 markings/sec, 155 secs
lola: 18236760 markings, 70595468 edges, 109677 markings/sec, 160 secs
lola: 18783291 markings, 72712027 edges, 109306 markings/sec, 165 secs
lola: 19332009 markings, 74836206 edges, 109744 markings/sec, 170 secs
lola: 19879262 markings, 76954749 edges, 109451 markings/sec, 175 secs
lola: 20428750 markings, 79081160 edges, 109898 markings/sec, 180 secs
lola: 20976449 markings, 81204112 edges, 109540 markings/sec, 185 secs
lola: 21526868 markings, 83333331 edges, 110084 markings/sec, 190 secs
lola: 22072973 markings, 85447422 edges, 109221 markings/sec, 195 secs
lola: 22621521 markings, 87571371 edges, 109710 markings/sec, 200 secs
lola: 23172205 markings, 89703955 edges, 110137 markings/sec, 205 secs
lola: 23724471 markings, 91840178 edges, 110453 markings/sec, 210 secs
lola: 24262340 markings, 93923667 edges, 107574 markings/sec, 215 secs
lola: 24764552 markings, 95866681 edges, 100442 markings/sec, 220 secs
lola: 25264573 markings, 97803275 edges, 100004 markings/sec, 225 secs
lola: 25766986 markings, 99747899 edges, 100483 markings/sec, 230 secs
lola: 26267017 markings, 101681388 edges, 100006 markings/sec, 235 secs
lola: 26763682 markings, 103606031 edges, 99333 markings/sec, 240 secs
lola: 27274475 markings, 105581923 edges, 102159 markings/sec, 245 secs
lola: 27813368 markings, 107666991 edges, 107779 markings/sec, 250 secs
lola: 28352520 markings, 109754202 edges, 107830 markings/sec, 255 secs
lola: 28892615 markings, 111844595 edges, 108019 markings/sec, 260 secs
lola: 29440105 markings, 113963479 edges, 109498 markings/sec, 265 secs
lola: 29991419 markings, 116096744 edges, 110263 markings/sec, 270 secs
lola: 30543197 markings, 118233183 edges, 110356 markings/sec, 275 secs
lola: 31095749 markings, 120370585 edges, 110510 markings/sec, 280 secs
lola: 31649398 markings, 122512382 edges, 110730 markings/sec, 285 secs
lola: 32201463 markings, 124648470 edges, 110413 markings/sec, 290 secs
lola: 32757620 markings, 126800579 edges, 111231 markings/sec, 295 secs
lola: 33312017 markings, 128943736 edges, 110879 markings/sec, 300 secs
lola: 33863587 markings, 131076899 edges, 110314 markings/sec, 305 secs
lola: 34417390 markings, 133218220 edges, 110761 markings/sec, 310 secs
lola: 34971057 markings, 135360234 edges, 110733 markings/sec, 315 secs
lola: 35525143 markings, 137502518 edges, 110817 markings/sec, 320 secs
lola: 36073118 markings, 139620149 edges, 109595 markings/sec, 325 secs
lola: 36621783 markings, 141739719 edges, 109733 markings/sec, 330 secs
lola: 37170026 markings, 143859273 edges, 109649 markings/sec, 335 secs
lola: 37354072 markings, 144570692 edges, 36809 markings/sec, 340 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: unknown no yes no no yes yes yes no yes no no unknown no yes yes
lola: ========================================
FORMULA SwimmingPool-PT-08-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-08-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496565271984

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_SwimmingPool-PT-08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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

tar xzf /home/mcc/BenchKit/INPUTS/S_SwimmingPool-PT-08.tgz
mv S_SwimmingPool-PT-08 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SwimmingPool-PT-08, 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 r158-ebro-149443464100174"
echo "====================================================================="
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
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 ;