fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r095-blw7-152650007100210
Last Updated
June 26, 2018

About the Execution of M4M.struct for FlexibleBarrier-PT-18b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1572.970 468495.00 858242.00 197.30 FTTTF?TTTFFFTTTF 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 1.4M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 7.3K 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 15K 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.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.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007100210
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527605295859


BK_STOP 1527605764354

--------------------
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-18b 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': 352438, 'Memory': 2912.1, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-18b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-18b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ FlexibleBarrier-PT-18b @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 9407/65536 symbol table entries, 2286 collisions
lola: preprocessing...
lola: finding significant places
lola: 4370 places, 5037 transitions, 4350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5075 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-18b-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t1628) OR NOT FIREABLE(t1789)) AND NOT FIREABLE(t861) AND FIREABLE(t3485) AND (FIREABLE(t4828) OR FIREABLE(t3397))))) : E (F ((FIREABLE(t4293) AND FIREABLE(t2533) AND (FIREABLE(t1573) OR FIREABLE(t1778)) AND (FIREABLE(t3895) OR (FIREABLE(t650) AND FIREABLE(t1403))) AND FIREABLE(t1099)))) : E (F ((FIREABLE(t4198) OR (FIREABLE(t1626) AND (NOT FIREABLE(t2319) OR FIREABLE(t917)))))) : E (F (FIREABLE(t4922))) : A (G ((NOT FIREABLE(t2857) OR NOT FIREABLE(t4130) OR NOT FIREABLE(t1898) OR FIREABLE(t1510)))) : E (F ((FIREABLE(t2422) AND FIREABLE(t3586) AND (FIREABLE(t591) OR FIREABLE(t1944)) AND (FIREABLE(t1041) OR FIREABLE(t2170) OR (FIREABLE(t1945) AND FIREABLE(t2764))) AND (NOT FIREABLE(t2597) OR NOT FIREABLE(t179) OR NOT FIREABLE(t3158) OR NOT FIREABLE(t1045))))) : E (F (FIREABLE(t3719))) : E (F (FIREABLE(t4418))) : E (F ((NOT FIREABLE(t1255) AND FIREABLE(t1703) AND FIREABLE(t3352) AND FIREABLE(t814) AND (NOT FIREABLE(t4131) OR NOT FIREABLE(t865))))) : A (G ((((FIREABLE(t132) OR FIREABLE(t5005) OR (FIREABLE(t127) AND FIREABLE(t4015))) AND FIREABLE(t2660)) OR NOT FIREABLE(t3139)))) : A (G (((NOT FIREABLE(t2483) OR NOT FIREABLE(t1900) OR (NOT FIREABLE(t3402) AND NOT FIREABLE(t657))) AND NOT FIREABLE(t363)))) : A (G (NOT FIREABLE(t2686))) : E (F (FIREABLE(t772))) : E (F ((FIREABLE(t3663) OR (NOT FIREABLE(t4229) AND NOT FIREABLE(t4256) AND (FIREABLE(t2989) OR FIREABLE(t160) OR (FIREABLE(t4066) AND FIREABLE(t3744))))))) : E (F (FIREABLE(t1927))) : A (G ((FIREABLE(t1498) OR FIREABLE(t2153) OR (FIREABLE(t1703) AND FIREABLE(t524)) OR (FIREABLE(t4195) AND NOT FIREABLE(t1763)) OR NOT FIREABLE(t4635))))
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 (((NOT FIREABLE(t1628) OR NOT FIREABLE(t1789)) AND NOT FIREABLE(t861) AND FIREABLE(t3485) AND (FIREABLE(t4828) OR FIREABLE(t3397)))))
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 544 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-18b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 51987 markings, 94907 edges, 10397 markings/sec, 0 secs
lola: sara is running 5 secs || 105047 markings, 192065 edges, 10612 markings/sec, 5 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(t4293) AND FIREABLE(t2533) AND (FIREABLE(t1573) OR FIREABLE(t1778)) AND (FIREABLE(t3895) OR (FIREABLE(t650) AND FIREABLE(t1403))) AND FIREABLE(t1099))))
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 544 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 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 47816 markings, 92803 edges, 9563 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 97410 markings, 191983 edges, 9919 markings/sec, 5 secs
lola: sara is running 10 secs || 148159 markings, 291694 edges, 10150 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 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4198) OR (FIREABLE(t1626) AND (NOT FIREABLE(t2319) OR FIREABLE(t917))))))
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 544 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 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4922)))
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 544 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-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 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2857) OR NOT FIREABLE(t4130) OR NOT FIREABLE(t1898) OR FIREABLE(t1510))))
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 544 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 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 53815 markings, 97360 edges, 10763 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 106393 markings, 194906 edges, 10516 markings/sec, 5 secs
lola: sara is running 10 secs || 158858 markings, 292016 edges, 10493 markings/sec, 10 secs
lola: sara is running 15 secs || 210019 markings, 386472 edges, 10232 markings/sec, 15 secs
lola: sara is running 20 secs || 261956 markings, 482703 edges, 10387 markings/sec, 20 secs
lola: sara is running 25 secs || 304331 markings, 619211 edges, 8475 markings/sec, 25 secs
lola: sara is running 30 secs || 345474 markings, 765402 edges, 8229 markings/sec, 30 secs
sara: warning, failure of lp_solve (at job 79)
lola: sara is running 35 secs || 384969 markings, 917273 edges, 7899 markings/sec, 35 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2422) AND FIREABLE(t3586) AND (FIREABLE(t591) OR FIREABLE(t1944)) AND (FIREABLE(t1041) OR FIREABLE(t2170) OR (FIREABLE(t1945) AND FIREABLE(t2764))) AND (NOT FIREABLE(t2597) OR NOT FIREABLE(t179) OR NOT FIREABLE(t3158) OR NOT FIREABLE(t1045)))))
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 544 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: ========================================
lola: state equation: Generated DNF with 128 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 51261 markings, 100898 edges, 10252 markings/sec, 0 secs
lola: sara is running 5 secs || 101793 markings, 204079 edges, 10106 markings/sec, 5 secs
lola: sara is running 10 secs || 152240 markings, 308570 edges, 10089 markings/sec, 10 secs
lola: sara is running 15 secs || 203013 markings, 408594 edges, 10155 markings/sec, 15 secs
lola: sara is running 20 secs || 251119 markings, 504647 edges, 9621 markings/sec, 20 secs
lola: sara is running 25 secs || 296775 markings, 623516 edges, 9131 markings/sec, 25 secs
lola: sara is running 30 secs || 337428 markings, 769522 edges, 8131 markings/sec, 30 secs
lola: sara is running 35 secs || 378374 markings, 915084 edges, 8189 markings/sec, 35 secs
lola: sara is running 40 secs || 416894 markings, 1044375 edges, 7704 markings/sec, 40 secs
lola: sara is running 45 secs || 453204 markings, 1208307 edges, 7262 markings/sec, 45 secs
lola: sara is running 50 secs || 487084 markings, 1377990 edges, 6776 markings/sec, 50 secs
lola: sara is running 55 secs || 525983 markings, 1501351 edges, 7780 markings/sec, 55 secs
lola: sara is running 60 secs || 573555 markings, 1604504 edges, 9514 markings/sec, 60 secs
lola: sara is running 65 secs || 621110 markings, 1699335 edges, 9511 markings/sec, 65 secs
lola: sara is running 70 secs || 669062 markings, 1802390 edges, 9590 markings/sec, 70 secs
lola: sara is running 75 secs || 717842 markings, 1900008 edges, 9756 markings/sec, 75 secs
lola: sara is running 80 secs || 768120 markings, 1998955 edges, 10056 markings/sec, 80 secs
lola: sara is running 85 secs || 815830 markings, 2095609 edges, 9542 markings/sec, 85 secs
lola: sara is running 90 secs || 856195 markings, 2240426 edges, 8073 markings/sec, 90 secs
lola: sara is running 95 secs || 897282 markings, 2388055 edges, 8217 markings/sec, 95 secs
lola: sara is running 100 secs || 935660 markings, 2509871 edges, 7676 markings/sec, 100 secs
lola: sara is running 105 secs || 971758 markings, 2663650 edges, 7220 markings/sec, 105 secs
lola: sara is running 110 secs || 1006697 markings, 2828166 edges, 6988 markings/sec, 110 secs
lola: sara is running 115 secs || 1042412 markings, 2975052 edges, 7143 markings/sec, 115 secs
lola: sara is running 120 secs || 1085993 markings, 3090656 edges, 8716 markings/sec, 120 secs
lola: sara is running 125 secs || 1134460 markings, 3185404 edges, 9693 markings/sec, 125 secs
lola: sara is running 130 secs || 1181620 markings, 3288889 edges, 9432 markings/sec, 130 secs
lola: sara is running 135 secs || 1231156 markings, 3385927 edges, 9907 markings/sec, 135 secs
lola: sara is running 140 secs || 1280001 markings, 3484265 edges, 9769 markings/sec, 140 secs
lola: sara is running 145 secs || 1330523 markings, 3583339 edges, 10104 markings/sec, 145 secs
lola: sara is running 150 secs || 1373936 markings, 3708007 edges, 8683 markings/sec, 150 secs
lola: sara is running 155 secs || 1414064 markings, 3852567 edges, 8026 markings/sec, 155 secs
lola: sara is running 160 secs || 1454278 markings, 3990886 edges, 8043 markings/sec, 160 secs
lola: sara is running 165 secs || 1491917 markings, 4124782 edges, 7528 markings/sec, 165 secs
lola: sara is running 170 secs || 1528720 markings, 4290236 edges, 7361 markings/sec, 170 secs
lola: sara is running 175 secs || 1561895 markings, 4455865 edges, 6635 markings/sec, 175 secs
lola: sara is running 180 secs || 1601254 markings, 4577267 edges, 7872 markings/sec, 180 secs
lola: sara is running 185 secs || 1648849 markings, 4676454 edges, 9519 markings/sec, 185 secs
lola: sara is running 190 secs || 1697229 markings, 4770876 edges, 9676 markings/sec, 190 secs
lola: sara is running 195 secs || 1744504 markings, 4874330 edges, 9455 markings/sec, 195 secs
lola: sara is running 200 secs || 1794216 markings, 4972087 edges, 9942 markings/sec, 200 secs
lola: sara is running 205 secs || 1844449 markings, 5070589 edges, 10047 markings/sec, 205 secs
lola: sara is running 210 secs || 1892060 markings, 5176813 edges, 9522 markings/sec, 210 secs
lola: sara is running 215 secs || 1931953 markings, 5319740 edges, 7979 markings/sec, 215 secs
lola: sara is running 220 secs || 1972332 markings, 5464636 edges, 8076 markings/sec, 220 secs
lola: sara is running 225 secs || 2011964 markings, 5588836 edges, 7926 markings/sec, 225 secs
lola: sara is running 230 secs || 2047398 markings, 5746666 edges, 7087 markings/sec, 230 secs
lola: sara is running 235 secs || 2081791 markings, 5911096 edges, 6879 markings/sec, 235 secs
lola: sara is running 240 secs || 2117876 markings, 6051532 edges, 7217 markings/sec, 240 secs
lola: sara is running 245 secs || 2163240 markings, 6164673 edges, 9073 markings/sec, 245 secs
lola: sara is running 250 secs || 2213809 markings, 6263944 edges, 10114 markings/sec, 250 secs
lola: sara is running 255 secs || 2262412 markings, 6370588 edges, 9721 markings/sec, 255 secs
lola: sara is running 260 secs || 2313136 markings, 6470542 edges, 10145 markings/sec, 260 secs
lola: sara is running 265 secs || 2363807 markings, 6570368 edges, 10134 markings/sec, 265 secs
lola: sara is running 270 secs || 2414947 markings, 6670864 edges, 10228 markings/sec, 270 secs
lola: sara is running 275 secs || 2455535 markings, 6808183 edges, 8118 markings/sec, 275 secs
lola: sara is running 280 secs || 2495926 markings, 6953152 edges, 8078 markings/sec, 280 secs
lola: sara is running 285 secs || 2536322 markings, 7085496 edges, 8079 markings/sec, 285 secs
lola: sara is running 290 secs || 2573876 markings, 7237354 edges, 7511 markings/sec, 290 secs
lola: sara is running 295 secs || 2609887 markings, 7406208 edges, 7202 markings/sec, 295 secs
lola: sara is running 300 secs || 2646319 markings, 7560135 edges, 7286 markings/sec, 300 secs
lola: sara is running 305 secs || 2689607 markings, 7677575 edges, 8658 markings/sec, 305 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3719)))
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 544 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-18b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 7 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4418)))
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 544 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-18b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1255) AND FIREABLE(t1703) AND FIREABLE(t3352) AND FIREABLE(t814) AND (NOT FIREABLE(t4131) OR NOT FIREABLE(t865)))))
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 544 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 58 markings, 57 edges
lola: ========================================
lola: subprocess 9 will run for 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t132) OR FIREABLE(t5005) OR (FIREABLE(t127) AND FIREABLE(t4015))) AND FIREABLE(t2660)) OR NOT FIREABLE(t3139))))
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 544 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 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 10 will run for 525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t2483) OR NOT FIREABLE(t1900) OR (NOT FIREABLE(t3402) AND NOT FIREABLE(t657))) AND NOT FIREABLE(t363))))
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 544 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-10.sara.lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 11 will run for 630 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2686)))
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 544 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-18b-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 788 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t772)))
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 544 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-18b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 13 will run for 1051 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3663) OR (NOT FIREABLE(t4229) AND NOT FIREABLE(t4256) AND (FIREABLE(t2989) OR FIREABLE(t160) OR (FIREABLE(t4066) AND FIREABLE(t3744)))))))
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 544 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 11 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-13.sara.
lola: sara is running 0 secs || 49910 markings, 97707 edges, 9982 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 101872 markings, 200292 edges, 10392 markings/sec, 5 secs
lola: sara is running 10 secs || 153924 markings, 303096 edges, 10410 markings/sec, 10 secs
lola: sara is running 15 secs || 206050 markings, 405546 edges, 10425 markings/sec, 15 secs
lola: sara is running 20 secs || 256775 markings, 507500 edges, 10145 markings/sec, 20 secs
lola: sara is running 25 secs || 300743 markings, 641677 edges, 8794 markings/sec, 25 secs
lola: sara is running 30 secs || 345047 markings, 776899 edges, 8861 markings/sec, 30 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1927)))
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 544 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-18b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 15 will run for 3114 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1498) OR FIREABLE(t2153) OR (FIREABLE(t1703) AND FIREABLE(t524)) OR (FIREABLE(t4195) AND NOT FIREABLE(t1763)) OR NOT FIREABLE(t4635))))
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 544 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 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no unknown yes yes yes no no no yes yes yes no
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-15 FALSE 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-18b"
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-18b.tgz
mv FlexibleBarrier-PT-18b 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-18b, 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-152650007100210"
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 ;