About the Execution of LoLA for CSRepetitions-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
148.130 | 701.00 | 120.00 | 0.00 | FTFFTFFTFFFFFFFF | 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 268K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K 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 4.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K 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 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500437
=====================================================================
--------------------
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-02-CTLCardinality-00
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-01
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-02
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-03
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-04
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-05
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-06
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-07
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-08
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-09
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-10
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-11
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-12
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-13
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-14
FORMULA_NAME CSRepetitions-PT-02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526603081121
info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-02 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ CSRepetitions-PT-02 @ 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: 51/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 45 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-02-CTLCardinality.task
lola: always true
lola: LP says that atomic proposition is always false: (3 <= Server_Waiting_2 + Server_Waiting_1)
lola: LP says that atomic proposition is always false: (3 <= Server_Waiting_2 + Server_Waiting_1)
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= Server_Waiting_2 + Server_Waiting_1)
lola: LP says that atomic proposition is always false: (3 <= Server_Waiting_2 + Server_Waiting_1)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_2_1)
lola: LP says that atomic proposition is always false: (2 <= Client_Sending_4)
lola: LP says that atomic proposition is always false: (3 <= Client_Sending_1)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_4_1)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_1_2)
lola: LP says that atomic proposition is always false: (3 <= Server_Anwering_3_2)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_4_1)
lola: LP says that atomic proposition is always false: (2 <= Server_Anwering_2_2)
lola: LP says that atomic proposition is always false: (3 <= RequestBuffer_2)
lola: NOT(E (X (A (G (TRUE))))) : E (F (A (G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= 2))))) : A ((((2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4) OR (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U E (F (FALSE)))) : E (F ((E (F ((1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4))) AND FALSE))) : (E (F (A (G (TRUE)))) AND TRUE) : A (F (E (F (())))) : E (F (((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) AND A (G ((2 <= Server_Waiting_2 + Server_Waiting_1)))))) : ((2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2) OR (A (G (TRUE)) AND E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1))))) : A (F (E (F (FALSE)))) : A (G (E (F (())))) : (NOT(A (((RequestBuffer_3 <= RequestBuffer_4) U (Server_Anwering_4_2 <= Server_Anwering_2_2)))) OR E (((RequestBuffer_1 <= Server_Anwering_1_1) U ()))) : E (F (A (G (((2 <= RequestBuffer_4) AND (Server_Anwering_3_1 <= RequestBufferSlots)))))) : E ((((Client_Waiting_1 <= 0) OR (Server_Anwering_1_1 <= 0)) U FALSE)) : A (X (E (((Server_Anwering_1_1 <= RequestBuffer_1) U FALSE)))) : (E (F (())) AND (E (X ((RequestBuffer_3 <= Server_Anwering_1_2))) OR (((Client_Waiting_4 <= 0) AND (Server_Anwering_1_2 <= 0)) OR A (F (FALSE))))) : A (G (E (F (()))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:288
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-2 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-3 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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
lola: ========================================
FORMULA CSRepetitions-PT-02-CTLCardinality-4 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-5 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-8 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-12 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: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-13 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.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-02-CTLCardinality-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: E (F (A (G (((2 <= RequestBuffer_4) AND (Server_Anwering_3_1 <= RequestBufferSlots))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((RequestBuffer_4 <= 1) OR (RequestBufferSlots + 1 <= Server_Anwering_3_1))
lola: processed formula length: 76
lola: 70 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 7424 markings, 37008 edges
lola: ========================================
FORMULA CSRepetitions-PT-02-CTLCardinality-11 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: E (F (A (G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4)
lola: processed formula length: 80
lola: 70 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: tscc_search
lola: The predicate is cwpossibly invariant.
lola: 227 markings, 339 edges
lola: ========================================
FORMULA CSRepetitions-PT-02-CTLCardinality-1 TRUE 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: E (F (((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) AND A (G ((2 <= Server_Waiting_2 + Server_Waiting_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U ((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) AND NOT(E(TRUE U (Server_Waiting_2 + Server_Waiting_1 <= 1)))))
lola: processed formula length: 184
lola: 71 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 7424 markings, 44114 edges
lola: ========================================
FORMULA CSRepetitions-PT-02-CTLCardinality-6 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: E (((RequestBuffer_4 + 1 <= RequestBuffer_3) R (Server_Anwering_2_2 + 1 <= Server_Anwering_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((RequestBuffer_4 + 1 <= RequestBuffer_3) R (Server_Anwering_2_2 + 1 <= Server_Anwering_4_2)))
lola: processed formula length: 97
lola: 70 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA CSRepetitions-PT-02-CTLCardinality-10 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: ((2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2) OR E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)
lola: processed formula length: 180
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2) OR E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)
lola: processed formula length: 180
lola: 68 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ...considering subproblem: E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1)))
lola: processed formula length: 195
lola: 71 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CSRepetitions-PT-02-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA CSRepetitions-PT-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no yes no no yes no no no no no no no no
lola:
preliminary result: no yes no no yes no no yes no no no no no no no no
lola: ========================================
sara: try reading problem file CSRepetitions-PT-02-CTLCardinality-17-0.sara.
lola: memory consumption: 22064 KB
lola: time consumption: 0 seconds
sara: place or transition ordering is non-deterministic
BK_STOP 1526603081822
--------------------
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-02"
export BK_EXAMINATION="CTLCardinality"
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-02.tgz
mv CSRepetitions-PT-02 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-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-ebro-152646306500437"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
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 ;