About the Execution of Irma.full for ResAllocation-PT-R100C002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6385.160 | 1126096.00 | 1207653.00 | 3332.90 | ???????????????? | 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 568K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 404K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is ResAllocation-PT-R100C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673581000416
=====================================================================
--------------------
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-R100C002-CTLCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527162830050
BK_STOP 1527163956146
--------------------
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-R100C002 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': 2301332, 'Memory': 15932.09, 'Tool': 'lola'}, {'Time': 2938307, 'Memory': 13336.82, 'Tool': 'lola'}, {'Time': 3509534, 'Memory': 9173.75, 'Tool': 'itstools'}, {'Time': 3509788, 'Memory': 9184.41, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola ResAllocation-PT-R100C002...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ResAllocation-PT-R100C002: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ResAllocation-PT-R100C002: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ ResAllocation-PT-R100C002 @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
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: 602/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 400 places, 202 transitions, 200 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 302 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R100C002-CTLCardinality.task
lola: (NOT(A (F ((2 <= p_1_89)))) OR (E (G (((3 <= r_1_59) AND (p_1_58 <= r_0_44)))) AND NOT(E (G ((r_1_94 <= r_0_15)))))) : E (F ((1 <= p_0_82))) : A ((((r_1_45 <= 1) OR ((r_0_98 <= r_0_43) AND (1 <= p_0_14))) U (1 <= p_0_77))) : E (F ((3 <= r_0_92))) : E (F ((3 <= p_1_42))) : ((A (((1 <= r_0_64) U (r_1_54 <= p_0_98))) AND (p_1_95 <= p_1_34)) AND ((A (G ((3 <= p_1_33))) OR E (F ((r_0_5 <= r_0_38)))) AND (p_1_71 <= r_0_13))) : (A (F ((2 <= r_1_68))) OR E (G (A (X ((2 <= p_1_49)))))) : NOT(((A (F ((2 <= r_0_48))) OR A (X ((1 <= p_0_93)))) AND ((r_1_28 <= r_1_17) OR (1 <= r_1_58) OR (r_0_83 <= r_0_39) OR (p_0_17 <= 0)))) : NOT((E (X ((p_1_91 <= 2))) AND A (F ((p_1_32 + 1 <= p_1_22))))) : E ((((r_1_48 <= p_0_74) OR (r_0_57 <= 1)) U ((2 <= r_0_95) AND (1 <= r_0_17) AND ((p_1_84 <= r_0_53) OR (1 <= r_1_63))))) : E (G ((A (X ((r_1_95 <= r_1_86))) OR A (G ((r_0_78 <= p_0_99)))))) : E (F (E (X (((3 <= r_1_41) OR (3 <= p_0_52)))))) : NOT(E (G (E (X ((p_0_99 <= p_0_46)))))) : A (G (E (F (((2 <= r_1_69) OR (2 <= p_1_38)))))) : A (((p_1_52 <= r_0_74) U E (X ((r_1_18 <= p_0_79))))) : A (((1 <= r_0_33) U E (F ((2 <= p_1_53)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F ((2 <= p_1_89)))) OR (E (G (((3 <= r_1_59) AND (p_1_58 <= r_0_44)))) AND NOT(E (G ((r_1_94 <= r_0_15))))))
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: E (G ((p_1_89 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p_1_89)))
lola: processed formula length: 28
lola: 8 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 4952 markings, 4951 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p_0_82)))
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 28 bytes per marking, with 24 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: 84 markings, 83 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((r_1_45 <= 1) OR ((r_0_98 <= r_0_43) AND (1 <= p_0_14))) U (1 <= p_0_77)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((r_1_45 <= 1) OR ((r_0_98 <= r_0_43) AND (1 <= p_0_14))) U (1 <= p_0_77)))
lola: processed formula: A ((((r_1_45 <= 1) OR ((r_0_98 <= r_0_43) AND (1 <= p_0_14))) U (1 <= p_0_77)))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 22 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: 5723 markings, 5723 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= r_0_92)))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-CTLCardinality-3.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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p_1_42)))
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 28 bytes per marking, with 24 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 ResAllocation-PT-R100C002-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-CTLCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= r_0_64) U (r_1_54 <= p_0_98))) AND (p_1_95 <= p_1_34)) AND ((A (G ((3 <= p_1_33))) OR E (F ((r_0_5 <= r_0_38)))) AND (p_1_71 <= r_0_13)))
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: A (((1 <= r_0_64) U (r_1_54 <= p_0_98)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= r_0_64) U (r_1_54 <= p_0_98)))
lola: processed formula: A (((1 <= r_0_64) U (r_1_54 <= p_0_98)))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 22 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: 4952 markings, 4952 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= r_1_68))) OR E (G (A (X ((2 <= p_1_49))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= r_1_68)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= r_1_68)))
lola: processed formula: A (F ((2 <= r_1_68)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 23 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: 4952 markings, 4952 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((2 <= p_1_49)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((2 <= p_1_49)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (F ((2 <= r_0_48))) OR A (X ((1 <= p_0_93)))) AND ((r_1_28 <= r_1_17) OR (1 <= r_1_58) OR (r_0_83 <= r_0_39) OR (p_0_17 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((r_0_48 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= r_0_48)))
lola: processed formula length: 28
lola: 11 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 4952 markings, 4951 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p_0_93 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p_0_93 <= 0))
lola: processed formula length: 17
lola: 10 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((p_1_91 <= 2))) AND A (F ((p_1_32 + 1 <= p_1_22)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p_1_91)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p_1_91)))
lola: processed formula: A (X ((3 <= p_1_91)))
lola: processed formula length: 21
lola: 7 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 22 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4952 markings, 4952 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p_1_22 <= p_1_32)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_1_32 + 1 <= p_1_22)))
lola: processed formula length: 37
lola: 9 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 4952 markings, 4951 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((r_1_48 <= p_0_74) OR (r_0_57 <= 1)) U ((2 <= r_0_95) AND (1 <= r_0_17) AND ((p_1_84 <= r_0_53) OR (1 <= r_1_63)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((r_1_48 <= p_0_74) OR (r_0_57 <= 1)) U ((2 <= r_0_95) AND (1 <= r_0_17) AND ((p_1_84 <= r_0_53) OR (1 <= r_1_63))))
lola: processed formula length: 120
lola: 1 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 606416 markings, 3147884 edges, 2011511443039453184 markings/sec, 0 secs
lola: 1137485 markings, 6165103 edges, 106214 markings/sec, 5 secs
lola: 1650773 markings, 9159480 edges, 102658 markings/sec, 10 secs
lola: 2134280 markings, 12164252 edges, 96701 markings/sec, 15 secs
lola: 2644827 markings, 15141964 edges, 102109 markings/sec, 20 secs
lola: 3150282 markings, 18141038 edges, 101091 markings/sec, 25 secs
lola: 3608937 markings, 21023278 edges, 91731 markings/sec, 30 secs
lola: 4051605 markings, 23984492 edges, 88534 markings/sec, 35 secs
lola: 4479760 markings, 26856199 edges, 85631 markings/sec, 40 secs
lola: 4930300 markings, 29599815 edges, 90108 markings/sec, 45 secs
lola: 5379102 markings, 32360082 edges, 89760 markings/sec, 50 secs
lola: 5881303 markings, 35322190 edges, 100440 markings/sec, 55 secs
lola: 6335694 markings, 38258141 edges, 90878 markings/sec, 60 secs
lola: 6826584 markings, 41139168 edges, 98178 markings/sec, 65 secs
lola: 7258137 markings, 43899188 edges, 86311 markings/sec, 70 secs
lola: 7673200 markings, 46692098 edges, 83013 markings/sec, 75 secs
lola: 8102125 markings, 49534597 edges, 85785 markings/sec, 80 secs
lola: 8502392 markings, 52391822 edges, 80053 markings/sec, 85 secs
lola: 8899830 markings, 55218325 edges, 79488 markings/sec, 90 secs
lola: 9316084 markings, 58031672 edges, 83251 markings/sec, 95 secs
lola: 9719713 markings, 60920417 edges, 80726 markings/sec, 100 secs
lola: 10167347 markings, 63658856 edges, 89527 markings/sec, 105 secs
lola: 10579387 markings, 66354231 edges, 82408 markings/sec, 110 secs
lola: 10975143 markings, 69036501 edges, 79151 markings/sec, 115 secs
lola: 11406707 markings, 71736973 edges, 86313 markings/sec, 120 secs
lola: 11830788 markings, 74415322 edges, 84816 markings/sec, 125 secs
lola: 12285322 markings, 77009404 edges, 90907 markings/sec, 130 secs
lola: 12758420 markings, 80032580 edges, 94620 markings/sec, 135 secs
lola: 13159897 markings, 82892530 edges, 80295 markings/sec, 140 secs
lola: 13605835 markings, 85695129 edges, 89188 markings/sec, 145 secs
lola: 14056958 markings, 88563241 edges, 90225 markings/sec, 150 secs
lola: 14525723 markings, 91291802 edges, 93753 markings/sec, 155 secs
lola: 14942296 markings, 93998300 edges, 83315 markings/sec, 160 secs
lola: 15340712 markings, 96682822 edges, 79683 markings/sec, 165 secs
lola: 15744583 markings, 99409035 edges, 80774 markings/sec, 170 secs
lola: 16113647 markings, 102126457 edges, 73813 markings/sec, 175 secs
lola: 16502896 markings, 104841345 edges, 77850 markings/sec, 180 secs
lola: 16889633 markings, 107503843 edges, 77347 markings/sec, 185 secs
lola: 17278645 markings, 110212857 edges, 77802 markings/sec, 190 secs
lola: 17663975 markings, 112919334 edges, 77066 markings/sec, 195 secs
lola: 18028049 markings, 115626127 edges, 72815 markings/sec, 200 secs
lola: 18383557 markings, 118369241 edges, 71102 markings/sec, 205 secs
lola: 18743111 markings, 121103896 edges, 71911 markings/sec, 210 secs
lola: 19117784 markings, 123803268 edges, 74935 markings/sec, 215 secs
lola: 19500690 markings, 126527953 edges, 76581 markings/sec, 220 secs
lola: 19900686 markings, 129236554 edges, 79999 markings/sec, 225 secs
lola: 20263490 markings, 132008114 edges, 72561 markings/sec, 230 secs
lola: 20643464 markings, 134774568 edges, 75995 markings/sec, 235 secs
lola: 21079776 markings, 137515579 edges, 87262 markings/sec, 240 secs
lola: 21483510 markings, 140113661 edges, 80747 markings/sec, 245 secs
lola: 21872932 markings, 142744211 edges, 77884 markings/sec, 250 secs
lola: 22267507 markings, 145385282 edges, 78915 markings/sec, 255 secs
lola: 22647090 markings, 148040136 edges, 75917 markings/sec, 260 secs
lola: 23018810 markings, 150700526 edges, 74344 markings/sec, 265 secs
lola: 23401858 markings, 153273130 edges, 76610 markings/sec, 270 secs
lola: 23771820 markings, 155942258 edges, 73992 markings/sec, 275 secs
lola: 24193421 markings, 158605248 edges, 84320 markings/sec, 280 secs
lola: 24583069 markings, 161108355 edges, 77930 markings/sec, 285 secs
lola: 24966536 markings, 163699475 edges, 76693 markings/sec, 290 secs
lola: 25353432 markings, 166296737 edges, 77379 markings/sec, 295 secs
lola: 25772917 markings, 168847324 edges, 83897 markings/sec, 300 secs
lola: 26187919 markings, 171388819 edges, 83000 markings/sec, 305 secs
lola: 26655413 markings, 174097740 edges, 93499 markings/sec, 310 secs
lola: 27093765 markings, 177046631 edges, 87670 markings/sec, 315 secs
lola: 27513471 markings, 179945055 edges, 83941 markings/sec, 320 secs
lola: 27900502 markings, 182766179 edges, 77406 markings/sec, 325 secs
lola: 28282802 markings, 185459474 edges, 76460 markings/sec, 330 secs
lola: 28747361 markings, 188329793 edges, 92912 markings/sec, 335 secs
lola: 29159094 markings, 191148940 edges, 82347 markings/sec, 340 secs
lola: 29634843 markings, 194007919 edges, 95150 markings/sec, 345 secs
lola: 30080428 markings, 196653069 edges, 89117 markings/sec, 350 secs
lola: 30482009 markings, 199276556 edges, 80316 markings/sec, 355 secs
lola: 30871363 markings, 201891444 edges, 77871 markings/sec, 360 secs
lola: 31262658 markings, 204526201 edges, 78259 markings/sec, 365 secs
lola: 31619767 markings, 207160791 edges, 71422 markings/sec, 370 secs
lola: 31997118 markings, 209801153 edges, 75470 markings/sec, 375 secs
lola: 32383150 markings, 212431409 edges, 77206 markings/sec, 380 secs
lola: 32761753 markings, 215097687 edges, 75721 markings/sec, 385 secs
lola: 33147310 markings, 217775400 edges, 77111 markings/sec, 390 secs
lola: 33506085 markings, 220445167 edges, 71755 markings/sec, 395 secs
lola: 33843690 markings, 223070034 edges, 67521 markings/sec, 400 secs
lola: 34183465 markings, 225713035 edges, 67955 markings/sec, 405 secs
lola: 34551463 markings, 228307554 edges, 73600 markings/sec, 410 secs
lola: 34913010 markings, 230909862 edges, 72309 markings/sec, 415 secs
lola: 35302902 markings, 233521437 edges, 77978 markings/sec, 420 secs
lola: 35665272 markings, 236224029 edges, 72474 markings/sec, 425 secs
lola: 36028299 markings, 238893013 edges, 72605 markings/sec, 430 secs
lola: 36429897 markings, 241658828 edges, 80320 markings/sec, 435 secs
lola: 36803603 markings, 244346423 edges, 74741 markings/sec, 440 secs
lola: 37161523 markings, 247048043 edges, 71584 markings/sec, 445 secs
lola: 37511993 markings, 249733988 edges, 70094 markings/sec, 450 secs
lola: 37864958 markings, 252454418 edges, 70593 markings/sec, 455 secs
lola: 38194919 markings, 255174593 edges, 65992 markings/sec, 460 secs
lola: 38530383 markings, 257902104 edges, 67093 markings/sec, 465 secs
lola: 38878689 markings, 260585178 edges, 69661 markings/sec, 470 secs
lola: 39205510 markings, 263298775 edges, 65364 markings/sec, 475 secs
lola: 39576128 markings, 266066832 edges, 74124 markings/sec, 480 secs
lola: 39943548 markings, 268716721 edges, 73484 markings/sec, 485 secs
lola: 40291340 markings, 271377168 edges, 69558 markings/sec, 490 secs
lola: 40637785 markings, 274036520 edges, 69289 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((r_1_95 <= r_1_86))) OR A (G ((r_0_78 <= p_0_99))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX((r_1_95 <= r_1_86))) AND E(TRUE U (p_0_99 + 1 <= r_0_78)))))
lola: processed formula length: 81
lola: 6 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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 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: 4952 markings, 4951 edges
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (((3 <= r_1_41) OR (3 <= p_0_52))))))
----- Kill lola and sara stderr -----
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(((3 <= r_1_41) OR (3 <= p_0_52))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 400 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R100C002-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 529529 markings, 2734518 edges, 3689329903141912576 markings/sec, 0 secs
lola: 976654 markings, 5287878 edges, 89425 markings/sec, 5 secs
lola: 1430829 markings, 7835479 edges, 90835 markings/sec, 10 secs
lola: 1842006 markings, 10364068 edges, 82235 markings/sec, 15 secs
lola: 2242099 markings, 12833341 edges, 80019 markings/sec, 20 secs
lola: 2675264 markings, 15345105 edges, 86633 markings/sec, 25 secs
lola: 3097170 markings, 17865749 edges, 84381 markings/sec, 30 secs
lola: 3497024 markings, 20296861 edges, 79971 markings/sec, 35 secs
lola: 3870615 markings, 22744197 edges, 74718 markings/sec, 40 secs
lola: 4232876 markings, 25168534 edges, 72452 markings/sec, 45 secs
lola: 4610393 markings, 27592133 edges, 75503 markings/sec, 50 secs
lola: 4980648 markings, 29923175 edges, 74051 markings/sec, 55 secs
lola: 5357831 markings, 32234772 edges, 75437 markings/sec, 60 secs
lola: 5778207 markings, 34673684 edges, 84075 markings/sec, 65 secs
lola: 6142469 markings, 37119214 edges, 72852 markings/sec, 70 secs
lola: 6552428 markings, 39596358 edges, 81992 markings/sec, 75 secs
lola: 6958136 markings, 41948028 edges, 81142 markings/sec, 80 secs
lola: 7318971 markings, 44265757 edges, 72167 markings/sec, 85 secs
lola: 7659372 markings, 46595842 edges, 68080 markings/sec, 90 secs
lola: 7998596 markings, 48883024 edges, 67845 markings/sec, 95 secs
lola: 8347684 markings, 51243511 edges, 69818 markings/sec, 100 secs
lola: 8662304 markings, 53593325 edges, 62924 markings/sec, 105 secs
lola: 9003650 markings, 55936671 edges, 68269 markings/sec, 110 secs
lola: 9349176 markings, 58282632 edges, 69105 markings/sec, 115 secs
lola: 9677012 markings, 60631804 edges, 65567 markings/sec, 120 secs
lola: 10057300 markings, 62937653 edges, 76058 markings/sec, 125 secs
lola: 10406280 markings, 65191503 edges, 69796 markings/sec, 130 secs
lola: 10737563 markings, 67440282 edges, 66257 markings/sec, 135 secs
lola: 11072306 markings, 69692363 edges, 66949 markings/sec, 140 secs
lola: 11436940 markings, 71922927 edges, 72927 markings/sec, 145 secs
lola: 11782807 markings, 74152680 edges, 69173 markings/sec, 150 secs
lola: 12156888 markings, 76330270 edges, 74816 markings/sec, 155 secs
lola: 12570857 markings, 78798747 edges, 82794 markings/sec, 160 secs
lola: 12930346 markings, 81248932 edges, 71898 markings/sec, 165 secs
lola: 13261185 markings, 83577419 edges, 66168 markings/sec, 170 secs
lola: 13643053 markings, 85947932 edges, 76374 markings/sec, 175 secs
lola: 14021538 markings, 88340591 edges, 75697 markings/sec, 180 secs
lola: 14425223 markings, 90664617 edges, 80737 markings/sec, 185 secs
lola: 14770649 markings, 92892495 edges, 69085 markings/sec, 190 secs
lola: 15106345 markings, 95145413 edges, 67139 markings/sec, 195 secs
lola: 15432050 markings, 97346778 edges, 65141 markings/sec, 200 secs
lola: 15775226 markings, 99616693 edges, 68635 markings/sec, 205 secs
lola: 16079982 markings, 101856766 edges, 60951 markings/sec, 210 secs
lola: 16399526 markings, 104118409 edges, 63909 markings/sec, 215 secs
lola: 16732843 markings, 106346667 edges, 66663 markings/sec, 220 secs
lola: 17042273 markings, 108595746 edges, 61886 markings/sec, 225 secs
lola: 17387840 markings, 110910605 edges, 69113 markings/sec, 230 secs
lola: 17702585 markings, 113198260 edges, 62949 markings/sec, 235 secs
lola: 18010523 markings, 115495017 edges, 61588 markings/sec, 240 secs
lola: 18303333 markings, 117787754 edges, 58562 markings/sec, 245 secs
lola: 18598103 markings, 120085328 edges, 58954 markings/sec, 250 secs
lola: 18923239 markings, 122373689 edges, 65027 markings/sec, 255 secs
lola: 19225400 markings, 124619734 edges, 60432 markings/sec, 260 secs
lola: 19547270 markings, 126875186 edges, 64374 markings/sec, 265 secs
lola: 19888117 markings, 129148785 edges, 68169 markings/sec, 270 secs
lola: 20189807 markings, 131447448 edges, 60338 markings/sec, 275 secs
lola: 20501832 markings, 133723844 edges, 62405 markings/sec, 280 secs
lola: 20835027 markings, 136072390 edges, 66639 markings/sec, 285 secs
lola: 21204225 markings, 138291629 edges, 73840 markings/sec, 290 secs
lola: 21540548 markings, 140456783 edges, 67265 markings/sec, 295 secs
lola: 21856529 markings, 142630918 edges, 63196 markings/sec, 300 secs
lola: 22179066 markings, 144796002 edges, 64507 markings/sec, 305 secs
lola: 22506888 markings, 147008145 edges, 65564 markings/sec, 310 secs
lola: 22804862 markings, 149214235 edges, 59595 markings/sec, 315 secs
lola: 23115870 markings, 151398303 edges, 62202 markings/sec, 320 secs
lola: 23443226 markings, 153561311 edges, 65471 markings/sec, 325 secs
lola: 23744436 markings, 155752830 edges, 60242 markings/sec, 330 secs
lola: 24091467 markings, 157981118 edges, 69406 markings/sec, 335 secs
lola: 24432133 markings, 160104972 edges, 68133 markings/sec, 340 secs
lola: 24756606 markings, 162256482 edges, 64895 markings/sec, 345 secs
lola: 25077633 markings, 164390543 edges, 64205 markings/sec, 350 secs
lola: 25397396 markings, 166549134 edges, 63953 markings/sec, 355 secs
lola: 25742058 markings, 168651877 edges, 68932 markings/sec, 360 secs
lola: 26082791 markings, 170761185 edges, 68147 markings/sec, 365 secs
lola: 26443986 markings, 172831954 edges, 72239 markings/sec, 370 secs
lola: 26836556 markings, 175328362 edges, 78514 markings/sec, 375 secs
lola: 27193139 markings, 177712045 edges, 71317 markings/sec, 380 secs
lola: 27533052 markings, 180085614 edges, 67983 markings/sec, 385 secs
lola: 27850770 markings, 182399848 edges, 63544 markings/sec, 390 secs
lola: 28160486 markings, 184609908 edges, 61943 markings/sec, 395 secs
lola: 28509162 markings, 186838013 edges, 69735 markings/sec, 400 secs
lola: 28877694 markings, 189246676 edges, 73706 markings/sec, 405 secs
lola: 29213423 markings, 191483733 edges, 67146 markings/sec, 410 secs
lola: 29612740 markings, 193875906 edges, 79863 markings/sec, 415 secs
lola: 29997400 markings, 196097297 edges, 76932 markings/sec, 420 secs
lola: 30327549 markings, 198229327 edges, 66030 markings/sec, 425 secs
lola: 30640337 markings, 200365268 edges, 62558 markings/sec, 430 secs
lola: 30953693 markings, 202473401 edges, 62671 markings/sec, 435 secs
lola: 31281079 markings, 204648862 edges, 65477 markings/sec, 440 secs
lola: 31573317 markings, 206789628 edges, 58448 markings/sec, 445 secs
lola: 31872988 markings, 208932901 edges, 59934 markings/sec, 450 secs
lola: 32193027 markings, 211058643 edges, 64008 markings/sec, 455 secs
lola: 32483649 markings, 213198944 edges, 58124 markings/sec, 460 secs
lola: 32811896 markings, 215399032 edges, 65649 markings/sec, 465 secs
lola: 33123211 markings, 217586109 edges, 62263 markings/sec, 470 secs
lola: 33411464 markings, 219743023 edges, 57651 markings/sec, 475 secs
lola: 33690053 markings, 221922454 edges, 55718 markings/sec, 480 secs
lola: 33973880 markings, 224079103 edges, 56765 markings/sec, 485 secs
lola: 34268203 markings, 226265751 edges, 58865 markings/sec, 490 secs
lola: 34562744 markings, 228397269 edges, 58908 markings/sec, 495 secs
lola: 34859944 markings, 230549427 edges, 59440 markings/sec, 500 secs
lola: 35167365 markings, 232667937 edges, 61484 markings/sec, 505 secs
lola: 35483709 markings, 234844444 edges, 63269 markings/sec, 510 secs
lola: 35769248 markings, 237039996 edges, 57108 markings/sec, 515 secs
lola: 36071266 markings, 239214139 edges, 60404 markings/sec, 520 secs
lola: 36395642 markings, 241452131 edges, 64875 markings/sec, 525 secs
lola: 36713609 markings, 243664662 edges, 63593 markings/sec, 530 secs
lola: 37002162 markings, 245825792 edges, 57711 markings/sec, 535 secs
lola: 37282944 markings, 248021942 edges, 56156 markings/sec, 540 secs
lola: 37568832 markings, 250195604 edges, 57178 markings/sec, 545 secs
lola: 37858409 markings, 252406668 edges, 57915 markings/sec, 550 secs
lola: 38127970 markings, 254599807 edges, 53912 markings/sec, 555 secs
lola: 38384154 markings, 256780293 edges, 51237 markings/sec, 560 secs
lola: 38658703 markings, 258956715 edges, 54910 markings/sec, 565 secs
lola: 38946210 markings, 261119614 edges, 57501 markings/sec, 570 secs
lola: 39204677 markings, 263292682 edges, 51693 markings/sec, 575 secs
lola: 39499857 markings, 265563396 edges, 59036 markings/sec, 580 secs
lola: 39805963 markings, 267701693 edges, 61221 markings/sec, 585 secs
lola: 40087662 markings, 269820825 edges, 56340 markings/sec, 590 secs
lola: 40361926 markings, 271967945 edges, 54853 markings/sec, 595 secs
lola: 40649042 markings, 274128031 edges, 57423 markings/sec, 600 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: '`'
Aborted (core dumped)
FORMULA ResAllocation-PT-R100C002-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="ResAllocation-PT-R100C002"
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-R100C002.tgz
mv ResAllocation-PT-R100C002 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-R100C002, 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-152673581000416"
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 '
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 ;