fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r211-smll-152732262000414
Last Updated
June 26, 2018

About the Execution of Irma.struct for PolyORBLF-PT-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4140.740 111749.00 72131.00 1025.00 FFFFFFFFFFFFFFFF 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 9.9M
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K 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 56K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S06J04T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732262000414
=====================================================================


--------------------
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 PolyORBLF-PT-S06J04T04-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527443765951


BK_STOP 1527443877700

--------------------
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 PolyORBLF-PT-S06J04T04 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 750729, 'Memory': 1153.41, 'Tool': 'lola'}, {'Time': 758110, 'Memory': 1176.54, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola PolyORBLF-PT-S06J04T04...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J04T04: translating PT formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLFireability @ PolyORBLF-PT-S06J04T04 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: A ((X (F ((FIREABLE(SetSigAbort_3) OR FIREABLE(SetSigAbort_1) OR FIREABLE(SetSigAbort_4) OR FIREABLE(SetSigAbort_2)))) U (FIREABLE(T_1096_3) OR FIREABLE(T_1096_4) OR FIREABLE(T_1096_2) OR FIREABLE(T_1096_1)))) : A (F (((FIREABLE(T_2578_3_3) OR FIREABLE(T_2578_4_4) OR FIREABLE(T_2578_2_1) OR FIREABLE(T_2578_3_2) OR FIREABLE(T_2578_2_2) OR FIREABLE(T_2578_5_3) OR FIREABLE(T_2578_6_3) OR FIREABLE(T_2578_5_1) OR FIREABLE(T_2578_1_4) OR FIREABLE(T_2578_1_3) OR FIREABLE(T_2578_2_4) OR FIREABLE(T_2578_6_2) OR FIREABLE(T_2578_3_4) OR FIREABLE(T_2578_2_3) OR FIREABLE(T_2578_5_4) OR FIREABLE(T_2578_3_1) OR FIREABLE(T_2578_6_4) OR FIREABLE(T_2578_4_1) OR FIREABLE(T_2578_6_1) OR FIREABLE(T_2578_5_2) OR FIREABLE(T_2578_1_2) OR FIREABLE(T_2578_4_3) OR FIREABLE(T_2578_1_1) OR FIREABLE(T_2578_4_2)) U G ((FIREABLE(T_1100_1) OR FIREABLE(T_1100_4) OR FIREABLE(T_1100_2) OR FIREABLE(T_1100_3)))))) : A (G ((FIREABLE(NoCheck_1) OR FIREABLE(NoCheck_4) OR FIREABLE(NoCheck_2) OR FIREABLE(NoCheck_3)))) : A (X (G (F (X (X ((FIREABLE(NeedMonitoring_1) OR FIREABLE(NeedMonitoring_3) OR FIREABLE(NeedMonitoring_2) OR FIREABLE(NeedMonitoring_4)))))))) : A (X ((FIREABLE(EnterCSIS_6_4) OR FIREABLE(EnterCSIS_6_1) OR FIREABLE(EnterCSIS_1_3) OR FIREABLE(EnterCSIS_3_1) OR FIREABLE(EnterCSIS_5_1) OR FIREABLE(EnterCSIS_5_4) OR FIREABLE(EnterCSIS_2_3) OR FIREABLE(EnterCSIS_5_2) OR FIREABLE(EnterCSIS_4_1) OR FIREABLE(EnterCSIS_6_3) OR FIREABLE(EnterCSIS_6_2) OR FIREABLE(EnterCSIS_4_2) OR FIREABLE(EnterCSIS_5_3) OR FIREABLE(EnterCSIS_2_4) OR FIREABLE(EnterCSIS_3_2) OR FIREABLE(EnterCSIS_1_4) OR FIREABLE(EnterCSIS_3_3) OR FIREABLE(EnterCSIS_4_4) OR FIREABLE(EnterCSIS_2_2) OR FIREABLE(EnterCSIS_1_1) OR FIREABLE(EnterCSIS_4_3) OR FIREABLE(EnterCSIS_1_2) OR FIREABLE(EnterCSIS_2_1) OR FIREABLE(EnterCSIS_3_4)))) : A (G ((X (F ((FIREABLE(T_2541_2) OR FIREABLE(T_2541_1) OR FIREABLE(T_2541_4) OR FIREABLE(T_2541_3)))) U F (G ((FIREABLE(T_2315_1) OR FIREABLE(T_2315_3) OR FIREABLE(T_2315_2) OR FIREABLE(T_2315_4))))))) : A (G ((FIREABLE(IsEvt_3_3) OR FIREABLE(IsEvt_2_2) OR FIREABLE(IsEvt_6_4) OR FIREABLE(IsEvt_1_2) OR FIREABLE(IsEvt_4_3) OR FIREABLE(IsEvt_5_4) OR FIREABLE(IsEvt_1_3) OR FIREABLE(IsEvt_6_1) OR FIREABLE(IsEvt_5_1) OR FIREABLE(IsEvt_6_3) OR FIREABLE(IsEvt_2_3) OR FIREABLE(IsEvt_4_1) OR FIREABLE(IsEvt_5_2) OR FIREABLE(IsEvt_3_1) OR FIREABLE(IsEvt_2_4) OR FIREABLE(IsEvt_1_1) OR FIREABLE(IsEvt_6_2) OR FIREABLE(IsEvt_1_4) OR FIREABLE(IsEvt_2_1) OR FIREABLE(IsEvt_4_2) OR FIREABLE(IsEvt_5_3) OR FIREABLE(IsEvt_4_4) OR FIREABLE(IsEvt_3_2) OR FIREABLE(IsEvt_3_4)))) : A (F (X ((X ((FIREABLE(T_0376_2_2) OR FIREABLE(T_0376_3_3) OR FIREABLE(T_0376_4_4) OR FIREABLE(T_0376_5_5) OR FIREABLE(T_0376_6_6) OR FIREABLE(T_0376_1_1))) U X ((FIREABLE(T_1094_2) OR FIREABLE(T_1094_1) OR FIREABLE(T_1094_4) OR FIREABLE(T_1094_3))))))) : A (X (X (X ((FIREABLE(T_1126_2_6_1_2_1) U FIREABLE(T_1126_2_4_4_3_4)))))) : A (FIREABLE(T_1125_2_1_5_6)) : A (F (X (FIREABLE(T_1126_4_1_2_2_3)))) : A (FIREABLE(T_1126_3_5_5_3_2)) : A (FIREABLE(T_1126_1_3_2_6_2)) : A (X (FIREABLE(T_1126_3_4_3_2_6))) : A (FIREABLE(T_2577_2_2)) : A ((G (G (X (FIREABLE(T_1126_3_1_4_6_6)))) U X ((FIREABLE(T_1126_1_1_3_4_4) U FIREABLE(T_1126_2_5_4_6_3)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((FIREABLE(SetSigAbort_3) OR FIREABLE(SetSigAbort_1) OR FIREABLE(SetSigAbort_4) OR FIREABLE(SetSigAbort_2)))) U (FIREABLE(T_1096_3) OR FIREABLE(T_1096_4) OR FIREABLE(T_1096_2) OR FIREABLE(T_1096_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((FIREABLE(SetSigAbort_3) OR FIREABLE(SetSigAbort_1) OR FIREABLE(SetSigAbort_4) OR FIREABLE(SetSigAbort_2)))) U (FIREABLE(T_1096_3) OR FIREABLE(T_1096_4) OR FIREABLE(T_1096_2) OR FIREABLE(T_1096_1))))
lola: processed formula: A ((X (F ((FIREABLE(SetSigAbort_3) OR FIREABLE(SetSigAbort_1) OR FIREABLE(SetSigAbort_4) OR FIREABLE(SetSigAbort_2)))) U (FIREABLE(T_1096_3) OR FIREABLE(T_1096_4) OR FIREABLE(T_1096_2) OR FIREABLE(T_1096_1))))
lola: processed formula length: 215
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 105 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(T_2578_3_3) OR FIREABLE(T_2578_4_4) OR FIREABLE(T_2578_2_1) OR FIREABLE(T_2578_3_2) OR FIREABLE(T_2578_2_2) OR FIREABLE(T_2578_5_3) OR FIREABLE(T_2578_6_3) OR FIREABLE(T_2578_5_1) OR FIREABLE(T_2578_1_4) OR FIREABLE(T_2578_1_3) OR FIREABLE(T_2578_2_4) OR FIREABLE(T_2578_6_2) OR FIREABLE(T_2578_3_4) OR FIREABLE(T_2578_2_3) OR FIREABLE(T_2578_5_4) OR FIREABLE(T_2578_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(T_2578_3_3) OR FIREABLE(T_2578_4_4) OR FIREABLE(T_2578_2_1) OR FIREABLE(T_2578_3_2) OR FIREABLE(T_2578_2_2) OR FIREABLE(T_2578_5_3) OR FIREABLE(T_2578_6_3) OR FIREABLE(T_2578_5_1) OR FIREABLE(T_2578_1_4) OR FIREABLE(T_2578_1_3) OR FIREABLE(T_2578_2_4) OR FIREABLE(T_2578_6_2) OR FIREABLE(T_2578_3_4) OR FIREABLE(T_2578_2_3) OR FIREABLE(T_2578_5_4) OR FIREABLE(T_2578_3_1) OR FIREABLE(T_2578_6_4) OR FIREABLE(T_2578_4_1) OR FIREABLE(T_2578_6_1) OR FIREABLE(T_2578_5_2) OR FIREABLE(T_2578_1_2) OR FIREABLE(T_2578_4_3) OR FIREABLE(T_2578_1_1) OR FIREABLE(T_2578_4_2)) U G ((FIREABLE(T_1100_1) OR FIREABLE(T_1100_4) OR FIREABLE(T_1100_2) OR FIREABLE(T_1100_3))))))
lola: processed formula: A (F (((FIREABLE(T_2578_3_3) OR FIREABLE(T_2578_4_4) OR FIREABLE(T_2578_2_1) OR FIREABLE(T_2578_3_2) OR FIREABLE(T_2578_2_2) OR FIREABLE(T_2578_5_3) OR FIREABLE(T_2578_6_3) OR FIREABLE(T_2578_5_1) OR FIREABLE(T_2578_1_4) OR FIREABLE(T_2578_1_3) OR FIREABLE(T_2578_2_4) OR FIREABLE(T_2578_6_2) OR FIREABLE(T_2578_3_4) OR FIREABLE(T_2578_2_3) OR FIREABLE(T_2578_5_4) OR FIREABLE(T_2578_3... (shortened)
lola: processed formula length: 703
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 160 markings, 161 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(NoCheck_1) OR FIREABLE(NoCheck_4) OR FIREABLE(NoCheck_2) OR FIREABLE(NoCheck_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (X (X ((FIREABLE(NeedMonitoring_1) OR FIREABLE(NeedMonitoring_3) OR FIREABLE(NeedMonitoring_2) OR FIREABLE(NeedMonitoring_4))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F (X (X ((FIREABLE(NeedMonitoring_1) OR FIREABLE(NeedMonitoring_3) OR FIREABLE(NeedMonitoring_2) OR FIREABLE(NeedMonitoring_4))))))))
lola: processed formula: A (X (G (F (X (X ((FIREABLE(NeedMonitoring_1) OR FIREABLE(NeedMonitoring_3) OR FIREABLE(NeedMonitoring_2) OR FIREABLE(NeedMonitoring_4))))))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 200200 markings, 471266 edges, 40040 markings/sec, 0 secs
lola: 529320 markings, 1466299 edges, 65824 markings/sec, 5 secs
lola: 908061 markings, 2709983 edges, 75748 markings/sec, 10 secs
lola: 1286127 markings, 3991170 edges, 75613 markings/sec, 15 secs
lola: 1670307 markings, 5249831 edges, 76836 markings/sec, 20 secs
lola: 2045322 markings, 6546293 edges, 75003 markings/sec, 25 secs
lola: 2424129 markings, 7831084 edges, 75761 markings/sec, 30 secs
lola: 2800331 markings, 9113794 edges, 75240 markings/sec, 35 secs
lola: 3177142 markings, 10357559 edges, 75362 markings/sec, 40 secs
lola: 3546410 markings, 11607879 edges, 73854 markings/sec, 45 secs
lola: 3915217 markings, 12825420 edges, 73761 markings/sec, 50 secs
lola: 4274211 markings, 14123461 edges, 71799 markings/sec, 55 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4599977 markings, 15340529 edges
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(EnterCSIS_6_4) OR FIREABLE(EnterCSIS_6_1) OR FIREABLE(EnterCSIS_1_3) OR FIREABLE(EnterCSIS_3_1) OR FIREABLE(EnterCSIS_5_1) OR FIREABLE(EnterCSIS_5_4) OR FIREABLE(EnterCSIS_2_3) OR FIREABLE(EnterCSIS_5_2) OR FIREABLE(EnterCSIS_4_1) OR FIREABLE(EnterCSIS_6_3) OR FIREABLE(EnterCSIS_6_2) OR FIREABLE(EnterCSIS_4_2) OR FIREABLE(EnterCSIS_5_3) OR FIREABLE(EnterCSIS_2_4) OR F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(EnterCSIS_6_4) OR FIREABLE(EnterCSIS_6_1) OR FIREABLE(EnterCSIS_1_3) OR FIREABLE(EnterCSIS_3_1) OR FIREABLE(EnterCSIS_5_1) OR FIREABLE(EnterCSIS_5_4) OR FIREABLE(EnterCSIS_2_3) OR FIREABLE(EnterCSIS_5_2) OR FIREABLE(EnterCSIS_4_1) OR FIREABLE(EnterCSIS_6_3) OR FIREABLE(EnterCSIS_6_2) OR FIREABLE(EnterCSIS_4_2) OR FIREABLE(EnterCSIS_5_3) OR FIREABLE(EnterCSIS_2_4) OR FIREABLE(EnterCSIS_3_2) OR FIREABLE(EnterCSIS_1_4) OR FIREABLE(EnterCSIS_3_3) OR FIREABLE(EnterCSIS_4_4) OR FIREABLE(EnterCSIS_2_2) OR FIREABLE(EnterCSIS_1_1) OR FIREABLE(EnterCSIS_4_3) OR FIREABLE(EnterCSIS_1_2) OR FIREABLE(EnterCSIS_2_1) OR FIREABLE(EnterCSIS_3_4))))
lola: processed formula: A (X ((FIREABLE(EnterCSIS_6_4) OR FIREABLE(EnterCSIS_6_1) OR FIREABLE(EnterCSIS_1_3) OR FIREABLE(EnterCSIS_3_1) OR FIREABLE(EnterCSIS_5_1) OR FIREABLE(EnterCSIS_5_4) OR FIREABLE(EnterCSIS_2_3) OR FIREABLE(EnterCSIS_5_2) OR FIREABLE(EnterCSIS_4_1) OR FIREABLE(EnterCSIS_6_3) OR FIREABLE(EnterCSIS_6_2) OR FIREABLE(EnterCSIS_4_2) OR FIREABLE(EnterCSIS_5_3) OR FIREABLE(EnterCSIS_2_4) OR F... (shortened)
lola: processed formula length: 677
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X (F ((FIREABLE(T_2541_2) OR FIREABLE(T_2541_1) OR FIREABLE(T_2541_4) OR FIREABLE(T_2541_3)))) U F (G ((FIREABLE(T_2315_1) OR FIREABLE(T_2315_3) OR FIREABLE(T_2315_2) OR FIREABLE(T_2315_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X (F ((FIREABLE(T_2541_2) OR FIREABLE(T_2541_1) OR FIREABLE(T_2541_4) OR FIREABLE(T_2541_3)))) U F (G ((FIREABLE(T_2315_1) OR FIREABLE(T_2315_3) OR FIREABLE(T_2315_2) OR FIREABLE(T_2315_4)))))))
lola: processed formula: A (G ((X (F ((FIREABLE(T_2541_2) OR FIREABLE(T_2541_1) OR FIREABLE(T_2541_4) OR FIREABLE(T_2541_3)))) U F (G ((FIREABLE(T_2315_1) OR FIREABLE(T_2315_3) OR FIREABLE(T_2315_2) OR FIREABLE(T_2315_4)))))))
lola: processed formula length: 207
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 199 markings, 200 edges
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(IsEvt_3_3) OR FIREABLE(IsEvt_2_2) OR FIREABLE(IsEvt_6_4) OR FIREABLE(IsEvt_1_2) OR FIREABLE(IsEvt_4_3) OR FIREABLE(IsEvt_5_4) OR FIREABLE(IsEvt_1_3) OR FIREABLE(IsEvt_6_1) OR FIREABLE(IsEvt_5_1) OR FIREABLE(IsEvt_6_3) OR FIREABLE(IsEvt_2_3) OR FIREABLE(IsEvt_4_1) OR FIREABLE(IsEvt_5_2) OR FIREABLE(IsEvt_3_1) OR FIREABLE(IsEvt_2_4) OR FIREABLE(IsEvt_1_1) OR FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((X ((FIREABLE(T_0376_2_2) OR FIREABLE(T_0376_3_3) OR FIREABLE(T_0376_4_4) OR FIREABLE(T_0376_5_5) OR FIREABLE(T_0376_6_6) OR FIREABLE(T_0376_1_1))) U X ((FIREABLE(T_1094_2) OR FIREABLE(T_1094_1) OR FIREABLE(T_1094_4) OR FIREABLE(T_1094_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X (((FIREABLE(T_0376_2_2) OR FIREABLE(T_0376_3_3) OR FIREABLE(T_0376_4_4) OR FIREABLE(T_0376_5_5) OR FIREABLE(T_0376_6_6) OR FIREABLE(T_0376_1_1)) U (FIREABLE(T_1094_2) OR FIREABLE(T_1094_1) OR FIREABLE(T_1094_4) OR FIREABLE(T_1094_3)))))))
lola: processed formula: A (F (X (X (((FIREABLE(T_0376_2_2) OR FIREABLE(T_0376_3_3) OR FIREABLE(T_0376_4_4) OR FIREABLE(T_0376_5_5) OR FIREABLE(T_0376_6_6) OR FIREABLE(T_0376_1_1)) U (FIREABLE(T_1094_2) OR FIREABLE(T_1094_1) OR FIREABLE(T_1094_4) OR FIREABLE(T_1094_3)))))))
lola: processed formula length: 257
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((FIREABLE(T_1126_2_6_1_2_1) U FIREABLE(T_1126_2_4_4_3_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X ((FIREABLE(T_1126_2_6_1_2_1) U FIREABLE(T_1126_2_4_4_3_4))))))
lola: processed formula: A (X (X (X ((FIREABLE(T_1126_2_6_1_2_1) U FIREABLE(T_1126_2_4_4_3_4))))))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(T_1125_2_1_5_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_1125_2_1_5_6)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (FIREABLE(T_1126_4_1_2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (FIREABLE(T_1126_4_1_2_2_3))))
lola: processed formula: A (F (X (FIREABLE(T_1126_4_1_2_2_3))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(T_1126_3_5_5_3_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_1126_3_5_5_3_2)
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(T_1126_1_3_2_6_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_1126_1_3_2_6_2)
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1158 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(T_1126_3_4_3_2_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(T_1126_3_4_3_2_6)))
lola: processed formula: A (X (FIREABLE(T_1126_3_4_3_2_6)))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: subprocess 14 will run for 1737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(T_2577_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(T_2577_2_2)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G (X (FIREABLE(T_1126_3_1_4_6_6)))) U X ((FIREABLE(T_1126_1_1_3_4_4) U FIREABLE(T_1126_2_5_4_6_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G (X (FIREABLE(T_1126_3_1_4_6_6)))) U X ((FIREABLE(T_1126_1_1_3_4_4) U FIREABLE(T_1126_2_5_4_6_3)))))
lola: processed formula: A ((G (G (X (FIREABLE(T_1126_3_1_4_6_6)))) U X ((FIREABLE(T_1126_1_1_3_4_4) U FIREABLE(T_1126_2_5_4_6_3)))))
lola: processed formula length: 108
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-LTLFireability.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 198 markings, 198 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="LTLFireability"
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/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 PolyORBLF-PT-S06J04T04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-smll-152732262000414"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;