fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281700063
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BugTracking-PT-q3m256

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4201.815 3600000.00 13990249.00 467.30 FFFFFFTTFTTT?FFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r312-tall-165472281700063.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BugTracking-PT-q3m256, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281700063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 17:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Jun 7 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q3m256-ReachabilityFireability-00
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-01
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-02
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-03
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-04
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-05
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-06
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-07
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-08
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-09
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-10
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-11
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-12
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-13
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-14
FORMULA_NAME BugTracking-PT-q3m256-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654745515761

Running Version 202205111006
[2022-06-09 03:31:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:31:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:31:57] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2022-06-09 03:31:57] [INFO ] Transformed 754 places.
[2022-06-09 03:31:57] [INFO ] Transformed 27370 transitions.
[2022-06-09 03:31:57] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1033 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 121 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 139216 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139216 steps, saw 67121 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 03:32:01] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-09 03:32:01] [INFO ] Computed 10 place invariants in 38 ms
[2022-06-09 03:32:01] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:32:02] [INFO ] After 575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-09 03:32:02] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 03:32:02] [INFO ] After 307ms SMT Verify possible using 255 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 03:32:02] [INFO ] After 1090ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 03:32:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-06-09 03:32:03] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 03:32:03] [INFO ] After 287ms SMT Verify possible using 255 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 03:32:03] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 7 ms to minimize.
[2022-06-09 03:32:04] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 1 ms to minimize.
[2022-06-09 03:32:04] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 1 ms to minimize.
[2022-06-09 03:32:04] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2022-06-09 03:32:05] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 1 ms to minimize.
[2022-06-09 03:32:05] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 0 ms to minimize.
[2022-06-09 03:32:05] [INFO ] Deduced a trap composed of 30 places in 331 ms of which 3 ms to minimize.
[2022-06-09 03:32:05] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
[2022-06-09 03:32:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2325 ms
[2022-06-09 03:32:06] [INFO ] After 2860ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 172 ms.
[2022-06-09 03:32:06] [INFO ] After 3634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8016 ms.
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 12 place count 235 transition count 2748
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 230 transition count 2748
Applied a total of 17 rules in 285 ms. Remains 230 /240 variables (removed 10) and now considering 2748/2769 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/240 places, 2748/2769 transitions.
Incomplete random walk after 1000000 steps, including 340 resets, run finished after 8565 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 58 resets, run finished after 2986 ms. (steps per millisecond=334 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 48 resets, run finished after 2893 ms. (steps per millisecond=345 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1810104 steps, run timeout after 42001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 1810104 steps, saw 1177170 distinct states, run finished after 42001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-09 03:33:11] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:11] [INFO ] Computed 8 place invariants in 20 ms
[2022-06-09 03:33:11] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-09 03:33:11] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 03:33:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 03:33:12] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 03:33:12] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:33:12] [INFO ] After 247ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 03:33:12] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2022-06-09 03:33:13] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 0 ms to minimize.
[2022-06-09 03:33:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 488 ms
[2022-06-09 03:33:13] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2022-06-09 03:33:13] [INFO ] After 1610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11268 ms.
Support contains 5 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 41 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 36 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2022-06-09 03:33:24] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:24] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 03:33:25] [INFO ] Implicit Places using invariants in 305 ms returned []
[2022-06-09 03:33:25] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:25] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 03:33:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:33:26] [INFO ] Implicit Places using invariants and state equation in 1479 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
[2022-06-09 03:33:26] [INFO ] Redundant transitions in 168 ms returned []
[2022-06-09 03:33:26] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:26] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 03:33:27] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2748/2748 transitions.
Incomplete random walk after 100000 steps, including 19 resets, run finished after 1134 ms. (steps per millisecond=88 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2022-06-09 03:33:28] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:28] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 03:33:28] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 03:33:29] [INFO ] After 518ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-06-09 03:33:29] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:33:29] [INFO ] After 267ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 03:33:29] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-09 03:33:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 03:33:30] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-09 03:33:30] [INFO ] After 303ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-09 03:33:30] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 0 ms to minimize.
[2022-06-09 03:33:30] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 0 ms to minimize.
[2022-06-09 03:33:31] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2022-06-09 03:33:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 629 ms
[2022-06-09 03:33:31] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2022-06-09 03:33:31] [INFO ] Deduced a trap composed of 54 places in 202 ms of which 0 ms to minimize.
[2022-06-09 03:33:31] [INFO ] Deduced a trap composed of 52 places in 181 ms of which 1 ms to minimize.
[2022-06-09 03:33:32] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 1 ms to minimize.
[2022-06-09 03:33:32] [INFO ] Deduced a trap composed of 31 places in 162 ms of which 0 ms to minimize.
[2022-06-09 03:33:32] [INFO ] Deduced a trap composed of 62 places in 176 ms of which 0 ms to minimize.
[2022-06-09 03:33:32] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 0 ms to minimize.
[2022-06-09 03:33:32] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 0 ms to minimize.
[2022-06-09 03:33:33] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 1 ms to minimize.
[2022-06-09 03:33:33] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2022-06-09 03:33:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2457 ms
[2022-06-09 03:33:33] [INFO ] After 3541ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2022-06-09 03:33:33] [INFO ] After 4154ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
FORMULA BugTracking-PT-q3m256-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000065 steps, including 334 resets, run finished after 4221 ms. (steps per millisecond=236 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 48 resets, run finished after 1547 ms. (steps per millisecond=646 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 797107 steps, run timeout after 15001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 797107 steps, saw 518402 distinct states, run finished after 15001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 03:33:54] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:54] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 03:33:54] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 03:33:54] [INFO ] After 489ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:33:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 03:33:55] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 03:33:55] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:33:55] [INFO ] After 225ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 03:33:55] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 0 ms to minimize.
[2022-06-09 03:33:55] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2022-06-09 03:33:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 365 ms
[2022-06-09 03:33:56] [INFO ] After 658ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-06-09 03:33:56] [INFO ] After 1224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2549 ms.
Support contains 3 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 39 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Applied a total of 0 rules in 37 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2022-06-09 03:33:58] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:58] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 03:33:59] [INFO ] Implicit Places using invariants in 281 ms returned []
[2022-06-09 03:33:59] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:33:59] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 03:33:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:34:00] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
[2022-06-09 03:34:00] [INFO ] Redundant transitions in 71 ms returned []
[2022-06-09 03:34:00] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:34:00] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 03:34:01] [INFO ] Dead Transitions using invariants and state equation in 728 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 230/230 places, 2748/2748 transitions.
Incomplete random walk after 100000 steps, including 32 resets, run finished after 452 ms. (steps per millisecond=221 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2022-06-09 03:34:01] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:34:01] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 03:34:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 03:34:02] [INFO ] After 408ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 03:34:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:34:02] [INFO ] After 266ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:02] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2022-06-09 03:34:02] [INFO ] After 402ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:03] [INFO ] After 229ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:03] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 0 ms to minimize.
[2022-06-09 03:34:03] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2022-06-09 03:34:04] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 0 ms to minimize.
[2022-06-09 03:34:04] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 1 ms to minimize.
[2022-06-09 03:34:04] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2022-06-09 03:34:04] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2022-06-09 03:34:05] [INFO ] Deduced a trap composed of 49 places in 212 ms of which 0 ms to minimize.
[2022-06-09 03:34:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1923 ms
[2022-06-09 03:34:05] [INFO ] After 2258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2022-06-09 03:34:05] [INFO ] After 2824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 516 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=516 )
Incomplete random walk after 10000 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160874 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160874 steps, saw 105488 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 03:34:08] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2022-06-09 03:34:08] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 03:34:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 03:34:08] [INFO ] After 404ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 03:34:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:34:09] [INFO ] After 187ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:09] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2022-06-09 03:34:09] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:09] [INFO ] After 154ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:09] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 1 ms to minimize.
[2022-06-09 03:34:10] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 0 ms to minimize.
[2022-06-09 03:34:10] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2022-06-09 03:34:10] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 1 ms to minimize.
[2022-06-09 03:34:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 918 ms
[2022-06-09 03:34:10] [INFO ] After 1130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-06-09 03:34:10] [INFO ] After 1642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 230 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 230/230 places, 2748/2748 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 230 transition count 2747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 2747
Applied a total of 2 rules in 80 ms. Remains 229 /230 variables (removed 1) and now considering 2747/2748 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/230 places, 2747/2748 transitions.
Incomplete random walk after 10132 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1688 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174523 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174523 steps, saw 89506 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-09 03:34:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 03:34:13] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 03:34:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 03:34:14] [INFO ] After 414ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 03:34:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:34:14] [INFO ] After 265ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:14] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 03:34:15] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:15] [INFO ] After 174ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:15] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2022-06-09 03:34:15] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2022-06-09 03:34:16] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 0 ms to minimize.
[2022-06-09 03:34:16] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 0 ms to minimize.
[2022-06-09 03:34:16] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 0 ms to minimize.
[2022-06-09 03:34:16] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 1 ms to minimize.
[2022-06-09 03:34:17] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 0 ms to minimize.
[2022-06-09 03:34:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1885 ms
[2022-06-09 03:34:17] [INFO ] After 2104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2022-06-09 03:34:17] [INFO ] After 2596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 03:34:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 03:34:17] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 03:34:17] [INFO ] Implicit Places using invariants in 301 ms returned []
[2022-06-09 03:34:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 03:34:17] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 03:34:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 03:34:19] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 1789 ms to find 0 implicit places.
[2022-06-09 03:34:19] [INFO ] Redundant transitions in 131 ms returned []
[2022-06-09 03:34:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 03:34:19] [INFO ] Computed 8 place invariants in 7 ms
[2022-06-09 03:34:19] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 279 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2022-06-09 03:34:20] [INFO ] Computed 9 place invariants in 13 ms
[2022-06-09 03:34:20] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-06-09 03:34:20] [INFO ] After 396ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 03:34:20] [INFO ] After 485ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2022-06-09 03:34:20] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished random walk after 1058 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=529 )
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 230 transition count 2618
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 228 transition count 2616
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 228 transition count 2615
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 228 transition count 2611
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 224 transition count 2611
Applied a total of 143 rules in 132 ms. Remains 224 /230 variables (removed 6) and now considering 2611/2748 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2611 rows 224 cols
[2022-06-09 03:34:21] [INFO ] Computed 9 place invariants in 13 ms
[2022-06-09 03:34:21] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-06-09 03:34:21] [INFO ] After 410ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 03:34:21] [INFO ] After 509ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:21] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 03:34:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-06-09 03:34:22] [INFO ] After 404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:22] [INFO ] After 496ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2022-06-09 03:34:22] [INFO ] After 606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-09 03:34:22] [INFO ] Flatten gal took : 305 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16202603087512107198
[2022-06-09 03:34:22] [INFO ] Too many transitions (2748) to apply POR reductions. Disabling POR matrices.
[2022-06-09 03:34:23] [INFO ] Applying decomposition
[2022-06-09 03:34:23] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16202603087512107198
Running compilation step : cd /tmp/ltsmin16202603087512107198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 03:34:23] [INFO ] Flatten gal took : 210 ms
[2022-06-09 03:34:23] [INFO ] Flatten gal took : 405 ms
Compilation finished in 6494 ms.
Running link step : cd /tmp/ltsmin16202603087512107198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 515 ms.
Running LTSmin : cd /tmp/ltsmin16202603087512107198;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BugTrackingPTq3m256ReachabilityFireability12==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BugTracking-PT-q3m256"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m256, 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 r312-tall-165472281700063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m256.tgz
mv BugTracking-PT-q3m256 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 ;