About the Execution of M4M.struct for FlexibleBarrier-PT-22b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 796.230 | 532428.00 | 997371.00 | 147.00 | F?TTFFTTTTFTTTFT | 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 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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 26 09:26 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 mcc4mcc-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 r095-blw7-152650007200238
=====================================================================
--------------------
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 1527611922115
BK_STOP 1527612454543
--------------------
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 stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 || 33232 markings, 64565 edges, 6646 markings/sec, 0 secs
lola: sara is running 5 secs || 66295 markings, 129734 edges, 6613 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 99381 markings, 194953 edges, 6617 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: 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: ========================================
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 || 39121 markings, 85939 edges, 7824 markings/sec, 0 secs
lola: sara is running 5 secs || 76920 markings, 175286 edges, 7560 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 112964 markings, 264314 edges, 7209 markings/sec, 10 secs
lola: sara is running 15 secs || 149896 markings, 355142 edges, 7386 markings/sec, 15 secs
lola: sara is running 20 secs || 188878 markings, 441082 edges, 7796 markings/sec, 20 secs
lola: sara is running 25 secs || 226371 markings, 533703 edges, 7499 markings/sec, 25 secs
lola: sara is running 30 secs || 262252 markings, 626975 edges, 7176 markings/sec, 30 secs
lola: sara is running 35 secs || 301104 markings, 712680 edges, 7770 markings/sec, 35 secs
lola: sara is running 40 secs || 338860 markings, 802403 edges, 7551 markings/sec, 40 secs
lola: sara is running 45 secs || 376030 markings, 896229 edges, 7434 markings/sec, 45 secs
lola: sara is running 50 secs || 413769 markings, 985032 edges, 7548 markings/sec, 50 secs
lola: sara is running 55 secs || 452796 markings, 1071336 edges, 7805 markings/sec, 55 secs
lola: sara is running 60 secs || 489953 markings, 1166921 edges, 7431 markings/sec, 60 secs
lola: sara is running 65 secs || 526523 markings, 1257503 edges, 7314 markings/sec, 65 secs
lola: sara is running 70 secs || 565418 markings, 1343300 edges, 7779 markings/sec, 70 secs
lola: sara is running 75 secs || 601928 markings, 1431584 edges, 7302 markings/sec, 75 secs
lola: sara is running 80 secs || 637946 markings, 1523141 edges, 7204 markings/sec, 80 secs
lola: sara is running 85 secs || 674756 markings, 1610122 edges, 7362 markings/sec, 85 secs
lola: sara is running 90 secs || 712859 markings, 1694628 edges, 7621 markings/sec, 90 secs
lola: sara is running 95 secs || 749410 markings, 1784550 edges, 7310 markings/sec, 95 secs
lola: sara is running 100 secs || 784467 markings, 1876516 edges, 7011 markings/sec, 100 secs
lola: sara is running 105 secs || 822036 markings, 1961170 edges, 7514 markings/sec, 105 secs
lola: sara is running 110 secs || 859843 markings, 2045565 edges, 7561 markings/sec, 110 secs
lola: sara is running 115 secs || 896122 markings, 2137575 edges, 7256 markings/sec, 115 secs
lola: sara is running 120 secs || 931207 markings, 2227698 edges, 7017 markings/sec, 120 secs
lola: sara is running 125 secs || 969276 markings, 2312180 edges, 7614 markings/sec, 125 secs
lola: sara is running 130 secs || 1006896 markings, 2397546 edges, 7524 markings/sec, 130 secs
lola: sara is running 135 secs || 1043401 markings, 2490850 edges, 7301 markings/sec, 135 secs
lola: sara is running 140 secs || 1079286 markings, 2580140 edges, 7177 markings/sec, 140 secs
lola: sara is running 145 secs || 1117194 markings, 2664279 edges, 7582 markings/sec, 145 secs
lola: sara is running 150 secs || 1149080 markings, 2765477 edges, 6377 markings/sec, 150 secs
lola: sara is running 155 secs || 1180575 markings, 2878700 edges, 6299 markings/sec, 155 secs
lola: sara is running 160 secs || 1212005 markings, 2992747 edges, 6286 markings/sec, 160 secs
lola: sara is running 165 secs || 1243488 markings, 3106972 edges, 6297 markings/sec, 165 secs
lola: sara is running 170 secs || 1274933 markings, 3222396 edges, 6289 markings/sec, 170 secs
lola: sara is running 175 secs || 1306515 markings, 3336369 edges, 6316 markings/sec, 175 secs
lola: sara is running 180 secs || 1338030 markings, 3449719 edges, 6303 markings/sec, 180 secs
lola: sara is running 185 secs || 1369426 markings, 3564429 edges, 6279 markings/sec, 185 secs
lola: sara is running 190 secs || 1400835 markings, 3679611 edges, 6282 markings/sec, 190 secs
lola: sara is running 195 secs || 1432280 markings, 3795079 edges, 6289 markings/sec, 195 secs
lola: sara is running 200 secs || 1464146 markings, 3908993 edges, 6373 markings/sec, 200 secs
lola: sara is running 205 secs || 1495557 markings, 4022352 edges, 6282 markings/sec, 205 secs
lola: sara is running 210 secs || 1526481 markings, 4130425 edges, 6185 markings/sec, 210 secs
lola: sara is running 215 secs || 1557467 markings, 4250953 edges, 6197 markings/sec, 215 secs
lola: sara is running 220 secs || 1583058 markings, 4375334 edges, 5118 markings/sec, 220 secs
lola: sara is running 225 secs || 1606900 markings, 4518580 edges, 4768 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 235 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 || 32796 markings, 63910 edges, 6559 markings/sec, 0 secs
lola: sara is running 5 secs || 64213 markings, 125554 edges, 6283 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97053 markings, 190335 edges, 6568 markings/sec, 10 secs
lola: sara is running 15 secs || 129305 markings, 253037 edges, 6450 markings/sec, 15 secs
lola: sara is running 20 secs || 160344 markings, 317249 edges, 6208 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 || 32623 markings, 62797 edges, 6525 markings/sec, 0 secs
lola: sara is running 5 secs || 65154 markings, 126821 edges, 6506 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 || 31768 markings, 61282 edges, 6354 markings/sec, 0 secs
lola: sara is running 5 secs || 64086 markings, 124762 edges, 6464 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 95705 markings, 187523 edges, 6324 markings/sec, 10 secs
lola: sara is running 15 secs || 126784 markings, 250609 edges, 6216 markings/sec, 15 secs
lola: sara is running 20 secs || 159099 markings, 313397 edges, 6463 markings/sec, 20 secs
lola: sara is running 25 secs || 191439 markings, 376924 edges, 6468 markings/sec, 25 secs
lola: sara is running 30 secs || 222891 markings, 439724 edges, 6290 markings/sec, 30 secs
lola: sara is running 35 secs || 254348 markings, 503212 edges, 6291 markings/sec, 35 secs
lola: sara is running 40 secs || 286761 markings, 566251 edges, 6483 markings/sec, 40 secs
lola: sara is running 45 secs || 319111 markings, 629793 edges, 6470 markings/sec, 45 secs
lola: sara is running 50 secs || 350666 markings, 692610 edges, 6311 markings/sec, 50 secs
lola: sara is running 55 secs || 382012 markings, 756074 edges, 6269 markings/sec, 55 secs
lola: sara is running 60 secs || 414410 markings, 819053 edges, 6480 markings/sec, 60 secs
lola: sara is running 65 secs || 446773 markings, 882657 edges, 6473 markings/sec, 65 secs
lola: sara is running 70 secs || 474191 markings, 960748 edges, 5484 markings/sec, 70 secs
lola: sara is running 75 secs || 501165 markings, 1040006 edges, 5395 markings/sec, 75 secs
lola: sara is running 80 secs || 529285 markings, 1104798 edges, 5624 markings/sec, 80 secs
lola: sara is running 85 secs || 552884 markings, 1203505 edges, 4720 markings/sec, 85 secs
lola: sara is running 90 secs || 576296 markings, 1305303 edges, 4682 markings/sec, 90 secs
lola: sara is running 95 secs || 599710 markings, 1408876 edges, 4683 markings/sec, 95 secs
lola: sara is running 100 secs || 623400 markings, 1510486 edges, 4738 markings/sec, 100 secs
lola: sara is running 105 secs || 647011 markings, 1613172 edges, 4722 markings/sec, 105 secs
lola: sara is running 110 secs || 670750 markings, 1716383 edges, 4748 markings/sec, 110 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 || 32223 markings, 62520 edges, 6445 markings/sec, 0 secs
lola: sara is running 5 secs || 65001 markings, 127192 edges, 6556 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97724 markings, 191753 edges, 6545 markings/sec, 10 secs
lola: sara is running 15 secs || 129718 markings, 255375 edges, 6399 markings/sec, 15 secs
lola: sara is running 20 secs || 160583 markings, 330056 edges, 6173 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 517 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 || 31343 markings, 60650 edges, 6269 markings/sec, 0 secs
lola: sara is running 5 secs || 64093 markings, 125114 edges, 6550 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 96711 markings, 189320 edges, 6524 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 617 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 || 31881 markings, 61838 edges, 6376 markings/sec, 0 secs
lola: sara is running 5 secs || 64390 markings, 125935 edges, 6502 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 96845 markings, 189929 edges, 6491 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 768 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 || 32218 markings, 62575 edges, 6444 markings/sec, 0 secs
lola: sara is running 5 secs || 65015 markings, 127191 edges, 6559 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97752 markings, 191681 edges, 6547 markings/sec, 10 secs
lola: sara is running 15 secs || 129622 markings, 255167 edges, 6374 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 1017 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: state equation: calling and running sara
sara: try reading problem file 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 1525 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: 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 3051 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 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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-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 mcc4mcc-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 r095-blw7-152650007200238"
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 '
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 ;