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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 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 614K 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-050B-ReachabilityFireability-2024-00
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldRVt-PT-050B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717088133038

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-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 16:55:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 16:55:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:55:34] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2024-05-30 16:55:34] [INFO ] Transformed 2503 places.
[2024-05-30 16:55:34] [INFO ] Transformed 2503 transitions.
[2024-05-30 16:55:34] [INFO ] Found NUPN structural information;
[2024-05-30 16:55:34] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 1801 ms. (22 steps per ms) remains 10/16 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 903 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 10/10 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-05-30 16:55:36] [INFO ] Computed 201 invariants in 39 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 2099/2326 variables, 185/412 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2326 variables, 2099/2511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2326 variables, 0/2511 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 177/2503 variables, 16/2527 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 177/2704 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/2704 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 2503/5006 variables, 2503/5207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/5006 variables, 0/5207 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5006/5006 variables, and 5207 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4711 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 2503/2503 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/227 variables, 227/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem ShieldRVt-PT-050B-ReachabilityFireability-2024-11 is UNSAT
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2099/2326 variables, 185/412 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2326 variables, 2099/2511 constraints. Problems are: Problem set: 1 solved, 9 unsolved
[2024-05-30 16:55:42] [INFO ] Deduced a trap composed of 24 places in 713 ms of which 68 ms to minimize.
[2024-05-30 16:55:42] [INFO ] Deduced a trap composed of 34 places in 499 ms of which 8 ms to minimize.
[2024-05-30 16:55:43] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 8 ms to minimize.
[2024-05-30 16:55:43] [INFO ] Deduced a trap composed of 54 places in 567 ms of which 7 ms to minimize.
[2024-05-30 16:55:44] [INFO ] Deduced a trap composed of 49 places in 386 ms of which 7 ms to minimize.
[2024-05-30 16:55:44] [INFO ] Deduced a trap composed of 44 places in 396 ms of which 7 ms to minimize.
[2024-05-30 16:55:45] [INFO ] Deduced a trap composed of 50 places in 352 ms of which 7 ms to minimize.
[2024-05-30 16:55:45] [INFO ] Deduced a trap composed of 43 places in 337 ms of which 6 ms to minimize.
[2024-05-30 16:55:45] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2326/5006 variables, and 2520 constraints, problems are : Problem set: 1 solved, 9 unsolved in 5011 ms.
Refiners :[Domain max(s): 2326/2503 constraints, Positive P Invariants (semi-flows): 185/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 9/9 constraints]
After SMT, in 9927ms problems are : Problem set: 1 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 217 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 2503 transition count 1918
Reduce places removed 585 places and 0 transitions.
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Iterating post reduction 1 with 658 rules applied. Total rules applied 1243 place count 1918 transition count 1845
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 2 with 73 rules applied. Total rules applied 1316 place count 1845 transition count 1845
Performed 219 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 219 Pre rules applied. Total rules applied 1316 place count 1845 transition count 1626
Deduced a syphon composed of 219 places in 3 ms
Reduce places removed 219 places and 0 transitions.
Iterating global reduction 3 with 438 rules applied. Total rules applied 1754 place count 1626 transition count 1626
Discarding 304 places :
Symmetric choice reduction at 3 with 304 rule applications. Total rules 2058 place count 1322 transition count 1322
Iterating global reduction 3 with 304 rules applied. Total rules applied 2362 place count 1322 transition count 1322
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 2362 place count 1322 transition count 1220
Deduced a syphon composed of 102 places in 6 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 2566 place count 1220 transition count 1220
Performed 386 Post agglomeration using F-continuation condition.Transition count delta: 386
Deduced a syphon composed of 386 places in 3 ms
Reduce places removed 386 places and 0 transitions.
Iterating global reduction 3 with 772 rules applied. Total rules applied 3338 place count 834 transition count 834
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3540 place count 733 transition count 893
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 3560 place count 723 transition count 898
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 3561 place count 723 transition count 897
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3569 place count 723 transition count 889
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 3577 place count 715 transition count 889
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 3580 place count 715 transition count 886
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 3582 place count 715 transition count 886
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3583 place count 714 transition count 885
Applied a total of 3583 rules in 717 ms. Remains 714 /2503 variables (removed 1789) and now considering 885/2503 (removed 1618) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 730 ms. Remains : 714/2503 places, 885/2503 transitions.
RANDOM walk for 40000 steps (8 resets) in 589 ms. (67 steps per ms) remains 7/9 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 6/7 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
// Phase 1: matrix 885 rows 714 cols
[2024-05-30 16:55:47] [INFO ] Computed 201 invariants in 3 ms
[2024-05-30 16:55:47] [INFO ] State equation strengthened by 251 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 392/524 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 190/714 variables, 73/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/714 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 885/1599 variables, 714/915 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1599 variables, 251/1166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1599 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1599 variables, 0/1166 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1599/1599 variables, and 1166 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 714/714 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 392/524 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:55:48] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2024-05-30 16:55:48] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 4 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 3 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/524 variables, 13/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 190/714 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:55:49] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-30 16:55:50] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 2 ms to minimize.
[2024-05-30 16:55:50] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 2 ms to minimize.
[2024-05-30 16:55:50] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/714 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 885/1599 variables, 714/932 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1599 variables, 251/1183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1599 variables, 6/1189 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-30 16:55:51] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 1 ms to minimize.
[2024-05-30 16:55:51] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 2 ms to minimize.
[2024-05-30 16:55:52] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 2 ms to minimize.
[2024-05-30 16:55:52] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-30 16:55:52] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-30 16:55:52] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-05-30 16:55:52] [INFO ] Deduced a trap composed of 14 places in 190 ms of which 3 ms to minimize.
[2024-05-30 16:55:53] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-30 16:55:53] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1599 variables, 9/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1599 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/1599 variables, 0/1198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1599/1599 variables, and 1198 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6722 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 714/714 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 26/26 constraints]
After SMT, in 8001ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 5042 ms.
Support contains 132 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 885/885 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 714 transition count 866
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 22 rules applied. Total rules applied 41 place count 695 transition count 863
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 692 transition count 863
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 44 place count 692 transition count 833
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 104 place count 662 transition count 833
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 660 transition count 831
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 660 transition count 831
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 214 place count 607 transition count 778
Renaming transitions due to excessive name length > 1024 char.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 248 place count 590 transition count 796
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 250 place count 590 transition count 794
Applied a total of 250 rules in 109 ms. Remains 590 /714 variables (removed 124) and now considering 794/885 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 590/714 places, 794/885 transitions.
RANDOM walk for 40000 steps (8 resets) in 465 ms. (85 steps per ms) remains 4/6 properties
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-050B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
// Phase 1: matrix 794 rows 590 cols
[2024-05-30 16:56:01] [INFO ] Computed 201 invariants in 2 ms
[2024-05-30 16:56:01] [INFO ] State equation strengthened by 323 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 304/411 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 179/590 variables, 85/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/590 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 794/1384 variables, 590/791 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1384 variables, 323/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1384 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1384 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1384/1384 variables, and 1114 constraints, problems are : Problem set: 0 solved, 4 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 590/590 constraints, ReadFeed: 323/323 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/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 304/411 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 2 ms to minimize.
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/411 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/411 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 179/590 variables, 85/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:02] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 794/1384 variables, 590/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1384 variables, 323/1123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1384 variables, 4/1127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-30 16:56:04] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-30 16:56:04] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-30 16:56:04] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-30 16:56:04] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1384 variables, 5/1132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1384 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1384 variables, 0/1132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1384/1384 variables, and 1132 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3546 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 590/590 constraints, ReadFeed: 323/323 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4445ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3124 ms.
Support contains 107 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 794/794 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 590 transition count 790
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 586 transition count 789
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 585 transition count 789
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 585 transition count 783
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 579 transition count 783
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 577 transition count 781
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 577 transition count 781
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 56 place count 562 transition count 766
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -3
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 68 place count 556 transition count 769
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 556 transition count 768
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 554 transition count 766
Applied a total of 71 rules in 74 ms. Remains 554 /590 variables (removed 36) and now considering 766/794 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 554/590 places, 766/794 transitions.
RANDOM walk for 40000 steps (8 resets) in 388 ms. (102 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 452 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 180412 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 4
Probabilistic random walk after 180412 steps, saw 112405 distinct states, run finished after 3004 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 766 rows 554 cols
[2024-05-30 16:56:12] [INFO ] Computed 201 invariants in 4 ms
[2024-05-30 16:56:12] [INFO ] State equation strengthened by 208 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 277/384 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/448 variables, 32/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 662/1110 variables, 448/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 196/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 180/1290 variables, 88/880 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1290 variables, 44/924 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1290 variables, 12/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1290 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 30/1320 variables, 18/954 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1320 variables, 9/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1320 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1320 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 963 constraints, problems are : Problem set: 0 solved, 4 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 554/554 constraints, ReadFeed: 208/208 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/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 277/384 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 2 ms to minimize.
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/448 variables, 32/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:13] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-30 16:56:14] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-30 16:56:14] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-30 16:56:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-30 16:56:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 5/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:56:14] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-30 16:56:14] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 2/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/448 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 662/1110 variables, 448/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 196/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 1/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 180/1290 variables, 88/897 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1290 variables, 44/941 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1290 variables, 12/953 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1290 variables, 3/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1290 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 30/1320 variables, 18/974 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1320 variables, 9/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1320 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1320 variables, 0/983 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 983 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3758 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 554/554 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 16/16 constraints]
After SMT, in 4757ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3144 ms.
Support contains 107 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 766/766 transitions.
Applied a total of 0 rules in 24 ms. Remains 554 /554 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 554/554 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 766/766 transitions.
Applied a total of 0 rules in 10 ms. Remains 554 /554 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2024-05-30 16:56:20] [INFO ] Invariant cache hit.
[2024-05-30 16:56:20] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-30 16:56:20] [INFO ] Invariant cache hit.
[2024-05-30 16:56:20] [INFO ] State equation strengthened by 208 read => feed constraints.
[2024-05-30 16:56:21] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
[2024-05-30 16:56:21] [INFO ] Redundant transitions in 41 ms returned []
Running 744 sub problems to find dead transitions.
[2024-05-30 16:56:21] [INFO ] Invariant cache hit.
[2024-05-30 16:56:21] [INFO ] State equation strengthened by 208 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (OVERLAPS) 19/554 variables, 130/201 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-30 16:56:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-30 16:56:34] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-30 16:56:35] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 2 ms to minimize.
[2024-05-30 16:56:35] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-05-30 16:56:35] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-30 16:56:36] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-30 16:56:37] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 7/208 constraints. Problems are: Problem set: 0 solved, 744 unsolved
[2024-05-30 16:56:48] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 554/1320 variables, and 209 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 0/554 constraints, ReadFeed: 0/208 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 744 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/535 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 3 (OVERLAPS) 19/554 variables, 130/203 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 6/209 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 6 (OVERLAPS) 766/1320 variables, 554/763 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1320 variables, 208/971 constraints. Problems are: Problem set: 0 solved, 744 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1320 variables, 744/1715 constraints. Problems are: Problem set: 0 solved, 744 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 1715 constraints, problems are : Problem set: 0 solved, 744 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 554/554 constraints, ReadFeed: 208/208 constraints, PredecessorRefiner: 744/744 constraints, Known Traps: 8/8 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 744 unsolved
Search for dead transitions found 0 dead transitions in 60305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62035 ms. Remains : 554/554 places, 766/766 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 115 edges and 554 vertex of which 2 / 554 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1774 edges and 553 vertex of which 552 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 115 edges and 551 vertex of which 4 / 551 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 549 transition count 761
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 113 edges and 546 vertex of which 2 / 546 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 11 rules applied. Total rules applied 18 place count 545 transition count 754
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 112 edges and 544 vertex of which 2 / 544 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 25 place count 543 transition count 749
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 542 transition count 746
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 29 place count 542 transition count 745
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 32 place count 540 transition count 745
Drop transitions (Redundant composition of simpler transitions.) removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 4 with 49 rules applied. Total rules applied 81 place count 540 transition count 696
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 4 with 26 rules applied. Total rules applied 107 place count 540 transition count 696
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 119 place count 540 transition count 684
Applied a total of 119 rules in 72 ms. Remains 540 /554 variables (removed 14) and now considering 684/766 (removed 82) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 684 rows 540 cols
[2024-05-30 16:57:22] [INFO ] Computed 194 invariants in 2 ms
[2024-05-30 16:57:22] [INFO ] [Real]Absence check using 194 positive place invariants in 27 ms returned sat
[2024-05-30 16:57:22] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-30 16:57:22] [INFO ] [Nat]Absence check using 194 positive place invariants in 26 ms returned sat
[2024-05-30 16:57:22] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-30 16:57:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 16:57:23] [INFO ] After 206ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 533 ms
[2024-05-30 16:57:23] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-30 16:57:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2024-05-30 16:57:24] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-30 16:57:24] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-30 16:57:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
TRAPS : Iteration 1
[2024-05-30 16:57:24] [INFO ] After 1492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-30 16:57:24] [INFO ] After 2269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 2556 ms.
[2024-05-30 16:57:24] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-30 16:57:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 554 places, 766 transitions and 3729 arcs took 7 ms.
[2024-05-30 16:57:24] [INFO ] Flatten gal took : 93 ms
Total runtime 110735 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-050B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 845
MODEL NAME: /home/mcc/execution/409/model
554 places, 766 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-050B-ReachabilityFireability-2024-01 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

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