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.r355-tall-171683760000983.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 greatspnxred
Input is ShieldRVt-PT-020A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760000983
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 4.1K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 01:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 12 01:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 01:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 01:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 54K 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-020A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-020A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717078694121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 14:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 14:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:18:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-30 14:18:15] [INFO ] Transformed 163 places.
[2024-05-30 14:18:15] [INFO ] Transformed 163 transitions.
[2024-05-30 14:18:15] [INFO ] Found NUPN structural information;
[2024-05-30 14:18:15] [INFO ] Parsed PT model containing 163 places and 163 transitions and 686 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 40000 steps (8 resets) in 1870 ms. (21 steps per ms) remains 12/16 properties
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 212 ms. (187 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 405 ms. (98 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 66 ms. (597 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
// Phase 1: matrix 162 rows 163 cols
[2024-05-30 14:18:16] [INFO ] Computed 81 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 33/147 variables, 73/187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 33/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 16/163 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 16/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/325 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 407 constraints, problems are : Problem set: 0 solved, 12 unsolved in 926 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 33/147 variables, 73/187 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 33/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 16/163 variables, 8/228 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 16/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 162/325 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 12/419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/325 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 325/325 variables, and 419 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1116 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 2149ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 8 different solutions.
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 6556 ms.
Support contains 81 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 transitions.
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 163 transition count 162
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 163 transition count 157
Applied a total of 10 rules in 36 ms. Remains 163 /163 variables (removed 0) and now considering 157/162 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 163/163 places, 157/162 transitions.
RANDOM walk for 40000 steps (8 resets) in 578 ms. (69 steps per ms) remains 4/10 properties
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
// Phase 1: matrix 157 rows 163 cols
[2024-05-30 14:18:26] [INFO ] Computed 81 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 46/119 variables, 59/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 22/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 44/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 157/320 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/320 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 407 constraints, problems are : Problem set: 0 solved, 4 unsolved in 242 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 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/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 46/119 variables, 59/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 44/163 variables, 22/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 44/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 157/320 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/320 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 411 constraints, problems are : Problem set: 0 solved, 4 unsolved in 444 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1457 ms.
Support contains 73 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 157/157 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 163 transition count 155
Applied a total of 4 rules in 21 ms. Remains 163 /163 variables (removed 0) and now considering 155/157 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 163/163 places, 155/157 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/4 properties
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
// Phase 1: matrix 155 rows 163 cols
[2024-05-30 14:18:28] [INFO ] Computed 81 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 41/107 variables, 53/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 56/163 variables, 28/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 56/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 155/318 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/318 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 407 constraints, problems are : Problem set: 0 solved, 3 unsolved in 181 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 66/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 41/107 variables, 53/119 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 41/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 56/163 variables, 28/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 56/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 155/318 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/318 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/318 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 410 constraints, problems are : Problem set: 0 solved, 3 unsolved in 381 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 577ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1007 ms.
Support contains 66 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 155/155 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 163 transition count 153
Applied a total of 4 rules in 19 ms. Remains 163 /163 variables (removed 0) and now considering 153/155 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 163/163 places, 153/155 transitions.
RANDOM walk for 40000 steps (8 resets) in 311 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 351669 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :1 out of 3
Probabilistic random walk after 351669 steps, saw 334452 distinct states, run finished after 3019 ms. (steps per millisecond=116 ) properties seen :1
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 153 rows 163 cols
[2024-05-30 14:18:33] [INFO ] Computed 81 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/101 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/163 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 62/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 153/316 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/316 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 407 constraints, problems are : Problem set: 0 solved, 2 unsolved in 162 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/101 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/163 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 62/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 153/316 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 320 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 504ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 667 ms.
Support contains 63 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 153/153 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 163 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 163 transition count 151
Applied a total of 4 rules in 13 ms. Remains 163 /163 variables (removed 0) and now considering 151/153 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 163/163 places, 151/153 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 377634 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :0 out of 2
Probabilistic random walk after 377634 steps, saw 357657 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :0
// Phase 1: matrix 151 rows 163 cols
[2024-05-30 14:18:37] [INFO ] Computed 81 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/101 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/163 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 62/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 151/314 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 407 constraints, problems are : Problem set: 0 solved, 2 unsolved in 156 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 38/101 variables, 50/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 38/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/163 variables, 31/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 62/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 151/314 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 409 constraints, problems are : Problem set: 0 solved, 2 unsolved in 326 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 510ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 322 ms.
Support contains 32 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 151/151 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 163 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 163 transition count 148
Applied a total of 6 rules in 27 ms. Remains 163 /163 variables (removed 0) and now considering 148/151 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 163/163 places, 148/151 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1124719 steps, run timeout after 3001 ms. (steps per millisecond=374 ) properties seen :0 out of 1
Probabilistic random walk after 1124719 steps, saw 1053599 distinct states, run finished after 3001 ms. (steps per millisecond=374 ) properties seen :0
// Phase 1: matrix 148 rows 163 cols
[2024-05-30 14:18:41] [INFO ] Computed 81 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 25/57 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/163 variables, 53/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 106/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 407 constraints, problems are : Problem set: 0 solved, 1 unsolved in 103 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 25/57 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 25/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/163 variables, 53/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 106/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 408 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 32 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 163/163 places, 148/148 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-30 14:18:41] [INFO ] Invariant cache hit.
[2024-05-30 14:18:42] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 14:18:42] [INFO ] Invariant cache hit.
[2024-05-30 14:18:42] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-30 14:18:42] [INFO ] Redundant transitions in 4 ms returned []
Running 147 sub problems to find dead transitions.
[2024-05-30 14:18:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 81/243 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/311 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 407 constraints, problems are : Problem set: 0 solved, 147 unsolved in 5177 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 81/243 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (OVERLAPS) 148/311 variables, 163/407 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 147/554 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 8 (OVERLAPS) 0/311 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 554 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4271 ms.
Refiners :[Domain max(s): 163/163 constraints, Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 163/163 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 9540ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 9543ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9816 ms. Remains : 163/163 places, 148/148 transitions.
[2024-05-30 14:18:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-30 14:18:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 148 transitions and 656 arcs took 4 ms.
[2024-05-30 14:18:52] [INFO ] Flatten gal took : 99 ms
Total runtime 36784 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-020A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 163
TRANSITIONS: 148
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 597
MODEL NAME: /home/mcc/execution/413/model
163 places, 148 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-020A-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717078762651

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-020A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldRVt-PT-020A, 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 r355-tall-171683760000983"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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