fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r138-qhx2-152673580900374
Last Updated
June 26, 2018

About the Execution of Irma.full for ResAllocation-PT-R003C100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2828.630 365699.00 391842.00 1564.10 ???????????????? normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K 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.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 693K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is ResAllocation-PT-R003C100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580900374
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527162144803


BK_STOP 1527162510502

--------------------
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 ResAllocation-PT-R003C100 as instance name.
Using ResAllocation 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': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1024, 'Memory': 131.98, 'Tool': 'lola'}, {'Time': 1107, 'Memory': 131.41, 'Tool': 'lola'}, {'Time': 322242, 'Memory': 2184.5, 'Tool': 'gspn'}, {'Time': 329067, 'Memory': 2213.16, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola ResAllocation-PT-R003C100...

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C100: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ ResAllocation-PT-R003C100 @ 3538 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1000/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 600 places, 400 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C100-CTLCardinality.task
lola: NOT(E (F (E (G ((r_37_2 <= r_94_1)))))) : ((2 <= p_13_2) OR A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0))))) : A ((A (X ((p_32_1 <= r_43_0))) U ((p_62_1 + 1 <= p_18_0) AND (p_2_0 <= 0)))) : ((A (F (((1 <= r_33_1) AND (1 <= r_21_2)))) OR ((r_36_1 <= r_73_1) AND (r_56_0 <= r_9_0))) AND A (F (((p_15_1 <= p_97_1) AND ((2 <= r_58_0) OR (2 <= r_87_1)))))) : E (G ((((r_76_0 <= r_56_2) OR (3 <= p_46_1) OR (3 <= r_59_1) OR (p_74_0 <= r_71_2)) AND (((2 <= r_86_2)) OR (p_17_2 + 1 <= r_48_0))))) : ((((1 <= p_58_1) OR E (F ((r_40_1 <= r_49_1)))) OR ((r_45_1 + 1 <= p_59_0) OR (r_18_0 <= 0))) AND E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (3 <= p_56_1) OR (p_33_2 <= r_26_2))))) : E (F (NOT(A (X ((r_18_0 <= r_72_1)))))) : A (F (((2 <= r_85_1) OR ((r_14_0 <= r_30_1) AND ((2 <= r_57_1) OR (r_32_0 <= p_82_1)))))) : (E (((p_9_2 <= r_12_1) U (2 <= p_87_1))) AND (A (F (((p_53_0 <= r_58_2) OR (1 <= r_41_0)))) OR E (((r_95_2 <= r_12_1) U (p_99_0 <= p_60_1))))) : E (G ((p_49_1 <= p_97_0))) : E ((E (X ((r_91_2 <= p_17_0))) U A (X ((3 <= p_21_2))))) : E (F ((A (X ((r_22_1 <= r_52_0))) OR E (G ((2 <= r_47_0)))))) : (NOT(A (((p_75_1 <= r_39_0) U (1 <= p_62_1)))) OR (3 <= r_74_1)) : NOT(E (G ((p_52_0 <= r_87_1)))) : E (G ((p_12_2 <= r_80_2))) : E (X (E (X (((3 <= p_30_2) AND (1 <= r_40_0))))))
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(E (F (E (G ((r_37_2 <= r_94_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (r_94_1 + 1 <= r_37_2)))))
lola: processed formula length: 52
lola: 7 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 4 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p_13_2) OR A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p_13_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_13_2)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0))))
lola: processed formula: A (F (((r_80_1 + 1 <= r_78_2) AND (p_92_1 + 1 <= r_6_0))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 19 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p_32_1 <= r_43_0))) U ((p_62_1 + 1 <= p_18_0) AND (p_2_0 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p_32_1 <= r_43_0)) U ((p_62_1 + 1 <= p_18_0) AND (p_2_0 <= 0)))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (((1 <= r_33_1) AND (1 <= r_21_2)))) OR ((r_36_1 <= r_73_1) AND (r_56_0 <= r_9_0))) AND A (F (((p_15_1 <= p_97_1) AND ((2 <= r_58_0) OR (2 <= r_87_1))))))
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 (F (((1 <= r_33_1) AND (1 <= r_21_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= r_33_1) AND (1 <= r_21_2))))
lola: processed formula: A (F (((1 <= r_33_1) AND (1 <= r_21_2))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 19 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p_15_1 <= p_97_1) AND ((2 <= r_58_0) OR (2 <= r_87_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p_15_1 <= p_97_1) AND ((2 <= r_58_0) OR (2 <= r_87_1)))))
lola: processed formula: A (F (((p_15_1 <= p_97_1) AND ((2 <= r_58_0) OR (2 <= r_87_1)))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 19 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((r_76_0 <= r_56_2) OR (3 <= p_46_1) OR (3 <= r_59_1) OR (p_74_0 <= r_71_2)) AND (((2 <= r_86_2)) OR (p_17_2 + 1 <= r_48_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((r_56_2 + 1 <= r_76_0) AND (p_46_1 <= 2) AND (r_59_1 <= 2) AND (r_71_2 + 1 <= p_74_0)) OR (((r_86_2 <= 1)) AND (r_48_0 <= p_17_2)))))
lola: processed formula length: 149
lola: 2 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= p_58_1) OR E (F ((r_40_1 <= r_49_1)))) OR ((r_45_1 + 1 <= p_59_0) OR (r_18_0 <= 0))) AND E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (3 <= p_56_1) OR (p_33_2 <= r_26_2)))))
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: (1 <= p_58_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_58_1)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((r_40_1 <= r_49_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 40 bytes per marking, with 20 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_13_0 <= r_27_2) OR (r_85_2 <= p_86_0) OR (3 <= p_56_1) OR (p_33_2 <= r_26_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((r_27_2 + 1 <= p_13_0) AND (p_86_0 + 1 <= r_85_2) AND (p_56_1 <= 2) AND (r_26_2 + 1 <= p_33_2))))
lola: processed formula length: 111
lola: 3 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 4 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (X ((r_18_0 <= r_72_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((r_72_1 + 1 <= r_18_0)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 20 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: 147269 markings, 223151 edges, 3689329903141912576 markings/sec, 0 secs
lola: 458781 markings, 2667535 edges, 62302 markings/sec, 5 secs
lola: 741952 markings, 5016395 edges, 56634 markings/sec, 10 secs
lola: 999539 markings, 7275005 edges, 51517 markings/sec, 15 secs
lola: 1252443 markings, 9554232 edges, 50581 markings/sec, 20 secs
lola: 1492137 markings, 11780324 edges, 47939 markings/sec, 25 secs
lola: 1721031 markings, 14000080 edges, 45779 markings/sec, 30 secs
lola: 1969844 markings, 16254834 edges, 49763 markings/sec, 35 secs
lola: 2212913 markings, 18481517 edges, 48614 markings/sec, 40 secs
lola: 2443729 markings, 20648113 edges, 46163 markings/sec, 45 secs
lola: 2683102 markings, 22865330 edges, 47875 markings/sec, 50 secs
lola: 2918835 markings, 25015967 edges, 47147 markings/sec, 55 secs
lola: 3145957 markings, 27138417 edges, 45424 markings/sec, 60 secs
lola: 3361305 markings, 29260258 edges, 43070 markings/sec, 65 secs
lola: 3611103 markings, 31414022 edges, 49960 markings/sec, 70 secs
lola: 3847013 markings, 33560031 edges, 47182 markings/sec, 75 secs
lola: 4075648 markings, 35686506 edges, 45727 markings/sec, 80 secs
lola: 4301319 markings, 37803475 edges, 45134 markings/sec, 85 secs
lola: 4510488 markings, 39844228 edges, 41834 markings/sec, 90 secs
lola: 4725513 markings, 41949758 edges, 43005 markings/sec, 95 secs
lola: 4931837 markings, 44052477 edges, 41265 markings/sec, 100 secs
lola: 5144701 markings, 46169155 edges, 42573 markings/sec, 105 secs
lola: 5347062 markings, 48269277 edges, 40472 markings/sec, 110 secs
lola: 5538188 markings, 50302484 edges, 38225 markings/sec, 115 secs
lola: 5730261 markings, 52368417 edges, 38415 markings/sec, 120 secs
lola: 5937885 markings, 54422590 edges, 41525 markings/sec, 125 secs
lola: 6141968 markings, 56495805 edges, 40817 markings/sec, 130 secs
lola: 6353228 markings, 58596259 edges, 42252 markings/sec, 135 secs
lola: 6553395 markings, 60677374 edges, 40033 markings/sec, 140 secs
lola: 6747224 markings, 62744345 edges, 38766 markings/sec, 145 secs
lola: 6937619 markings, 64795354 edges, 38079 markings/sec, 150 secs
lola: 7146558 markings, 66848164 edges, 41788 markings/sec, 155 secs
lola: 7349341 markings, 68912832 edges, 40557 markings/sec, 160 secs
lola: 7553701 markings, 70946917 edges, 40872 markings/sec, 165 secs
lola: 7745544 markings, 72940090 edges, 38369 markings/sec, 170 secs
lola: 7936191 markings, 74945986 edges, 38129 markings/sec, 175 secs
lola: 8117907 markings, 76903905 edges, 36343 markings/sec, 180 secs
lola: 8330903 markings, 78917071 edges, 42599 markings/sec, 185 secs
lola: 8546715 markings, 80880939 edges, 43162 markings/sec, 190 secs
lola: 8756384 markings, 82844553 edges, 41934 markings/sec, 195 secs
lola: 8947732 markings, 84719020 edges, 38270 markings/sec, 200 secs
lola: 9149479 markings, 86695132 edges, 40349 markings/sec, 205 secs
lola: 9343468 markings, 88651437 edges, 38798 markings/sec, 210 secs
lola: 9533295 markings, 90630240 edges, 37965 markings/sec, 215 secs
lola: 9719673 markings, 92592719 edges, 37276 markings/sec, 220 secs
lola: 9911157 markings, 94529635 edges, 38297 markings/sec, 225 secs
lola: 10105097 markings, 96491342 edges, 38788 markings/sec, 230 secs
lola: 10293993 markings, 98429900 edges, 37779 markings/sec, 235 secs
lola: 10474163 markings, 100328945 edges, 36034 markings/sec, 240 secs
lola: 10652117 markings, 102181361 edges, 35591 markings/sec, 245 secs
lola: 10829148 markings, 103969315 edges, 35406 markings/sec, 250 secs
lola: 11004878 markings, 105737759 edges, 35146 markings/sec, 255 secs
lola: 11173466 markings, 107490118 edges, 33718 markings/sec, 260 secs
lola: 11333741 markings, 109202516 edges, 32055 markings/sec, 265 secs
lola: 11513491 markings, 110973491 edges, 35950 markings/sec, 270 secs
lola: 11687878 markings, 112747386 edges, 34877 markings/sec, 275 secs
lola: 11869591 markings, 114560918 edges, 36343 markings/sec, 280 secs
lola: 12047115 markings, 116387822 edges, 35505 markings/sec, 285 secs
lola: 12237209 markings, 118353745 edges, 38019 markings/sec, 290 secs
lola: 12422588 markings, 120298798 edges, 37076 markings/sec, 295 secs
lola: 12580835 markings, 122087734 edges, 31649 markings/sec, 300 secs
lola: 12774370 markings, 124111505 edges, 38707 markings/sec, 305 secs
lola: 12941233 markings, 126010164 edges, 33373 markings/sec, 310 secs
lola: 13119576 markings, 127950213 edges, 35669 markings/sec, 315 secs
lola: 13286405 markings, 129854906 edges, 33366 markings/sec, 320 secs
lola: 13464524 markings, 131846946 edges, 35624 markings/sec, 325 secs
lola: 13635644 markings, 133814626 edges, 34224 markings/sec, 330 secs
lola: 13787080 markings, 135696012 edges, 30287 markings/sec, 335 secs
lola: 13976092 markings, 137676926 edges, 37802 markings/sec, 340 secs
lola: 14147179 markings, 139618014 edges, 34217 markings/sec, 345 secs
lola: local time limit reached - aborting
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: '\ufffd'
Aborted (core dumped)
FORMULA ResAllocation-PT-R003C100-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C100"
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/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 ResAllocation-PT-R003C100, 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 r138-qhx2-152673580900374"
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 ;