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 2.0M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K 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 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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.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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-blw7-152650003500238
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527196219113


BK_STOP 1527196755204

--------------------
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 FlexibleBarrier-PT-22b 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': 758787, 'Memory': 784.36, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-22b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ FlexibleBarrier-PT-22b @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13947/65536 symbol table entries, 4218 collisions
lola: preprocessing...
lola: finding significant places
lola: 6478 places, 7469 transitions, 6454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7515 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t4794) AND FIREABLE(t603) AND NOT FIREABLE(t1328) AND FIREABLE(t730) AND FIREABLE(t4452)))) : E (F ((NOT FIREABLE(t3203) AND NOT FIREABLE(t2537) AND FIREABLE(t1458) AND FIREABLE(t3902) AND NOT FIREABLE(t6642) AND (FIREABLE(t546) OR FIREABLE(t4905))))) : E (F (FIREABLE(t4683))) : E (F ((FIREABLE(t6637) OR FIREABLE(t1031) OR FIREABLE(t4004)))) : E (F ((NOT FIREABLE(t2403) AND NOT FIREABLE(t946) AND FIREABLE(t2480) AND (FIREABLE(t845) OR FIREABLE(t7070) OR (FIREABLE(t6082) AND FIREABLE(t7199))) AND FIREABLE(t2196)))) : A (G ((NOT FIREABLE(t1203) OR NOT FIREABLE(t4656)))) : A (G ((FIREABLE(t7210) OR FIREABLE(t747) OR NOT FIREABLE(t7319) OR FIREABLE(t5474) OR NOT FIREABLE(t228) OR (((FIREABLE(t2037) AND FIREABLE(t2616)) OR (FIREABLE(t7204) AND FIREABLE(t4882))) AND FIREABLE(t1155))))) : E (F (((FIREABLE(t2146) AND FIREABLE(t1690) AND (FIREABLE(t1995) OR FIREABLE(t3146)) AND NOT FIREABLE(t5286) AND NOT FIREABLE(t22)) OR FIREABLE(t4759)))) : E (F (FIREABLE(t928))) : E (F (((((FIREABLE(t6500) AND FIREABLE(t5378)) OR FIREABLE(t3835)) AND (NOT FIREABLE(t7088) OR (FIREABLE(t5290) AND FIREABLE(t5222)))) OR FIREABLE(t1383)))) : E (F ((FIREABLE(t6969) AND FIREABLE(t250)))) : E (F ((NOT FIREABLE(t6427) AND NOT FIREABLE(t6041) AND FIREABLE(t7321) AND FIREABLE(t5595)))) : E (F (((NOT FIREABLE(t4957) OR FIREABLE(t4254)) AND FIREABLE(t5080)))) : E (F (FIREABLE(t6686))) : A (G ((FIREABLE(t1112) OR FIREABLE(t1709) OR (FIREABLE(t6154) AND FIREABLE(t1097)) OR (NOT FIREABLE(t4636) AND NOT FIREABLE(t6457)) OR (FIREABLE(t603) AND (FIREABLE(t1462) OR FIREABLE(t1855)) AND FIREABLE(t5693))))) : E (F ((FIREABLE(t3335) AND FIREABLE(t2952) AND (NOT FIREABLE(t4466) OR NOT FIREABLE(t6385) OR NOT FIREABLE(t6018) OR NOT FIREABLE(t903)))))
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(t4794) AND FIREABLE(t603) AND NOT FIREABLE(t1328) AND FIREABLE(t730) AND FIREABLE(t4452))))
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 808 bytes per marking, with 10 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 32488 markings, 62926 edges, 6498 markings/sec, 0 secs
lola: sara is running 5 secs || 63811 markings, 124291 edges, 6265 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 96856 markings, 189426 edges, 6609 markings/sec, 10 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 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3203) AND NOT FIREABLE(t2537) AND FIREABLE(t1458) AND FIREABLE(t3902) AND NOT FIREABLE(t6642) AND (FIREABLE(t546) OR FIREABLE(t4905)))))
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 808 bytes per marking, with 10 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 36 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 36824 markings, 82162 edges, 7365 markings/sec, 0 secs
lola: sara is running 5 secs || 75261 markings, 167450 edges, 7687 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 111856 markings, 262161 edges, 7319 markings/sec, 10 secs
lola: sara is running 15 secs || 147814 markings, 351708 edges, 7192 markings/sec, 15 secs
lola: sara is running 20 secs || 186318 markings, 436862 edges, 7701 markings/sec, 20 secs
lola: sara is running 25 secs || 223272 markings, 525849 edges, 7391 markings/sec, 25 secs
lola: sara is running 30 secs || 259773 markings, 618342 edges, 7300 markings/sec, 30 secs
lola: sara is running 35 secs || 297096 markings, 706072 edges, 7465 markings/sec, 35 secs
lola: sara is running 40 secs || 335457 markings, 791094 edges, 7672 markings/sec, 40 secs
lola: sara is running 45 secs || 372375 markings, 883765 edges, 7384 markings/sec, 45 secs
lola: sara is running 50 secs || 407997 markings, 975501 edges, 7124 markings/sec, 50 secs
lola: sara is running 55 secs || 446491 markings, 1060641 edges, 7699 markings/sec, 55 secs
lola: sara is running 60 secs || 483979 markings, 1147589 edges, 7498 markings/sec, 60 secs
lola: sara is running 65 secs || 520735 markings, 1240834 edges, 7351 markings/sec, 65 secs
lola: sara is running 70 secs || 557374 markings, 1330042 edges, 7328 markings/sec, 70 secs
lola: sara is running 75 secs || 594977 markings, 1413690 edges, 7521 markings/sec, 75 secs
lola: sara is running 80 secs || 630837 markings, 1500951 edges, 7172 markings/sec, 80 secs
lola: sara is running 85 secs || 666607 markings, 1590763 edges, 7154 markings/sec, 85 secs
lola: sara is running 90 secs || 702503 markings, 1677518 edges, 7179 markings/sec, 90 secs
lola: sara is running 95 secs || 740062 markings, 1761088 edges, 7512 markings/sec, 95 secs
lola: sara is running 100 secs || 775985 markings, 1848366 edges, 7185 markings/sec, 100 secs
lola: sara is running 105 secs || 811889 markings, 1937986 edges, 7181 markings/sec, 105 secs
lola: sara is running 110 secs || 846481 markings, 2023093 edges, 6918 markings/sec, 110 secs
lola: sara is running 115 secs || 883850 markings, 2106437 edges, 7474 markings/sec, 115 secs
lola: sara is running 120 secs || 920291 markings, 2191508 edges, 7288 markings/sec, 120 secs
lola: sara is running 125 secs || 956270 markings, 2282299 edges, 7196 markings/sec, 125 secs
lola: sara is running 130 secs || 991257 markings, 2370034 edges, 6997 markings/sec, 130 secs
lola: sara is running 135 secs || 1029124 markings, 2454128 edges, 7573 markings/sec, 135 secs
lola: sara is running 140 secs || 1065834 markings, 2539848 edges, 7342 markings/sec, 140 secs
lola: sara is running 145 secs || 1102052 markings, 2630999 edges, 7244 markings/sec, 145 secs
lola: sara is running 150 secs || 1135899 markings, 2717229 edges, 6769 markings/sec, 150 secs
lola: sara is running 155 secs || 1166729 markings, 2829005 edges, 6166 markings/sec, 155 secs
lola: sara is running 160 secs || 1196577 markings, 2939098 edges, 5970 markings/sec, 160 secs
lola: sara is running 165 secs || 1226464 markings, 3045564 edges, 5977 markings/sec, 165 secs
lola: sara is running 170 secs || 1256990 markings, 3156260 edges, 6105 markings/sec, 170 secs
lola: sara is running 175 secs || 1287926 markings, 3268827 edges, 6187 markings/sec, 175 secs
lola: sara is running 180 secs || 1318877 markings, 3381870 edges, 6190 markings/sec, 180 secs
lola: sara is running 185 secs || 1349758 markings, 3495062 edges, 6176 markings/sec, 185 secs
lola: sara is running 190 secs || 1380790 markings, 3608347 edges, 6206 markings/sec, 190 secs
lola: sara is running 195 secs || 1411994 markings, 3720901 edges, 6241 markings/sec, 195 secs
lola: sara is running 200 secs || 1443287 markings, 3833507 edges, 6259 markings/sec, 200 secs
lola: sara is running 205 secs || 1474512 markings, 3946699 edges, 6245 markings/sec, 205 secs
lola: sara is running 210 secs || 1505217 markings, 4055910 edges, 6141 markings/sec, 210 secs
lola: sara is running 215 secs || 1536670 markings, 4167128 edges, 6291 markings/sec, 215 secs
lola: sara is running 220 secs || 1564985 markings, 4281626 edges, 5663 markings/sec, 220 secs
lola: sara is running 225 secs || 1588997 markings, 4413137 edges, 4802 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4683)))
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 808 bytes per marking, with 10 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-22b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6637) OR FIREABLE(t1031) OR FIREABLE(t4004))))
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 808 bytes per marking, with 10 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 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2403) AND NOT FIREABLE(t946) AND FIREABLE(t2480) AND (FIREABLE(t845) OR FIREABLE(t7070) OR (FIREABLE(t6082) AND FIREABLE(t7199))) AND FIREABLE(t2196))))
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 808 bytes per marking, with 10 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 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 32144 markings, 62344 edges, 6429 markings/sec, 0 secs
lola: sara is running 5 secs || 64702 markings, 126560 edges, 6512 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97271 markings, 190799 edges, 6514 markings/sec, 10 secs
lola: sara is running 15 secs || 129865 markings, 254914 edges, 6519 markings/sec, 15 secs

