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.r047-tajo-171620398100367.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 greatspnxred
Input is BugTracking-PT-q3m064, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 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-q3m064-ReachabilityFireability-2024-00
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2023-01
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-02
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-03
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-04
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-05
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-06
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-07
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2023-08
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-09
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-10
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-11
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-12
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-13
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-14
FORMULA_NAME BugTracking-PT-q3m064-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716295439219

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:44:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 12:44:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:44:01] [INFO ] Load time of PNML (sax parser for PT used): 809 ms
[2024-05-21 12:44:01] [INFO ] Transformed 754 places.
[2024-05-21 12:44:01] [INFO ] Transformed 27370 transitions.
[2024-05-21 12:44:01] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1010 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 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-q3m064-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (32 resets) in 2282 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 228 ms. (174 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 125535 steps, run timeout after 3003 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 125535 steps, saw 62756 distinct states, run finished after 3008 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-21 12:44:05] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-21 12:44:05] [INFO ] Computed 10 invariants in 33 ms
[2024-05-21 12:44:06] [INFO ] State equation strengthened by 255 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 12:44:06] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1809/1903 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1903 variables, 146/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 854/2757 variables, 80/327 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2757 variables, 84/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2757 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 4/2761 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2761 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 117/2878 variables, 63/475 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2878 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2878 variables, 24/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/2881 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2881 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2881 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/2882 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2882 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2882 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2882 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2882/2882 variables, and 506 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1955 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 83/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1809/1903 variables, 94/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1903 variables, 146/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1903 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1903 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 854/2757 variables, 80/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2757 variables, 84/412 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2757 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2757 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/2761 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2761 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 117/2878 variables, 63/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2878 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2878 variables, 24/503 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2878 variables, 2/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2878 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/2881 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2881 variables, 1/507 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 12:44:11] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 3 ms to minimize.
[2024-05-21 12:44:11] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2881 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2881 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 1/2882 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2882 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2882/2882 variables, and 512 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, ReadFeed: 255/255 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 7186ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 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.12 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 292 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 303 ms. Remains : 230/240 places, 2748/2769 transitions.
RANDOM walk for 40088 steps (47 resets) in 430 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 100579 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 100579 steps, saw 66652 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-21 12:44:16] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
// Phase 1: matrix 2619 rows 230 cols
[2024-05-21 12:44:16] [INFO ] Computed 8 invariants in 14 ms
[2024-05-21 12:44:16] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1769/1848 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1848 variables, 116/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1848 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 881/2729 variables, 87/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2729 variables, 100/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2729 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/2732 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2732 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 116/2848 variables, 63/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2848 variables, 2/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2848 variables, 25/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2848 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/2849 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2849 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2849 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2849/2849 variables, and 479 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 68/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1769/1848 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1848 variables, 116/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1848 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 881/2729 variables, 87/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2729 variables, 100/386 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2729 variables, 2/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2729 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/2732 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2732 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 116/2848 variables, 63/452 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2848 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2848 variables, 25/479 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2848 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 12:44:21] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 2 ms to minimize.
[2024-05-21 12:44:21] [INFO ] Deduced a trap composed of 54 places in 351 ms of which 2 ms to minimize.
[2024-05-21 12:44:22] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2024-05-21 12:44:22] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 2 ms to minimize.
[2024-05-21 12:44:22] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2848 variables, 5/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2848 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 1/2849 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2849 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 12:44:25] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2849 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2849 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2849 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2849/2849 variables, and 489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, ReadFeed: 241/241 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 10804ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 15999 ms.
Support contains 11 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 51 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 51 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 45 ms. Remains 230 /230 variables (removed 0) and now considering 2748/2748 (removed 0) transitions.
[2024-05-21 12:44:43] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-21 12:44:43] [INFO ] Invariant cache hit.
[2024-05-21 12:44:44] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-21 12:44:44] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-21 12:44:44] [INFO ] Invariant cache hit.
[2024-05-21 12:44:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 12:44:45] [INFO ] Implicit Places using invariants and state equation in 1389 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2024-05-21 12:44:45] [INFO ] Redundant transitions in 159 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-05-21 12:44:45] [INFO ] Flow matrix only has 2619 transitions (discarded 129 similar events)
[2024-05-21 12:44:45] [INFO ] Invariant cache hit.
[2024-05-21 12:44:45] [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-05-21 12:45:38] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-05-21 12:45:38] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 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-05-21 12:45:39] [INFO ] Deduced a trap composed of 8 places in 101 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-05-21 12:45:40] [INFO ] Deduced a trap composed of 9 places in 66 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-05-21 12:45:40] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 3 ms to minimize.
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
[2024-05-21 12:45:40] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 9 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-05-21 12:45:40] [INFO ] Deduced a trap composed of 9 places in 57 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-05-21 12:45:40] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
[2024-05-21 12:45:40] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 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-05-21 12:45:40] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 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
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30055 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
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/18 constraints. Problems are: Problem set: 198 solved, 2548 unsolved
SMT process timed out in 87357ms, After SMT, problems are : Problem set: 198 solved, 2548 unsolved
Search for dead transitions found 198 dead transitions in 87395ms
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.1 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 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 50 place count 173 transition count 1407
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 7 places and 120 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 66 place count 166 transition count 1287
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 66 rules in 47 ms. Remains 166 /230 variables (removed 64) and now considering 1287/2550 (removed 1263) transitions.
[2024-05-21 12:46:13] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
// Phase 1: matrix 1202 rows 166 cols
[2024-05-21 12:46:13] [INFO ] Computed 9 invariants in 7 ms
[2024-05-21 12:46:13] [INFO ] Implicit Places using invariants in 661 ms returned []
[2024-05-21 12:46:13] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
[2024-05-21 12:46:13] [INFO ] Invariant cache hit.
[2024-05-21 12:46:13] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-21 12:46:14] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 166/230 places, 1287/2748 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 90756 ms. Remains : 166/230 places, 1287/2748 transitions.
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2023-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40032 steps (56 resets) in 359 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (31 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 240253 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :0 out of 2
Probabilistic random walk after 240253 steps, saw 157797 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
[2024-05-21 12:46:17] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
// Phase 1: matrix 1202 rows 164 cols
[2024-05-21 12:46:17] [INFO ] Computed 7 invariants in 9 ms
[2024-05-21 12:46:17] [INFO ] State equation strengthened by 139 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) 30/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 461/497 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 333/830 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/830 variables, 31/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/834 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/834 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 457/1291 variables, 48/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1291 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1291 variables, 53/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1291 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1293 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1293 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 73/1366 variables, 42/292 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1366 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1366 variables, 17/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1366 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/1366 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1366/1366 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 139/139 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) 30/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 461/497 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/497 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 333/830 variables, 38/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/830 variables, 31/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/830 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/830 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/834 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/834 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 457/1291 variables, 48/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1291 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1291 variables, 53/250 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1291 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 12:46:18] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1291 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/1293 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1293 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 73/1366 variables, 42/295 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1366 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1366 variables, 17/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 12:46:19] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 1 ms to minimize.
[2024-05-21 12:46:19] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1366 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1366 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 12:46:19] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/1366 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1366 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1366 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1366/1366 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1689 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2259ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 809 ms.
Support contains 6 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 1287/1287 transitions.
Applied a total of 0 rules in 20 ms. Remains 164 /164 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 164/164 places, 1287/1287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 1287/1287 transitions.
Applied a total of 0 rules in 21 ms. Remains 164 /164 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2024-05-21 12:46:20] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
[2024-05-21 12:46:20] [INFO ] Invariant cache hit.
[2024-05-21 12:46:21] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-21 12:46:21] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
[2024-05-21 12:46:21] [INFO ] Invariant cache hit.
[2024-05-21 12:46:21] [INFO ] State equation strengthened by 139 read => feed constraints.
[2024-05-21 12:46:21] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 849 ms to find 0 implicit places.
[2024-05-21 12:46:21] [INFO ] Redundant transitions in 16 ms returned []
Running 1285 sub problems to find dead transitions.
[2024-05-21 12:46:21] [INFO ] Flow matrix only has 1202 transitions (discarded 85 similar events)
[2024-05-21 12:46:21] [INFO ] Invariant cache hit.
[2024-05-21 12:46:21] [INFO ] State equation strengthened by 139 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1285 unsolved
[2024-05-21 12:46:30] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 1281 unsolved
[2024-05-21 12:46:35] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2024-05-21 12:46:35] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 2/10 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 4 (OVERLAPS) 1202/1366 variables, 164/174 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1366 variables, 139/313 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1366/1366 variables, and 313 constraints, problems are : Problem set: 8 solved, 1277 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1285/1285 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 3/10 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 3 (OVERLAPS) 1202/1366 variables, 164/174 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1366 variables, 139/313 constraints. Problems are: Problem set: 8 solved, 1277 unsolved
Problem TDEAD451 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1094 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1366 variables, 1277/1590 constraints. Problems are: Problem set: 107 solved, 1178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1366/1366 variables, and 1590 constraints, problems are : Problem set: 107 solved, 1178 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 164/164 constraints, ReadFeed: 139/139 constraints, PredecessorRefiner: 1277/1285 constraints, Known Traps: 3/3 constraints]
After SMT, in 64439ms problems are : Problem set: 107 solved, 1178 unsolved
Search for dead transitions found 107 dead transitions in 64452ms
Found 107 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 107 transitions
Dead transitions reduction (with SMT) removed 107 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 164/164 places, 1180/1287 transitions.
Reduce places removed 25 places and 423 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 139 transition count 757
Reduce places removed 18 places and 179 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 43 place count 121 transition count 578
Reduce places removed 8 places and 69 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 51 place count 113 transition count 509
Reduce places removed 6 places and 54 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 57 place count 107 transition count 455
Reduce places removed 3 places and 42 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 60 place count 104 transition count 413
Reduce places removed 1 places and 10 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 61 place count 103 transition count 403
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 62 place count 102 transition count 391
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 63 place count 101 transition count 385
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 68 place count 96 transition count 354
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 8 with 5 rules applied. Total rules applied 73 place count 96 transition count 354
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 73 rules in 18 ms. Remains 96 /164 variables (removed 68) and now considering 354/1180 (removed 826) transitions.
[2024-05-21 12:47:26] [INFO ] Flow matrix only has 328 transitions (discarded 26 similar events)
// Phase 1: matrix 328 rows 96 cols
[2024-05-21 12:47:26] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 12:47:26] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-21 12:47:26] [INFO ] Flow matrix only has 328 transitions (discarded 26 similar events)
[2024-05-21 12:47:26] [INFO ] Invariant cache hit.
[2024-05-21 12:47:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 12:47:26] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/164 places, 354/1287 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65717 ms. Remains : 96/164 places, 354/1287 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-ReachabilityFireability-2023-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 205870 ms.
ITS solved all properties within timeout

BK_STOP 1716295646581

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-q3m064"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BugTracking-PT-q3m064, 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 r047-tajo-171620398100367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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