About the Execution of Irma.struct for ResAllocation-PT-R100C002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4228.710 | 522176.00 | 971096.00 | 3646.80 | 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 irma4mcc-structural
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 r139-qhx2-152673581600418
=====================================================================
--------------------
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 1527804130057
BK_STOP 1527804652233
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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...
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 ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ ResAllocation-PT-R100C002 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 103 markings, 102 edges
lola: ========================================
lola: state equation: calling and running sara
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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality.sara.
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
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: state equation: calling and running sara
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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-5.sara.
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: subprocess 7 will run for 392 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: ========================================
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-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 || 606802 markings, 1120936 edges, 121360 markings/sec, 0 secs
lola: sara is running 5 secs || 1192632 markings, 2231020 edges, 117166 markings/sec, 5 secs
lola: sara is running 10 secs || 1752878 markings, 3403738 edges, 112049 markings/sec, 10 secs
lola: sara is running 15 secs || 2324608 markings, 4643272 edges, 114346 markings/sec, 15 secs
sara: warning, failure of lp_solve (at job 581)
lola: sara is running 20 secs || 2845519 markings, 6133128 edges, 104182 markings/sec, 20 secs
lola: sara is running 25 secs || 3393841 markings, 7666512 edges, 109664 markings/sec, 25 secs
lola: sara is running 30 secs || 3921865 markings, 9018395 edges, 105605 markings/sec, 30 secs
lola: sara is running 35 secs || 4496086 markings, 10115701 edges, 114844 markings/sec, 35 secs
lola: sara is running 40 secs || 5010420 markings, 11356446 edges, 102867 markings/sec, 40 secs
lola: sara is running 45 secs || 5506088 markings, 12755004 edges, 99134 markings/sec, 45 secs
lola: sara is running 50 secs || 5943928 markings, 14236501 edges, 87568 markings/sec, 50 secs
lola: sara is running 55 secs || 6445455 markings, 15694923 edges, 100305 markings/sec, 55 secs
lola: sara is running 60 secs || 6998348 markings, 16913983 edges, 110579 markings/sec, 60 secs
lola: sara is running 65 secs || 7459830 markings, 18340236 edges, 92296 markings/sec, 65 secs
lola: sara is running 70 secs || 7915266 markings, 19809391 edges, 91087 markings/sec, 70 secs
lola: sara is running 75 secs || 8362882 markings, 21357195 edges, 89523 markings/sec, 75 secs
lola: sara is running 80 secs || 8863714 markings, 22869224 edges, 100166 markings/sec, 80 secs
lola: sara is running 85 secs || 9288645 markings, 24471871 edges, 84986 markings/sec, 85 secs
lola: sara is running 90 secs || 9771034 markings, 25861635 edges, 96478 markings/sec, 90 secs
lola: sara is running 95 secs || 10237257 markings, 27284346 edges, 93245 markings/sec, 95 secs
lola: sara is running 100 secs || 10694423 markings, 28772454 edges, 91433 markings/sec, 100 secs
lola: sara is running 105 secs || 11081249 markings, 30315428 edges, 77365 markings/sec, 105 secs
lola: sara is running 110 secs || 11483309 markings, 31881463 edges, 80412 markings/sec, 110 secs
lola: sara is running 115 secs || 12027427 markings, 33463091 edges, 108824 markings/sec, 115 secs
lola: sara is running 120 secs || 12496430 markings, 35002736 edges, 93801 markings/sec, 120 secs
lola: sara is running 125 secs || 12987928 markings, 36395200 edges, 98300 markings/sec, 125 secs
lola: sara is running 130 secs || 13456143 markings, 37779324 edges, 93643 markings/sec, 130 secs
lola: sara is running 135 secs || 13925463 markings, 39162395 edges, 93864 markings/sec, 135 secs
lola: sara is running 140 secs || 14399085 markings, 40552143 edges, 94724 markings/sec, 140 secs
lola: sara is running 145 secs || 14894860 markings, 41931218 edges, 99155 markings/sec, 145 secs
lola: sara is running 150 secs || 15392972 markings, 43300585 edges, 99622 markings/sec, 150 secs
lola: sara is running 155 secs || 15873247 markings, 44731429 edges, 96055 markings/sec, 155 secs
lola: sara is running 160 secs || 16316087 markings, 46329625 edges, 88568 markings/sec, 160 secs
lola: sara is running 165 secs || 16718698 markings, 47885420 edges, 80522 markings/sec, 165 secs
lola: sara is running 170 secs || 17124255 markings, 49434465 edges, 81111 markings/sec, 170 secs
lola: sara is running 175 secs || 17526812 markings, 50949330 edges, 80511 markings/sec, 175 secs
lola: sara is running 180 secs || 17908727 markings, 52446350 edges, 76383 markings/sec, 180 secs
lola: sara is running 185 secs || 18309415 markings, 53948719 edges, 80138 markings/sec, 185 secs
lola: sara is running 190 secs || 18697974 markings, 55466826 edges, 77712 markings/sec, 190 secs
lola: sara is running 195 secs || 19146125 markings, 57099951 edges, 89630 markings/sec, 195 secs
lola: sara is running 200 secs || 19603852 markings, 58683569 edges, 91545 markings/sec, 200 secs
lola: sara is running 205 secs || 20015105 markings, 60192924 edges, 82251 markings/sec, 205 secs
lola: sara is running 210 secs || 20495977 markings, 61682421 edges, 96174 markings/sec, 210 secs
lola: sara is running 215 secs || 21035349 markings, 63026532 edges, 107874 markings/sec, 215 secs
lola: sara is running 220 secs || 21508674 markings, 64552972 edges, 94665 markings/sec, 220 secs
lola: sara is running 225 secs || 21972686 markings, 66267183 edges, 92802 markings/sec, 225 secs
lola: sara is running 230 secs || 22408155 markings, 68008408 edges, 87094 markings/sec, 230 secs
lola: sara is running 235 secs || 22818309 markings, 69656268 edges, 82031 markings/sec, 235 secs
lola: sara is running 240 secs || 23230810 markings, 71304937 edges, 82500 markings/sec, 240 secs
lola: sara is running 245 secs || 23693403 markings, 72839736 edges, 92519 markings/sec, 245 secs
lola: sara is running 250 secs || 24180401 markings, 74112349 edges, 97400 markings/sec, 250 secs
lola: sara is running 255 secs || 24598348 markings, 75510015 edges, 83589 markings/sec, 255 secs
lola: sara is running 260 secs || 25027554 markings, 76913354 edges, 85841 markings/sec, 260 secs
lola: sara is running 265 secs || 25557914 markings, 78112619 edges, 106072 markings/sec, 265 secs
lola: sara is running 270 secs || 26115586 markings, 79271724 edges, 111534 markings/sec, 270 secs
lola: sara is running 275 secs || 26640522 markings, 80511987 edges, 104987 markings/sec, 275 secs
lola: sara is running 280 secs || 27093225 markings, 81915506 edges, 90541 markings/sec, 280 secs
lola: sara is running 285 secs || 27566393 markings, 83254486 edges, 94634 markings/sec, 285 secs
lola: sara is running 290 secs || 28022228 markings, 84655762 edges, 91167 markings/sec, 290 secs
lola: sara is running 295 secs || 28499113 markings, 86010396 edges, 95377 markings/sec, 295 secs
lola: sara is running 300 secs || 28970157 markings, 87399920 edges, 94209 markings/sec, 300 secs
lola: sara is running 305 secs || 29440799 markings, 88775650 edges, 94128 markings/sec, 305 secs
lola: sara is running 310 secs || 29915739 markings, 90182366 edges, 94988 markings/sec, 310 secs
lola: sara is running 315 secs || 30384529 markings, 91558732 edges, 93758 markings/sec, 315 secs
lola: sara is running 320 secs || 30865577 markings, 92917653 edges, 96210 markings/sec, 320 secs
lola: sara is running 325 secs || 31343852 markings, 94285574 edges, 95655 markings/sec, 325 secs
lola: sara is running 330 secs || 31749238 markings, 95811857 edges, 81077 markings/sec, 330 secs
lola: sara is running 335 secs || 32129920 markings, 97364543 edges, 76136 markings/sec, 335 secs
lola: sara is running 340 secs || 32533470 markings, 98888080 edges, 80710 markings/sec, 340 secs
lola: sara is running 345 secs || 32915667 markings, 100451095 edges, 76439 markings/sec, 345 secs
lola: sara is running 350 secs || 33314007 markings, 101963496 edges, 79668 markings/sec, 350 secs
lola: sara is running 355 secs || 33723388 markings, 103497297 edges, 81876 markings/sec, 355 secs
lola: sara is running 360 secs || 34104600 markings, 105051348 edges, 76242 markings/sec, 360 secs
lola: sara is running 365 secs || 34522485 markings, 106516243 edges, 83577 markings/sec, 365 secs
lola: sara is running 370 secs || 34984110 markings, 107935645 edges, 92325 markings/sec, 370 secs
lola: sara is running 375 secs || 35439205 markings, 109342375 edges, 91019 markings/sec, 375 secs
lola: sara is running 380 secs || 35829333 markings, 110908481 edges, 78026 markings/sec, 380 secs
lola: sara is running 385 secs || 36225687 markings, 112445315 edges, 79271 markings/sec, 385 secs
lola: sara is running 390 secs || 36633723 markings, 113974994 edges, 81607 markings/sec, 390 secs
lola: sara is running 395 secs || 37023656 markings, 115531598 edges, 77987 markings/sec, 395 secs
lola: sara is running 400 secs || 37415450 markings, 117118209 edges, 78359 markings/sec, 400 secs
lola: sara is running 405 secs || 37902835 markings, 118780773 edges, 97477 markings/sec, 405 secs
lola: sara is running 410 secs || 38407928 markings, 120430867 edges, 101019 markings/sec, 410 secs
lola: sara is running 415 secs || 38846652 markings, 122042304 edges, 87745 markings/sec, 415 secs
lola: sara is running 420 secs || 39317951 markings, 123590507 edges, 94260 markings/sec, 420 secs
lola: sara is running 425 secs || 39836906 markings, 124852827 edges, 103791 markings/sec, 425 secs
lola: sara is running 430 secs || 40299192 markings, 126281342 edges, 92457 markings/sec, 430 secs
lola: sara is running 435 secs || 40706286 markings, 127783049 edges, 81419 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: state equation: calling and running sara
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
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-10.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
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 1030 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: state equation: calling and running sara
lola: ========================================
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
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
sara: try reading problem file ResAllocation-PT-R100C002-ReachabilityCardinality-13.sara.
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 || 536800 markings, 1516644 edges, 107360 markings/sec, 0 secs
lola: sara is running 5 secs || 1109147 markings, 3180069 edges, 114469 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to ResAllocation-PT-R100C002-ReachabilityCardinality-15.sara
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no unknown yes no no yes yes no yes
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 stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R100C002"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
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-structural"
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 r139-qhx2-152673581600418"
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 ;