fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r114-csrt-152666472700500
Last Updated
June 26, 2018

About the Execution of Irma.full for PermAdmissibility-PT-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.320 294002.00 266000.00 1720.70 ???????????????? 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 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K 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 12K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 481K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PermAdmissibility-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700500
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527142145909


BK_STOP 1527142439911

--------------------
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 PermAdmissibility-PT-20 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1731915, 'Memory': 15947.64, 'Tool': 'lola'}, {'Time': 1738713, 'Memory': 15952.66, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-PT-20...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-20: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-PT-20 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-20-CTLCardinality.task
lola: NOT(E (F (E (G ((in3_4 + in3_5 <= c6)))))) : E (G ((E (F ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) OR TRUE))) : E (X ((A (G ((c19 <= in1_0 + in1_1))) OR (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) : (A (G (((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= 0) OR (c16 <= 0)))) OR ((E (X ((c110 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))) AND (3 <= c13)) AND ((c12 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) AND (c7 <= c20)))) : (((((in2_2 + in2_3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (in2_2 + in2_3 <= c17) AND (c20 <= c8)) AND E (X ((c14 <= c15)))) OR (((c18 <= c110) OR (1 <= c5)) AND (c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))) AND (E (G (((3 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7)))) AND NOT(E (G ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7)))))) : A (F (NOT(E (F ((3 <= c5)))))) : A (G ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= c12))) : A (X (A (((c110 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) U (1 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7))))) : E (G ((E (X ((aux15_3 <= aux7_2))) OR ((out4_0 <= 2) OR ((out6_1 <= out2_1) AND (3 <= c15)))))) : A ((((out7_7 + 1 <= out1_5) OR (aux13_0 <= aux8_3)) U A (X ((3 <= out4_0))))) : A (X ((((1 <= aux16_0) AND ((out4_3 <= aux16_4) OR (out5_6 <= aux14_5))) OR A (F ((2 <= aux15_4)))))) : (((1 <= c12) OR (out4_6 + 1 <= out6_4) OR (aux10_4 <= 1)) AND A (F (((2 <= aux12_0) AND (out7_7 <= out4_1) AND (1 <= aux10_2))))) : E (F (E (G (((1 <= out7_3) AND (out7_6 <= aux11_4)))))) : NOT(E (G ((aux15_6 <= aux10_3)))) : NOT((((3 <= out6_3) OR A (F ((1 <= aux9_0)))) OR E (G ((aux12_5 + 1 <= aux9_1))))) : (A (G (A (F ((aux8_3 <= aux11_4))))) AND E (F ((3 <= out4_5))))
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 ((in3_4 + in3_5 <= c6))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (c6 + 1 <= in3_4 + in3_5)))))
lola: processed formula length: 55
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 321 markings, 360 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((c19 <= in1_0 + in1_1))) OR (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
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 (X (A (G ((c19 <= in1_0 + in1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (in1_0 + in1_1 + 1 <= c19))))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 222 markings, 224 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))
lola: processed formula length: 112
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= 0) OR (c16 <= 0)))) OR ((E (X ((c110 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))) AND (3 <= c13)) AND ((c12 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) AND (c7 <= c20))))
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 (G (((out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= 0) OR (c16 <= 0))))
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 544 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((c110 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((c110 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))
lola: processed formula length: 91
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= c13) AND ((c12 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) AND (c7 <= c20)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= c13) AND ((c12 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) AND (c7 <= c20)))
lola: processed formula length: 121
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((in2_2 + in2_3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (in2_2 + in2_3 <= c17) AND (c20 <= c8)) AND E (X ((c14 <= c15)))) OR (((c18 <= c110) OR (1 <= c5)) AND (c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))) AND (E (G (((3 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) OR (aux14_0 + aux14_1 + aux1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((in2_2 + in2_3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (in2_2 + in2_3 <= c17) AND (c20 <= c8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((in2_2 + in2_3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (in2_2 + in2_3 <= c17) AND (c20 <= c8))
lola: processed formula length: 133
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((c18 <= c110) OR (1 <= c5)) AND (c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((c18 <= c110) OR (1 <= c5)) AND (c11 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))
lola: processed formula length: 114
lola: 3 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: processed formula with 3 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= 2) AND (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: processed formula length: 254
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 1393187 markings, 1973613 edges, 1953358685363240960 markings/sec, 0 secs
lola: 2782924 markings, 4019533 edges, 277947 markings/sec, 5 secs
lola: 4210003 markings, 6044514 edges, 285416 markings/sec, 10 secs
lola: 5564050 markings, 8027055 edges, 270809 markings/sec, 15 secs
lola: 6834359 markings, 9797174 edges, 254062 markings/sec, 20 secs
lola: 8065739 markings, 11654281 edges, 246276 markings/sec, 25 secs
lola: 9400706 markings, 13681053 edges, 266993 markings/sec, 30 secs
lola: 10769912 markings, 15667142 edges, 273841 markings/sec, 35 secs
lola: 12088853 markings, 17509519 edges, 263788 markings/sec, 40 secs
lola: 13335505 markings, 19391739 edges, 249330 markings/sec, 45 secs
lola: 14628961 markings, 21335851 edges, 258691 markings/sec, 50 secs
lola: 15945677 markings, 23200530 edges, 263343 markings/sec, 55 secs
lola: 17122557 markings, 24873219 edges, 235376 markings/sec, 60 secs
lola: 18268875 markings, 26586511 edges, 229264 markings/sec, 65 secs
lola: 19443248 markings, 28336291 edges, 234875 markings/sec, 70 secs
lola: 20586999 markings, 29919096 edges, 228750 markings/sec, 75 secs
lola: 21682628 markings, 31592344 edges, 219126 markings/sec, 80 secs
lola: 22788843 markings, 33218722 edges, 221243 markings/sec, 85 secs
lola: 23778230 markings, 34777788 edges, 197877 markings/sec, 90 secs
lola: 24783013 markings, 36471031 edges, 200957 markings/sec, 95 secs
lola: 26003843 markings, 38261082 edges, 244166 markings/sec, 100 secs
lola: 27159947 markings, 40032914 edges, 231221 markings/sec, 105 secs
lola: 28382146 markings, 41877844 edges, 244440 markings/sec, 110 secs
lola: 29558804 markings, 43549709 edges, 235332 markings/sec, 115 secs
lola: 30664633 markings, 45294608 edges, 221166 markings/sec, 120 secs
lola: 31843457 markings, 47109023 edges, 235765 markings/sec, 125 secs
lola: 33003954 markings, 48746661 edges, 232099 markings/sec, 130 secs
lola: 34080513 markings, 50433328 edges, 215312 markings/sec, 135 secs
lola: 35191420 markings, 52143280 edges, 222181 markings/sec, 140 secs
lola: 36222831 markings, 53868351 edges, 206282 markings/sec, 145 secs
lola: 37419341 markings, 55498163 edges, 239302 markings/sec, 150 secs
lola: 38518171 markings, 57067116 edges, 219766 markings/sec, 155 secs
lola: 39664165 markings, 58776491 edges, 229199 markings/sec, 160 secs
lola: 40747418 markings, 60529984 edges, 216651 markings/sec, 165 secs
lola: 41893464 markings, 62362039 edges, 229209 markings/sec, 170 secs
lola: 43100290 markings, 64185967 edges, 241365 markings/sec, 175 secs
lola: 44239383 markings, 66012085 edges, 227819 markings/sec, 180 secs
lola: 45364959 markings, 67768197 edges, 225115 markings/sec, 185 secs
lola: 46462957 markings, 69473825 edges, 219600 markings/sec, 190 secs
lola: 47542839 markings, 71145199 edges, 215976 markings/sec, 195 secs
lola: 48546667 markings, 72785319 edges, 200766 markings/sec, 200 secs
lola: 49715276 markings, 74623821 edges, 233722 markings/sec, 205 secs
lola: 50810286 markings, 76431563 edges, 219002 markings/sec, 210 secs
lola: 51930946 markings, 78157442 edges, 224132 markings/sec, 215 secs
lola: 52973030 markings, 79895093 edges, 208417 markings/sec, 220 secs
lola: 54023701 markings, 81669584 edges, 210134 markings/sec, 225 secs
lola: 55120893 markings, 83356742 edges, 219438 markings/sec, 230 secs
lola: 56157737 markings, 85083408 edges, 207369 markings/sec, 235 secs
lola: 57178936 markings, 86821230 edges, 204240 markings/sec, 240 secs
lola: 57294114 markings, 87003446 edges, 23036 markings/sec, 245 secs
lola: 57300582 markings, 87012837 edges, 1294 markings/sec, 250 secs
lola: 57302675 markings, 87016045 edges, 419 markings/sec, 255 secs
lola: 57304359 markings, 87018609 edges, 337 markings/sec, 260 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: '\ufffd'
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: '
'
Aborted (core dumped)
FORMULA PermAdmissibility-PT-20-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="PermAdmissibility-PT-20"
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/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 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 PermAdmissibility-PT-20, 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 r114-csrt-152666472700500"
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 ;