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 1.1M
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 945K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is FlexibleBarrier-PT-16b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001200196
=====================================================================

--------------------
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 FlexibleBarrier-PT-16b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1527062880318


BK_STOP 1527063047894

--------------------
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 FlexibleBarrier-PT-16b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 119476, 'Memory': 332.91, 'Tool': 'lola'}, {'Time': 2872566, 'Memory': 15935.5, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-16b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-16b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ FlexibleBarrier-PT-16b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7473/65536 symbol table entries, 1468 collisions
lola: preprocessing...
lola: finding significant places
lola: 3472 places, 4001 transitions, 3454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4035 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-16b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t3819) AND FIREABLE(t916) AND NOT FIREABLE(t2378) AND FIREABLE(t62) AND (NOT FIREABLE(t927) OR NOT FIREABLE(t290) OR (FIREABLE(t3561) AND FIREABLE(t3698) AND NOT FIREABLE(t3416)))))) : E (F ((FIREABLE(t2764) OR FIREABLE(t3210) OR (FIREABLE(t1949) AND FIREABLE(t276))))) : E (F ((NOT FIREABLE(t2803) AND NOT FIREABLE(t643) AND (NOT FIREABLE(t63) OR NOT FIREABLE(t600)) AND (FIREABLE(t876) OR (FIREABLE(t1172) AND FIREABLE(t1333) AND NOT FIREABLE(t1482)))))) : E (F ((((FIREABLE(t3732) OR FIREABLE(t2475) OR (FIREABLE(t3048) AND FIREABLE(t1702))) AND FIREABLE(t3902)) OR FIREABLE(t1795)))) : E (F ((FIREABLE(t1254) OR FIREABLE(t2478)))) : A (G (NOT FIREABLE(t3401))) : E (F ((FIREABLE(t1117) AND NOT FIREABLE(t2237)))) : E (F (FIREABLE(t455))) : A (G ((NOT FIREABLE(t3456) OR NOT FIREABLE(t1626) OR (NOT FIREABLE(t3794) AND NOT FIREABLE(t703)) OR NOT FIREABLE(t166)))) : E (F (FIREABLE(t3490))) : E (F (FIREABLE(t2532))) : E (F ((NOT FIREABLE(t2563) AND FIREABLE(t807)))) : A (G ((NOT FIREABLE(t2905) OR NOT FIREABLE(t757)))) : A (G (((NOT FIREABLE(t607) AND NOT FIREABLE(t3805)) OR (FIREABLE(t3075) AND FIREABLE(t2638) AND FIREABLE(t454)) OR NOT FIREABLE(t3705) OR NOT FIREABLE(t463) OR (NOT FIREABLE(t1184) AND NOT FIREABLE(t106))))) : A (G ((NOT FIREABLE(t2560) OR NOT FIREABLE(t2949) OR (NOT FIREABLE(t3989) AND NOT FIREABLE(t2373)) OR (NOT FIREABLE(t2366) AND NOT FIREABLE(t2852) AND NOT FIREABLE(t1269) AND NOT FIREABLE(t1581))))) : E (F (((FIREABLE(t711) OR FIREABLE(t1722)) AND NOT FIREABLE(t1244) AND FIREABLE(t511) AND FIREABLE(t3029) AND NOT FIREABLE(t1040) AND FIREABLE(t2028))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3819) AND FIREABLE(t916) AND NOT FIREABLE(t2378) AND FIREABLE(t62) AND (NOT FIREABLE(t927) OR NOT FIREABLE(t290) OR (FIREABLE(t3561) AND FIREABLE(t3698) AND NOT FIREABLE(t3416))))))
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 432 bytes per marking, with 2 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 40 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 58522 markings, 153094 edges, 11704 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2764) OR FIREABLE(t3210) OR (FIREABLE(t1949) AND FIREABLE(t276)))))
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 432 bytes per marking, with 2 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 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2803) AND NOT FIREABLE(t643) AND (NOT FIREABLE(t63) OR NOT FIREABLE(t600)) AND (FIREABLE(t876) OR (FIREABLE(t1172) AND FIREABLE(t1333) AND NOT FIREABLE(t1482))))))
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 432 bytes per marking, with 2 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t3732) OR FIREABLE(t2475) OR (FIREABLE(t3048) AND FIREABLE(t1702))) AND FIREABLE(t3902)) OR FIREABLE(t1795))))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 59786 markings, 155322 edges, 11957 markings/sec, 0 secs
lola: sara is running 5 secs || 118396 markings, 317462 edges, 11722 markings/sec, 5 secs
lola: sara is running 10 secs || 177514 markings, 475228 edges, 11824 markings/sec, 10 secs
lola: sara is running 15 secs || 239684 markings, 644552 edges, 12434 markings/sec, 15 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1254) OR FIREABLE(t2478))))
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 432 bytes per marking, with 2 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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t3401)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: ========================================
lola: subprocess 6 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1117) AND NOT FIREABLE(t2237))))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 62953 markings, 155397 edges, 12591 markings/sec, 0 secs
lola: sara is running 5 secs || 127229 markings, 315841 edges, 12855 markings/sec, 5 secs
lola: sara is running 10 secs || 193645 markings, 481085 edges, 13283 markings/sec, 10 secs
lola: sara is running 15 secs || 253214 markings, 665488 edges, 11914 markings/sec, 15 secs
lola: sara is running 20 secs || 305137 markings, 861265 edges, 10385 markings/sec, 20 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t455)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3456) OR NOT FIREABLE(t1626) OR (NOT FIREABLE(t3794) AND NOT FIREABLE(t703)) OR NOT FIREABLE(t166))))
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 432 bytes per marking, with 2 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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 60800 markings, 159432 edges, 12160 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3490)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2532)))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 61970 markings, 153736 edges, 12394 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 692 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2563) AND FIREABLE(t807))))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 61594 markings, 158969 edges, 12319 markings/sec, 0 secs
lola: sara is running 5 secs || 123820 markings, 330585 edges, 12445 markings/sec, 5 secs
lola: sara is running 10 secs || 186494 markings, 501072 edges, 12535 markings/sec, 10 secs
lola: sara is running 15 secs || 250291 markings, 668748 edges, 12759 markings/sec, 15 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 860 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2905) OR NOT FIREABLE(t757))))
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 432 bytes per marking, with 2 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 FlexibleBarrier-PT-16b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 13 will run for 1146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t607) AND NOT FIREABLE(t3805)) OR (FIREABLE(t3075) AND FIREABLE(t2638) AND FIREABLE(t454)) OR NOT FIREABLE(t3705) OR NOT FIREABLE(t463) OR (NOT FIREABLE(t1184) AND NOT FIREABLE(t106)))))
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 432 bytes per marking, with 2 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 96 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 63559 markings, 162457 edges, 12712 markings/sec, 0 secs
lola: sara is running 5 secs || 125160 markings, 318720 edges, 12320 markings/sec, 5 secs
lola: sara is running 10 secs || 182417 markings, 469122 edges, 11451 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 14 will run for 1710 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2560) OR NOT FIREABLE(t2949) OR (NOT FIREABLE(t3989) AND NOT FIREABLE(t2373)) OR (NOT FIREABLE(t2366) AND NOT FIREABLE(t2852) AND NOT FIREABLE(t1269) AND NOT FIREABLE(t1581)))))
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 432 bytes per marking, with 2 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 32 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 78 markings, 77 edges
lola: ========================================
lola: subprocess 15 will run for 3421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t711) OR FIREABLE(t1722)) AND NOT FIREABLE(t1244) AND FIREABLE(t511) AND FIREABLE(t3029) AND NOT FIREABLE(t1040) AND FIREABLE(t2028))))
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 432 bytes per marking, with 2 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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-16b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-16b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 57760 markings, 151742 edges, 11552 markings/sec, 0 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes yes yes yes yes no yes no yes
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="FlexibleBarrier-PT-16b"
export BK_EXAMINATION="ReachabilityFireability"
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/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b 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 FlexibleBarrier-PT-16b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-blw7-152650001200196"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;