Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683760800287.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldIIPt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760800287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 20:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 338K May 18 16:43 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 ShieldIIPt-PT-020B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPt-PT-020B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717237179095

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:19:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 10:19:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:19:40] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-01 10:19:40] [INFO ] Transformed 1403 places.
[2024-06-01 10:19:40] [INFO ] Transformed 1303 transitions.
[2024-06-01 10:19:40] [INFO ] Found NUPN structural information;
[2024-06-01 10:19:40] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1346 ms. (29 steps per ms) remains 8/16 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1196 ms. (33 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
// Phase 1: matrix 1303 rows 1403 cols
[2024-06-01 10:19:41] [INFO ] Computed 181 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 213/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1151/1364 variables, 174/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 1151/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1364 variables, 0/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 39/1403 variables, 7/1545 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1403 variables, 39/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1403 variables, 0/1584 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1303/2706 variables, 1403/2987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2706 variables, 0/2987 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2706/2706 variables, and 2987 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2374 ms.
Refiners :[Domain max(s): 1403/1403 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 1403/1403 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 213/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/213 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1151/1364 variables, 174/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 1151/1538 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 10:19:45] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 51 ms to minimize.
[2024-06-01 10:19:45] [INFO ] Deduced a trap composed of 18 places in 246 ms of which 5 ms to minimize.
[2024-06-01 10:19:45] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 5 ms to minimize.
[2024-06-01 10:19:46] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 5 ms to minimize.
[2024-06-01 10:19:46] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 5 ms to minimize.
[2024-06-01 10:19:46] [INFO ] Deduced a trap composed of 19 places in 224 ms of which 4 ms to minimize.
[2024-06-01 10:19:46] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 5 ms to minimize.
[2024-06-01 10:19:47] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 4 ms to minimize.
[2024-06-01 10:19:47] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 4 ms to minimize.
[2024-06-01 10:19:47] [INFO ] Deduced a trap composed of 16 places in 208 ms of which 4 ms to minimize.
[2024-06-01 10:19:47] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 5 ms to minimize.
[2024-06-01 10:19:48] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 4 ms to minimize.
[2024-06-01 10:19:48] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 5 ms to minimize.
[2024-06-01 10:19:48] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 5 ms to minimize.
[2024-06-01 10:19:48] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 4 ms to minimize.
[2024-06-01 10:19:48] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 4 ms to minimize.
[2024-06-01 10:19:49] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 4 ms to minimize.
[2024-06-01 10:19:49] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 4 ms to minimize.
[2024-06-01 10:19:49] [INFO ] Deduced a trap composed of 43 places in 201 ms of which 4 ms to minimize.
SMT process timed out in 7657ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 213 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 1403 transition count 1107
Reduce places removed 196 places and 0 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Iterating post reduction 1 with 251 rules applied. Total rules applied 447 place count 1207 transition count 1052
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 503 place count 1152 transition count 1051
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 503 place count 1152 transition count 970
Deduced a syphon composed of 81 places in 2 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 665 place count 1071 transition count 970
Discarding 97 places :
Symmetric choice reduction at 3 with 97 rule applications. Total rules 762 place count 974 transition count 873
Iterating global reduction 3 with 97 rules applied. Total rules applied 859 place count 974 transition count 873
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 859 place count 974 transition count 850
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 905 place count 951 transition count 850
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Deduced a syphon composed of 252 places in 1 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 3 with 504 rules applied. Total rules applied 1409 place count 699 transition count 598
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 1461 place count 673 transition count 602
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1467 place count 673 transition count 596
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1473 place count 667 transition count 596
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 1491 place count 667 transition count 596
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1492 place count 666 transition count 595
Applied a total of 1492 rules in 431 ms. Remains 666 /1403 variables (removed 737) and now considering 595/1303 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 666/1403 places, 595/1303 transitions.
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 6/8 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 291 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/6 properties
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
// Phase 1: matrix 595 rows 666 cols
[2024-06-01 10:19:50] [INFO ] Computed 181 invariants in 4 ms
[2024-06-01 10:19:50] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 460/639 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 23/662 variables, 10/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/662 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 595/1257 variables, 662/841 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1257 variables, 45/886 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1257 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 4/1261 variables, 4/890 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1261 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1261 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1261 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1261/1261 variables, and 892 constraints, problems are : Problem set: 0 solved, 5 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 666/666 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 460/639 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:19:51] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 4 ms to minimize.
[2024-06-01 10:19:51] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:19:51] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:19:51] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 5 ms to minimize.
[2024-06-01 10:19:52] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/639 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-06-01 10:19:53] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/639 variables, 15/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 8 ms to minimize.
[2024-06-01 10:19:54] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/639 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 23/662 variables, 10/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 595/1257 variables, 662/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1257 variables, 45/924 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1257 variables, 5/929 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:19:56] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 10:19:56] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-01 10:19:56] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 10:19:56] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 10:19:56] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:19:56] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1257 variables, 6/935 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:19:57] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:19:57] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1257 variables, 2/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1257 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 4/1261 variables, 4/941 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1261 variables, 2/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1261 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1261 variables, 0/943 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1261/1261 variables, and 943 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7975 ms.
Refiners :[Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 666/666 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 46/46 constraints]
After SMT, in 9000ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 7486 ms.
Support contains 179 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 595/595 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 666 transition count 592
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 663 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 662 transition count 591
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 8 place count 662 transition count 583
Deduced a syphon composed of 8 places in 14 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 654 transition count 583
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 74 place count 629 transition count 558
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 625 transition count 561
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 625 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 623 transition count 559
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 621 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 620 transition count 557
Applied a total of 89 rules in 116 ms. Remains 620 /666 variables (removed 46) and now considering 557/595 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 620/666 places, 557/595 transitions.
RANDOM walk for 40000 steps (8 resets) in 380 ms. (104 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 190405 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 5
Probabilistic random walk after 190405 steps, saw 89215 distinct states, run finished after 3010 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 557 rows 620 cols
[2024-06-01 10:20:10] [INFO ] Computed 180 invariants in 3 ms
[2024-06-01 10:20:10] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 417/596 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 18/614 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 557/1171 variables, 614/791 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1171 variables, 55/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1171 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 6/1177 variables, 6/852 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1177 variables, 3/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1177 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1177 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1177/1177 variables, and 855 constraints, problems are : Problem set: 0 solved, 5 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 620/620 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 417/596 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:20:11] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:20:11] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:20:11] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:20:11] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:20:12] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/596 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 3 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/596 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:20:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:20:14] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 4/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:20:14] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/596 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 18/614 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 557/1171 variables, 614/825 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1171 variables, 55/880 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1171 variables, 4/884 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 10:20:15] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
[2024-06-01 10:20:15] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-06-01 10:20:15] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 10:20:15] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:20:15] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 10:20:15] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 10:20:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 10:20:16] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:20:16] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 10:20:16] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:20:16] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:20:16] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1171 variables, 12/896 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1171 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 6/1177 variables, 6/902 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1177 variables, 3/905 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1177 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1177 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/1177 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1177/1177 variables, and 906 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7656 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 620/620 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 46/46 constraints]
After SMT, in 8574ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
FORMULA ShieldIIPt-PT-020B-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5223 ms.
Support contains 147 out of 620 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 620/620 places, 557/557 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 620 transition count 549
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 612 transition count 547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 610 transition count 547
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 20 place count 610 transition count 539
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 36 place count 602 transition count 539
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 78 place count 581 transition count 518
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 578 transition count 520
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 578 transition count 515
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 94 place count 573 transition count 515
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 573 transition count 515
Applied a total of 96 rules in 82 ms. Remains 573 /620 variables (removed 47) and now considering 515/557 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 573/620 places, 515/557 transitions.
RANDOM walk for 40000 steps (8 resets) in 422 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 223664 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 223664 steps, saw 109627 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 515 rows 573 cols
[2024-06-01 10:20:27] [INFO ] Computed 180 invariants in 3 ms
[2024-06-01 10:20:27] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 398/545 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/563 variables, 8/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 514/1077 variables, 563/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 64/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1077 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 11/1088 variables, 10/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1088 variables, 5/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1088 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1088/1088 variables, and 817 constraints, problems are : Problem set: 0 solved, 4 unsolved in 744 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 573/573 constraints, ReadFeed: 64/64 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/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 398/545 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:20:28] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:20:28] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 2 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:20:29] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 20/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/545 variables, 5/192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:20:30] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 18/563 variables, 8/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 514/1077 variables, 563/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1077 variables, 64/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1077 variables, 3/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 3 ms to minimize.
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 2 ms to minimize.
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 10:20:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-01 10:20:32] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1077 variables, 8/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1077 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/1088 variables, 10/851 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1088 variables, 5/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1088 variables, 1/857 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 10:20:33] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 10:20:33] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:20:33] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 3/860 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1088 variables, 0/860 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1088/1088 variables, and 860 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6206 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 573/573 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 39/39 constraints]
After SMT, in 6974ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 11076 ms.
Support contains 147 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 515/515 transitions.
Applied a total of 0 rules in 11 ms. Remains 573 /573 variables (removed 0) and now considering 515/515 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 573/573 places, 515/515 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 515/515 transitions.
Applied a total of 0 rules in 10 ms. Remains 573 /573 variables (removed 0) and now considering 515/515 (removed 0) transitions.
[2024-06-01 10:20:46] [INFO ] Invariant cache hit.
[2024-06-01 10:20:46] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-06-01 10:20:46] [INFO ] Invariant cache hit.
[2024-06-01 10:20:46] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-06-01 10:20:47] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1056 ms to find 0 implicit places.
[2024-06-01 10:20:47] [INFO ] Redundant transitions in 34 ms returned []
Running 507 sub problems to find dead transitions.
[2024-06-01 10:20:47] [INFO ] Invariant cache hit.
[2024-06-01 10:20:47] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (OVERLAPS) 6/573 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:20:55] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:20:55] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:20:55] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:20:55] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:20:56] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:20:57] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:20:57] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/573 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:21:02] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:21:03] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:04] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-06-01 10:21:05] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 10:21:05] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 10:21:05] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:21:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:21:06] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:21:06] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:21:06] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2024-06-01 10:21:06] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:21:07] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:21:07] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:21:07] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:21:07] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:21:07] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-06-01 10:21:07] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:21:08] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:21:08] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:21:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:21:09] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 10:21:09] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-06-01 10:21:13] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 573/1088 variables, and 242 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/573 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 507/507 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 507 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/567 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/567 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/567 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 3 (OVERLAPS) 6/573 variables, 169/181 constraints. Problems are: Problem set: 0 solved, 507 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/573 variables, 61/242 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:21:22] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:21:22] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:21:22] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:21:22] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 10:21:23] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 10:21:25] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-06-01 10:21:25] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:21:25] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
[2024-06-01 10:21:25] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:21:25] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:21:26] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/573 variables, 12/254 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:21:28] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:21:32] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 3/257 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:33] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/573 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:40] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/573 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 507 unsolved
[2024-06-01 10:21:43] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 10:21:44] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 507 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 573/1088 variables, and 261 constraints, problems are : Problem set: 0 solved, 507 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 0/573 constraints, ReadFeed: 0/64 constraints, PredecessorRefiner: 0/507 constraints, Known Traps: 81/81 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 507 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61301 ms. Remains : 573/573 places, 515/515 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 573 transition count 515
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 573 transition count 514
Applied a total of 32 rules in 38 ms. Remains 573 /573 variables (removed 0) and now considering 514/515 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 514 rows 573 cols
[2024-06-01 10:21:47] [INFO ] Computed 180 invariants in 2 ms
[2024-06-01 10:21:47] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 10:21:47] [INFO ] [Nat]Absence check using 180 positive place invariants in 30 ms returned sat
[2024-06-01 10:21:48] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 10:21:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 10:21:48] [INFO ] After 353ms SMT Verify possible using 23 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 10:21:48] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 10:21:48] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 3 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 2 ms to minimize.
[2024-06-01 10:21:49] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1695 ms
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 10:21:50] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 3 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 6 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-01 10:21:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1269 ms
[2024-06-01 10:21:51] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 303 ms
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
TRAPS : Iteration 1
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:21:52] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 493 ms
[2024-06-01 10:21:53] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2024-06-01 10:21:53] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-01 10:21:53] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 10:21:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
TRAPS : Iteration 2
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 2 ms to minimize.
[2024-06-01 10:21:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
TRAPS : Iteration 3
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 10:21:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
TRAPS : Iteration 4
[2024-06-01 10:21:56] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:21:56] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
[2024-06-01 10:21:56] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 10:21:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2024-06-01 10:21:56] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
TRAPS : Iteration 5
[2024-06-01 10:21:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
TRAPS : Iteration 6
[2024-06-01 10:21:57] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 2 ms to minimize.
[2024-06-01 10:21:57] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 10:21:57] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:21:57] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-06-01 10:21:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:21:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 539 ms
[2024-06-01 10:21:58] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-06-01 10:21:58] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 10:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
TRAPS : Iteration 7
[2024-06-01 10:21:58] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-06-01 10:21:58] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 10:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 262 ms
[2024-06-01 10:21:59] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-06-01 10:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-01 10:21:59] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 2 ms to minimize.
[2024-06-01 10:21:59] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 10:21:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2024-06-01 10:21:59] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 10:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
TRAPS : Iteration 8
[2024-06-01 10:21:59] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 10:21:59] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-06-01 10:21:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-06-01 10:22:00] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 10:22:00] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 10:22:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2024-06-01 10:22:00] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 10:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
TRAPS : Iteration 9
[2024-06-01 10:22:00] [INFO ] After 12737ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 10:22:01] [INFO ] After 13839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 14037 ms.
[2024-06-01 10:22:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 10:22:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 573 places, 515 transitions and 1943 arcs took 6 ms.
[2024-06-01 10:22:01] [INFO ] Flatten gal took : 76 ms
Total runtime 141377 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
Could not compute solution for formula : ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldIIPt-PT-020B-ReachabilityFireability-2024-15

BK_STOP 1717237321900

--------------------
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
mcc2024
rfs formula name ShieldIIPt-PT-020B-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/1501/inv_0_
rfs formula name ShieldIIPt-PT-020B-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1501/inv_1_
rfs formula name ShieldIIPt-PT-020B-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1501/inv_2_
rfs formula name ShieldIIPt-PT-020B-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/1501/inv_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldIIPt-PT-020B"
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 ShieldIIPt-PT-020B, 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 r528-tall-171683760800287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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