lola: sara is running 20 secs || 161036 markings, 318033 edges, 6234 markings/sec, 20 secs
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 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1203) OR NOT FIREABLE(t4656))))
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 808 bytes per marking, with 10 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-22b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 29982 markings, 57068 edges, 5996 markings/sec, 0 secs
lola: sara is running 5 secs || 61842 markings, 119831 edges, 6372 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t7210) OR FIREABLE(t747) OR NOT FIREABLE(t7319) OR FIREABLE(t5474) OR NOT FIREABLE(t228) OR (((FIREABLE(t2037) AND FIREABLE(t2616)) OR (FIREABLE(t7204) AND FIREABLE(t4882))) AND FIREABLE(t1155)))))
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 808 bytes per marking, with 10 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 240 literals and 27 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 30532 markings, 58563 edges, 6106 markings/sec, 0 secs
lola: sara is running 5 secs || 62385 markings, 120958 edges, 6371 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 92404 markings, 182772 edges, 6004 markings/sec, 10 secs
lola: sara is running 15 secs || 124277 markings, 244434 edges, 6375 markings/sec, 15 secs
lola: sara is running 20 secs || 156080 markings, 306784 edges, 6361 markings/sec, 20 secs
lola: sara is running 25 secs || 186215 markings, 368485 edges, 6027 markings/sec, 25 secs
lola: sara is running 30 secs || 218074 markings, 430417 edges, 6372 markings/sec, 30 secs
lola: sara is running 35 secs || 249953 markings, 492917 edges, 6376 markings/sec, 35 secs
lola: sara is running 40 secs || 281016 markings, 554726 edges, 6213 markings/sec, 40 secs
lola: sara is running 45 secs || 311915 markings, 616986 edges, 6180 markings/sec, 45 secs
lola: sara is running 50 secs || 343829 markings, 679082 edges, 6383 markings/sec, 50 secs
lola: sara is running 55 secs || 375718 markings, 741539 edges, 6378 markings/sec, 55 secs
lola: sara is running 60 secs || 405778 markings, 803434 edges, 6012 markings/sec, 60 secs
lola: sara is running 65 secs || 437713 markings, 865227 edges, 6387 markings/sec, 65 secs
lola: sara is running 70 secs || 467413 markings, 930249 edges, 5940 markings/sec, 70 secs
lola: sara is running 75 secs || 491646 markings, 1017845 edges, 4847 markings/sec, 75 secs
lola: sara is running 80 secs || 520826 markings, 1083375 edges, 5836 markings/sec, 80 secs
lola: sara is running 85 secs || 544905 markings, 1168709 edges, 4816 markings/sec, 85 secs
lola: sara is running 90 secs || 567935 markings, 1268497 edges, 4606 markings/sec, 90 secs
lola: sara is running 95 secs || 591014 markings, 1369415 edges, 4616 markings/sec, 95 secs
lola: sara is running 100 secs || 614041 markings, 1470737 edges, 4605 markings/sec, 100 secs
lola: sara is running 105 secs || 637285 markings, 1570939 edges, 4649 markings/sec, 105 secs
lola: sara is running 110 secs || 660531 markings, 1671961 edges, 4649 markings/sec, 110 secs

