Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853100471.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FlexibleBarrier-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853100471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 25 12:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 25 12:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 model.pnml

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

=== Now, execution of the tool begins

BK_START 1678485262033

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 21:54:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 21:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 21:54:23] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2023-03-10 21:54:23] [INFO ] Transformed 542 places.
[2023-03-10 21:54:23] [INFO ] Transformed 621 transitions.
[2023-03-10 21:54:23] [INFO ] Found NUPN structural information;
[2023-03-10 21:54:23] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 193 resets, run finished after 697 ms. (steps per millisecond=14 ) properties (out of 16) seen :2
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 621 rows 542 cols
[2023-03-10 21:54:25] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-10 21:54:25] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-10 21:54:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-10 21:54:27] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-10 21:54:27] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 5 ms to minimize.
[2023-03-10 21:54:27] [INFO ] Deduced a trap composed of 161 places in 128 ms of which 1 ms to minimize.
[2023-03-10 21:54:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 360 ms
[2023-03-10 21:54:28] [INFO ] Deduced a trap composed of 159 places in 107 ms of which 0 ms to minimize.
[2023-03-10 21:54:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 127 ms
[2023-03-10 21:54:28] [INFO ] After 2338ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 598 ms.
[2023-03-10 21:54:29] [INFO ] After 3315ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 10 different solutions.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 4 properties in 61 ms.
Support contains 148 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 542 transition count 573
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 81 rules applied. Total rules applied 129 place count 494 transition count 540
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 161 place count 462 transition count 540
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 161 place count 462 transition count 504
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 233 place count 426 transition count 504
Discarding 105 places :
Symmetric choice reduction at 3 with 105 rule applications. Total rules 338 place count 321 transition count 399
Iterating global reduction 3 with 105 rules applied. Total rules applied 443 place count 321 transition count 399
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 443 place count 321 transition count 398
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 445 place count 320 transition count 398
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 454 place count 311 transition count 389
Iterating global reduction 3 with 9 rules applied. Total rules applied 463 place count 311 transition count 389
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 466 place count 311 transition count 386
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 508 place count 290 transition count 365
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 514 place count 287 transition count 365
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 527 place count 287 transition count 352
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 540 place count 274 transition count 352
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 546 place count 274 transition count 352
Applied a total of 546 rules in 125 ms. Remains 274 /542 variables (removed 268) and now considering 352/621 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 274/542 places, 352/621 transitions.
Incomplete random walk after 10000 steps, including 227 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-10 21:54:29] [INFO ] Flow matrix only has 351 transitions (discarded 1 similar events)
// Phase 1: matrix 351 rows 274 cols
[2023-03-10 21:54:29] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-10 21:54:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-10 21:54:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 21:54:30] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-10 21:54:30] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 21:54:30] [INFO ] After 226ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-10 21:54:30] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 1 ms to minimize.
[2023-03-10 21:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-10 21:54:30] [INFO ] After 577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-10 21:54:30] [INFO ] After 1207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 22 ms.
Support contains 128 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 352/352 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 274 transition count 348
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 270 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 269 transition count 347
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 269 transition count 345
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 267 transition count 345
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 21 place count 260 transition count 338
Iterating global reduction 3 with 7 rules applied. Total rules applied 28 place count 260 transition count 338
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 44 place count 252 transition count 330
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 252 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 251 transition count 329
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 250 transition count 328
Applied a total of 47 rules in 50 ms. Remains 250 /274 variables (removed 24) and now considering 328/352 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 250/274 places, 328/352 transitions.
Incomplete random walk after 10000 steps, including 239 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 21:54:31] [INFO ] Flow matrix only has 327 transitions (discarded 1 similar events)
// Phase 1: matrix 327 rows 250 cols
[2023-03-10 21:54:31] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 21:54:31] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 21:54:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 21:54:31] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 21:54:31] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-10 21:54:32] [INFO ] After 189ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-10 21:54:32] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 3 ms to minimize.
[2023-03-10 21:54:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-10 21:54:32] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 183 ms.
[2023-03-10 21:54:32] [INFO ] After 1015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 17 ms.
Support contains 112 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 328/328 transitions.
Graph (trivial) has 17 edges and 250 vertex of which 3 / 250 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 248 transition count 323
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 246 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 245 transition count 322
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 9 place count 243 transition count 320
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 243 transition count 320
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 23 place count 237 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 237 transition count 312
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 26 place count 236 transition count 311
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 236 transition count 311
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 236 transition count 310
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 30 place count 236 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 32 place count 234 transition count 308
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 33 place count 234 transition count 308
Applied a total of 33 rules in 51 ms. Remains 234 /250 variables (removed 16) and now considering 308/328 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 234/250 places, 308/328 transitions.
Incomplete random walk after 10000 steps, including 276 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1579683 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 1579683 steps, saw 382072 distinct states, run finished after 3002 ms. (steps per millisecond=526 ) properties seen :3
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2023-03-10 21:54:35] [INFO ] Flow matrix only has 307 transitions (discarded 1 similar events)
// Phase 1: matrix 307 rows 234 cols
[2023-03-10 21:54:35] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 21:54:35] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:54:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-10 21:54:36] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:54:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-10 21:54:36] [INFO ] After 79ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:54:36] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-10 21:54:36] [INFO ] After 507ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 68 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 308/308 transitions.
Graph (trivial) has 54 edges and 234 vertex of which 3 / 234 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 232 transition count 295
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 222 transition count 295
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 21 place count 222 transition count 291
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 29 place count 218 transition count 291
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 44 place count 203 transition count 276
Iterating global reduction 2 with 15 rules applied. Total rules applied 59 place count 203 transition count 276
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 83 place count 191 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 88 place count 186 transition count 259
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 186 transition count 259
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 98 place count 186 transition count 254
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 106 place count 186 transition count 246
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 114 place count 178 transition count 246
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 178 transition count 244
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 119 place count 178 transition count 244
Applied a total of 119 rules in 50 ms. Remains 178 /234 variables (removed 56) and now considering 244/308 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 178/234 places, 244/308 transitions.
Incomplete random walk after 10000 steps, including 305 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2047116 steps, run timeout after 3001 ms. (steps per millisecond=682 ) properties seen :{}
Probabilistic random walk after 2047116 steps, saw 457141 distinct states, run finished after 3001 ms. (steps per millisecond=682 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-10 21:54:39] [INFO ] Flow matrix only has 242 transitions (discarded 2 similar events)
// Phase 1: matrix 242 rows 178 cols
[2023-03-10 21:54:39] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-10 21:54:39] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:54:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:39] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:54:39] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-10 21:54:39] [INFO ] After 84ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:54:40] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-10 21:54:40] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 68 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 244/244 transitions.
Applied a total of 0 rules in 7 ms. Remains 178 /178 variables (removed 0) and now considering 244/244 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 178/178 places, 244/244 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 244/244 transitions.
Applied a total of 0 rules in 5 ms. Remains 178 /178 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2023-03-10 21:54:40] [INFO ] Flow matrix only has 242 transitions (discarded 2 similar events)
[2023-03-10 21:54:40] [INFO ] Invariant cache hit.
[2023-03-10 21:54:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-10 21:54:40] [INFO ] Flow matrix only has 242 transitions (discarded 2 similar events)
[2023-03-10 21:54:40] [INFO ] Invariant cache hit.
[2023-03-10 21:54:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-10 21:54:40] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-10 21:54:40] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-10 21:54:40] [INFO ] Flow matrix only has 242 transitions (discarded 2 similar events)
[2023-03-10 21:54:40] [INFO ] Invariant cache hit.
[2023-03-10 21:54:40] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 178/178 places, 244/244 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 178 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 177 transition count 241
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 175 transition count 239
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 175 transition count 239
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 174 transition count 238
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 173 transition count 237
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 173 transition count 237
Applied a total of 12 rules in 16 ms. Remains 173 /178 variables (removed 5) and now considering 237/244 (removed 7) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 237 rows 173 cols
[2023-03-10 21:54:40] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-10 21:54:40] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 21:54:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-10 21:54:40] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 21:54:40] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 77 ms.
[2023-03-10 21:54:40] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 21:54:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2023-03-10 21:54:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 244 transitions and 755 arcs took 2 ms.
[2023-03-10 21:54:41] [INFO ] Flatten gal took : 46 ms
Total runtime 17486 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FlexibleBarrier-PT-06b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
ReachabilityFireability

FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678485284436

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 4 (type EQUN) for FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: result : unknown
lola: LAUNCH task # 8 (type SRCH) for 0 FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 8 (type SRCH) for FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 3 (type FNDP) for FlexibleBarrier-PT-06b-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 490069
lola: tried executions : 12636
lola: time used : 2.000000
lola: memory pages used : 0
lola: CANCELED task # 6 (type SRCH) for FlexibleBarrier-PT-06b-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 7 (type EXCL) for FlexibleBarrier-PT-06b-ReachabilityFireability-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FlexibleBarrier-PT-06b-ReachabilityFireability-10: EF true findpath


Time elapsed: 3 secs. Pages in use: 3

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="FlexibleBarrier-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is FlexibleBarrier-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853100471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-06b.tgz
mv FlexibleBarrier-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;