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 mcc4mcc-full
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 r166-smll-152705517000269
=====================================================================

--------------------
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 1527109759346


BK_STOP 1527110817335

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SwimmingPool-PT-09...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
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: state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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 392 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 443 markings, 442 edges
lola: sara: try reading problem file SwimmingPool-PT-09-CTLCardinality-5.sara.
state equation: write sara problem file to SwimmingPool-PT-09-CTLCardinality-7.sara
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
lola: checking a Boolean combination of formulassara:
place or transition ordering is non-deterministic
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
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: 1244763 markings, 4633568 edges, 1996758058579001344 markings/sec, 0 secs
lola: 2444500 markings, 9149419 edges, 239947 markings/sec, 5 secs
lola: 3623327 markings, 13600670 edges, 235765 markings/sec, 10 secs
lola: 4788033 markings, 17997215 edges, 232941 markings/sec, 15 secs
lola: 5943322 markings, 22367503 edges, 231058 markings/sec, 20 secs
lola: 7085377 markings, 26687410 edges, 228411 markings/sec, 25 secs
lola: 8222713 markings, 30997863 edges, 227467 markings/sec, 30 secs
lola: 9354892 markings, 35279131 edges, 226436 markings/sec, 35 secs
lola: 10479554 markings, 39544670 edges, 224932 markings/sec, 40 secs
lola: 11602712 markings, 43795558 edges, 224632 markings/sec, 45 secs
lola: 12717415 markings, 48019758 edges, 222941 markings/sec, 50 secs
lola: 13831485 markings, 52242517 edges, 222814 markings/sec, 55 secs
lola: 14933914 markings, 56416784 edges, 220486 markings/sec, 60 secs
lola: 16015269 markings, 60513375 edges, 216271 markings/sec, 65 secs
lola: 17004042 markings, 64258162 edges, 197755 markings/sec, 70 secs
lola: 18066951 markings, 68276118 edges, 212582 markings/sec, 75 secs
lola: 19131840 markings, 72313674 edges, 212978 markings/sec, 80 secs
lola: 20201368 markings, 76364080 edges, 213906 markings/sec, 85 secs
lola: 21271541 markings, 80418048 edges, 214035 markings/sec, 90 secs
lola: 22345934 markings, 84482262 edges, 214879 markings/sec, 95 secs
lola: 23417304 markings, 88542699 edges, 214274 markings/sec, 100 secs
lola: 24490759 markings, 92602580 edges, 214691 markings/sec, 105 secs
lola: 25564908 markings, 96665242 edges, 214830 markings/sec, 110 secs
lola: 26641415 markings, 100739134 edges, 215301 markings/sec, 115 secs
lola: 27713097 markings, 104793886 edges, 214336 markings/sec, 120 secs
lola: 28786492 markings, 108856405 edges, 214679 markings/sec, 125 secs
lola: 29863979 markings, 112926249 edges, 215497 markings/sec, 130 secs
lola: 30936127 markings, 116986270 edges, 214430 markings/sec, 135 secs
lola: 32016691 markings, 121066705 edges, 216113 markings/sec, 140 secs
lola: 33095732 markings, 125142595 edges, 215808 markings/sec, 145 secs
lola: 34172674 markings, 129218431 edges, 215388 markings/sec, 150 secs
lola: 35247653 markings, 133282169 edges, 214996 markings/sec, 155 secs
lola: 36313617 markings, 137309525 edges, 213193 markings/sec, 160 secs
lola: 37394760 markings, 141390521 edges, 216229 markings/sec, 165 secs
lola: 38474126 markings, 145473144 edges, 215873 markings/sec, 170 secs
lola: 39554587 markings, 149554288 edges, 216092 markings/sec, 175 secs
lola: 40636137 markings, 153641811 edges, 216310 markings/sec, 180 secs
lola: 41668510 markings, 157544574 edges, 206475 markings/sec, 185 secs
lola: 42727681 markings, 161544897 edges, 211834 markings/sec, 190 secs
lola: 43791889 markings, 165565361 edges, 212842 markings/sec, 195 secs
lola: 44876965 markings, 169666733 edges, 217015 markings/sec, 200 secs
lola: 45962942 markings, 173763166 edges, 217195 markings/sec, 205 secs
lola: 47048894 markings, 177859819 edges, 217190 markings/sec, 210 secs
lola: 48115869 markings, 181889846 edges, 213395 markings/sec, 215 secs
lola: 49204497 markings, 185997526 edges, 217726 markings/sec, 220 secs
lola: 50293561 markings, 190109505 edges, 217813 markings/sec, 225 secs
lola: 51369415 markings, 194172169 edges, 215171 markings/sec, 230 secs
lola: 52447493 markings, 198239690 edges, 215616 markings/sec, 235 secs
lola: 53527752 markings, 202307964 edges, 216052 markings/sec, 240 secs
lola: 54606625 markings, 206375291 edges, 215775 markings/sec, 245 secs
lola: 55685564 markings, 210442602 edges, 215788 markings/sec, 250 secs
lola: 56768065 markings, 214516027 edges, 216500 markings/sec, 255 secs
lola: 57852268 markings, 218596366 edges, 216841 markings/sec, 260 secs
lola: 58935000 markings, 222670624 edges, 216546 markings/sec, 265 secs
lola: 60016741 markings, 226740777 edges, 216348 markings/sec, 270 secs
lola: 61104596 markings, 230823439 edges, 217571 markings/sec, 275 secs
lola: 62096744 markings, 234550428 edges, 198430 markings/sec, 280 secs
lola: 63164861 markings, 238562088 edges, 213623 markings/sec, 285 secs
lola: 64243375 markings, 242608629 edges, 215703 markings/sec, 290 secs
lola: 65332918 markings, 246682868 edges, 217909 markings/sec, 295 secs
lola: 66425051 markings, 250767610 edges, 218427 markings/sec, 300 secs
lola: 67529650 markings, 254893574 edges, 220920 markings/sec, 305 secs
lola: 68636186 markings, 259018472 edges, 221307 markings/sec, 310 secs
lola: 69756554 markings, 263181229 edges, 224074 markings/sec, 315 secs
lola: 70887820 markings, 267369037 edges, 226253 markings/sec, 320 secs
lola: 72036748 markings, 271587032 edges, 229786 markings/sec, 325 secs
lola: 73161704 markings, 276089960 edges, 224991 markings/sec, 330 secs
lola: 73803916 markings, 280898368 edges, 128442 markings/sec, 335 secs
lola: 74490798 markings, 285597862 edges, 137376 markings/sec, 340 secs
lola: 75166205 markings, 290104110 edges, 135081 markings/sec, 345 secs
lola: 75783735 markings, 294177303 edges, 123506 markings/sec, 350 secs
lola: 76389185 markings, 298107582 edges, 121090 markings/sec, 355 secs
lola: 76993001 markings, 302006262 edges, 120763 markings/sec, 360 secs
lola: 77598590 markings, 305892599 edges, 121118 markings/sec, 365 secs
lola: 78206243 markings, 309771444 edges, 121531 markings/sec, 370 secs
lola: 78817262 markings, 313660095 edges, 122204 markings/sec, 375 secs
lola: 79428291 markings, 317536249 edges, 122206 markings/sec, 380 secs
lola: 80029715 markings, 321343622 edges, 120285 markings/sec, 385 secs
lola: 80725132 markings, 325741658 edges, 139083 markings/sec, 390 secs
lola: 81466068 markings, 330423448 edges, 148187 markings/sec, 395 secs
lola: 82200324 markings, 335062605 edges, 146851 markings/sec, 400 secs
lola: 82930008 markings, 339670960 edges, 145937 markings/sec, 405 secs
lola: 83657126 markings, 344263386 edges, 145424 markings/sec, 410 secs
lola: 84379799 markings, 348826815 edges, 144535 markings/sec, 415 secs
lola: 85100557 markings, 353378904 edges, 144152 markings/sec, 420 secs
lola: 85814295 markings, 357884600 edges, 142748 markings/sec, 425 secs
lola: 86481619 markings, 362096925 edges, 133465 markings/sec, 430 secs
lola: 87136514 markings, 366227745 edges, 130979 markings/sec, 435 secs
lola: 87799315 markings, 370405700 edges, 132560 markings/sec, 440 secs
lola: 88474467 markings, 374655729 edges, 135030 markings/sec, 445 secs
lola: 89176189 markings, 379067950 edges, 140344 markings/sec, 450 secs
lola: 89885381 markings, 383503003 edges, 141838 markings/sec, 455 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 614 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 768 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 768 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: 1875754 markings, 5212511 edges, 2851541625195200512 markings/sec, 0 secs
lola: 3270636 markings, 9475168 edges, 278976 markings/sec, 5 secs
lola: 4676073 markings, 13901403 edges, 281087 markings/sec, 10 secs
lola: 6007991 markings, 18170147 edges, 266384 markings/sec, 15 secs
lola: 7275549 markings, 22273559 edges, 253512 markings/sec, 20 secs
lola: 8513604 markings, 26295801 edges, 247611 markings/sec, 25 secs
lola: 9719918 markings, 30259697 edges, 241263 markings/sec, 30 secs
lola: 10899300 markings, 34149052 edges, 235876 markings/sec, 35 secs
lola: 12040505 markings, 37938600 edges, 228241 markings/sec, 40 secs
lola: 13186250 markings, 41748676 edges, 229149 markings/sec, 45 secs
lola: 14306711 markings, 45509329 edges, 224092 markings/sec, 50 secs
lola: 15408703 markings, 49218487 edges, 220398 markings/sec, 55 secs
lola: 16497339 markings, 52864157 edges, 217727 markings/sec, 60 secs
lola: 17548591 markings, 56424914 edges, 210250 markings/sec, 65 secs
lola: 18590575 markings, 59941485 edges, 208397 markings/sec, 70 secs
lola: 19616629 markings, 63413670 edges, 205211 markings/sec, 75 secs
lola: 20621817 markings, 66836154 edges, 201038 markings/sec, 80 secs
lola: 21624745 markings, 70240115 edges, 200586 markings/sec, 85 secs
lola: 22609747 markings, 73601594 edges, 197000 markings/sec, 90 secs
lola: 23583321 markings, 76932198 edges, 194715 markings/sec, 95 secs
lola: 24549458 markings, 80247632 edges, 193227 markings/sec, 100 secs
lola: 25521327 markings, 83579078 edges, 194374 markings/sec, 105 secs
lola: 26485686 markings, 86897263 edges, 192872 markings/sec, 110 secs
lola: 27446248 markings, 90216988 edges, 192112 markings/sec, 115 secs
lola: 28399079 markings, 93520748 edges, 190566 markings/sec, 120 secs
lola: 29362758 markings, 96850549 edges, 192736 markings/sec, 125 secs
lola: 30318578 markings, 100162420 edges, 191164 markings/sec, 130 secs
lola: 31265330 markings, 103450922 edges, 189350 markings/sec, 135 secs
lola: 32226727 markings, 106766870 edges, 192279 markings/sec, 140 secs
lola: 33179293 markings, 110063846 edges, 190513 markings/sec, 145 secs
lola: 34135216 markings, 113372195 edges, 191185 markings/sec, 150 secs
lola: 35083908 markings, 116671567 edges, 189738 markings/sec, 155 secs
lola: 36011494 markings, 119890916 edges, 185517 markings/sec, 160 secs
lola: 36915696 markings, 123034284 edges, 180840 markings/sec, 165 secs
lola: 37814258 markings, 126162901 edges, 179712 markings/sec, 170 secs
lola: 38710643 markings, 129293996 edges, 179277 markings/sec, 175 secs
lola: 39615306 markings, 132437365 edges, 180933 markings/sec, 180 secs
lola: 40515117 markings, 135575351 edges, 179962 markings/sec, 185 secs
lola: 41403992 markings, 138688392 edges, 177775 markings/sec, 190 secs
lola: 42300030 markings, 141809934 edges, 179208 markings/sec, 195 secs
lola: 43199563 markings, 144938510 edges, 179907 markings/sec, 200 secs
lola: 44087932 markings, 148038504 edges, 177674 markings/sec, 205 secs
lola: 44981537 markings, 151159844 edges, 178721 markings/sec, 210 secs
lola: 45867045 markings, 154259355 edges, 177102 markings/sec, 215 secs
lola: 46748093 markings, 157354440 edges, 176210 markings/sec, 220 secs
lola: 47633234 markings, 160460476 edges, 177028 markings/sec, 225 secs
lola: 48522731 markings, 163572632 edges, 177899 markings/sec, 230 secs
lola: 49408174 markings, 166666080 edges, 177089 markings/sec, 235 secs
lola: 50283090 markings, 169736428 edges, 174983 markings/sec, 240 secs
lola: 51164193 markings, 172828148 edges, 176221 markings/sec, 245 secs
lola: 52036050 markings, 175893554 edges, 174371 markings/sec, 250 secs
lola: 52908671 markings, 178957024 edges, 174524 markings/sec, 255 secs
lola: 53776821 markings, 182003756 edges, 173630 markings/sec, 260 secs
lola: 54639936 markings, 185030438 edges, 172623 markings/sec, 265 secs
lola: 55496524 markings, 188035323 edges, 171318 markings/sec, 270 secs
lola: 56338591 markings, 191006214 edges, 168413 markings/sec, 275 secs
lola: 57175487 markings, 193961506 edges, 167379 markings/sec, 280 secs
lola: 58012707 markings, 196900860 edges, 167444 markings/sec, 285 secs
lola: 58842294 markings, 199819570 edges, 165917 markings/sec, 290 secs
lola: 59671865 markings, 202746122 edges, 165914 markings/sec, 295 secs
lola: 60491579 markings, 205642591 edges, 163943 markings/sec, 300 secs
lola: 61310262 markings, 208532349 edges, 163737 markings/sec, 305 secs
lola: 62125416 markings, 211408825 edges, 163031 markings/sec, 310 secs
lola: 62931536 markings, 214259635 edges, 161224 markings/sec, 315 secs
lola: 63734105 markings, 217115142 edges, 160514 markings/sec, 320 secs
lola: 64537518 markings, 219968845 edges, 160683 markings/sec, 325 secs
lola: 65343314 markings, 222831552 edges, 161159 markings/sec, 330 secs
lola: 66148309 markings, 225687245 edges, 160999 markings/sec, 335 secs
lola: 66945631 markings, 228530084 edges, 159464 markings/sec, 340 secs
lola: 67738883 markings, 231359569 edges, 158650 markings/sec, 345 secs
lola: 68537092 markings, 234197011 edges, 159642 markings/sec, 350 secs
lola: 69343389 markings, 237056288 edges, 161259 markings/sec, 355 secs
lola: 70147353 markings, 239902890 edges, 160793 markings/sec, 360 secs
lola: 70951467 markings, 242761676 edges, 160823 markings/sec, 365 secs
lola: 71755981 markings, 245616584 edges, 160903 markings/sec, 370 secs
lola: 72561477 markings, 248474447 edges, 161099 markings/sec, 375 secs
lola: 73361017 markings, 251313859 edges, 159908 markings/sec, 380 secs
lola: 74156262 markings, 254153630 edges, 159049 markings/sec, 385 secs
lola: 74958350 markings, 257006651 edges, 160418 markings/sec, 390 secs
lola: 75742951 markings, 259817350 edges, 156920 markings/sec, 395 secs
lola: 76541372 markings, 262662845 edges, 159684 markings/sec, 400 secs
lola: 77335970 markings, 265489342 edges, 158920 markings/sec, 405 secs
lola: 78136400 markings, 268334025 edges, 160086 markings/sec, 410 secs
lola: 78939087 markings, 271188645 edges, 160537 markings/sec, 415 secs
lola: 79728682 markings, 274012535 edges, 157919 markings/sec, 420 secs
lola: 80522683 markings, 276843744 edges, 158800 markings/sec, 425 secs
lola: 81316078 markings, 279672921 edges, 158679 markings/sec, 430 secs
lola: 82104932 markings, 282492640 edges, 157771 markings/sec, 435 secs
lola: 82907709 markings, 285340635 edges, 160555 markings/sec, 440 secs
lola: 83697847 markings, 288162069 edges, 158028 markings/sec, 445 secs
lola: 84483383 markings, 290971270 edges, 157107 markings/sec, 450 secs
lola: 85269505 markings, 293781764 edges, 157224 markings/sec, 455 secs
lola: 86052462 markings, 296579397 edges, 156591 markings/sec, 460 secs
lola: 86832027 markings, 299367767 edges, 155913 markings/sec, 465 secs
lola: 87610958 markings, 302139030 edges, 155786 markings/sec, 470 secs
lola: 88363602 markings, 304836747 edges, 150529 markings/sec, 475 secs
lola: 89171472 markings, 307726123 edges, 161574 markings/sec, 480 secs
lola: 89960530 markings, 310552350 edges, 157812 markings/sec, 485 secs
lola: 90315037 markings, 311818862 edges, 70901 markings/sec, 490 secs
lola: 90321561 markings, 311842504 edges, 1305 markings/sec, 495 secs
lola: 90324889 markings, 311854097 edges, 666 markings/sec, 500 secs
lola: 90327167 markings, 311862026 edges, 456 markings/sec, 505 secs
lola: 90329100 markings, 311869007 edges, 387 markings/sec, 510 secs
lola: 90329111 markings, 311869053 edges, 2 markings/sec, 515 secs
lola: 90330518 markings, 311873769 edges, 281 markings/sec, 520 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 842 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: ========================================
lola: subprocess 14 will run for 1264 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: subprocess 14 will run for 1264 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 2528 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 447 markings, 446 edges
lola: ========================================
lola: SUBRESULT
lola: lola: result: yes
state equation: calling and running sara
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2528 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 2528 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: state equation: calling and running 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-15.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 stderr -----
----- Finished stdout -----

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="mcc4mcc-full"
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 mcc4mcc-full"
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 r166-smll-152705517000269"
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 ;