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 188K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 17 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is GPPP-PT-C1000N0000000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r244-blw7-152732546700097
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527890139827

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C1000N0000000010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C1000N0000000010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ GPPP-PT-C1000N0000000010 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C1000N0000000010-LTLCardinality.task
check_solution: Constraint R1 = 6.93596686442e-310 is below its lower bound 1
check_solution: Constraint R3 = 0 is above its equality of -10
check_solution: Constraint R6 = 6.15378779518e-313 is above its equality of -40
check_solution: Constraint R9 = 2.12199580776e-314 is above its equality of -2000
check_solution: Constraint R11 = 1.06099789568e-313 is above its equality of -3000
check_solution: Constraint R12 = 1.48539705397e-313 is above its equality of -20
check_solution: Constraint R13 = 1.90979621226e-313 is above its equality of -7000
check_solution: Constraint R23 = 6.15378779518e-313 is above its equality of -1
check_solution: Constraint R25 = 7.00258611177e-313 is above its equality of -20

Seriously low accuracy found ||*|| = 7000 (rel. error 1)
spx_run: Lost feasibility 10 times - iter 728 and 400 nodes.
spx_run: Lost feasibility 10 times - iter 3502 and 2018 nodes.
spx_run: Lost feasibility 10 times - iter 5964 and 3188 nodes.
spx_run: Lost feasibility 10 times - iter 9129 and 4872 nodes.
spx_run: Lost feasibility 10 times - iter 11291 and 5910 nodes.
spx_run: Lost feasibility 10 times - iter 14807 and 7848 nodes.
spx_run: Lost feasibility 10 times - iter 18716 and 9856 nodes.
spx_run: Lost feasibility 10 times - iter 20988 and 10928 nodes.
spx_run: Lost feasibility 10 times - iter 24694 and 13100 nodes.
spx_run: Lost feasibility 10 times - iter 27156 and 14270 nodes.
spx_run: Lost feasibility 10 times - iter 30321 and 15954 nodes.
spx_run: Lost feasibility 10 times - iter 32483 and 16992 nodes.
spx_run: Lost feasibility 10 times - iter 35999 and 18930 nodes.
spx_run: Lost feasibility 10 times - iter 39908 and 20938 nodes.
spx_run: Lost feasibility 10 times - iter 42180 and 22010 nodes.
spx_run: Lost feasibility 10 times - iter 45886 and 24182 nodes.
spx_run: Lost feasibility 10 times - iter 48348 and 25352 nodes.
spx_run: Lost feasibility 10 times - iter 51513 and 27036 nodes.
spx_run: Lost feasibility 10 times - iter 53675 and 28074 nodes.
spx_run: Lost feasibility 10 times - iter 57191 and 30012 nodes.
spx_run: Lost feasibility 10 times - iter 61100 and 32020 nodes.
spx_run: Lost feasibility 10 times - iter 63372 and 33092 nodes.
spx_run: Lost feasibility 10 times - iter 67078 and 35264 nodes.
spx_run: Lost feasibility 10 times - iter 69540 and 36434 nodes.
spx_run: Lost feasibility 10 times - iter 72705 and 38118 nodes.
spx_run: Lost feasibility 10 times - iter 74867 and 39156 nodes.
spx_run: Lost feasibility 10 times - iter 78383 and 41094 nodes.
spx_run: Lost feasibility 10 times - iter 82292 and 43102 nodes.
spx_run: Lost feasibility 10 times - iter 84564 and 44174 nodes.
spx_run: Lost feasibility 10 times - iter 88270 and 46346 nodes.
spx_run: Lost feasibility 10 times - iter 90732 and 47516 nodes.
spx_run: Lost feasibility 10 times - iter 93897 and 49200 nodes.
spx_run: Lost feasibility 10 times - iter 96059 and 50238 nodes.
spx_run: Lost feasibility 10 times - iter 99575 and 52176 nodes.
spx_run: Lost feasibility 10 times - iter 103484 and 54184 nodes.
spx_run: Lost feasibility 10 times - iter 105756 and 55256 nodes.
spx_run: Lost feasibility 10 times - iter 109462 and 57428 nodes.
spx_run: Lost feasibility 10 times - iter 111924 and 58598 nodes.
spx_run: Lost feasibility 10 times - iter 115089 and 60282 nodes.
spx_run: Lost feasibility 10 times - iter 117251 and 61320 nodes.
spx_run: Lost feasibility 10 times - iter 120767 and 63258 nodes.
spx_run: Lost feasibility 10 times - iter 124676 and 65266 nodes.
spx_run: Lost feasibility 10 times - iter 126948 and 66338 nodlola: LP says that atomic proposition is always true: (G6P <= ADP)
lola: LP says that atomic proposition is always true: (Pyr <= ADP)
lola: A ((ATP <= R5P)) : A ((S7P <= PEP)) : A (G (G (F (X ((3 <= Xu5P)))))) : A (F (G (X (G ((1 <= b1)))))) : A (G (G (F (F ((3 <= GSSG)))))) : A (F (F (F ((a1 <= R5P))))) : A (X (G (F (F ((1 <= ATP)))))) : A (G (F (((a2 <= b2) U (GAP <= NADPH))))) : A (F (G ((2 <= _1_3_BPG)))) : A (X (F (G (X ((3 <= GSSG)))))) : A ((a1 <= NADH)) : A (G (X (G (X (TRUE))))) : A (G (F (((2 <= Pyr) U (1 <= GSSG))))) : A (F ((G ((_3PG <= GSSG)) U X ((Gluc <= NADPplus))))) : A (G (G (X (F ((Pi <= GSH)))))) : A (G (TRUE))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ATP <= R5P)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ATP <= R5P)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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
es.
spx_run: Lost feasibility 10 times - iter 130654 and 68510 nodes.
spx_run: Lost feasibility 10 times - iter 133117 and 69680 nodes.
spx_run: Lost feasibility 10 times - iter 135995 and 71224 nodes.
spx_run: Lost feasibility 10 times - iter 137857 and 72110 nodes.
spx_run: Lost feasibility 10 times - iter 139787 and 73180 nodes.
spx_run: Lost feasibility 10 times - iter 140363 and 73464 nodes.
spx_run: Lost feasibility 10 times - iter 141284 and 73888 nodes.
spx_run: Lost feasibility 10 times - iter 145047 and 76122 nodes.
spx_run: Lost feasibility 10 times - iter 147289 and 77168 nodes.
spx_run: Lost feasibility 10 times - iter 150287 and 78720 nodes.
spx_run: Lost feasibility 10 times - iter 152319 and 79712 nodes.
spx_run: Lost feasibility 10 times - iter 155439 and 81338 nodes.
check_solution: Constraint R3 = 0 is above its equality of -10
check_solution: Constraint R6 = 6.15378779518e-313 is above its equality of -40
check_solution: Constraint R9 = 2.12199580776e-314 is above its equality of -2000
check_solution: Constraint R11 = 1.06099789568e-313 is above its equality of -3000
check_solution: Constraint R12 = 1.48539705397e-313 is above its equality of -20
check_solution: Constraint R13 = 1.90979621226e-313 is above its equality of -7000
check_solution: Constraint R23 = 6.15378779518e-313 is above its equality of -1
check_solution: Constraint R25 = 7.00258611177e-313 is above its equality of -20

