About the Execution of LTSMin+red for ShieldRVt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 648.651 | 119162.00 | 177538.00 | 332.70 | T?T?T?????TTTTFT | normal |
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-171683762301007.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 ShieldRVt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762301007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 ShieldRVt-PT-030B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717276831167
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:20:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:20:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:20:32] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-01 21:20:32] [INFO ] Transformed 1503 places.
[2024-06-01 21:20:32] [INFO ] Transformed 1503 transitions.
[2024-06-01 21:20:32] [INFO ] Found NUPN structural information;
[2024-06-01 21:20:32] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1892 ms. (21 steps per ms) remains 12/16 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 11/12 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1503 rows 1503 cols
[2024-06-01 21:20:33] [INFO ] Computed 121 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1316/1503 variables, 121/308 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1316/1624 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1503/3006 variables, 1503/3127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 3127 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2852 ms.
Refiners :[Domain max(s): 1503/1503 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1503/1503 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 187/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 1316/1503 variables, 121/308 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1316/1624 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 21:20:37] [INFO ] Deduced a trap composed of 37 places in 423 ms of which 58 ms to minimize.
[2024-06-01 21:20:38] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 7 ms to minimize.
[2024-06-01 21:20:38] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 6 ms to minimize.
[2024-06-01 21:20:38] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 6 ms to minimize.
[2024-06-01 21:20:39] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 6 ms to minimize.
[2024-06-01 21:20:39] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 5 ms to minimize.
[2024-06-01 21:20:39] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 6 ms to minimize.
[2024-06-01 21:20:40] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 5 ms to minimize.
[2024-06-01 21:20:40] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 5 ms to minimize.
[2024-06-01 21:20:40] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 6 ms to minimize.
[2024-06-01 21:20:40] [INFO ] Deduced a trap composed of 48 places in 270 ms of which 5 ms to minimize.
[2024-06-01 21:20:41] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 5 ms to minimize.
[2024-06-01 21:20:41] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 5 ms to minimize.
[2024-06-01 21:20:41] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 5 ms to minimize.
[2024-06-01 21:20:42] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 5 ms to minimize.
SMT process timed out in 8282ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 187 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 307 transitions
Trivial Post-agglo rules discarded 307 transitions
Performed 307 trivial Post agglomeration. Transition count delta: 307
Iterating post reduction 0 with 307 rules applied. Total rules applied 307 place count 1503 transition count 1196
Reduce places removed 307 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 1 with 374 rules applied. Total rules applied 681 place count 1196 transition count 1129
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 748 place count 1129 transition count 1129
Performed 116 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 116 Pre rules applied. Total rules applied 748 place count 1129 transition count 1013
Deduced a syphon composed of 116 places in 2 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 980 place count 1013 transition count 1013
Discarding 158 places :
Symmetric choice reduction at 3 with 158 rule applications. Total rules 1138 place count 855 transition count 855
Iterating global reduction 3 with 158 rules applied. Total rules applied 1296 place count 855 transition count 855
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 1296 place count 855 transition count 797
Deduced a syphon composed of 58 places in 4 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1412 place count 797 transition count 797
Performed 220 Post agglomeration using F-continuation condition.Transition count delta: 220
Deduced a syphon composed of 220 places in 2 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 3 with 440 rules applied. Total rules applied 1852 place count 577 transition count 577
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 1956 place count 525 transition count 605
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1957 place count 525 transition count 604
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1964 place count 525 transition count 597
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1971 place count 518 transition count 597
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1973 place count 518 transition count 595
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1974 place count 518 transition count 595
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1976 place count 518 transition count 595
Applied a total of 1976 rules in 388 ms. Remains 518 /1503 variables (removed 985) and now considering 595/1503 (removed 908) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 518/1503 places, 595/1503 transitions.
RANDOM walk for 40000 steps (15 resets) in 645 ms. (61 steps per ms) remains 9/11 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 260 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (9 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
// Phase 1: matrix 595 rows 518 cols
[2024-06-01 21:20:43] [INFO ] Computed 121 invariants in 10 ms
[2024-06-01 21:20:43] [INFO ] State equation strengthened by 123 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 382/518 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 595/1113 variables, 518/639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1113 variables, 123/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1113 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/1113 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 762 constraints, problems are : Problem set: 0 solved, 8 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 518/518 constraints, ReadFeed: 123/123 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/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 382/518 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 5 ms to minimize.
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:20:44] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 5 ms to minimize.
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:20:45] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 2 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:20:46] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 17/158 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 2 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:20:47] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 595/1113 variables, 518/685 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 123/808 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1113 variables, 8/816 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 21:20:48] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:20:48] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:20:48] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-06-01 21:20:48] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:20:48] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:20:48] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1113 variables, 6/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1113 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1113 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 822 constraints, problems are : Problem set: 0 solved, 8 unsolved in 6430 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 518/518 constraints, ReadFeed: 123/123 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 52/52 constraints]
After SMT, in 7296ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 7952 ms.
Support contains 136 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 595/595 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 518 transition count 586
Reduce places removed 9 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 17 rules applied. Total rules applied 26 place count 509 transition count 578
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 34 place count 501 transition count 578
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 34 place count 501 transition count 566
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 58 place count 489 transition count 566
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 488 transition count 565
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 488 transition count 565
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 132 place count 452 transition count 529
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 146 place count 445 transition count 536
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 445 transition count 535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 444 transition count 535
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 444 transition count 535
Applied a total of 149 rules in 85 ms. Remains 444 /518 variables (removed 74) and now considering 535/595 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 444/518 places, 535/595 transitions.
RANDOM walk for 40000 steps (14 resets) in 341 ms. (116 steps per ms) remains 7/8 properties
FORMULA ShieldRVt-PT-030B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
// Phase 1: matrix 535 rows 444 cols
[2024-06-01 21:20:59] [INFO ] Computed 121 invariants in 11 ms
[2024-06-01 21:20:59] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 310/444 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 535/979 variables, 444/565 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/979 variables, 147/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/979 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 979/979 variables, and 712 constraints, problems are : Problem set: 0 solved, 7 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 444/444 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 310/444 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:20:59] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/444 variables, 16/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:00] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:21:01] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 535/979 variables, 444/590 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/979 variables, 147/737 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/979 variables, 7/744 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:02] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 21:21:02] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:21:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:21:02] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 21:21:02] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 21:21:02] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/979 variables, 6/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:03] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/979 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/979 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/979 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 979/979 variables, and 751 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5509 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 444/444 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 32/32 constraints]
After SMT, in 6231ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6055 ms.
Support contains 134 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 535/535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 444 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 443 transition count 534
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 441 transition count 532
Applied a total of 6 rules in 18 ms. Remains 441 /444 variables (removed 3) and now considering 532/535 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 441/444 places, 532/535 transitions.
RANDOM walk for 40000 steps (16 resets) in 266 ms. (149 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 213593 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 7
Probabilistic random walk after 213593 steps, saw 132623 distinct states, run finished after 3009 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 532 rows 441 cols
[2024-06-01 21:21:14] [INFO ] Computed 121 invariants in 3 ms
[2024-06-01 21:21:14] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 307/441 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 532/973 variables, 441/562 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/973 variables, 147/709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/973 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/973 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 973/973 variables, and 709 constraints, problems are : Problem set: 0 solved, 7 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 441/441 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 307/441 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:15] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-01 21:21:15] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 21:21:15] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-06-01 21:21:15] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 2 ms to minimize.
[2024-06-01 21:21:15] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-06-01 21:21:15] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-06-01 21:21:16] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 21:21:17] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 14/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 532/973 variables, 441/596 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 147/743 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 7/750 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:21:18] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 21:21:18] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 21:21:18] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 3/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/973 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 973/973 variables, and 753 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4371 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 441/441 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 37/37 constraints]
After SMT, in 5060ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3068 ms.
Support contains 134 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 532/532 transitions.
Applied a total of 0 rules in 21 ms. Remains 441 /441 variables (removed 0) and now considering 532/532 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 441/441 places, 532/532 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 532/532 transitions.
Applied a total of 0 rules in 8 ms. Remains 441 /441 variables (removed 0) and now considering 532/532 (removed 0) transitions.
[2024-06-01 21:21:22] [INFO ] Invariant cache hit.
[2024-06-01 21:21:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-01 21:21:22] [INFO ] Invariant cache hit.
[2024-06-01 21:21:23] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 21:21:23] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-06-01 21:21:23] [INFO ] Redundant transitions in 38 ms returned []
Running 531 sub problems to find dead transitions.
[2024-06-01 21:21:23] [INFO ] Invariant cache hit.
[2024-06-01 21:21:23] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 21:21:30] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-06-01 21:21:30] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:21:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:21:32] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:21:33] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-06-01 21:21:33] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:21:33] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 21:21:33] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 21:21:34] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:21:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 21:21:35] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 21:21:35] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 21:21:35] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 21:21:35] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 21:21:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 21:21:37] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (OVERLAPS) 532/973 variables, 441/590 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 147/737 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 973/973 variables, and 737 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 441/441 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 28/149 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (OVERLAPS) 532/973 variables, 441/590 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/973 variables, 147/737 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/973 variables, 531/1268 constraints. Problems are: Problem set: 0 solved, 531 unsolved
[2024-06-01 21:22:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-06-01 21:22:09] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 3 ms to minimize.
[2024-06-01 21:22:13] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-06-01 21:22:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-01 21:22:14] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-06-01 21:22:14] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-06-01 21:22:16] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:22:16] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 21:22:19] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 21:22:20] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/973 variables, 10/1278 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 973/973 variables, and 1278 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 441/441 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 38/38 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61014 ms. Remains : 441/441 places, 532/532 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 47 edges and 441 vertex of which 2 / 441 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 17 place count 440 transition count 514
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 30 place count 440 transition count 514
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 440 transition count 508
Applied a total of 36 rules in 40 ms. Remains 440 /441 variables (removed 1) and now considering 508/532 (removed 24) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 508 rows 440 cols
[2024-06-01 21:22:23] [INFO ] Computed 121 invariants in 5 ms
[2024-06-01 21:22:24] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-01 21:22:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-06-01 21:22:24] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-01 21:22:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 21:22:24] [INFO ] After 269ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
TRAPS : Iteration 0
[2024-06-01 21:22:24] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 283 ms
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 391 ms
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:22:25] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 367 ms
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
TRAPS : Iteration 1
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2024-06-01 21:22:26] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
TRAPS : Iteration 2
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
TRAPS : Iteration 3
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-01 21:22:27] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 21:22:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 4
[2024-06-01 21:22:28] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 21:22:28] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:22:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2024-06-01 21:22:28] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 5
[2024-06-01 21:22:28] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-06-01 21:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-06-01 21:22:28] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 21:22:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 6
[2024-06-01 21:22:29] [INFO ] After 4873ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
[2024-06-01 21:22:29] [INFO ] After 5751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Over-approximation ignoring read arcs solved 0 properties in 5935 ms.
[2024-06-01 21:22:29] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-06-01 21:22:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 532 transitions and 2214 arcs took 6 ms.
[2024-06-01 21:22:30] [INFO ] Flatten gal took : 68 ms
Total runtime 117762 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-030B-ReachabilityFireability-2024-09
BK_STOP 1717276950329
--------------------
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 ShieldRVt-PT-030B-ReachabilityFireability-2024-01
rfs formula type EF
rfs formula formula --invariant=/tmp/1166/inv_0_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/1166/inv_1_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1166/inv_2_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/1166/inv_3_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/1166/inv_4_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/1166/inv_5_
rfs formula name ShieldRVt-PT-030B-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1166/inv_6_
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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-171683762301007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B 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 '
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 ;