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 3.0M
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is JoinFreeModules-PT-0500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630900283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526851426596

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0500 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0500 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-0500 @ 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: 6502/65536 symbol table entries, 1048 collisions
lola: preprocessing...
lola: Size of bit vector: 80032
lola: finding significant places
lola: 2501 places, 4001 transitions, 2000 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4501 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0500-CTLCardinality.task
lola: E (F (E (G ((2 <= p290))))) : (NOT(NOT(E (G ((p2484 <= p1321))))) AND E (X (E (X ((2 <= p1938)))))) : (((E (X ((1 <= p279))) OR ((p845 <= p1629) AND (3 <= p2308) AND ((2 <= p2033) OR (p1270 <= p212)))) OR ((p762 <= 2) OR ((p1503 + 1 <= p501) AND (p1520 + 1 <= p526)))) AND E (G (E (X ((2 <= p1388)))))) : A ((E (F ((2 <= p1464))) U ((1 <= p741) AND (p1333 <= p1516) AND (2 <= p1658) AND (p103 <= p356)))) : A (G (E (((p1875 <= p1896) U (p670 <= p1027))))) : (E ((((3 <= p693) AND (3 <= p793)) U ((3 <= p1478) AND (p737 <= p1111)))) AND (((2 <= p2037) AND A (F ((p1713 <= p430)))) OR (E (G ((1 <= p1671))) OR A (X ((p2078 <= p714)))))) : (A (F (((p675 <= p2313) AND (p2422 <= p1375)))) AND ((p2398 <= p1506) OR (p1826 <= p1141) OR (p2095 <= p797) OR (((p491 <= p2102) OR (p2170 <= p1561)) AND (3 <= p297)) OR (2 <= p1313))) : A (X (E (F ((1 <= p2269))))) : (A (F ((2 <= p327))) OR (A (((3 <= p992) U (3 <= p664))) OR (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262)))))) : E (G (((p1605 <= 2) OR (p2436 + 1 <= p1468) OR (p146 <= 2)))) : A (G (A (F (((p224 <= p2383) AND (1 <= p1307)))))) : E (X (NOT(A (G ((1 <= p1553)))))) : NOT(E (G ((p2325 <= p251)))) : (E (G (A (X ((p927 <= p1566))))) AND A (X ((p119 <= p1882)))) : A (X (((p1592 <= p191) AND A (G ((3 <= p803)))))) : E (G (((p2095 <= 0) OR (p2292 + 1 <= p1325) OR (p198 <= 1) OR (p2388 + 1 <= p237))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((p2484 <= p1321))) AND E (X (E (X ((2 <= p1938))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p2484 <= p1321)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p2484 <= p1321)))
lola: processed formula length: 24
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (X ((2 <= p1938)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(EX((2 <= p1938)))
lola: processed formula length: 20
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA JoinFreeModules-PT-0500-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((1 <= p279))) OR (((p845 <= p1629) AND (3 <= p2308) AND ((2 <= p2033) OR (p1270 <= p212))) OR ((p762 <= 2) OR ((p1503 + 1 <= p501) AND (p1520 + 1 <= p526))))) AND E (G (E (X ((2 <= p1388))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p845 <= p1629) AND (3 <= p2308) AND ((2 <= p2033) OR (p1270 <= p212))) OR ((p762 <= 2) OR ((p1503 + 1 <= p501) AND (p1520 + 1 <= p526))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: (((p845 <= p1629) AND (3 <= p2308) AND ((2 <= p2033) OR (p1270 <= p212))) OR ((p762 <= 2) OR ((p1503 + 1 <= p501) AND (p1520 + 1 <= p526))))
lola: processed formula length: 142
lola: 15 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: processed formula with 7 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: ========================================
lola: subprocess 2 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((2 <= p1388)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX((2 <= p1388)))))
lola: processed formula length: 36
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E ((((3 <= p693) AND (3 <= p793)) U ((3 <= p1478) AND (p737 <= p1111)))) AND (((2 <= p2037) AND A (F ((p1713 <= p430)))) OR (E (G ((1 <= p1671))) OR A (X ((p2078 <= p714))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p1671)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= p1671)))
lola: processed formula length: 20
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((3 <= p693) AND (3 <= p793)) U ((3 <= p1478) AND (p737 <= p1111))))
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 ((((3 <= p693) AND (3 <= p793)) U ((3 <= p1478) AND (p737 <= p1111))))
lola: processed formula length: 72
lola: 17 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: formula 0: ((3 <= p1478) AND (p737 <= p1111))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p2269)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (1 <= p2269)))
lola: processed formula length: 26
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 85948 markings, 128865 edges, 17190 markings/sec, 0 secs
lola: 172960 markings, 259194 edges, 17402 markings/sec, 5 secs
lola: 259761 markings, 389334 edges, 17360 markings/sec, 10 secs
lola: 346494 markings, 519393 edges, 17347 markings/sec, 15 secs
lola: 433349 markings, 649562 edges, 17371 markings/sec, 20 secs
lola: 520291 markings, 779822 edges, 17388 markings/sec, 25 secs
lola: 607069 markings, 909938 edges, 17356 markings/sec, 30 secs
lola: 694062 markings, 1040217 edges, 17399 markings/sec, 35 secs
lola: 780873 markings, 1170366 edges, 17362 markings/sec, 40 secs
lola: 867580 markings, 1300373 edges, 17341 markings/sec, 45 secs
lola: 954302 markings, 1430293 edges, 17344 markings/sec, 50 secs
lola: 1041069 markings, 1560354 edges, 17353 markings/sec, 55 secs
lola: 1127737 markings, 1690289 edges, 17334 markings/sec, 60 secs
lola: 1214405 markings, 1820168 edges, 17334 markings/sec, 65 secs
lola: 1301460 markings, 1950678 edges, 17411 markings/sec, 70 secs
lola: 1386614 markings, 2078321 edges, 17031 markings/sec, 75 secs
lola: 1472088 markings, 2206398 edges, 17095 markings/sec, 80 secs
lola: 1555872 markings, 2331952 edges, 16757 markings/sec, 85 secs
lola: 1640256 markings, 2458451 edges, 16877 markings/sec, 90 secs
lola: 1727160 markings, 2588689 edges, 17381 markings/sec, 95 secs
lola: 1813942 markings, 2718811 edges, 17356 markings/sec, 100 secs
lola: 1900902 markings, 2849077 edges, 17392 markings/sec, 105 secs
lola: 1987887 markings, 2979516 edges, 17397 markings/sec, 110 secs
lola: 2074780 markings, 3109759 edges, 17379 markings/sec, 115 secs
lola: 2161488 markings, 3239654 edges, 17342 markings/sec, 120 secs
lola: 2248009 markings, 3369352 edges, 17304 markings/sec, 125 secs
lola: 2334554 markings, 3499081 edges, 17309 markings/sec, 130 secs
lola: 2420939 markings, 3628544 edges, 17277 markings/sec, 135 secs
lola: 2507377 markings, 3758145 edges, 17288 markings/sec, 140 secs
lola: 2593844 markings, 3887756 edges, 17293 markings/sec, 145 secs
lola: 2680265 markings, 4017238 edges, 17284 markings/sec, 150 secs
lola: 2766510 markings, 4146553 edges, 17249 markings/sec, 155 secs
lola: 2852665 markings, 4275698 edges, 17231 markings/sec, 160 secs
lola: 2939013 markings, 4405029 edges, 17270 markings/sec, 165 secs
lola: 3025202 markings, 4534235 edges, 17238 markings/sec, 170 secs
lola: 3111510 markings, 4663605 edges, 17262 markings/sec, 175 secs
lola: 3197650 markings, 4792701 edges, 17228 markings/sec, 180 secs
lola: 3283893 markings, 4922000 edges, 17249 markings/sec, 185 secs
lola: 3370190 markings, 5051347 edges, 17259 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p1553 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (p1553 <= 0)
lola: processed formula length: 12
lola: 15 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 501 markings, 500 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (X ((p927 <= p1566))))) AND A (X ((p119 <= p1882))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p119 <= p1882)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p119 <= p1882))
lola: processed formula length: 19
lola: 15 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X ((p927 <= p1566)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX((p927 <= p1566)))))
lola: processed formula length: 39
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((p1592 <= p191))) AND A (X (A (G ((3 <= p803))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p1592 <= p191)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((p1592 <= p191))
lola: processed formula length: 19
lola: 15 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((3 <= p803)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p803 <= 2)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 499 markings, 498 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola:
FORMULA JoinFreeModules-PT-0500-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p290)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (2 <= p290)
lola: processed formula length: 11
lola: 15 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 23 markings, 23 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p251 + 1 <= p2325)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p2325 <= p251)
lola: processed formula length: 15
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.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: 11 markings, 11 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p224 <= p2383) AND (1 <= p1307))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((p2383 + 1 <= p224) OR (p1307 <= 0))
lola: processed formula length: 38
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 512 markings, 512 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1605 <= 2) OR (p2436 + 1 <= p1468) OR (p146 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p1605 <= 2) OR (p2436 + 1 <= p1468) OR (p146 <= 2))))
lola: processed formula length: 63
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 602 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p2095 <= 0) OR (p2292 + 1 <= p1325) OR (p198 <= 1) OR (p2388 + 1 <= p237))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p2095 <= 0) OR (p2292 + 1 <= p1325) OR (p198 <= 1) OR (p2388 + 1 <= p237))))
lola: processed formula length: 87
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 11 markings, 11 edges
lola:
FORMULA JoinFreeModules-PT-0500-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 752 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (((p1875 <= p1896) U (p670 <= p1027)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(E((p1875 <= p1896) U (p670 <= p1027)))))
lola: processed formula length: 57
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: 57259 markings, 143057 edges, 11452 markings/sec, 0 secs
lola: 115336 markings, 288189 edges, 11615 markings/sec, 5 secs
lola: 171047 markings, 427401 edges, 11142 markings/sec, 10 secs
lola: 229077 markings, 572428 edges, 11606 markings/sec, 15 secs
lola: 287233 markings, 717769 edges, 11631 markings/sec, 20 secs
lola: 345349 markings, 862961 edges, 11623 markings/sec, 25 secs
lola: 403505 markings, 1008337 edges, 11631 markings/sec, 30 secs
lola: 461515 markings, 1153302 edges, 11602 markings/sec, 35 secs
lola: 519787 markings, 1298858 edges, 11654 markings/sec, 40 secs
lola: 577838 markings, 1443953 edges, 11610 markings/sec, 45 secs
lola: 636048 markings, 1589339 edges, 11642 markings/sec, 50 secs
lola: 694260 markings, 1734842 edges, 11642 markings/sec, 55 secs
lola: 752416 markings, 1880100 edges, 11631 markings/sec, 60 secs
lola: 810501 markings, 2025294 edges, 11617 markings/sec, 65 secs
lola: 868620 markings, 2170560 edges, 11624 markings/sec, 70 secs
lola: 926690 markings, 2315636 edges, 11614 markings/sec, 75 secs
lola: 984839 markings, 2460900 edges, 11630 markings/sec, 80 secs
lola: 1042916 markings, 2606064 edges, 11615 markings/sec, 85 secs
lola: 1101002 markings, 2751229 edges, 11617 markings/sec, 90 secs
lola: 1158978 markings, 2896118 edges, 11595 markings/sec, 95 secs
lola: 1217106 markings, 3041311 edges, 11626 markings/sec, 100 secs
lola: 1275420 markings, 3187050 edges, 11663 markings/sec, 105 secs
lola: 1333714 markings, 3332743 edges, 11659 markings/sec, 110 secs
lola: 1391907 markings, 3478125 edges, 11639 markings/sec, 115 secs
lola: 1450203 markings, 3623770 edges, 11659 markings/sec, 120 secs
lola: 1508367 markings, 3769183 edges, 11633 markings/sec, 125 secs
lola: 1566610 markings, 3914657 edges, 11649 markings/sec, 130 secs
lola: 1624716 markings, 4059907 edges, 11621 markings/sec, 135 secs
lola: 1682880 markings, 4205206 edges, 11633 markings/sec, 140 secs
lola: 1740963 markings, 4350359 edges, 11617 markings/sec, 145 secs
lola: 1799086 markings, 4495639 edges, 11625 markings/sec, 150 secs
lola: 1857262 markings, 4640958 edges, 11635 markings/sec, 155 secs
lola: 1915483 markings, 4786496 edges, 11644 markings/sec, 160 secs
lola: 1973767 markings, 4932116 edges, 11657 markings/sec, 165 secs
lola: 2032015 markings, 5077604 edges, 11650 markings/sec, 170 secs
lola: 2090171 markings, 5223004 edges, 11631 markings/sec, 175 secs
lola: 2148380 markings, 5368374 edges, 11642 markings/sec, 180 secs
lola: 2206441 markings, 5513494 edges, 11612 markings/sec, 185 secs
lola: 2264506 markings, 5658619 edges, 11613 markings/sec, 190 secs
lola: 2322520 markings, 5803592 edges, 11603 markings/sec, 195 secs
lola: 2380517 markings, 5948496 edges, 11599 markings/sec, 200 secs
lola: 2438492 markings, 6093357 edges, 11595 markings/sec, 205 secs
lola: 2496463 markings, 6238220 edges, 11594 markings/sec, 210 secs
lola: 2554439 markings, 6383055 edges, 11595 markings/sec, 215 secs
lola: 2612212 markings, 6527481 edges, 11555 markings/sec, 220 secs
lola: 2670184 markings, 6672301 edges, 11594 markings/sec, 225 secs
lola: 2727949 markings, 6816704 edges, 11553 markings/sec, 230 secs
lola: 2785757 markings, 6961096 edges, 11562 markings/sec, 235 secs
lola: 2843490 markings, 7105362 edges, 11547 markings/sec, 240 secs
lola: 2901343 markings, 7249962 edges, 11571 markings/sec, 245 secs
lola: 2959077 markings, 7394210 edges, 11547 markings/sec, 250 secs
lola: 3016858 markings, 7538598 edges, 11556 markings/sec, 255 secs
lola: 3074783 markings, 7683338 edges, 11585 markings/sec, 260 secs
lola: 3132601 markings, 7827779 edges, 11564 markings/sec, 265 secs
lola: 3190338 markings, 7972092 edges, 11547 markings/sec, 270 secs
lola: 3248137 markings, 8116561 edges, 11560 markings/sec, 275 secs
lola: 3306068 markings, 8261301 edges, 11586 markings/sec, 280 secs
lola: 3363932 markings, 8405848 edges, 11573 markings/sec, 285 secs
lola: 3401967 markings, 8500945 edges, 7607 markings/sec, 290 secs
lola: 3403012 markings, 8503572 edges, 209 markings/sec, 295 secs
lola: 3403081 markings, 8503720 edges, 14 markings/sec, 300 secs
lola: 3403571 markings, 8504914 edges, 98 markings/sec, 305 secs
lola: 3403861 markings, 8505615 edges, 58 markings/sec, 310 secs
lola: 3404137 markings, 8506410 edges, 55 markings/sec, 315 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 896 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= p1464))) U ((1 <= p741) AND (p1333 <= p1516) AND (2 <= p1658) AND (p103 <= p356))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U (2 <= p1464)) U ((1 <= p741) AND (p1333 <= p1516) AND (2 <= p1658) AND (p103 <= p356)))
lola: processed formula length: 98
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: 82070 markings, 123002 edges, 16414 markings/sec, 0 secs
lola: 169423 markings, 253951 edges, 17471 markings/sec, 5 secs
lola: 256496 markings, 384420 edges, 17415 markings/sec, 10 secs
lola: 343662 markings, 515078 edges, 17433 markings/sec, 15 secs
lola: 428645 markings, 642509 edges, 16997 markings/sec, 20 secs
lola: 514283 markings, 770794 edges, 17128 markings/sec, 25 secs
lola: 596362 markings, 893880 edges, 16416 markings/sec, 30 secs
lola: 683789 markings, 1024870 edges, 17485 markings/sec, 35 secs
lola: 771097 markings, 1155743 edges, 17462 markings/sec, 40 secs
lola: 858266 markings, 1286409 edges, 17434 markings/sec, 45 secs
lola: 945557 markings, 1417183 edges, 17458 markings/sec, 50 secs
lola: 1032941 markings, 1548200 edges, 17477 markings/sec, 55 secs
lola: 1120163 markings, 1678924 edges, 17444 markings/sec, 60 secs
lola: 1207412 markings, 1809668 edges, 17450 markings/sec, 65 secs
lola: 1295037 markings, 1941033 edges, 17525 markings/sec, 70 secs
lola: 1382520 markings, 2072151 edges, 17497 markings/sec, 75 secs
lola: 1470034 markings, 2203295 edges, 17503 markings/sec, 80 secs
lola: 1557590 markings, 2334543 edges, 17511 markings/sec, 85 secs
lola: 1645033 markings, 2465587 edges, 17489 markings/sec, 90 secs
lola: 1732385 markings, 2596603 edges, 17470 markings/sec, 95 secs
lola: 1819647 markings, 2727356 edges, 17452 markings/sec, 100 secs
lola: 1907020 markings, 2858282 edges, 17475 markings/sec, 105 secs
lola: 1994463 markings, 2989307 edges, 17489 markings/sec, 110 secs
lola: 2081766 markings, 3120228 edges, 17461 markings/sec, 115 secs
lola: 2169226 markings, 3251271 edges, 17492 markings/sec, 120 secs
lola: 2256468 markings, 3382078 edges, 17448 markings/sec, 125 secs
lola: 2343713 markings, 3512837 edges, 17449 markings/sec, 130 secs
lola: 2430906 markings, 3643526 edges, 17439 markings/sec, 135 secs
lola: 2517862 markings, 3773819 edges, 17391 markings/sec, 140 secs
lola: 2604783 markings, 3904099 edges, 17384 markings/sec, 145 secs
lola: 2691682 markings, 4034366 edges, 17380 markings/sec, 150 secs
lola: 2778405 markings, 4164310 edges, 17345 markings/sec, 155 secs
lola: 2865085 markings, 4294308 edges, 17336 markings/sec, 160 secs
lola: 2951842 markings, 4424294 edges, 17351 markings/sec, 165 secs
lola: 3038634 markings, 4554360 edges, 17358 markings/sec, 170 secs
lola: 3125444 markings, 4684454 edges, 17362 markings/sec, 175 secs
lola: 3212069 markings, 4814318 edges, 17325 markings/sec, 180 secs
lola: 3298946 markings, 4944527 edges, 17375 markings/sec, 185 secs
lola: 3385771 markings, 5074648 edges, 17365 markings/sec, 190 secs
lola: 3402832 markings, 5100224 edges, 3412 markings/sec, 195 secs
lola: 3404212 markings, 5102287 edges, 276 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((p675 <= p2313) AND (p2422 <= p1375)))) AND ((p2398 <= p1506) OR (p1826 <= p1141) OR (p2095 <= p797) OR (((p491 <= p2102) OR (p2170 <= p1561)) AND (3 <= p297)) OR (2 <= p1313)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p2398 <= p1506) OR (p1826 <= p1141) OR (p2095 <= p797) OR (((p491 <= p2102) OR (p2170 <= p1561)) AND (3 <= p297)) OR (2 <= p1313))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2398 <= p1506) OR (p1826 <= p1141) OR (p2095 <= p797) OR (((p491 <= p2102) OR (p2170 <= p1561)) AND (3 <= p297)) OR (2 <= p1313))
lola: processed formula length: 137
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: processed formula with 7 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: ========================================
lola: subprocess 15 will run for 2480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p675 <= p2313) AND (p2422 <= p1375))))
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: ((p2313 + 1 <= p675) OR (p1375 + 1 <= p2422))
lola: processed formula length: 46
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.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: 11 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= p327))) OR (A (((3 <= p992) U (3 <= p664))) OR (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2480 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262))))
lola: processed formula length: 118
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: processed formula with 6 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: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p992) U (3 <= p664)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((3 <= p992) U (3 <= p664)))
lola: processed formula length: 31
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((1 <= p2269)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E(TRUE U (1 <= p2269)))
lola: processed formula length: 26
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 75285 markings, 112863 edges, 15057 markings/sec, 0 secs
lola: 162629 markings, 243723 edges, 17469 markings/sec, 5 secs
lola: 249785 markings, 374355 edges, 17431 markings/sec, 10 secs
lola: 336980 markings, 505073 edges, 17439 markings/sec, 15 secs
lola: 424246 markings, 635899 edges, 17453 markings/sec, 20 secs
lola: 511612 markings, 766784 edges, 17473 markings/sec, 25 secs
lola: 598795 markings, 897481 edges, 17437 markings/sec, 30 secs
lola: 686119 markings, 1028353 edges, 17465 markings/sec, 35 secs
lola: 773370 markings, 1159183 edges, 17450 markings/sec, 40 secs
lola: 860637 markings, 1289949 edges, 17453 markings/sec, 45 secs
lola: 947773 markings, 1420567 edges, 17427 markings/sec, 50 secs
lola: 1035112 markings, 1551394 edges, 17468 markings/sec, 55 secs
lola: 1114717 markings, 1670801 edges, 15921 markings/sec, 60 secs
lola: 1201801 markings, 1801272 edges, 17417 markings/sec, 65 secs
lola: 1289263 markings, 1932342 edges, 17492 markings/sec, 70 secs
lola: 1376659 markings, 2063404 edges, 17479 markings/sec, 75 secs
lola: 1464210 markings, 2194589 edges, 17510 markings/sec, 80 secs
lola: 1551623 markings, 2325638 edges, 17483 markings/sec, 85 secs
lola: 1635127 markings, 2450808 edges, 16701 markings/sec, 90 secs
lola: 1722306 markings, 2581487 edges, 17436 markings/sec, 95 secs
lola: 1809519 markings, 2712213 edges, 17443 markings/sec, 100 secs
lola: 1896749 markings, 2842914 edges, 17446 markings/sec, 105 secs
lola: 1983952 markings, 2973612 edges, 17441 markings/sec, 110 secs
lola: 2070935 markings, 3103941 edges, 17397 markings/sec, 115 secs
lola: 2154173 markings, 3228720 edges, 16648 markings/sec, 120 secs
lola: 2241139 markings, 3359080 edges, 17393 markings/sec, 125 secs
lola: 2328169 markings, 3489511 edges, 17406 markings/sec, 130 secs
lola: 2415050 markings, 3619747 edges, 17376 markings/sec, 135 secs
lola: 2501872 markings, 3749885 edges, 17364 markings/sec, 140 secs
lola: 2588756 markings, 3880110 edges, 17377 markings/sec, 145 secs
lola: 2671938 markings, 4004786 edges, 16636 markings/sec, 150 secs
lola: 2758701 markings, 4134795 edges, 17353 markings/sec, 155 secs
lola: 2845321 markings, 4264688 edges, 17324 markings/sec, 160 secs
lola: 2932153 markings, 4394828 edges, 17366 markings/sec, 165 secs
lola: 3018867 markings, 4524754 edges, 17343 markings/sec, 170 secs
lola: 3105615 markings, 4654767 edges, 17350 markings/sec, 175 secs
lola: 3192232 markings, 4784555 edges, 17323 markings/sec, 180 secs
lola: 3278895 markings, 4914528 edges, 17333 markings/sec, 185 secs
lola: 3365682 markings, 5044551 edges, 17357 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0500-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (G (E (((p1875 <= p1896) U (p670 <= p1027)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(E((p1875 <= p1896) U (p670 <= p1027)))))
lola: processed formula length: 57
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: 55051 markings, 137570 edges, 11010 markings/sec, 0 secs
lola: 113083 markings, 282602 edges, 11606 markings/sec, 5 secs
lola: 168753 markings, 421697 edges, 11134 markings/sec, 10 secs
lola: 224297 markings, 560444 edges, 11109 markings/sec, 15 secs
lola: 279923 markings, 699459 edges, 11125 markings/sec, 20 secs
lola: 337909 markings, 844390 edges, 11597 markings/sec, 25 secs
lola: 393588 markings, 983481 edges, 11136 markings/sec, 30 secs
lola: 451503 markings, 1128263 edges, 11583 markings/sec, 35 secs
lola: 509685 markings, 1273585 edges, 11636 markings/sec, 40 secs
lola: 567609 markings, 1418337 edges, 11585 markings/sec, 45 secs
lola: 623221 markings, 1557338 edges, 11122 markings/sec, 50 secs
lola: 681379 markings, 1702607 edges, 11632 markings/sec, 55 secs
lola: 736859 markings, 1841301 edges, 11096 markings/sec, 60 secs
lola: 794907 markings, 1986338 edges, 11610 markings/sec, 65 secs
lola: 850376 markings, 2124926 edges, 11094 markings/sec, 70 secs
lola: 908432 markings, 2270007 edges, 11611 markings/sec, 75 secs
lola: 966356 markings, 2414711 edges, 11585 markings/sec, 80 secs
lola: 1021951 markings, 2553646 edges, 11119 markings/sec, 85 secs
lola: 1078756 markings, 2695612 edges, 11361 markings/sec, 90 secs
lola: 1136735 markings, 2840478 edges, 11596 markings/sec, 95 secs
lola: 1194578 markings, 2985064 edges, 11569 markings/sec, 100 secs
lola: 1250296 markings, 3124249 edges, 11144 markings/sec, 105 secs
lola: 1308477 markings, 3269669 edges, 11636 markings/sec, 110 secs
lola: 1366624 markings, 3414968 edges, 11629 markings/sec, 115 secs
lola: 1424787 markings, 3560296 edges, 11633 markings/sec, 120 secs
lola: 1482963 markings, 3705675 edges, 11635 markings/sec, 125 secs
lola: 1541165 markings, 3851109 edges, 11640 markings/sec, 130 secs
lola: 1599357 markings, 3996493 edges, 11638 markings/sec, 135 secs
lola: 1657529 markings, 4141881 edges, 11634 markings/sec, 140 secs
lola: 1715559 markings, 4286917 edges, 11606 markings/sec, 145 secs
lola: 1773725 markings, 4432226 edges, 11633 markings/sec, 150 secs
lola: 1831784 markings, 4577294 edges, 11612 markings/sec, 155 secs
lola: 1889905 markings, 4722532 edges, 11624 markings/sec, 160 secs
lola: 1948088 markings, 4867944 edges, 11637 markings/sec, 165 secs
lola: 2006284 markings, 5013346 edges, 11639 markings/sec, 170 secs
lola: 2064340 markings, 5158450 edges, 11611 markings/sec, 175 secs
lola: 2122525 markings, 5303770 edges, 11637 markings/sec, 180 secs
lola: 2180559 markings, 5448786 edges, 11607 markings/sec, 185 secs
lola: 2238557 markings, 5593718 edges, 11600 markings/sec, 190 secs
lola: 2296555 markings, 5738658 edges, 11600 markings/sec, 195 secs
lola: 2354642 markings, 5883816 edges, 11617 markings/sec, 200 secs
lola: 2412627 markings, 6028706 edges, 11597 markings/sec, 205 secs
lola: 2470682 markings, 6173815 edges, 11611 markings/sec, 210 secs
lola: 2528646 markings, 6318625 edges, 11593 markings/sec, 215 secs
lola: 2586579 markings, 6463378 edges, 11587 markings/sec, 220 secs
lola: 2644411 markings, 6607934 edges, 11566 markings/sec, 225 secs
lola: 2702293 markings, 6752502 edges, 11576 markings/sec, 230 secs
lola: 2760004 markings, 6896737 edges, 11542 markings/sec, 235 secs
lola: 2817727 markings, 7041016 edges, 11545 markings/sec, 240 secs
lola: 2875518 markings, 7185445 edges, 11558 markings/sec, 245 secs
lola: 2933249 markings, 7329675 edges, 11546 markings/sec, 250 secs
lola: 2990948 markings, 7473847 edges, 11540 markings/sec, 255 secs
lola: 3048794 markings, 7618420 edges, 11569 markings/sec, 260 secs
lola: 3106539 markings, 7762731 edges, 11549 markings/sec, 265 secs
lola: 3164340 markings, 7907109 edges, 11560 markings/sec, 270 secs
lola: 3222039 markings, 8051301 edges, 11540 markings/sec, 275 secs
lola: 3279869 markings, 8195836 edges, 11566 markings/sec, 280 secs
lola: 3337629 markings, 8340183 edges, 11552 markings/sec, 285 secs
lola: 3395547 markings, 8484875 edges, 11584 markings/sec, 290 secs
lola: 3402376 markings, 8501976 edges, 1366 markings/sec, 295 secs
lola: 3402956 markings, 8503403 edges, 116 markings/sec, 300 secs
lola: 3405234 markings, 8509062 edges, 456 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0500-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= p1464))) U ((1 <= p741) AND (p1333 <= p1516) AND (2 <= p1658) AND (p103 <= p356))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(E(TRUE U (2 <= p1464)) U ((1 <= p741) AND (p1333 <= p1516) AND (2 <= p1658) AND (p103 <= p356)))
lola: processed formula length: 98
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: 82600 markings, 123853 edges, 16520 markings/sec, 0 secs
lola: 169965 markings, 254701 edges, 17473 markings/sec, 5 secs
lola: 257147 markings, 385386 edges, 17436 markings/sec, 10 secs
lola: 344265 markings, 516013 edges, 17424 markings/sec, 15 secs
lola: 431548 markings, 646799 edges, 17457 markings/sec, 20 secs
lola: 518875 markings, 777738 edges, 17465 markings/sec, 25 secs
lola: 606078 markings, 908446 edges, 17441 markings/sec, 30 secs
lola: 693468 markings, 1039353 edges, 17478 markings/sec, 35 secs
lola: 780713 markings, 1170166 edges, 17449 markings/sec, 40 secs
lola: 867909 markings, 1300863 edges, 17439 markings/sec, 45 secs
lola: 948079 markings, 1421040 edges, 16034 markings/sec, 50 secs
lola: 1034903 markings, 1551145 edges, 17365 markings/sec, 55 secs
lola: 1121452 markings, 1680884 edges, 17310 markings/sec, 60 secs
lola: 1207983 markings, 1810572 edges, 17306 markings/sec, 65 secs
lola: 1294889 markings, 1940804 edges, 17381 markings/sec, 70 secs
lola: 1381638 markings, 2070892 edges, 17350 markings/sec, 75 secs
lola: 1468496 markings, 2201048 edges, 17372 markings/sec, 80 secs
lola: 1554882 markings, 2330473 edges, 17277 markings/sec, 85 secs
lola: 1637678 markings, 2454560 edges, 16559 markings/sec, 90 secs
lola: 1721194 markings, 2579770 edges, 16703 markings/sec, 95 secs
lola: 1808492 markings, 2710672 edges, 17460 markings/sec, 100 secs
lola: 1895869 markings, 2841534 edges, 17475 markings/sec, 105 secs
lola: 1983215 markings, 2972533 edges, 17469 markings/sec, 110 secs
lola: 2070556 markings, 3103367 edges, 17468 markings/sec, 115 secs
lola: 2157862 markings, 3234246 edges, 17461 markings/sec, 120 secs
lola: 2244979 markings, 3364804 edges, 17423 markings/sec, 125 secs
lola: 2332141 markings, 3495436 edges, 17432 markings/sec, 130 secs
lola: 2419137 markings, 3625905 edges, 17399 markings/sec, 135 secs
lola: 2506215 markings, 3756383 edges, 17416 markings/sec, 140 secs
lola: 2593221 markings, 3886800 edges, 17401 markings/sec, 145 secs
lola: 2680204 markings, 4017115 edges, 17397 markings/sec, 150 secs
lola: 2766926 markings, 4147139 edges, 17344 markings/sec, 155 secs
lola: 2853528 markings, 4276918 edges, 17320 markings/sec, 160 secs
lola: 2940294 markings, 4406982 edges, 17353 markings/sec, 165 secs
lola: 3026947 markings, 4536879 edges, 17331 markings/sec, 170 secs
lola: 3113723 markings, 4666889 edges, 17355 markings/sec, 175 secs
lola: 3200326 markings, 4796708 edges, 17321 markings/sec, 180 secs
lola: 3287017 markings, 4926704 edges, 17338 markings/sec, 185 secs
lola: 3373774 markings, 5056694 edges, 17351 markings/sec, 190 secs
lola: 3402029 markings, 5099087 edges, 5651 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0500-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (F ((2 <= p327))) OR (A (((3 <= p992) U (3 <= p664))) OR (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p1193) AND (p479 + 1 <= p650)) OR ((1 <= p324) AND (p1987 <= p1060) AND ((p1026 <= p1605) OR (3 <= p1262))))
lola: processed formula length: 118
lola: 14 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.task
lola: processed formula with 6 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: A (F ((2 <= p327)))
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: (p327 <= 1)
lola: processed formula length: 11
lola: 16 rewrites
lola: closed formula file JoinFreeModules-PT-0500-CTLCardinality.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: 11 markings, 11 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((3 <= p992) U (3 <= p664)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((3 <= p992) U (3 <= p664)))
lola: processed formula length: 31
lola: 18 rewrites
lola: closed formula file JoinFreeModules-PT-0500-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: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA JoinFreeModules-PT-0500-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes unknown unknown yes no unknown no yes no yes no yes no yes
lola:
preliminary result: yes yes yes unknown unknown yes no unknown no yes no yes no yes no yes
lola: memory consumption: 32860 KB
lola: time consumption: 1806 seconds

BK_STOP 1526853232257

--------------------
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="JoinFreeModules-PT-0500"
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/JoinFreeModules-PT-0500.tgz
mv JoinFreeModules-PT-0500 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 JoinFreeModules-PT-0500, 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 r100-smll-152658630900283"
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 '' CTLCardinality.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 ;