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-171683759700854.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 ShieldRVs-PT-050A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759700854
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 18:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 12 18:06 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 320K 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 ShieldRVs-PT-050A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-050A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717062993134

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 09:56:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 09:56:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 09:56:34] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-30 09:56:34] [INFO ] Transformed 703 places.
[2024-05-30 09:56:34] [INFO ] Transformed 953 transitions.
[2024-05-30 09:56:34] [INFO ] Found NUPN structural information;
[2024-05-30 09:56:34] [INFO ] Parsed PT model containing 703 places and 953 transitions and 4600 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (57 resets) in 1932 ms. (20 steps per ms) remains 6/14 properties
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 560 ms. (71 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 785 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
// Phase 1: matrix 953 rows 703 cols
[2024-05-30 09:56:36] [INFO ] Computed 201 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 180/267 variables, 73/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 180/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 436/703 variables, 128/468 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 436/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 953/1656 variables, 703/1607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1656 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1656/1656 variables, and 1607 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1218 ms.
Refiners :[Domain max(s): 703/703 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 703/703 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem ShieldRVs-PT-050A-ReachabilityCardinality-2024-12 is UNSAT
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 180/267 variables, 73/160 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 180/340 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 436/703 variables, 128/468 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 436/904 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 09:56:37] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 29 ms to minimize.
[2024-05-30 09:56:38] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 3 ms to minimize.
[2024-05-30 09:56:38] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-30 09:56:38] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2024-05-30 09:56:38] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 3 ms to minimize.
[2024-05-30 09:56:38] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-30 09:56:38] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 3 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 2 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 2 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-30 09:56:39] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 20/924 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:56:40] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 7/931 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 09:56:41] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 1/932 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/703 variables, 0/932 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 953/1656 variables, 703/1635 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1656 variables, 4/1639 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-30 09:56:42] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-05-30 09:56:42] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 6412ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 953/953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 702 transition count 952
Partial Free-agglomeration rule applied 83 times.
Drop transitions (Partial Free agglomeration) removed 83 transitions
Iterating global reduction 0 with 83 rules applied. Total rules applied 85 place count 702 transition count 952
Applied a total of 85 rules in 192 ms. Remains 702 /703 variables (removed 1) and now considering 952/953 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 702/703 places, 952/953 transitions.
RANDOM walk for 40000 steps (64 resets) in 1097 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 173004 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 173004 steps, saw 44373 distinct states, run finished after 3005 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:56:46] [INFO ] Computed 201 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 158/229 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 158/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 473/702 variables, 138/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 473/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 4 unsolved in 714 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 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/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 158/229 variables, 63/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 158/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 473/702 variables, 138/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 473/903 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:56:47] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 3 ms to minimize.
[2024-05-30 09:56:47] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-30 09:56:47] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2024-05-30 09:56:47] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 6 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 2 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 2 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 3 ms to minimize.
[2024-05-30 09:56:48] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-30 09:56:49] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 6 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-30 09:56:50] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:56:51] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 09:56:51] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-30 09:56:51] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 13/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 952/1654 variables, 702/1638 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 4/1642 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:56:52] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 3 ms to minimize.
[2024-05-30 09:56:52] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2024-05-30 09:56:52] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-30 09:56:53] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 13/1655 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 09:56:54] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 1/1656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1654 variables, 0/1656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1656 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8938 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 47/47 constraints]
After SMT, in 9703ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 921 ms.
Support contains 69 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Applied a total of 0 rules in 34 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (65 resets) in 453 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 200695 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 3
Probabilistic random walk after 200695 steps, saw 50133 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-30 09:57:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 156/225 variables, 62/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 156/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 477/702 variables, 139/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 477/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 585 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 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/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 156/225 variables, 62/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 156/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 477/702 variables, 139/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 477/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 1 ms to minimize.
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 2 ms to minimize.
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2024-05-30 09:57:01] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 17/920 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:57:02] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 1/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 952/1654 variables, 702/1623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 3/1626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 09:57:03] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 09:57:04] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 8/1634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1654 variables, 0/1634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1634 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4761 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 5374ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1742 ms.
Support contains 36 out of 702 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 702/702 places, 952/952 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 702 transition count 952
Applied a total of 11 rules in 68 ms. Remains 702 /702 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 702/702 places, 952/952 transitions.
RANDOM walk for 40000 steps (67 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254850 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254850 steps, saw 60970 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
// Phase 1: matrix 952 rows 702 cols
[2024-05-30 09:57:10] [INFO ] Computed 201 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 93/129 variables, 36/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 93/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 573/702 variables, 165/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/702 variables, 573/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 952/1654 variables, 702/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1654 variables, 0/1605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1654/1654 variables, and 1605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 412 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 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/36 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 93/129 variables, 36/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 93/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 573/702 variables, 165/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/702 variables, 573/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 3 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 2 ms to minimize.
[2024-05-30 09:57:11] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-30 09:57:12] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/702 variables, 15/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/702 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 952/1654 variables, 702/1621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1654 variables, 1/1622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 2 ms to minimize.
[2024-05-30 09:57:13] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 2 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 2 ms to minimize.
[2024-05-30 09:57:14] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-30 09:57:15] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 7 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1654 variables, 20/1642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 09:57:16] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 3 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 2 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 09:57:17] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1654 variables, 9/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1654 variables, 0/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1654 variables, 0/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1654/1654 variables, and 1651 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7080 ms.
Refiners :[Domain max(s): 702/702 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 702/702 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 45/45 constraints]
After SMT, in 7525ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 22054 steps, including 996 resets, run visited all 1 properties in 164 ms. (steps per millisecond=134 )
FORMULA ShieldRVs-PT-050A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 170 ms.
All properties solved without resorting to model-checking.
Total runtime 44010 ms.
ITS solved all properties within timeout

BK_STOP 1717063038397

--------------------
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 ReachabilityCardinality -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="ShieldRVs-PT-050A"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVs-PT-050A, examination is ReachabilityCardinality"
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-171683759700854"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050A.tgz
mv ShieldRVs-PT-050A execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;