About the Execution of M4M.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 |
| 4124.680 | 510453.00 | 970085.00 | 2338.10 | FFFFFFFF?TFFTTFT | 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 572K
-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.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:27 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 mcc4mcc-full
Input is ResAllocation-PT-R100C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673584100418
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-01
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-02
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-03
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-04
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-05
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-06
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-07
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-08
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-09
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R100C002-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527972943225
BK_STOP 1527973453678
--------------------
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': 'ReachabilityCardinality', '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': 540, 'Memory': 110.82, 'Tool': 'lola'}, {'Time': 720, 'Memory': 111.39, 'Tool': 'lola'}, {'Time': 3434, 'Memory': 321.27, 'Tool': 'itstools'}, {'Time': 4283, 'Memory': 319.95, 'Tool': 'itstools'}, {'Time': 15088, 'Memory': 2353.2, 'Tool': 'marcie'}, {'Time': 17224, 'Memory': 2353.12, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola ResAllocation-PT-R100C002...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ ResAllocation-PT-R100C002 @ 3538 seconds
----- 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-ReachabilityCardinality.task
lola: A (G (((p_1_60 <= r_1_38) OR (1 <= p_1_55)))) : E (F ((((3 <= r_0_77) OR (p_1_75 <= r_0_7) OR ((1 <= r_1_49) AND (2 <= r_1_71))) AND (3 <= p_0_31)))) : E (F ((2 <= r_1_41))) : E (F (((2 <= p_0_66) AND (3 <= r_0_36)))) : E (F ((((3 <= p_1_95) OR (3 <= p_0_21) OR ((r_0_89 <= p_1_85) AND (3 <= p_0_34))) AND (p_0_91 + 1 <= r_0_48)))) : A (G (((p_1_91 <= p_1_23) OR (r_1_24 <= r_0_29)))) : A (G (((r_0_45 <= r_0_31) OR (3 <= p_0_96)))) : E (F ((2 <= p_0_13))) : A (G (((r_1_12 <= p_1_64) OR (p_0_97 <= r_1_79)))) : A (G ((((3 <= p_0_38) AND (p_0_41 <= p_0_17)) OR (r_0_21 <= 2) OR (((3 <= p_0_5) OR (1 <= r_0_35)) AND ((p_0_75 <= p_0_17) OR (r_0_83 <= p_0_73)))))) : A (G ((r_0_38 <= r_1_60))) : E (F (((3 <= r_1_55) AND (p_0_97 <= r_1_77) AND ((1 <= p_0_84) OR (3 <= r_1_74)) AND ((1 <= r_0_27) OR (p_0_50 <= r_1_19) OR (p_1_72 <= r_1_13))))) : A (G (((p_1_19 <= 2) OR ((p_1_62 <= r_0_80) AND (3 <= r_0_29)) OR (1 <= p_1_90)))) : E (F ((1 <= p_0_32))) : A (G ((((2 <= r_1_26) AND (3 <= p_1_98) AND (2 <= p_1_90)) OR (p_1_2 <= r_0_26)))) : E (F (((r_1_72 <= 0) AND (p_0_94 <= 2) AND ((r_1_72 <= r_0_98) OR (2 <= r_1_75) OR (p_0_18 <= r_1_55) OR (p_0_98 <= p_0_34)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_1_60 <= r_1_38) OR (1 <= p_1_55))))
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 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 103 markings, 102 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= r_0_77) OR (p_1_75 <= r_0_7) OR ((1 <= r_1_49) AND (2 <= r_1_71))) AND (3 <= p_0_31))))
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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
========================================
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= r_1_41)))
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-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-2.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p_0_66) AND (3 <= r_0_36))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-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_95) OR (3 <= p_0_21) OR ((r_0_89 <= p_1_85) AND (3 <= p_0_34))) AND (p_0_91 + 1 <= r_0_48))))
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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-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 (G (((p_1_91 <= p_1_23) OR (r_1_24 <= r_0_29))))
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 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r_0_45 <= r_0_31) OR (3 <= p_0_96))))
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 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p_0_13)))
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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-6.sara.
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r_1_12 <= p_1_64) OR (p_0_97 <= r_1_79))))
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 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 588314 markings, 1075621 edges, 117663 markings/sec, 0 secs
lola: sara is running 5 secs || 1172762 markings, 2189533 edges, 116890 markings/sec, 5 secs
lola: sara is running 10 secs || 1728243 markings, 3352516 edges, 111096 markings/sec, 10 secs
lola: sara is running 15 secs || 2298494 markings, 4580904 edges, 114050 markings/sec, 15 secs
sara: warning, failure of lp_solve (at job 581)
lola: sara is running 20 secs || 2822236 markings, 6063557 edges, 104748 markings/sec, 20 secs
lola: sara is running 25 secs || 3307628 markings, 7494753 edges, 97078 markings/sec, 25 secs
lola: sara is running 30 secs || 3826251 markings, 8820602 edges, 103725 markings/sec, 30 secs
lola: sara is running 35 secs || 4373703 markings, 9859111 edges, 109490 markings/sec, 35 secs
lola: sara is running 40 secs || 4888676 markings, 11041021 edges, 102995 markings/sec, 40 secs
lola: sara is running 45 secs || 5357005 markings, 12360858 edges, 93666 markings/sec, 45 secs
lola: sara is running 50 secs || 5825201 markings, 13823776 edges, 93639 markings/sec, 50 secs
lola: sara is running 55 secs || 6308887 markings, 15360595 edges, 96737 markings/sec, 55 secs
lola: sara is running 60 secs || 6884965 markings, 16562345 edges, 115216 markings/sec, 60 secs
lola: sara is running 65 secs || 7345825 markings, 17988765 edges, 92172 markings/sec, 65 secs
lola: sara is running 70 secs || 7810575 markings, 19445275 edges, 92950 markings/sec, 70 secs
lola: sara is running 75 secs || 8242185 markings, 20939687 edges, 86322 markings/sec, 75 secs
lola: sara is running 80 secs || 8682027 markings, 22415072 edges, 87968 markings/sec, 80 secs
lola: sara is running 85 secs || 9133433 markings, 23977978 edges, 90281 markings/sec, 85 secs
lola: sara is running 90 secs || 9609127 markings, 25361594 edges, 95139 markings/sec, 90 secs
lola: sara is running 95 secs || 10056947 markings, 26745768 edges, 89564 markings/sec, 95 secs
lola: sara is running 100 secs || 10511109 markings, 28157363 edges, 90832 markings/sec, 100 secs
lola: sara is running 105 secs || 10914290 markings, 29649749 edges, 80636 markings/sec, 105 secs
lola: sara is running 110 secs || 11312303 markings, 31147090 edges, 79603 markings/sec, 110 secs
lola: sara is running 115 secs || 11739149 markings, 32626885 edges, 85369 markings/sec, 115 secs
lola: sara is running 120 secs || 12226775 markings, 34119264 edges, 97525 markings/sec, 120 secs
lola: sara is running 125 secs || 12680374 markings, 35481260 edges, 90720 markings/sec, 125 secs
lola: sara is running 130 secs || 13122332 markings, 36811032 edges, 88392 markings/sec, 130 secs
lola: sara is running 135 secs || 13563233 markings, 38133892 edges, 88180 markings/sec, 135 secs
lola: sara is running 140 secs || 14014152 markings, 39436145 edges, 90184 markings/sec, 140 secs
lola: sara is running 145 secs || 14475425 markings, 40731255 edges, 92255 markings/sec, 145 secs
lola: sara is running 150 secs || 14939365 markings, 42112935 edges, 92788 markings/sec, 150 secs
lola: sara is running 155 secs || 15421272 markings, 43418316 edges, 96381 markings/sec, 155 secs
lola: sara is running 160 secs || 15897131 markings, 44828535 edges, 95172 markings/sec, 160 secs
lola: sara is running 165 secs || 16319387 markings, 46342708 edges, 84451 markings/sec, 165 secs
lola: sara is running 170 secs || 16686476 markings, 47789128 edges, 73418 markings/sec, 170 secs
lola: sara is running 175 secs || 17079839 markings, 49257858 edges, 78673 markings/sec, 175 secs
lola: sara is running 180 secs || 17463592 markings, 50706788 edges, 76751 markings/sec, 180 secs
lola: sara is running 185 secs || 17844790 markings, 52190529 edges, 76240 markings/sec, 185 secs
lola: sara is running 190 secs || 18220557 markings, 53683293 edges, 75153 markings/sec, 190 secs
lola: sara is running 195 secs || 18622959 markings, 55111513 edges, 80480 markings/sec, 195 secs
lola: sara is running 200 secs || 19015814 markings, 56699044 edges, 78571 markings/sec, 200 secs
lola: sara is running 205 secs || 19464657 markings, 58246985 edges, 89769 markings/sec, 205 secs
lola: sara is running 210 secs || 19872826 markings, 59746727 edges, 81634 markings/sec, 210 secs
lola: sara is running 215 secs || 20313273 markings, 61118401 edges, 88089 markings/sec, 215 secs
lola: sara is running 220 secs || 20844726 markings, 62437850 edges, 106291 markings/sec, 220 secs
lola: sara is running 225 secs || 21308416 markings, 63831479 edges, 92738 markings/sec, 225 secs
lola: sara is running 230 secs || 21711178 markings, 65347953 edges, 80552 markings/sec, 230 secs
lola: sara is running 235 secs || 22161048 markings, 67007918 edges, 89974 markings/sec, 235 secs
lola: sara is running 240 secs || 22563506 markings, 68628208 edges, 80492 markings/sec, 240 secs
lola: sara is running 245 secs || 22932659 markings, 70111900 edges, 73831 markings/sec, 245 secs
lola: sara is running 250 secs || 23337808 markings, 71729123 edges, 81030 markings/sec, 250 secs
lola: sara is running 255 secs || 23793776 markings, 73088129 edges, 91194 markings/sec, 255 secs
lola: sara is running 260 secs || 24252771 markings, 74363738 edges, 91799 markings/sec, 260 secs
lola: sara is running 265 secs || 24662925 markings, 75718125 edges, 82031 markings/sec, 265 secs
lola: sara is running 270 secs || 25087981 markings, 77122205 edges, 85011 markings/sec, 270 secs
lola: sara is running 275 secs || 25636234 markings, 78278148 edges, 109651 markings/sec, 275 secs
lola: sara is running 280 secs || 26188932 markings, 79351889 edges, 110540 markings/sec, 280 secs
lola: sara is running 285 secs || 26670575 markings, 80607709 edges, 96329 markings/sec, 285 secs
lola: sara is running 290 secs || 27115310 markings, 81983249 edges, 88947 markings/sec, 290 secs
lola: sara is running 295 secs || 27577065 markings, 83276916 edges, 92351 markings/sec, 295 secs
lola: sara is running 300 secs || 28015367 markings, 84634636 edges, 87660 markings/sec, 300 secs
lola: sara is running 305 secs || 28465603 markings, 85941425 edges, 90047 markings/sec, 305 secs
lola: sara is running 310 secs || 28912969 markings, 87275796 edges, 89473 markings/sec, 310 secs
lola: sara is running 315 secs || 29376755 markings, 88579201 edges, 92757 markings/sec, 315 secs
lola: sara is running 320 secs || 29824669 markings, 89936489 edges, 89583 markings/sec, 320 secs
lola: sara is running 325 secs || 30300338 markings, 91217266 edges, 95134 markings/sec, 325 secs
lola: sara is running 330 secs || 30754848 markings, 92574670 edges, 90902 markings/sec, 330 secs
lola: sara is running 335 secs || 31197461 markings, 93936300 edges, 88523 markings/sec, 335 secs
lola: sara is running 340 secs || 31630596 markings, 95325638 edges, 86627 markings/sec, 340 secs
lola: sara is running 345 secs || 32007985 markings, 96870623 edges, 75478 markings/sec, 345 secs
lola: sara is running 350 secs || 32387226 markings, 98415006 edges, 75848 markings/sec, 350 secs
lola: sara is running 355 secs || 32787836 markings, 99926980 edges, 80122 markings/sec, 355 secs
lola: sara is running 360 secs || 33158461 markings, 101408570 edges, 74125 markings/sec, 360 secs
lola: sara is running 365 secs || 33550760 markings, 102918642 edges, 78460 markings/sec, 365 secs
lola: sara is running 370 secs || 33929038 markings, 104403349 edges, 75656 markings/sec, 370 secs
lola: sara is running 375 secs || 34320062 markings, 105855523 edges, 78205 markings/sec, 375 secs
lola: sara is running 380 secs || 34749105 markings, 107207178 edges, 85809 markings/sec, 380 secs
lola: sara is running 385 secs || 35209491 markings, 108505707 edges, 92077 markings/sec, 385 secs
lola: sara is running 390 secs || 35603527 markings, 109984360 edges, 78807 markings/sec, 390 secs
lola: sara is running 395 secs || 35997368 markings, 111469505 edges, 78768 markings/sec, 395 secs
lola: sara is running 400 secs || 36369364 markings, 112985361 edges, 74399 markings/sec, 400 secs
lola: sara is running 405 secs || 36752439 markings, 114498879 edges, 76615 markings/sec, 405 secs
lola: sara is running 410 secs || 37152913 markings, 115982363 edges, 80095 markings/sec, 410 secs
lola: sara is running 415 secs || 37548247 markings, 117536217 edges, 79067 markings/sec, 415 secs
lola: sara is running 420 secs || 38026444 markings, 119162549 edges, 95639 markings/sec, 420 secs
lola: sara is running 425 secs || 38496070 markings, 120759179 edges, 93925 markings/sec, 425 secs
lola: sara is running 430 secs || 38909620 markings, 122271817 edges, 82710 markings/sec, 430 secs
lola: sara is running 435 secs || 39371872 markings, 123702240 edges, 92450 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p_0_38) AND (p_0_41 <= p_0_17)) OR (r_0_21 <= 2) OR (((3 <= p_0_5) OR (1 <= r_0_35)) AND ((p_0_75 <= p_0_17) OR (r_0_83 <= p_0_73))))))
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 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((r_0_38 <= r_1_60)))
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 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-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= r_1_55) AND (p_0_97 <= r_1_77) AND ((1 <= p_0_84) OR (3 <= r_1_74)) AND ((1 <= r_0_27) OR (p_0_50 <= r_1_19) OR (p_1_72 <= r_1_13)))))
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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-11.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 12 will run for 773 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_1_19 <= 2) OR ((p_1_62 <= r_0_80) AND (3 <= r_0_29)) OR (1 <= p_1_90))))
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 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 13 will run for 1031 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p_0_32)))
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-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1546 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= r_1_26) AND (3 <= p_1_98) AND (2 <= p_1_90)) OR (p_1_2 <= r_0_26))))
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 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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-13.sara.
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 508582 markings, 1435095 edges, 101716 markings/sec, 0 secs
lola: sara is running 5 secs || 1048020 markings, 3001778 edges, 107888 markings/sec, 5 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3082 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((r_1_72 <= 0) AND (p_0_94 <= 2) AND ((r_1_72 <= r_0_98) OR (2 <= r_1_75) OR (p_0_18 <= r_1_55) OR (p_0_98 <= p_0_34)))))
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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no unknown yes no no yes yes no yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/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 mcc4mcc-full"
echo " Input is ResAllocation-PT-R100C002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r142-qhx2-152673584100418"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;