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-171683760101023.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-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760101023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 489K 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-040B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717084516179

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-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:55:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 15:55:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:55:17] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2024-05-30 15:55:17] [INFO ] Transformed 2003 places.
[2024-05-30 15:55:17] [INFO ] Transformed 2003 transitions.
[2024-05-30 15:55:17] [INFO ] Found NUPN structural information;
[2024-05-30 15:55:17] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1871 ms. (21 steps per ms) remains 10/16 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 477 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 893 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
// Phase 1: matrix 2003 rows 2003 cols
[2024-05-30 15:55:19] [INFO ] Computed 161 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1511/1673 variables, 132/294 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1673 variables, 1511/1805 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1673 variables, 0/1805 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 330/2003 variables, 29/1834 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 330/2164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2003/4006 variables, 2003/4167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/4006 variables, 0/4167 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4006/4006 variables, and 4167 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3411 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 2003/2003 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1511/1673 variables, 132/294 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1673 variables, 1511/1805 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-30 15:55:23] [INFO ] Deduced a trap composed of 43 places in 368 ms of which 54 ms to minimize.
[2024-05-30 15:55:24] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 6 ms to minimize.
[2024-05-30 15:55:24] [INFO ] Deduced a trap composed of 49 places in 270 ms of which 6 ms to minimize.
[2024-05-30 15:55:24] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 6 ms to minimize.
[2024-05-30 15:55:24] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 5 ms to minimize.
[2024-05-30 15:55:25] [INFO ] Deduced a trap composed of 48 places in 233 ms of which 5 ms to minimize.
[2024-05-30 15:55:25] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 5 ms to minimize.
[2024-05-30 15:55:25] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 5 ms to minimize.
[2024-05-30 15:55:25] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 4 ms to minimize.
[2024-05-30 15:55:26] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 4 ms to minimize.
[2024-05-30 15:55:26] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 4 ms to minimize.
[2024-05-30 15:55:26] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 4 ms to minimize.
[2024-05-30 15:55:26] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 3 ms to minimize.
[2024-05-30 15:55:26] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 4 ms to minimize.
[2024-05-30 15:55:26] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 3 ms to minimize.
[2024-05-30 15:55:27] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 3 ms to minimize.
[2024-05-30 15:55:27] [INFO ] Deduced a trap composed of 68 places in 147 ms of which 3 ms to minimize.
[2024-05-30 15:55:27] [INFO ] Deduced a trap composed of 33 places in 131 ms of which 3 ms to minimize.
[2024-05-30 15:55:27] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1673/4006 variables, and 1824 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5017 ms.
Refiners :[Domain max(s): 1673/2003 constraints, Positive P Invariants (semi-flows): 132/161 constraints, State Equation: 0/2003 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 19/19 constraints]
After SMT, in 8608ms problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 2003 transition count 1523
Reduce places removed 480 places and 0 transitions.
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Iterating post reduction 1 with 547 rules applied. Total rules applied 1027 place count 1523 transition count 1456
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 1094 place count 1456 transition count 1456
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 1094 place count 1456 transition count 1297
Deduced a syphon composed of 159 places in 5 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 1412 place count 1297 transition count 1297
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 1654 place count 1055 transition count 1055
Iterating global reduction 3 with 242 rules applied. Total rules applied 1896 place count 1055 transition count 1055
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 1896 place count 1055 transition count 983
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 2040 place count 983 transition count 983
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 334
Deduced a syphon composed of 334 places in 2 ms
Reduce places removed 334 places and 0 transitions.
Iterating global reduction 3 with 668 rules applied. Total rules applied 2708 place count 649 transition count 649
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 2854 place count 576 transition count 685
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2855 place count 576 transition count 684
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 2863 place count 576 transition count 676
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 2871 place count 568 transition count 676
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2874 place count 568 transition count 673
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2877 place count 568 transition count 673
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2878 place count 567 transition count 672
Applied a total of 2878 rules in 530 ms. Remains 567 /2003 variables (removed 1436) and now considering 672/2003 (removed 1331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 567/2003 places, 672/2003 transitions.
RANDOM walk for 40000 steps (10 resets) in 495 ms. (80 steps per ms) remains 9/10 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (8 resets) in 209 ms. (190 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 8/9 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
// Phase 1: matrix 672 rows 567 cols
[2024-05-30 15:55:28] [INFO ] Computed 161 invariants in 4 ms
[2024-05-30 15:55:28] [INFO ] State equation strengthened by 146 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 350/488 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 40/528 variables, 18/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 652/1180 variables, 528/672 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1180 variables, 142/814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1180 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 52/1232 variables, 34/848 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1232 variables, 14/862 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1232 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1232 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 3/1235 variables, 2/868 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1235 variables, 1/869 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1235 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 4/1239 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1239 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1239 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1239 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1239/1239 variables, and 874 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1792 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 567/567 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 350/488 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 2 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 2 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/488 variables, 10/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-30 15:55:31] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 5 ms to minimize.
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 40/528 variables, 18/163 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:32] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 652/1180 variables, 528/692 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 142/834 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 3/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 52/1232 variables, 34/871 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1232 variables, 14/885 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1232 variables, 4/889 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1232 variables, 5/894 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:34] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-30 15:55:34] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-30 15:55:34] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1232 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1232 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 3/1235 variables, 2/899 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1235 variables, 1/900 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1235 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (OVERLAPS) 4/1239 variables, 4/904 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1239 variables, 1/905 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 15:55:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-30 15:55:37] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-30 15:55:37] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-30 15:55:37] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-30 15:55:37] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1239 variables, 5/910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1239 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/1239 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1239/1239 variables, and 910 constraints, problems are : Problem set: 0 solved, 8 unsolved in 8513 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 567/567 constraints, ReadFeed: 146/146 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 28/28 constraints]
After SMT, in 10371ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 8263 ms.
Support contains 138 out of 567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 567/567 places, 672/672 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 567 transition count 668
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 563 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 562 transition count 667
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 10 place count 562 transition count 661
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 22 place count 556 transition count 661
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 554 transition count 659
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 554 transition count 659
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 48 place count 543 transition count 648
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 60 place count 537 transition count 653
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 537 transition count 650
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 66 place count 534 transition count 650
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 67 place count 533 transition count 649
Applied a total of 67 rules in 101 ms. Remains 533 /567 variables (removed 34) and now considering 649/672 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 533/567 places, 649/672 transitions.
RANDOM walk for 40000 steps (10 resets) in 372 ms. (107 steps per ms) remains 4/8 properties
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 264 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
// Phase 1: matrix 649 rows 533 cols
[2024-05-30 15:55:48] [INFO ] Computed 161 invariants in 6 ms
[2024-05-30 15:55:48] [INFO ] State equation strengthened by 162 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 322/427 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 48/475 variables, 22/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 612/1087 variables, 475/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1087 variables, 155/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1087 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 81/1168 variables, 48/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1168 variables, 18/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1168 variables, 7/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1168 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/1176 variables, 5/845 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1176 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1176 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 6/1182 variables, 8/855 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1182 variables, 1/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1182 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1182 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 856 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1063 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 533/533 constraints, ReadFeed: 162/162 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/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 322/427 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 4 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:55:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 12/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 3/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 3/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/427 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 48/475 variables, 22/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:50] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/475 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/475 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 612/1087 variables, 475/635 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1087 variables, 155/790 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1087 variables, 2/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1087 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 81/1168 variables, 48/840 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1168 variables, 18/858 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1168 variables, 7/865 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1168 variables, 2/867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1168 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 8/1176 variables, 5/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1176 variables, 2/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1176 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 6/1182 variables, 8/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1182 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:55:52] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1182 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1182 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1182 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 884 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4404 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 533/533 constraints, ReadFeed: 162/162 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 24/24 constraints]
After SMT, in 5506ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3203 ms.
Support contains 105 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 649/649 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 533 transition count 643
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 527 transition count 643
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 527 transition count 629
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 513 transition count 629
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 509 transition count 625
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 509 transition count 625
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 67 place count 499 transition count 616
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 87 place count 489 transition count 626
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 489 transition count 624
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 489 transition count 624
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 487 transition count 622
Applied a total of 93 rules in 94 ms. Remains 487 /533 variables (removed 46) and now considering 622/649 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 487/533 places, 622/649 transitions.
RANDOM walk for 40000 steps (10 resets) in 333 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 180350 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 4
Probabilistic random walk after 180350 steps, saw 109102 distinct states, run finished after 3005 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 622 rows 487 cols
[2024-05-30 15:56:00] [INFO ] Computed 160 invariants in 7 ms
[2024-05-30 15:56:00] [INFO ] State equation strengthened by 181 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/397 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 42/439 variables, 21/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 594/1033 variables, 439/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1033 variables, 173/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1033 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 73/1106 variables, 46/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1106 variables, 23/817 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1106 variables, 8/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/827 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 828 constraints, problems are : Problem set: 0 solved, 4 unsolved in 865 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 487/487 constraints, ReadFeed: 181/181 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/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/397 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 8/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:56:01] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:56:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 42/439 variables, 21/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 594/1033 variables, 439/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1033 variables, 173/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1033 variables, 2/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1033 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 73/1106 variables, 46/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1106 variables, 23/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1106 variables, 8/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1106 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 15:56:03] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1106 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1106 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 3/1109 variables, 2/849 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 1/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1109 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1109 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 850 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3568 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 487/487 constraints, ReadFeed: 181/181 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 18/18 constraints]
After SMT, in 4473ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4208 ms.
Support contains 105 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 622/622 transitions.
Applied a total of 0 rules in 12 ms. Remains 487 /487 variables (removed 0) and now considering 622/622 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 487/487 places, 622/622 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 622/622 transitions.
Applied a total of 0 rules in 13 ms. Remains 487 /487 variables (removed 0) and now considering 622/622 (removed 0) transitions.
[2024-05-30 15:56:09] [INFO ] Invariant cache hit.
[2024-05-30 15:56:09] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-30 15:56:09] [INFO ] Invariant cache hit.
[2024-05-30 15:56:09] [INFO ] State equation strengthened by 181 read => feed constraints.
[2024-05-30 15:56:10] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2024-05-30 15:56:10] [INFO ] Redundant transitions in 32 ms returned []
Running 614 sub problems to find dead transitions.
[2024-05-30 15:56:10] [INFO ] Invariant cache hit.
[2024-05-30 15:56:10] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/481 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/481 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 6/487 variables, 127/160 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2024-05-30 15:56:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-30 15:56:19] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 15:56:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-30 15:56:19] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 15:56:19] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-30 15:56:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-30 15:56:20] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:56:20] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 15:56:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-30 15:56:20] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 15:56:21] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 15:56:21] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:56:21] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-30 15:56:22] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 14/174 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2024-05-30 15:56:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 6 (OVERLAPS) 622/1109 variables, 487/662 constraints. Problems are: Problem set: 0 solved, 614 unsolved
SMT process timed out in 30205ms, After SMT, problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 30215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31401 ms. Remains : 487/487 places, 622/622 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 487 transition count 599
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 40 place count 487 transition count 599
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 51 place count 487 transition count 588
Applied a total of 51 rules in 79 ms. Remains 487 /487 variables (removed 0) and now considering 588/622 (removed 34) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 588 rows 487 cols
[2024-05-30 15:56:40] [INFO ] Computed 160 invariants in 4 ms
[2024-05-30 15:56:40] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-30 15:56:40] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2024-05-30 15:56:41] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-30 15:56:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 595 ms
[2024-05-30 15:56:42] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-30 15:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
TRAPS : Iteration 1
[2024-05-30 15:56:42] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-30 15:56:42] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-30 15:56:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 199 ms
[2024-05-30 15:56:42] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-30 15:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
TRAPS : Iteration 2
[2024-05-30 15:56:42] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 15:56:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2024-05-30 15:56:43] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 3
[2024-05-30 15:56:43] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-05-30 15:56:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
TRAPS : Iteration 4
[2024-05-30 15:56:43] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:56:43] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:56:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
TRAPS : Iteration 5
[2024-05-30 15:56:44] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-30 15:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
TRAPS : Iteration 6
[2024-05-30 15:56:44] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2024-05-30 15:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
TRAPS : Iteration 7
[2024-05-30 15:56:44] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-30 15:56:44] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-30 15:56:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
TRAPS : Iteration 8
[2024-05-30 15:56:45] [INFO ] After 4603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-30 15:56:45] [INFO ] After 5033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 5252 ms.
[2024-05-30 15:56:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-30 15:56:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 487 places, 622 transitions and 2835 arcs took 6 ms.
[2024-05-30 15:56:46] [INFO ] Flatten gal took : 98 ms
Total runtime 88678 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 487
TRANSITIONS: 622
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.001s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 966
MODEL NAME: /home/mcc/execution/406/model
487 places, 622 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040B"
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-040B, 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-171683760101023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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