Seriously low accuracy found ||*|| = 7000 (rel. error 1)
check_solution: Constraint R3 = 0 is above its equality of -10
check_solution: Constraint R6 = 6.15378779518e-313 is above its equality of -40
check_solution: Constraint R9 = 2.12199580776e-314 is above its equality of -2000
check_solution: Constraint R11 = 1.06099789568e-313 is above its equality of -3000
check_solution: Constraint R12 = 1.48539705397e-313 is above its equality of -20
check_solution: Constraint R13 = 1.90979621226e-313 is above its equality of -7000
check_solution: Constraint R23 = 6.15378779518e-313 is above its equality of -1
check_solution: Constraint R25 = 7.00258611177e-313 is above its equality of -20

Seriously low accuracy found ||*|| = 7000 (rel. error 1)

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (S7P <= PEP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (S7P <= PEP)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: processed formula with 1 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 GPPP-PT-C1000N0000000010-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (a1 <= NADH)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (a1 <= NADH)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 264 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: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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 GPPP-PT-C1000N0000000010-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((Gluc <= NADPplus)) OR (G ((_3PG <= GSSG)) AND X (F ((Gluc <= NADPplus)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((Gluc <= NADPplus)) OR (G ((_3PG <= GSSG)) AND X (F ((Gluc <= NADPplus)))))))
lola: processed formula length: 87
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.task
lola: ========================================
lola: the resulting Büchi automaton has 5 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: 56934 markings, 265135 edges

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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 GPPP-PT-C1000N0000000010-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((a1 <= R5P)))
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: (R5P + 1 <= a1)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 236 markings, 236 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= _1_3_BPG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= _1_3_BPG))))
lola: processed formula length: 27
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: add low 9
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, 25 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= GSSG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= GSSG))))
lola: processed formula length: 23
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: add low 7
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: 207958 markings, 552315 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= b1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= b1))))
lola: processed formula length: 21
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: add low 9
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: 47 markings, 48 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= GSSG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= GSSG))))
lola: processed formula length: 23
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: 207957 markings, 461697 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= GSSG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= GSSG))))
lola: processed formula length: 23
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: 180383 markings, 354314 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Xu5P))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= Xu5P))))
lola: processed formula length: 23
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: 240 markings, 240 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= ATP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= ATP))))
lola: processed formula length: 22
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: 462 markings, 511 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1718 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Pi <= GSH))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Pi <= GSH))))
lola: processed formula length: 23
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: 15 markings, 15 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((GAP <= NADPH))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((GAP <= NADPH))))
lola: processed formula length: 26
lola: 37 rewrites
lola: closed formula file GPPP-PT-C1000N0000000010-LTLCardinality.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: 45 markings, 45 edges
lola: ========================================

FORMULA GPPP-PT-C1000N0000000010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no yes no no no yes
lola:
preliminary result: no yes no no no no no no no no no yes no no no yes
lola: memory consumption: 19088 KB
lola: time consumption: 133 seconds

BK_STOP 1527890273053

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