fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Irma.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
1558.160 468223.00 857060.00 224.60 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K 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 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 irma4mcc-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 r091-blw7-152650003500210
=====================================================================

--------------------
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 1527194106024


BK_STOP 1527194574247

--------------------
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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
ReachabilityFireability @ FlexibleBarrier-PT-18b @ 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: 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.
lola: sara is running 0 secs || 47908 markings, 87178 edges, 9582 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 97777 markings, 178968 edges, 9974 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 || 48353 markings, 94078 edges, 9671 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 97934 markings, 193560 edges, 9916 markings/sec, 5 secs

lola: sara is running 10 secs || 148601 markings, 292607 edges, 10133 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
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-2.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 || 51381 markings, 94261 edges, 10276 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 104091 markings, 190120 edges, 10542 markings/sec, 5 secs
lola: sara is running 10 secs || 155955 markings, 286015 edges, 10373 markings/sec, 10 secs
lola: sara is running 15 secs || 207743 markings, 381787 edges, 10358 markings/sec, 15 secs
lola: sara is running 20 secs || 259187 markings, 476848 edges, 10289 markings/sec, 20 secs
lola: sara is running 25 secs || 301183 markings, 607949 edges, 8399 markings/sec, 25 secs
lola: sara is running 30 secs || 341637 markings, 751893 edges, 8091 markings/sec, 30 secs
sara: warning, failure of lp_solve (at job 79)
lola: sara is running 35 secs || 381876 markings, 896090 edges, 8048 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 || 49334 markings, 96304 edges, 9867 markings/sec, 0 secs
lola: sara is running 5 secs || 99576 markings, 200138 edges, 10048 markings/sec, 5 secs
lola: sara is running 10 secs || 149762 markings, 304455 edges, 10037 markings/sec, 10 secs
lola: sara is running 15 secs || 200344 markings, 405011 edges, 10116 markings/sec, 15 secs
lola: sara is running 20 secs || 251394 markings, 505254 edges, 10210 markings/sec, 20 secs
lola: sara is running 25 secs || 297087 markings, 624658 edges, 9139 markings/sec, 25 secs
lola: sara is running 30 secs || 337567 markings, 770051 edges, 8096 markings/sec, 30 secs
lola: sara is running 35 secs || 378192 markings, 914557 edges, 8125 markings/sec, 35 secs
lola: sara is running 40 secs || 417054 markings, 1044920 edges, 7772 markings/sec, 40 secs
lola: sara is running 45 secs || 453594 markings, 1209621 edges, 7308 markings/sec, 45 secs
lola: sara is running 50 secs || 488179 markings, 1382202 edges, 6917 markings/sec, 50 secs
lola: sara is running 55 secs || 527693 markings, 1506535 edges, 7903 markings/sec, 55 secs
lola: sara is running 60 secs || 575843 markings, 1609558 edges, 9630 markings/sec, 60 secs
lola: sara is running 65 secs || 624530 markings, 1706007 edges, 9737 markings/sec, 65 secs
lola: sara is running 70 secs || 672990 markings, 1811073 edges, 9692 markings/sec, 70 secs
lola: sara is running 75 secs || 723429 markings, 1910402 edges, 10088 markings/sec, 75 secs
lola: sara is running 80 secs || 774236 markings, 2010309 edges, 10161 markings/sec, 80 secs
lola: sara is running 85 secs || 822138 markings, 2118226 edges, 9580 markings/sec, 85 secs
lola: sara is running 90 secs || 862297 markings, 2262320 edges, 8032 markings/sec, 90 secs
lola: sara is running 95 secs || 903387 markings, 2409938 edges, 8218 markings/sec, 95 secs
lola: sara is running 100 secs || 941831 markings, 2531482 edges, 7689 markings/sec, 100 secs
lola: sara is running 105 secs || 978029 markings, 2691336 edges, 7240 markings/sec, 105 secs
lola: sara is running 110 secs || 1013009 markings, 2861794 edges, 6996 markings/sec, 110 secs
lola: sara is running 115 secs || 1050410 markings, 2998674 edges, 7480 markings/sec, 115 secs
lola: sara is running 120 secs || 1095766 markings, 3110178 edges, 9071 markings/sec, 120 secs
lola: sara is running 125 secs || 1145304 markings, 3207574 edges, 9908 markings/sec, 125 secs
lola: sara is running 130 secs || 1193535 markings, 3313556 edges, 9646 markings/sec, 130 secs
lola: sara is running 135 secs || 1244690 markings, 3414357 edges, 10231 markings/sec, 135 secs
lola: sara is running 140 secs || 1296198 markings, 3515611 edges, 10302 markings/sec, 140 secs
lola: sara is running 145 secs || 1347923 markings, 3617739 edges, 10345 markings/sec, 145 secs
lola: sara is running 150 secs || 1388350 markings, 3759577 edges, 8085 markings/sec, 150 secs
lola: sara is running 155 secs || 1429275 markings, 3907028 edges, 8185 markings/sec, 155 secs
lola: sara is running 160 secs || 1469427 markings, 4035610 edges, 8030 markings/sec, 160 secs
lola: sara is running 165 secs || 1506165 markings, 4189980 edges, 7348 markings/sec, 165 secs
lola: sara is running 170 secs || 1541846 markings, 4356465 edges, 7136 markings/sec, 170 secs
lola: sara is running 175 secs || 1577882 markings, 4506101 edges, 7207 markings/sec, 175 secs
lola: sara is running 180 secs || 1621358 markings, 4621440 edges, 8695 markings/sec, 180 secs
lola: sara is running 185 secs || 1670561 markings, 4718020 edges, 9841 markings/sec, 185 secs
lola: sara is running 190 secs || 1717833 markings, 4821505 edges, 9454 markings/sec, 190 secs
lola: sara is running 195 secs || 1767962 markings, 4920176 edges, 10026 markings/sec, 195 secs
lola: sara is running 200 secs || 1818406 markings, 5019100 edges, 10089 markings/sec, 200 secs
lola: sara is running 205 secs || 1867983 markings, 5119119 edges, 9915 markings/sec, 205 secs
lola: sara is running 210 secs || 1911675 markings, 5247149 edges, 8738 markings/sec, 210 secs
lola: sara is running 215 secs || 1952068 markings, 5392074 edges, 8079 markings/sec, 215 secs
lola: sara is running 220 secs || 1992519 markings, 5530273 edges, 8090 markings/sec, 220 secs
lola: sara is running 225 secs || 2030442 markings, 5671109 edges, 7585 markings/sec, 225 secs
lola: sara is running 230 secs || 2066940 markings, 5833593 edges, 7300 markings/sec, 230 secs
lola: sara is running 235 secs || 2101380 markings, 5999799 edges, 6888 markings/sec, 235 secs
lola: sara is running 240 secs || 2141353 markings, 6121079 edges, 7995 markings/sec, 240 secs
lola: sara is running 245 secs || 2192381 markings, 6222853 edges, 10206 markings/sec, 245 secs
lola: sara is running 250 secs || 2242624 markings, 6325951 edges, 10049 markings/sec, 250 secs
lola: sara is running 255 secs || 2293259 markings, 6430505 edges, 10127 markings/sec, 255 secs
lola: sara is running 260 secs || 2343569 markings, 6530986 edges, 10062 markings/sec, 260 secs
lola: sara is running 265 secs || 2394196 markings, 6631696 edges, 10125 markings/sec, 265 secs
lola: sara is running 270 secs || 2439928 markings, 6752307 edges, 9146 markings/sec, 270 secs
lola: sara is running 275 secs || 2480467 markings, 6897715 edges, 8108 markings/sec, 275 secs
lola: sara is running 280 secs || 2521102 markings, 7041476 edges, 8127 markings/sec, 280 secs
lola: sara is running 285 secs || 2559867 markings, 7173950 edges, 7753 markings/sec, 285 secs
lola: sara is running 290 secs || 2596413 markings, 7338660 edges, 7309 markings/sec, 290 secs
lola: sara is running 295 secs || 2631055 markings, 7511904 edges, 6928 markings/sec, 295 secs
lola: sara is running 300 secs || 2670722 markings, 7634524 edges, 7933 markings/sec, 300 secs
lola: sara is running 305 secs || 2720176 markings, 7739362 edges, 9891 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
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
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-9.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 631 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: state equation: calling and running 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 || 49601 markings, 97066 edges, 9920 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 100355 markings, 196694 edges, 10151 markings/sec, 5 secs
lola: sara is running 10 secs || 150053 markings, 296188 edges, 9940 markings/sec, 10 secs
lola: sara is running 15 secs || 200894 markings, 396132 edges, 10168 markings/sec, 15 secs
lola: sara is running 20 secs || 251357 markings, 495675 edges, 10093 markings/sec, 20 secs
lola: sara is running 25 secs || 294273 markings, 622002 edges, 8583 markings/sec, 25 secs
lola: sara is running 30 secs || 337243 markings, 752794 edges, 8594 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 1558 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
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 3116 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: state equation: calling and running sara
sara: try reading problem file 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: RESULT
lola:
SUMMARY: no yes yes yes no unknown yes yes yes no no no yes yes yes no
lola: ========================================
----- Kill lola and sara stderr -----
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 -----
----- 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="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-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 irma4mcc-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 r091-blw7-152650003500210"
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 ;