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 240K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 70K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is DES-PT-30a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r054-smll-152646382300241
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526500883538


BK_STOP 1526501673223

--------------------
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 DES-PT-30a as instance name.
Using DES 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': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3539338, 'Memory': 8428.68, 'Tool': 'lola'}, {'Time': 3540182, 'Memory': 8447.92, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-30a...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DES-PT-30a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-30a @ 3540 seconds
make: [verify] Error 2 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 425/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 234 places, 191 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 216 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-30a-CTLCardinality.task
lola: ((((p171 <= p184) AND (p113 <= p103)) AND (E (G ((p116 <= p138))) OR (1 <= p98))) OR (p55 + 1 <= p54)) : E (F (((p138 <= p43) AND (3 <= p228) AND ((1 <= p44) OR (p96 <= p183)) AND (((1 <= p56) AND (p67 <= p200)) OR (1 <= p17))))) : ((E (F ((p76 + 1 <= p84))) AND (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))) AND (A (X ((p35 <= p60))) AND (p22 <= p120))) : E (X (A (F (((3 <= p87) AND (3 <= p155)))))) : E (G ((p65 <= p141))) : (((2 <= p145) AND E (X (((3 <= p131) AND (1 <= p169))))) OR NOT(E (G (((1 <= p117) OR (p112 <= p22)))))) : E (G (((p174 + 1 <= p172) OR (p94 <= 0)))) : E (F ((1 <= p160))) : A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195)))) : A (F (A (((3 <= p187) U (2 <= p203))))) : E (G ((((1 <= p231) OR (p32 <= p217) OR (p158 <= 0)) AND A (F ((p221 <= p46)))))) : A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67))))) : NOT(((A (F ((p185 <= p32))) AND E (G ((p156 <= p181)))) OR A (X (((3 <= p61) AND (p178 <= p181)))))) : (A (F (((p20 <= p205) AND (2 <= p59) AND (2 <= p166)))) AND (E (G ((p42 <= p206))) OR ((2 <= p37) AND E (F ((p95 <= p174)))))) : NOT(A (G ((p45 <= p48)))) : ((((p233 <= 2) AND (p76 + 1 <= p69) AND (1 <= p154)) OR NOT(A (F ((3 <= p17))))) AND (((1 <= p162) AND (3 <= p195)) OR A (X ((p42 <= p171)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p171 <= p184) AND (p113 <= p103)) AND (E (G ((p116 <= p138))) OR (1 <= p98))) OR (p55 + 1 <= p54))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p171 <= p184) AND (p113 <= p103))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p171 <= p184) AND (p113 <= p103))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p116 <= p138)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p138 + 1 <= p116)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 114 markings, 229 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p138 <= p43) AND (3 <= p228) AND ((1 <= p44) OR (p96 <= p183)) AND (((1 <= p56) AND (p67 <= p200)) OR (1 <= p17)))))
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 17 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 18 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-30a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-30a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p76 + 1 <= p84))) AND (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))) AND (A (X ((p35 <= p60))) AND (p22 <= p120)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p76 + 1 <= p84)))
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 17 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 DES-PT-30a-CTLCardinality-2.sara
lola: lola: SUBRESULT
state equation: calling and running sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 141 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p63) AND (p84 <= p197)) OR (2 <= p179) OR (p122 <= 1))
lola: processed formula length: 64
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 4 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: ========================================
sara: try reading problem file DES-PT-30a-CTLCardinality-2.sara.
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p35 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p35 <= p60)))
lola: processed formula: A (X ((p35 <= p60)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p22 <= p120)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p120)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((3 <= p87) AND (3 <= p155))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((3 <= p87) AND (3 <= p155))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: 44 markings, 43 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p65 <= p141)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p141 + 1 <= p65)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p145) AND E (X (((3 <= p131) AND (1 <= p169))))) OR NOT(E (G (((1 <= p117) OR (p112 <= p22))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p145)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p145)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: processed formula with 1 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: processed formula: A (F (((p117 <= 0) AND (p22 + 1 <= p112))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 16 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p174 + 1 <= p172) OR (p94 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p172 <= p174) AND (1 <= p94))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 45 markings, 44 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p160)))
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 17 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
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to DES-PT-30a-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: lola: produced by: state space
state equation: calling and running sara
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: processed formula: A ((((p87 <= p205) OR (p12 <= p40) OR (2 <= p143)) U ((p215 <= 2) AND (p18 + 1 <= p195))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: sara: try reading problem file DES-PT-30a-CTLCardinality-7.sara.
the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 15 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((3 <= p187) U (2 <= p203)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((3 <= p187) U (2 <= p203)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 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: 45 markings, 89 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((1 <= p231) OR (p32 <= p217) OR (p158 <= 0)) AND A (F ((p221 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p231 <= 0) AND (p217 + 1 <= p32) AND (1 <= p158)) OR NOT(A(TRUE U (p221 <= p46))))))
lola: processed formula length: 100
lola: 4 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).

lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 126 markings, 216 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: processed formula: A (X ((A (G ((p81 <= p152))) OR (((3 <= p69) OR (2 <= p201)) AND (2 <= p67)))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 234 places; total mentions: 0
lola: closed formula file DES-PT-30a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 14 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
sara: place or transition ordering is non-deterministic

lola: 612222 markings, 4432964 edges, 122444 markings/sec, 0 secs
lola: 1151948 markings, 8857464 edges, 107945 markings/sec, 5 secs
lola: 1638694 markings, 13214053 edges, 97349 markings/sec, 10 secs
lola: 2076398 markings, 17638182 edges, 87541 markings/sec, 15 secs
lola: 2556395 markings, 21997543 edges, 95999 markings/sec, 20 secs
lola: 3074365 markings, 26410164 edges, 103594 markings/sec, 25 secs
lola: 3628619 markings, 30795311 edges, 110851 markings/sec, 30 secs
lola: 4104433 markings, 34919073 edges, 95163 markings/sec, 35 secs
lola: 4603714 markings, 38837002 edges, 99856 markings/sec, 40 secs
lola: 5132678 markings, 43159030 edges, 105793 markings/sec, 45 secs
lola: 5602328 markings, 47424065 edges, 93930 markings/sec, 50 secs
lola: 6053613 markings, 51756021 edges, 90257 markings/sec, 55 secs
lola: 6468032 markings, 55990488 edges, 82884 markings/sec, 60 secs
lola: 6864943 markings, 60459259 edges, 79382 markings/sec, 65 secs
lola: 7295164 markings, 64676428 edges, 86044 markings/sec, 70 secs
lola: 7747451 markings, 68942657 edges, 90457 markings/sec, 75 secs
lola: 8224090 markings, 73154048 edges, 95328 markings/sec, 80 secs
lola: 8637264 markings, 77133699 edges, 82635 markings/sec, 85 secs
lola: 9054787 markings, 80901540 edges, 83505 markings/sec, 90 secs
lola: 9530736 markings, 84867602 edges, 95190 markings/sec, 95 secs
lola: 10071159 markings, 89328803 edges, 108085 markings/sec, 100 secs
lola: 10465188 markings, 93873000 edges, 78806 markings/sec, 105 secs
lola: 10920615 markings, 98182094 edges, 91085 markings/sec, 110 secs
lola: 11261066 markings, 102637752 edges, 68090 markings/sec, 115 secs
lola: 11639552 markings, 107014025 edges, 75697 markings/sec, 120 secs
lola: 12063519 markings, 111472029 edges, 84793 markings/sec, 125 secs
lola: 12541708 markings, 115838869 edges, 95638 markings/sec, 130 secs
lola: 13009234 markings, 120152250 edges, 93505 markings/sec, 135 secs
lola: 13401671 markings, 124205720 edges, 78487 markings/sec, 140 secs
lola: 13812356 markings, 128091350 edges, 82137 markings/sec, 145 secs
lola: 14307941 markings, 132350693 edges, 99117 markings/sec, 150 secs
lola: 14733098 markings, 136708849 edges, 85031 markings/sec, 155 secs
lola: 15059153 markings, 141217265 edges, 65211 markings/sec, 160 secs
lola: 15501452 markings, 145557877 edges, 88460 markings/sec, 165 secs
lola: 15938402 markings, 149902877 edges, 87390 markings/sec, 170 secs
lola: 16306286 markings, 154383613 edges, 73577 markings/sec, 175 secs
lola: 16715068 markings, 158646614 edges, 81756 markings/sec, 180 secs
lola: 17020253 markings, 163028271 edges, 61037 markings/sec, 185 secs
lola: 17365200 markings, 167419584 edges, 68989 markings/sec, 190 secs
lola: 17738322 markings, 171631716 edges, 74624 markings/sec, 195 secs
lola: 18108185 markings, 175802928 edges, 73973 markings/sec, 200 secs
lola: 18558815 markings, 180289005 edges, 90126 markings/sec, 205 secs
lola: 18940309 markings, 184283747 edges, 76299 markings/sec, 210 secs
lola: 19285229 markings, 188160381 edges, 68984 markings/sec, 215 secs
lola: 19662282 markings, 192003913 edges, 75411 markings/sec, 220 secs
lola: 20094600 markings, 196196269 edges, 86464 markings/sec, 225 secs
lola: 20486352 markings, 200364951 edges, 78350 markings/sec, 230 secs
lola: 20794897 markings, 204963707 edges, 61709 markings/sec, 235 secs
lola: 21204760 markings, 209226596 edges, 81973 markings/sec, 240 secs
lola: 21785699 markings, 213647003 edges, 116188 markings/sec, 245 secs
lola: 22251892 markings, 218107288 edges, 93239 markings/sec, 250 secs
lola: 22769383 markings, 222558641 edges, 103498 markings/sec, 255 secs
lola: 23315174 markings, 226750093 edges, 109158 markings/sec, 260 secs
lola: 23798380 markings, 230888254 edges, 96641 markings/sec, 265 secs
lola: 24318903 markings, 235146308 edges, 104105 markings/sec, 270 secs
lola: 24746772 markings, 239353857 edges, 85574 markings/sec, 275 secs
lola: 25177342 markings, 243798814 edges, 86114 markings/sec, 280 secs
lola: 25637530 markings, 247983700 edges, 92038 markings/sec, 285 secs
lola: 26038170 markings, 252323590 edges, 80128 markings/sec, 290 secs
lola: 26459257 markings, 256753106 edges, 84217 markings/sec, 295 secs
lola: 26960511 markings, 261030621 edges, 100251 markings/sec, 300 secs
lola: 27434914 markings, 265283568 edges, 94881 markings/sec, 305 secs
lola: 27838737 markings, 269590747 edges, 80765 markings/sec, 310 secs
lola: 28225089 markings, 273915621 edges, 77270 markings/sec, 315 secs
lola: 28635729 markings, 277995886 edges, 82128 markings/sec, 320 secs
lola: 29004111 markings, 282355121 edges, 73676 markings/sec, 325 secs
lola: 29384432 markings, 286667009 edges, 76064 markings/sec, 330 secs
lola: 29832628 markings, 290883916 edges, 89639 markings/sec, 335 secs
lola: 30186795 markings, 295124916 edges, 70833 markings/sec, 340 secs
lola: 30552051 markings, 299410148 edges, 73051 markings/sec, 345 secs
lola: 31050098 markings, 303737116 edges, 99609 markings/sec, 350 secs
lola: 31544509 markings, 308107945 edges, 98882 markings/sec, 355 secs
lola: 31995944 markings, 312323151 edges, 90287 markings/sec, 360 secs
lola: 32342624 markings, 316809873 edges, 69336 markings/sec, 365 secs
lola: 32762401 markings, 320974114 edges, 83955 markings/sec, 370 secs
lola: 33059184 markings, 325329357 edges, 59357 markings/sec, 375 secs
lola: 33482604 markings, 330007170 edges, 84684 markings/sec, 380 secs
lola: 33865290 markings, 334630636 edges, 76537 markings/sec, 385 secs
lola: 34202551 markings, 339160445 edges, 67452 markings/sec, 390 secs
lola: 34569156 markings, 343689683 edges, 73321 markings/sec, 395 secs
lola: 34929374 markings, 348119512 edges, 72044 markings/sec, 400 secs
lola: 35327485 markings, 352034796 edges, 79622 markings/sec, 405 secs
lola: 35657842 markings, 356182942 edges, 66071 markings/sec, 410 secs
lola: 36103394 markings, 360572311 edges, 89110 markings/sec, 415 secs
lola: 36556810 markings, 365126421 edges, 90683 markings/sec, 420 secs
lola: 36959512 markings, 369569811 edges, 80540 markings/sec, 425 secs
lola: 37377691 markings, 374097947 edges, 83636 markings/sec, 430 secs
lola: 37786078 markings, 378402264 edges, 81677 markings/sec, 435 secs
lola: 38176692 markings, 382419283 edges, 78123 markings/sec, 440 secs
lola: 38613774 markings, 386570160 edges, 87416 markings/sec, 445 secs
lola: 39154313 markings, 391165981 edges, 108108 markings/sec, 450 secs
lola: 39622556 markings, 395643669 edges, 93649 markings/sec, 455 secs
lola: 40086841 markings, 400104914 edges, 92857 markings/sec, 460 secs
lola: 40538771 markings, 404546474 edges, 90386 markings/sec, 465 secs
lola: 40969746 markings, 408658702 edges, 86195 markings/sec, 470 secs
lola: 41380592 markings, 412694443 edges, 82169 markings/sec, 475 secs
lola: 41852869 markings, 416920956 edges, 94455 markings/sec, 480 secs
lola: 42244904 markings, 421008612 edges, 78407 markings/sec, 485 secs
lola: 42599744 markings, 424967571 edges, 70968 markings/sec, 490 secs
lola: 42975568 markings, 429058530 edges, 75165 markings/sec, 495 secs
lola: 43352751 markings, 433030908 edges, 75437 markings/sec, 500 secs
lola: 43713163 markings, 436781433 edges, 72082 markings/sec, 505 secs
lola: 44191474 markings, 440774161 edges, 95662 markings/sec, 510 secs
lola: 44594296 markings, 444639987 edges, 80564 markings/sec, 515 secs
lola: 44960254 markings, 448407921 edges, 73192 markings/sec, 520 secs
lola: 45371615 markings, 452310896 edges, 82272 markings/sec, 525 secs
lola: 45760741 markings, 456112780 edges, 77825 markings/sec, 530 secs
lola: 46226277 markings, 460112274 edges, 93107 markings/sec, 535 secs
lola: 46733217 markings, 464440587 edges, 101388 markings/sec, 540 secs
lola: 47149766 markings, 468833664 edges, 83310 markings/sec, 545 secs
lola: 47550542 markings, 473210526 edges, 80155 markings/sec, 550 secs
lola: 48001337 markings, 477428251 edges, 90159 markings/sec, 555 secs
lola: 48384073 markings, 481581380 edges, 76547 markings/sec, 560 secs
lola: 48750804 markings, 485848104 edges, 73346 markings/sec, 565 secs
lola: 49153689 markings, 490144304 edges, 80577 markings/sec, 570 secs
lola: 49579965 markings, 494372285 edges, 85255 markings/sec, 575 secs
lola: 50009470 markings, 498577781 edges, 85901 markings/sec, 580 secs
lola: 50370728 markings, 502788597 edges, 72252 markings/sec, 585 secs
lola: 50707384 markings, 507089085 edges, 67331 markings/sec, 590 secs
lola: 51072450 markings, 511184317 edges, 73013 markings/sec, 595 secs
lola: 51346695 markings, 515542264 edges, 54849 markings/sec, 600 secs
lola: 51712472 markings, 520131790 edges, 73155 markings/sec, 605 secs
lola: 52041078 markings, 524572495 edges, 65721 markings/sec, 610 secs
lola: 52387180 markings, 528766197 edges, 69220 markings/sec, 615 secs
lola: 52692417 markings, 532625655 edges, 61047 markings/sec, 620 secs
lola: 53113707 markings, 537086174 edges, 84258 markings/sec, 625 secs
lola: 53503847 markings, 541543877 edges, 78028 markings/sec, 630 secs
lola: 53852419 markings, 545657207 edges, 69714 markings/sec, 635 secs
lola: 54262403 markings, 549735847 edges, 81997 markings/sec, 640 secs
lola: 54709163 markings, 554208972 edges, 89352 markings/sec, 645 secs
lola: 55110086 markings, 558617987 edges, 80185 markings/sec, 650 secs
lola: 55493508 markings, 562496667 edges, 76684 markings/sec, 655 secs
lola: 55880774 markings, 566517122 edges, 77453 markings/sec, 660 secs
lola: 56254362 markings, 570531217 edges, 74718 markings/sec, 665 secs
lola: 56569052 markings, 574470453 edges, 62938 markings/sec, 670 secs
lola: 56932295 markings, 578181490 edges, 72649 markings/sec, 675 secs
lola: 57302404 markings, 581997602 edges, 74022 markings/sec, 680 secs
lola: 57663529 markings, 585743112 edges, 72225 markings/sec, 685 secs
lola: 57995817 markings, 589369686 edges, 66458 markings/sec, 690 secs
lola: 58588671 markings, 593844436 edges, 118571 markings/sec, 695 secs
lola: 59149840 markings, 598224092 edges, 112234 markings/sec, 700 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: memory allocation failed
lola:
preliminary result: yes no yes no yes no yes yes no no yes unknown
FORMULA DES-PT-30a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-30a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="DES-PT-30a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/DES-PT-30a.tgz
mv DES-PT-30a 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-full"
echo " Input is DES-PT-30a, 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 r054-smll-152646382300241"
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 ;