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)
.................
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is SwimmingPool-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r163-smll-152705515000269
=====================================================================

--------------------
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-09-CTLCardinality-00
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-01
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-02
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-03
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-04
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-05
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-06
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-07
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-08
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-09
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-10
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-11
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-12
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-13
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-14
FORMULA_NAME SwimmingPool-PT-09-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527076322307


BK_STOP 1527077410686

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using SwimmingPool-PT-09 as instance name.
Using SwimmingPool as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 559272, 'Memory': 5391.98, 'Tool': 'lola'}, {'Time': 559594, 'Memory': 5392.56, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola SwimmingPool-PT-09...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
SwimmingPool-PT-09: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SwimmingPool-PT-09 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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-09-CTLCardinality.task
lola: NOT(A (G (E (F ((1 <= Undress)))))) : A (G ((1 <= Bags))) : (((E (G ((Out <= Cabins))) AND A (F ((Undress <= WaitBag)))) AND E (G (((1 <= Cabins) AND (3 <= WaitBag))))) OR A (G (E (F (TRUE))))) : (A (X (A (F ((Out <= Entered))))) OR E (F (((Out <= 2) AND (Bags <= 2))))) : A (X (NOT(E (G ((Undress <= Dressed)))))) : A (G ((WaitBag <= Cabins))) : E (X (E (((3 <= Out) U (Cabins <= InBath))))) : NOT(A (G ((3 <= Bags)))) : E (G (((1 <= InBath) OR ((Dress <= Out) AND (WaitBag <= Entered) AND (WaitBag <= Dress))))) : ((A (F ((1 <= WaitBag))) AND (3 <= Out)) OR E (X ((((3 <= Undress) AND (3 <= Dress)) OR ((2 <= Undress) AND (3 <= InBath)))))) : E (((3 <= Out) U A (G ((2 <= Cabins))))) : A (G ((3 <= Cabins))) : (A (X (E (F ((Bags <= Cabins))))) OR E (X ((Cabins <= WaitBag)))) : A (G ((3 <= Bags))) : ((((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered)) OR E (F (((Bags <= 1))))) : (A (G ((((1 <= Dressed) AND (2 <= Dressed)) OR (1 <= Bags)))) OR E (X ((1 <= Undress))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((1 <= Undress))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (1 <= Undress))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 1676160 markings, 4637519 edges
lola: ========================================
lola: subprocess 1 will run for 235 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: 451 markings, 450 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((Out <= Cabins))) AND A (F ((Undress <= WaitBag)))) AND E (G (((1 <= Cabins) AND (3 <= WaitBag))))) OR A (G (E (F (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (A (F ((Out <= Entered))))) OR E (F (((Out <= 2) AND (Bags <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((Out <= Entered)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (Out <= Entered)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 501 markings, 501 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Out <= 2) AND (Bags <= 2))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 488 markings, 487 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((Undress <= Dressed))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (Dressed + 1 <= Undress)))
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 24570 markings, 36674 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((WaitBag <= 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-09-CTLCardinality-5.sara
lola: 93 markings, 92 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((3 <= Out) U (Cabins <= InBath)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((3 <= Out) U (Cabins <= InBath)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 357 markings, 356 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((3 <= Bags))))
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-09-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 443 markings, 442 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= InBath) OR ((Dress <= Out) AND (WaitBag <= Entered) AND (WaitBag <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((InBath <= 0) AND ((Out + 1 <= Dress) OR (Entered + 1 <= WaitBag) OR (Dress + 1 <= WaitBag)))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 361 markings, 360 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((1 <= WaitBag))) AND (3 <= Out)) OR E (X ((((3 <= Undress) AND (3 <= Dress)) OR ((2 <= Undress) AND (3 <= InBath))))))
lola: ========================================
lola: SUBTASK
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-5.sara.lola:
checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= WaitBag)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula: A (F ((1 <= WaitBag)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 182 markings, 181 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= Out)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Out)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 0 markings, 0 edges
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((3 <= Out) U A (G ((2 <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((3 <= Out) U NOT(E(TRUE U (Cabins <= 1))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 1252495 markings, 4662381 edges, 1996758058579001344 markings/sec, 0 secs
lola: 2466180 markings, 9231524 edges, 242737 markings/sec, 5 secs
lola: 3657718 markings, 13731333 edges, 238308 markings/sec, 10 secs
lola: 4837088 markings, 18183930 edges, 235874 markings/sec, 15 secs
lola: 6003642 markings, 22596237 edges, 233311 markings/sec, 20 secs
lola: 7111303 markings, 26786262 edges, 221532 markings/sec, 25 secs
lola: 8261251 markings, 31144199 edges, 229990 markings/sec, 30 secs
lola: 9406153 markings, 35472246 edges, 228980 markings/sec, 35 secs
lola: 10543605 markings, 39785388 edges, 227490 markings/sec, 40 secs
lola: 11678173 markings, 44081071 edges, 226914 markings/sec, 45 secs
lola: 12806325 markings, 48357193 edges, 225630 markings/sec, 50 secs
lola: 13933136 markings, 52627236 edges, 225362 markings/sec, 55 secs
lola: 15053892 markings, 56870788 edges, 224151 markings/sec, 60 secs
lola: 16174147 markings, 61118041 edges, 224051 markings/sec, 65 secs
lola: 17292248 markings, 65347880 edges, 223620 markings/sec, 70 secs
lola: 18405805 markings, 69564530 edges, 222711 markings/sec, 75 secs
lola: 19516886 markings, 73770995 edges, 222216 markings/sec, 80 secs
lola: 20626627 markings, 77974445 edges, 221948 markings/sec, 85 secs
lola: 21733890 markings, 82167562 edges, 221453 markings/sec, 90 secs
lola: 22843010 markings, 86363659 edges, 221824 markings/sec, 95 secs
lola: 23946480 markings, 90547112 edges, 220694 markings/sec, 100 secs
lola: 25052582 markings, 94727301 edges, 221220 markings/sec, 105 secs
lola: 26157128 markings, 98907226 edges, 220909 markings/sec, 110 secs
lola: 27258422 markings, 103075517 edges, 220259 markings/sec, 115 secs
lola: 28360226 markings, 107240325 edges, 220361 markings/sec, 120 secs
lola: 29460007 markings, 111400441 edges, 219956 markings/sec, 125 secs
lola: 30558735 markings, 115556842 edges, 219746 markings/sec, 130 secs
lola: 31660339 markings, 119717572 edges, 220321 markings/sec, 135 secs
lola: 32760022 markings, 123875469 edges, 219937 markings/sec, 140 secs
lola: 33858867 markings, 128029832 edges, 219769 markings/sec, 145 secs
lola: 34956034 markings, 132177033 edges, 219433 markings/sec, 150 secs
lola: 36054582 markings, 136330315 edges, 219710 markings/sec, 155 secs
lola: 37152585 markings, 140477154 edges, 219601 markings/sec, 160 secs
lola: 38252673 markings, 144635682 edges, 220018 markings/sec, 165 secs
lola: 39352228 markings, 148786543 edges, 219911 markings/sec, 170 secs
lola: 40447940 markings, 152930507 edges, 219142 markings/sec, 175 secs
lola: 41542777 markings, 157068054 edges, 218967 markings/sec, 180 secs
lola: 42641335 markings, 161219474 edges, 219712 markings/sec, 185 secs
lola: 43738858 markings, 165364006 edges, 219505 markings/sec, 190 secs
lola: 44837915 markings, 169517970 edges, 219811 markings/sec, 195 secs
lola: 45937096 markings, 173665233 edges, 219836 markings/sec, 200 secs
lola: 47033446 markings, 177801220 edges, 219270 markings/sec, 205 secs
lola: 48134119 markings, 181958870 edges, 220135 markings/sec, 210 secs
lola: 49233731 markings, 186108694 edges, 219922 markings/sec, 215 secs
lola: 50333387 markings, 190260619 edges, 219931 markings/sec, 220 secs
lola: 51434447 markings, 194415972 edges, 220212 markings/sec, 225 secs
lola: 52536204 markings, 198574407 edges, 220351 markings/sec, 230 secs
lola: 53640931 markings, 202732600 edges, 220945 markings/sec, 235 secs
lola: 54745699 markings, 206898998 edges, 220954 markings/sec, 240 secs
lola: 55854664 markings, 211074821 edges, 221793 markings/sec, 245 secs
lola: 56963076 markings, 215246996 edges, 221682 markings/sec, 250 secs
lola: 58071073 markings, 219419466 edges, 221599 markings/sec, 255 secs
lola: 59181254 markings, 223598247 edges, 222036 markings/sec, 260 secs
lola: 60292442 markings, 227770870 edges, 222238 markings/sec, 265 secs
lola: 61401965 markings, 231941072 edges, 221905 markings/sec, 270 secs
lola: 62512921 markings, 236114525 edges, 222191 markings/sec, 275 secs
lola: 63624374 markings, 240281763 edges, 222291 markings/sec, 280 secs
lola: 64737680 markings, 244454375 edges, 222661 markings/sec, 285 secs
lola: 65852148 markings, 248629075 edges, 222894 markings/sec, 290 secs
lola: 66971056 markings, 252809969 edges, 223782 markings/sec, 295 secs
lola: 68097554 markings, 257007795 edges, 225300 markings/sec, 300 secs
lola: 69225959 markings, 261210534 edges, 225681 markings/sec, 305 secs
lola: 70359336 markings, 265417610 edges, 226675 markings/sec, 310 secs
lola: 71508513 markings, 269652125 edges, 229835 markings/sec, 315 secs
lola: 72689689 markings, 273954544 edges, 236235 markings/sec, 320 secs
lola: 73509011 markings, 278794834 edges, 163864 markings/sec, 325 secs
lola: 74221815 markings, 283774110 edges, 142561 markings/sec, 330 secs
lola: 74943165 markings, 288632302 edges, 144270 markings/sec, 335 secs
lola: 75677620 markings, 293480224 edges, 146891 markings/sec, 340 secs
lola: 76421653 markings, 298318562 edges, 148807 markings/sec, 345 secs
lola: 77163330 markings, 303102432 edges, 148335 markings/sec, 350 secs
lola: 77898823 markings, 307809979 edges, 147099 markings/sec, 355 secs
lola: 78648089 markings, 312583446 edges, 149853 markings/sec, 360 secs
lola: 79398992 markings, 317350129 edges, 150181 markings/sec, 365 secs
lola: 80151965 markings, 322116772 edges, 150595 markings/sec, 370 secs
lola: 80911024 markings, 326915610 edges, 151812 markings/sec, 375 secs
lola: 81668885 markings, 331704990 edges, 151572 markings/sec, 380 secs
lola: 82427807 markings, 336500756 edges, 151784 markings/sec, 385 secs
lola: 83185829 markings, 341286595 edges, 151604 markings/sec, 390 secs
lola: 83948051 markings, 346100488 edges, 152444 markings/sec, 395 secs
lola: 84712725 markings, 350929324 edges, 152935 markings/sec, 400 secs
lola: 85481716 markings, 355785106 edges, 153798 markings/sec, 405 secs
lola: 86260159 markings, 360698851 edges, 155689 markings/sec, 410 secs
lola: 87044895 markings, 365649537 edges, 156947 markings/sec, 415 secs
lola: 87836293 markings, 370638560 edges, 158280 markings/sec, 420 secs
lola: 88631013 markings, 375640381 edges, 158944 markings/sec, 425 secs
lola: 89454641 markings, 380814937 edges, 164726 markings/sec, 430 secs
lola: 89885381 markings, 383503003 edges, 86148 markings/sec, 435 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 89885381 markings, 383503003 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 177 markings, 176 edges
lola: ========================================
lola: subprocess 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((Bags <= Cabins))))) OR E (X ((Cabins <= WaitBag))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((Bags <= Cabins)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (Bags <= Cabins)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-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: 2013663 markings, 5625548 edges, 2851541625195200512 markings/sec, 0 secs
lola: 3562846 markings, 10390278 edges, 309837 markings/sec, 5 secs
lola: 4778765 markings, 14226863 edges, 243184 markings/sec, 10 secs
lola: 5953021 markings, 17990115 edges, 234851 markings/sec, 15 secs
lola: 7083259 markings, 21653161 edges, 226048 markings/sec, 20 secs
lola: 8184111 markings, 25222962 edges, 220170 markings/sec, 25 secs
lola: 9253973 markings, 28722584 edges, 213972 markings/sec, 30 secs
lola: 10298893 markings, 32163356 edges, 208984 markings/sec, 35 secs
lola: 11315819 markings, 35530899 edges, 203385 markings/sec, 40 secs
lola: 12320763 markings, 38870015 edges, 200989 markings/sec, 45 secs
lola: 13317512 markings, 42184918 edges, 199350 markings/sec, 50 secs
lola: 14284172 markings, 45433732 edges, 193332 markings/sec, 55 secs
lola: 15242577 markings, 48657865 edges, 191681 markings/sec, 60 secs
lola: 16195309 markings, 51859933 edges, 190546 markings/sec, 65 secs
lola: 17130672 markings, 55011748 edges, 187073 markings/sec, 70 secs
lola: 18059721 markings, 58149115 edges, 185810 markings/sec, 75 secs
lola: 18986957 markings, 61277471 edges, 185447 markings/sec, 80 secs
lola: 19892671 markings, 64363525 edges, 181143 markings/sec, 85 secs
lola: 20799821 markings, 67437297 edges, 181430 markings/sec, 90 secs
lola: 21702057 markings, 70501012 edges, 180447 markings/sec, 95 secs
lola: 22590349 markings, 73535709 edges, 177658 markings/sec, 100 secs
lola: 23475098 markings, 76562426 edges, 176950 markings/sec, 105 secs
lola: 24352453 markings, 79567458 edges, 175471 markings/sec, 110 secs
lola: 25219005 markings, 82552960 edges, 173310 markings/sec, 115 secs
lola: 26087491 markings, 85529592 edges, 173697 markings/sec, 120 secs
lola: 26942145 markings, 88474977 edges, 170931 markings/sec, 125 secs
lola: 27787291 markings, 91397807 edges, 169029 markings/sec, 130 secs
lola: 28624851 markings, 94302955 edges, 167512 markings/sec, 135 secs
lola: 29464861 markings, 97209244 edges, 168002 markings/sec, 140 secs
lola: 30297138 markings, 100088965 edges, 166455 markings/sec, 145 secs
lola: 31118460 markings, 102938584 edges, 164264 markings/sec, 150 secs
lola: 31944790 markings, 105793746 edges, 165266 markings/sec, 155 secs
lola: 32764871 markings, 108630298 edges, 164016 markings/sec, 160 secs
lola: 33586512 markings, 111473076 edges, 164328 markings/sec, 165 secs
lola: 34402833 markings, 114299913 edges, 163264 markings/sec, 170 secs
lola: 35212968 markings, 117115667 edges, 162027 markings/sec, 175 secs
lola: 36015630 markings, 119905881 edges, 160532 markings/sec, 180 secs
lola: 36814170 markings, 122681593 edges, 159708 markings/sec, 185 secs
lola: 37612325 markings, 125455115 edges, 159631 markings/sec, 190 secs
lola: 38398620 markings, 128205219 edges, 157259 markings/sec, 195 secs
lola: 39193364 markings, 130971958 edges, 158949 markings/sec, 200 secs
lola: 39987737 markings, 133731639 edges, 158875 markings/sec, 205 secs
lola: 40769599 markings, 136463006 edges, 156372 markings/sec, 210 secs
lola: 41547866 markings, 139188263 edges, 155653 markings/sec, 215 secs
lola: 42329592 markings, 141912631 edges, 156345 markings/sec, 220 secs
lola: 43114140 markings, 144637777 edges, 156910 markings/sec, 225 secs
lola: 43884044 markings, 147330759 edges, 153981 markings/sec, 230 secs
lola: 44660010 markings, 150035797 edges, 155193 markings/sec, 235 secs
lola: 45428884 markings, 152727123 edges, 153775 markings/sec, 240 secs
lola: 46192081 markings, 155405742 edges, 152639 markings/sec, 245 secs
lola: 46959691 markings, 158097365 edges, 153522 markings/sec, 250 secs
lola: 47725959 markings, 160785399 edges, 153254 markings/sec, 255 secs
lola: 48492359 markings, 163466761 edges, 153280 markings/sec, 260 secs
lola: 49257319 markings, 166138479 edges, 152992 markings/sec, 265 secs
lola: 50011130 markings, 168783392 edges, 150762 markings/sec, 270 secs
lola: 50771200 markings, 171444232 edges, 152014 markings/sec, 275 secs
lola: 51520093 markings, 174084410 edges, 149779 markings/sec, 280 secs
lola: 52277731 markings, 176737325 edges, 151528 markings/sec, 285 secs
lola: 53028691 markings, 179375377 edges, 150192 markings/sec, 290 secs
lola: 53776769 markings, 182003563 edges, 149616 markings/sec, 295 secs
lola: 54527968 markings, 184634954 edges, 150240 markings/sec, 300 secs
lola: 55269952 markings, 187246684 edges, 148397 markings/sec, 305 secs
lola: 56016179 markings, 189865731 edges, 149245 markings/sec, 310 secs
lola: 56750761 markings, 192459526 edges, 146916 markings/sec, 315 secs
lola: 57488037 markings, 195058161 edges, 147455 markings/sec, 320 secs
lola: 58222870 markings, 197640012 edges, 146967 markings/sec, 325 secs
lola: 58955003 markings, 200219190 edges, 146427 markings/sec, 330 secs
lola: 59692392 markings, 202816686 edges, 147478 markings/sec, 335 secs
lola: 60420017 markings, 205389936 edges, 145525 markings/sec, 340 secs
lola: 61156806 markings, 207985486 edges, 147358 markings/sec, 345 secs
lola: 61876336 markings, 210526914 edges, 143906 markings/sec, 350 secs
lola: 62554884 markings, 212924276 edges, 135710 markings/sec, 355 secs
lola: 63222485 markings, 215295295 edges, 133520 markings/sec, 360 secs
lola: 63898368 markings, 217698127 edges, 135177 markings/sec, 365 secs
lola: 64571075 markings, 220089492 edges, 134541 markings/sec, 370 secs
lola: 65245291 markings, 222487515 edges, 134843 markings/sec, 375 secs
lola: 65923370 markings, 224890720 edges, 135616 markings/sec, 380 secs
lola: 66601060 markings, 227300320 edges, 135538 markings/sec, 385 secs
lola: 67265466 markings, 229674803 edges, 132881 markings/sec, 390 secs
lola: 67940076 markings, 232072829 edges, 134922 markings/sec, 395 secs
lola: 68613304 markings, 234468993 edges, 134646 markings/sec, 400 secs
lola: 69297407 markings, 236896025 edges, 136821 markings/sec, 405 secs
lola: 69981366 markings, 239317263 edges, 136792 markings/sec, 410 secs
lola: 70756380 markings, 242067688 edges, 155003 markings/sec, 415 secs
lola: 71607188 markings, 245089512 edges, 170162 markings/sec, 420 secs
lola: 72459059 markings, 248113373 edges, 170374 markings/sec, 425 secs
lola: 73306452 markings, 251116781 edges, 169479 markings/sec, 430 secs
lola: 74145130 markings, 254113816 edges, 167736 markings/sec, 435 secs
lola: 74992357 markings, 257126000 edges, 169445 markings/sec, 440 secs
lola: 75820244 markings, 260093271 edges, 165577 markings/sec, 445 secs
lola: 76665068 markings, 263098587 edges, 168965 markings/sec, 450 secs
lola: 77502522 markings, 266078620 edges, 167491 markings/sec, 455 secs
lola: 78343715 markings, 269070268 edges, 168239 markings/sec, 460 secs
lola: 79178606 markings, 272044058 edges, 166978 markings/sec, 465 secs
lola: 80012955 markings, 275022400 edges, 166870 markings/sec, 470 secs
lola: 80842508 markings, 277984939 edges, 165911 markings/sec, 475 secs
lola: 81670601 markings, 280944735 edges, 165619 markings/sec, 480 secs
lola: 82513497 markings, 283940614 edges, 168579 markings/sec, 485 secs
lola: 83345425 markings, 286901420 edges, 166386 markings/sec, 490 secs
lola: 84178006 markings, 289874375 edges, 166516 markings/sec, 495 secs
lola: 85003099 markings, 292826558 edges, 165019 markings/sec, 500 secs
lola: 85828017 markings, 295777057 edges, 164984 markings/sec, 505 secs
lola: 86649744 markings, 298719913 edges, 164345 markings/sec, 510 secs
lola: 87484932 markings, 301690635 edges, 167038 markings/sec, 515 secs
lola: 88310729 markings, 304646839 edges, 165159 markings/sec, 520 secs
lola: 89141285 markings, 307616420 edges, 166111 markings/sec, 525 secs
lola: 89967599 markings, 310578069 edges, 165263 markings/sec, 530 secs
lola: 90314587 markings, 311817310 edges, 69398 markings/sec, 535 secs
lola: 90321429 markings, 311842041 edges, 1368 markings/sec, 540 secs
lola: 90322703 markings, 311846747 edges, 255 markings/sec, 545 secs
lola: 90326063 markings, 311858231 edges, 672 markings/sec, 550 secs
lola: 90326123 markings, 311858456 edges, 12 markings/sec, 555 secs
lola: 90327346 markings, 311862661 edges, 245 markings/sec, 560 secs
lola: 90330184 markings, 311872602 edges, 568 markings/sec, 565 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 832 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= 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: 443 markings, 442 edges
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered)) OR E (F (((Bags <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((Out <= 2) OR (Cabins + 1 <= Dressed) OR (Out <= WaitBag)) AND (3 <= Entered))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-CTLCardinality.task
lola: processed formula with 4 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Bags <= 1))))
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-09-CTLCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 447 markings, 446 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((((1 <= Dressed) AND (2 <= Dressed)) OR (1 <= Bags)))) OR E (X ((1 <= Undress))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= Dressed) AND (2 <= Dressed)) OR (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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 451 markings, 450 edges
lola: ========================================
sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes no yes no no unknown no yes unknown
FORMULA SwimmingPool-PT-09-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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="SwimmingPool-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/SwimmingPool-PT-09.tgz
mv SwimmingPool-PT-09 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is SwimmingPool-PT-09, 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 r163-smll-152705515000269"
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 ;