Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399300327.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q3m002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399300327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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-q3m002-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-01
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-08
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-12
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2023-13
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2023-14
FORMULA_NAME BugTracking-PT-q3m002-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717222845630

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:20:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:20:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:20:48] [INFO ] Load time of PNML (sax parser for PT used): 794 ms
[2024-06-01 06:20:48] [INFO ] Transformed 754 places.
[2024-06-01 06:20:48] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:20:48] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1022 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 514 places in 99 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (843 resets) in 2507 ms. (15 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (282 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (541 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (296 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (254 resets) in 339 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (260 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 124843 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 5
Probabilistic random walk after 124843 steps, saw 72362 distinct states, run finished after 3006 ms. (steps per millisecond=41 ) properties seen :0
[2024-06-01 06:20:52] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-06-01 06:20:52] [INFO ] Computed 10 invariants in 32 ms
[2024-06-01 06:20:52] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 118/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 13 ms to minimize.
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
Problem BugTracking-PT-q3m002-ReachabilityFireability-2024-06 is UNSAT
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 06:20:53] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
Problem BugTracking-PT-q3m002-ReachabilityFireability-2023-14 is UNSAT
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2023-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem BugTracking-PT-q3m002-ReachabilityFireability-2024-15 is UNSAT
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 4/12 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2490/2623 variables, 133/145 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2623 variables, 226/371 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2623 variables, 0/371 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 230/2853 variables, 90/461 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2853 variables, 22/483 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2853 variables, 0/483 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 28/2881 variables, 16/499 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2881 variables, 1/500 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2881 variables, 7/507 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2881 variables, 0/507 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/2882 variables, 1/508 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2882 variables, 1/509 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2882 variables, 0/509 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/2882 variables, 0/509 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 509 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 69/75 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1655/1730 variables, 75/80 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1730 variables, 117/197 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1730 variables, 1/198 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1730 variables, 0/198 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 729/2459 variables, 80/278 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2459 variables, 61/339 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2459 variables, 0/339 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 4/2463 variables, 1/340 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2463 variables, 0/340 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 392/2855 variables, 61/401 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2855 variables, 2/403 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2855 variables, 75/478 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2855 variables, 1/479 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2855 variables, 1/480 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2855 variables, 0/480 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 5/2860 variables, 2/482 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2860 variables, 1/483 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2860 variables, 0/483 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 22/2882 variables, 23/506 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2882 variables, 1/507 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2882 variables, 2/509 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2882 variables, 2/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2882 variables, 0/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/2882 variables, 0/511 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2882/2882 variables, and 511 constraints, problems are : Problem set: 3 solved, 2 unsolved in 4250 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 6035ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 8218 ms.
Support contains 6 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.7 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 204 ms. Remains 230 /240 variables (removed 10) and now considering 2748/2769 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 230/240 places, 2748/2769 transitions.
RANDOM walk for 40001 steps (1158 resets) in 474 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (559 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (332 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 153058 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 153058 steps, saw 100491 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 06:21:10] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2024-06-01 06:21:10] [INFO ] Computed 8 invariants in 31 ms
[2024-06-01 06:21:10] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1617/1679 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1679 variables, 86/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1679 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 627/2306 variables, 78/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 70/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2306 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/2308 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2308 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 505/2813 variables, 56/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2813 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2813 variables, 83/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2813 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/2816 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2816 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 33/2849 variables, 34/475 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2849 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2849 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2849/2849 variables, and 479 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1617/1679 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1679 variables, 86/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1679 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 627/2306 variables, 78/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2306 variables, 70/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2306 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2306 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/2308 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2308 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 505/2813 variables, 56/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2813 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2813 variables, 83/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2813 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:21:13] [INFO ] Deduced a trap composed of 19 places in 226 ms of which 2 ms to minimize.
[2024-06-01 06:21:13] [INFO ] Deduced a trap composed of 50 places in 262 ms of which 1 ms to minimize.
[2024-06-01 06:21:13] [INFO ] Deduced a trap composed of 39 places in 224 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 25 places in 234 ms of which 2 ms to minimize.
[2024-06-01 06:21:14] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 1 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 49 places in 312 ms of which 2 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 50 places in 222 ms of which 2 ms to minimize.
[2024-06-01 06:21:15] [INFO ] Deduced a trap composed of 38 places in 274 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2813 variables, 9/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-06-01 06:21:16] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2813 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2813 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/2816 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2816 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 33/2849 variables, 34/488 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2849 variables, 2/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2849 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2849 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/2849 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2849/2849 variables, and 492 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 7753ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3967 ms.
Support contains 6 out of 230 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 REACHABILITY mode , in 1 iterations and 41 ms. Remains : 230/230 places, 2748/2748 transitions.
Starting structural reductions in REACHABILITY 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.
[2024-06-01 06:21:22] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-06-01 06:21:22] [INFO ] Invariant cache hit.
[2024-06-01 06:21:22] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-06-01 06:21:22] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-06-01 06:21:22] [INFO ] Invariant cache hit.
[2024-06-01 06:21:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-06-01 06:21:24] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
[2024-06-01 06:21:24] [INFO ] Redundant transitions in 160 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-06-01 06:21:24] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-06-01 06:21:24] [INFO ] Invariant cache hit.
[2024-06-01 06:21:24] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-06-01 06:22:16] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 14 ms to minimize.
Problem TDEAD2293 is UNSAT
Problem TDEAD2294 is UNSAT
Problem TDEAD2295 is UNSAT
Problem TDEAD2296 is UNSAT
Problem TDEAD2298 is UNSAT
Problem TDEAD2299 is UNSAT
Problem TDEAD2302 is UNSAT
Problem TDEAD2303 is UNSAT
Problem TDEAD2304 is UNSAT
Problem TDEAD2305 is UNSAT
Problem TDEAD2308 is UNSAT
Problem TDEAD2309 is UNSAT
Problem TDEAD2310 is UNSAT
Problem TDEAD2311 is UNSAT
Problem TDEAD2314 is UNSAT
Problem TDEAD2315 is UNSAT
Problem TDEAD2316 is UNSAT
Problem TDEAD2317 is UNSAT
Problem TDEAD2319 is UNSAT
Problem TDEAD2320 is UNSAT
Problem TDEAD2323 is UNSAT
Problem TDEAD2324 is UNSAT
Problem TDEAD2325 is UNSAT
Problem TDEAD2326 is UNSAT
Problem TDEAD2329 is UNSAT
Problem TDEAD2330 is UNSAT
Problem TDEAD2331 is UNSAT
Problem TDEAD2332 is UNSAT
[2024-06-01 06:22:17] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 1 ms to minimize.
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 1 ms to minimize.
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2593 is UNSAT
[2024-06-01 06:22:18] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
[2024-06-01 06:22:19] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
[2024-06-01 06:22:19] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
[2024-06-01 06:22:19] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
Problem TDEAD2632 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD2269 is UNSAT
Problem TDEAD2270 is UNSAT
Problem TDEAD2271 is UNSAT
Problem TDEAD2272 is UNSAT
Problem TDEAD2273 is UNSAT
Problem TDEAD2274 is UNSAT
Problem TDEAD2275 is UNSAT
Problem TDEAD2280 is UNSAT
Problem TDEAD2281 is UNSAT
Problem TDEAD2282 is UNSAT
Problem TDEAD2283 is UNSAT
Problem TDEAD2284 is UNSAT
Problem TDEAD2285 is UNSAT
Problem TDEAD2286 is UNSAT
Problem TDEAD2287 is UNSAT
Problem TDEAD2288 is UNSAT
Problem TDEAD2289 is UNSAT
Problem TDEAD2290 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 10/18 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 230/2849 variables, and 18 constraints, problems are : Problem set: 198 solved, 2548 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 198 solved, 2548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 7/7 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/222 variables, 10/17 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 0/17 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
At refinement iteration 3 (OVERLAPS) 8/230 variables, 1/18 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/2849 variables, and 18 constraints, problems are : Problem set: 198 solved, 2548 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/230 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 10/10 constraints]
After SMT, in 88284ms problems are : Problem set: 198 solved, 2548 unsolved
Search for dead transitions found 198 dead transitions in 88348ms
Found 198 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 198 transitions
Dead transitions reduction (with SMT) removed 198 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/230 places, 2550/2748 transitions.
Graph (complete) has 3104 edges and 230 vertex of which 222 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 18 places and 551 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 204 transition count 1999
Reduce places removed 13 places and 257 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 191 transition count 1742
Reduce places removed 5 places and 141 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 186 transition count 1601
Reduce places removed 4 places and 77 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 41 place count 182 transition count 1524
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 49 place count 174 transition count 1427
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 7 places and 121 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 64 place count 167 transition count 1306
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 64 rules in 61 ms. Remains 167 /230 variables (removed 63) and now considering 1306/2550 (removed 1244) transitions.
[2024-06-01 06:22:52] [INFO ] Flow matrix only has 1219 transitions (discarded 87 similar events)
// Phase 1: matrix 1219 rows 167 cols
[2024-06-01 06:22:52] [INFO ] Computed 9 invariants in 38 ms
[2024-06-01 06:22:53] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-06-01 06:22:53] [INFO ] Flow matrix only has 1219 transitions (discarded 87 similar events)
[2024-06-01 06:22:53] [INFO ] Invariant cache hit.
[2024-06-01 06:22:53] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-06-01 06:22:54] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 167/230 places, 1306/2748 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 92341 ms. Remains : 167/230 places, 1306/2748 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-ReachabilityFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 127318 ms.
ITS solved all properties within timeout

BK_STOP 1717222974562

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-q3m002"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m002, 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 r472-tajo-171620399300327"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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