fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r184-qhx2-152732127400102
Last Updated
June 26, 2018

About the Execution of LoLA for Referendum-COL-0020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
164.280 37932.00 8768.00 2058.60 FFFFFFFTFTFTFFTF 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 168K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.8K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Referendum-COL-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-qhx2-152732127400102
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528204898760

info: Time: 3600 - MCC
===========================================================================================
prep: translating Referendum-COL-0020 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Referendum-COL-0020 formula LTLFireability into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLFireability @ Referendum-COL-0020 @ 3553 seconds
lola: LoLA will run for 3553 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 102/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 61
lola: finding significant places
lola: 61 places, 41 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 23 transition conflict sets
lola: TASK
lola: reading formula from Referendum-COL-0020-LTLFireability.task
lola: A (F (F (G (F (G (FIREABLE(t0))))))) : A (F (F (G (X (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))))) : A (G (G (X (F (X ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))))) : A (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))) : A ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1))) : A ((X (G (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))) U G (((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)) U (FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))) : A (G (F (F (G (G ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))))) : A (F (FIREABLE(t0))) : A (X (FIREABLE(t0))) : A (X (F (X ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))) : A (X (FIREABLE(t0))) : A (X ((X (X (FIREABLE(t0))) U F (X ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))) : A (X (F (FIREABLE(t0)))) : A ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))) : A (X ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))) : A (F (G (X (X ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1))
lola: processed formula length: 348
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-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: ========================================

FORMULA Referendum-COL-0020-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))
lola: processed formula length: 357
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-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: ========================================

FORMULA Referendum-COL-0020-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(t0)))
lola: processed formula length: 20
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 22 markings, 22 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1))))))
lola: processed formula length: 364
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 42 markings, 41 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (FIREABLE(t0)))
lola: processed formula length: 20
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 22 markings, 22 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))))
lola: processed formula length: 373
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 42 markings, 41 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(t0))))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 22 markings, 22 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))) U G ((F ((FIREABLE(t20) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))) U G ((F ((FIREABLE(t20) OR FI... (shortened)
lola: processed formula length: 1439
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 23 markings, 23 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: processed formula length: 365
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21))))
lola: processed formula length: 365
lola: 34 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t40) AND NOT FIREABLE(t39) AND NOT FIREABLE(t38) AND NOT FIREABLE(t37) AND NOT FIREABLE(t36) AND NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t24) AND NOT FIREABLE(t23) AND NOT FIREABLE(t22) AND NOT FIREABLE(t21))
lola: state equation: Generated DNF with 20 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(t0)
lola: processed formula length: 16
lola: 34 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(t0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(t0))))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 23 markings, 24 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))
lola: processed formula length: 360
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 23 markings, 24 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1)))))
lola: processed formula length: 360
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 24 markings, 24 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))
lola: processed formula length: 369
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 23 markings, 24 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31) OR FIREABLE(t30) OR FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21)))))
lola: processed formula length: 369
lola: 32 rewrites
lola: closed formula file Referendum-COL-0020-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 23 markings, 24 edges
lola: ========================================

FORMULA Referendum-COL-0020-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no yes no yes no no yes no
lola:
preliminary result: no no no no no no no yes no yes no yes no no yes no
lola: memory consumption: 14800 KB
lola: time consumption: 0 seconds

BK_STOP 1528204936692

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-COL-0020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lola"
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/Referendum-COL-0020.tgz
mv Referendum-COL-0020 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 lola"
echo " Input is Referendum-COL-0020, 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 r184-qhx2-152732127400102"
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 ;