lola: sara is running 115 secs || 683189 markings, 1773927 edges, 4532 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2146) AND FIREABLE(t1690) AND (FIREABLE(t1995) OR FIREABLE(t3146)) AND NOT FIREABLE(t5286) AND NOT FIREABLE(t22)) OR FIREABLE(t4759))))
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 808 bytes per marking, with 10 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 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t928)))
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 808 bytes per marking, with 10 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-22b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 32468 markings, 63023 edges, 6494 markings/sec, 0 secs
lola: sara is running 5 secs || 65067 markings, 127352 edges, 6520 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97638 markings, 191570 edges, 6514 markings/sec, 10 secs
lola: sara is running 15 secs || 129397 markings, 254840 edges, 6352 markings/sec, 15 secs
lola: sara is running 20 secs || 160209 markings, 329013 edges, 6162 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 9 will run for 443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(t6500) AND FIREABLE(t5378)) OR FIREABLE(t3835)) AND (NOT FIREABLE(t7088) OR (FIREABLE(t5290) AND FIREABLE(t5222)))) OR FIREABLE(t1383))))
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 808 bytes per marking, with 10 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 27 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6969) AND FIREABLE(t250))))
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 808 bytes per marking, with 10 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 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 33075 markings, 64431 edges, 6615 markings/sec, 0 secs
lola: sara is running 5 secs || 66068 markings, 129474 edges, 6599 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 98708 markings, 193692 edges, 6528 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 616 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t6427) AND NOT FIREABLE(t6041) AND FIREABLE(t7321) AND FIREABLE(t5595))))
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 808 bytes per marking, with 10 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-22b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 32951 markings, 64398 edges, 6590 markings/sec, 0 secs
lola: sara is running 5 secs || 66006 markings, 129351 edges, 6611 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 99017 markings, 194513 edges, 6602 markings/sec, 10 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 767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t4957) OR FIREABLE(t4254)) AND FIREABLE(t5080))))
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 808 bytes per marking, with 10 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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara.
lola: sara is running 0 secs || 31893 markings, 61858 edges, 6379 markings/sec, 0 secs
lola: sara is running 5 secs || 64685 markings, 126492 edges, 6558 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97696 markings, 191554 edges, 6602 markings/sec, 10 secs

lola: sara is running 15 secs || 129637 markings, 255197 edges, 6388 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 13 will run for 1015 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t6686)))
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 808 bytes per marking, with 10 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 14 will run for 1523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1112) OR FIREABLE(t1709) OR (FIREABLE(t6154) AND FIREABLE(t1097)) OR (NOT FIREABLE(t4636) AND NOT FIREABLE(t6457)) OR (FIREABLE(t603) AND (FIREABLE(t1462) OR FIREABLE(t1855)) AND FIREABLE(t5693)))))
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 808 bytes per marking, with 10 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 70 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 15 will run for 3047 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3335) AND FIREABLE(t2952) AND (NOT FIREABLE(t4466) OR NOT FIREABLE(t6385) OR NOT FIREABLE(t6018) OR NOT FIREABLE(t903)))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 47 markings, 46 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes yes no no yes yes yes yes no yes yes yes no yes
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
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/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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 FlexibleBarrier-PT-22b, 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 r091-blw7-152650003500238"
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 ;