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 404K
-rw-r--r-- 1 mcc users 10K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K 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 39K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.2K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K 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 16K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 71K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r220-ebro-152732362700128
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527461201504

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-03 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ CSRepetitions-PT-03 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 139/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1856
lola: finding significant places
lola: 58 places, 81 transitions, 46 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 127 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-03-LTLFireability.task
lola: A (X (X ((G ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))) U (FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)))))) : A (X ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_Request_3_3) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_5_2) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_4_3) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_6_2) OR FIREABLE(Read_Request_2_1) OR FIREABLE(Read_Request_7_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_9_3) OR FIREABLE(Read_Request_7_1) OR FIREABLE(Read_Request_8_2) OR FIREABLE(Read_Request_8_1) OR FIREABLE(Read_Request_1_2)))) : A (G ((G (G ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_Request_3_3) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_5_2) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_4_3) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_6_2) OR FIREABLE(Read_Request_2_1) OR FIREABLE(Read_Request_7_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_9_3) OR FIREABLE(Read_Request_7_1) OR FIREABLE(Read_Request_8_2) OR FIREABLE(Read_Request_8_1) OR FIREABLE(Read_Request_1_2)))) U X (G ((FIREABLE(Lose_Request_7) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_5) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Lose_Request_8) OR FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6))))))) : A ((G (X (F ((FIREABLE(Send_Answer_8_2) OR FIREABLE(Send_Answer_2_2) OR FIREABLE(Send_Answer_9_2) OR FIREABLE(Send_Answer_7_3) OR FIREABLE(Send_Answer_5_1) OR FIREABLE(Send_Answer_1_3) OR FIREABLE(Send_Answer_6_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_2_3) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_6_3) OR FIREABLE(Send_Answer_5_3) OR FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_3_3) OR FIREABLE(Send_Answer_4_3) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_8_1) OR FIREABLE(Send_Answer_5_2) OR FIREABLE(Send_Answer_7_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_6_2) OR FIREABLE(Send_Answer_9_3) OR FIREABLE(Send_Answer_7_2) OR FIREABLE(Send_Answer_8_3) OR FIREABLE(Send_Answer_9_1))))) U X (G (F ((FIREABLE(Send_Answer_8_2) OR FIREABLE(Send_Answer_2_2) OR FIREABLE(Send_Answer_9_2) OR FIREABLE(Send_Answer_7_3) OR FIREABLE(Send_Answer_5_1) OR FIREABLE(Send_Answer_1_3) OR FIREABLE(Send_Answer_6_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_2_3) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_6_3) OR FIREABLE(Send_Answer_5_3) OR FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_3_3) OR FIREABLE(Send_Answer_4_3) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_8_1) OR FIREABLE(Send_Answer_5_2) OR FIREABLE(Send_Answer_7_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_6_2) OR FIREABLE(Send_Answer_9_3) OR FIREABLE(Send_Answer_7_2) OR FIREABLE(Send_Answer_8_3) OR FIREABLE(Send_Answer_9_1))))))) : A (X (G (G (((FIREABLE(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_3) OR FIREABLE(Send_Request_9) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7)) U (FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_Request_3_3) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_5_2) OR FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_4_3) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_6_2) OR FIREABLE(Read_Request_2_1) OR FIREABLE(Read_Request_7_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_9_3) OR FIREABLE(Read_Request_7_1) OR FIREABLE(Read_Request_8_2) OR FIREABLE(Read_Request_8_1) OR FIREABLE(Read_Request_1_2))))))) : A (((F ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))) U X ((FIREABLE(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_3) OR FIREABLE(Send_Request_9) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7)))) U (FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)))) : A ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))) : A (G ((FIREABLE(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_3) OR FIREABLE(Send_Request_9) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7)))) : A (FIREABLE(Send_Request_4)) : A ((F (F (G (FIREABLE(Send_Answer_4_2)))) U FIREABLE(Read_Request_4_1))) : A (F (G ((G (FIREABLE(Lose_Request_2)) U X (FIREABLE(Prepare_Request_5)))))) : A (X (G ((FIREABLE(Send_Answer_9_1) U G (FIREABLE(Read_Request_4_1)))))) : A (G (FIREABLE(Send_Answer_8_1))) : A (F (G (X (X (F (FIREABLE(Read_Request_9_2))))))) : A (X (X (F (F (FIREABLE(Lose_Request_1)))))) : A (F (((FIREABLE(Send_Request_3) U FIREABLE(Send_Request_8)) U X (F (FIREABLE(Read_Request_4_1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))
lola: processed formula length: 285
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA CSRepetitions-PT-03-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Send_Request_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Send_Request_4)
lola: processed formula length: 24
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-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 CSRepetitions-PT-03-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (G ((FIREABLE(Lose_Request_7) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_5) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Lose_Request_8) OR FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6)))) OR (G ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (G ((FIREABLE(Lose_Request_7) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_5) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Lose_Request_8) OR FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6)))) OR (G ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3... (shortened)
lola: processed formula length: 1391
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 52 markings, 52 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_... (shortened)
lola: processed formula length: 1955
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 4 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: 40 markings, 40 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))) U X ((FIREABLE(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Sen... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))) U X ((FIREABLE(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Sen... (shortened)
lola: processed formula length: 850
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 4 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: 1 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)) OR (G ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_9) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)) OR (G ((FIREABLE(Prepare_Request_7) OR FIREABLE(Prepare_Request_8) OR FIREABLE(Prepare_Request_2) OR ... (shortened)
lola: processed formula length: 888
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 7 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: 100 markings, 171 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_Request... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1) OR FIREABLE(Read_Request_5_1) OR FIREABLE(Read_Request_7_3) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_9_2) OR FIREABLE(Read_Request_1_3) OR FIREABLE(Read_Request_2_3) OR FIREABLE(Read_Request_6_1) OR FIREABLE(Read_Request_6_3) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_5_3) OR FIREABLE(Read_Request... (shortened)
lola: processed formula length: 842
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 52 markings, 52 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((X (FIREABLE(Prepare_Request_5)) OR (G (FIREABLE(Lose_Request_2)) AND X (F (FIREABLE(Prepare_Request_5))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((X (FIREABLE(Prepare_Request_5)) OR (G (FIREABLE(Lose_Request_2)) AND X (F (FIREABLE(Prepare_Request_5))))))))
lola: processed formula length: 119
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 11 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: 55 markings, 56 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G (FIREABLE(Read_Request_4_1)))) AND A (X (G ((FIREABLE(Send_Answer_9_1) OR G (FIREABLE(Read_Request_4_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(Read_Request_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(Read_Request_4_1))))
lola: processed formula length: 38
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 22 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (FIREABLE(Lose_Request_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (FIREABLE(Lose_Request_1)))))
lola: processed formula length: 40
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 52 markings, 52 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(Read_Request_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(Read_Request_4_1))))
lola: processed formula length: 38
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-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: 52 markings, 52 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(Send_Answer_8_1)))
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(Send_Answer_8_1)))
lola: processed formula length: 33
lola: 35 rewrites
lola: closed formula file CSRepetitions-PT-03-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(Send_Answer_8_1)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_3) OR FIREABLE(Send_Request_9) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7))))
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(Send_Request_6) OR FIREABLE(Send_Request_5) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_3) OR FIREABLE(Send_Request_9) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7))))
lola: processed formula length: 266
lola: 35 rewrites
lola: closed formula file CSRepetitions-PT-03-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: formula 0: (NOT FIREABLE(Send_Request_6) AND NOT FIREABLE(Send_Request_5) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_3) AND NOT FIREABLE(Send_Request_9) AND NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_8) AND NOT FIREABLE(Send_Request_7))
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(Read_Request_9_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(Read_Request_9_2))))
lola: processed formula length: 38
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-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, 23 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(Read_Request_4_1) OR (F (FIREABLE(Read_Request_4_1)) AND F (G (FIREABLE(Send_Answer_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(Read_Request_4_1) OR (F (FIREABLE(Read_Request_4_1)) AND F (G (FIREABLE(Send_Answer_4_2))))))
lola: processed formula length: 106
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 4 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: 22 markings, 22 edges
lola: ========================================

FORMULA CSRepetitions-PT-03-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((FIREABLE(Send_Answer_8_2) OR FIREABLE(Send_Answer_2_2) OR FIREABLE(Send_Answer_9_2) OR FIREABLE(Send_Answer_7_3) OR FIREABLE(Send_Answer_5_1) OR FIREABLE(Send_Answer_1_3) OR FIREABLE(Send_Answer_6_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_2_3) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_6_3) OR FIREABLE(Send_Answer_5_3) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((FIREABLE(Send_Answer_8_2) OR FIREABLE(Send_Answer_2_2) OR FIREABLE(Send_Answer_9_2) OR FIREABLE(Send_Answer_7_3) OR FIREABLE(Send_Answer_5_1) OR FIREABLE(Send_Answer_1_3) OR FIREABLE(Send_Answer_6_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_2_3) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_6_3) OR FIREABLE(Send_Answer_5_3) OR ... (shortened)
lola: processed formula length: 2458
lola: 33 rewrites
lola: closed formula file CSRepetitions-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 6 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: 55 markings, 55 edges
lola: ========================================
FORMULA CSRepetitions-PT-03-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: RESULT
lola:
SUMMARY: yes no no no no yes yes no no no no no no no no no
lola:
preliminary result: yes no no no no yes yes no no no no no no no no no
lola: memory consumption: 14808 KB
lola: time consumption: 0 seconds

BK_STOP 1527461201983

--------------------
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="CSRepetitions-PT-03"
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/CSRepetitions-PT-03.tgz
mv CSRepetitions-PT-03 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 CSRepetitions-PT-03, 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 r220-ebro-152732362700128"
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 ;