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.r364-tall-171683777800412.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 ShieldPPPt-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777800412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 3.9K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 15:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 15:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 268K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716914201131

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldPPPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:36:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 16:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:36:42] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2024-05-28 16:36:42] [INFO ] Transformed 1003 places.
[2024-05-28 16:36:42] [INFO ] Transformed 723 transitions.
[2024-05-28 16:36:42] [INFO ] Found NUPN structural information;
[2024-05-28 16:36:42] [INFO ] Parsed PT model containing 1003 places and 723 transitions and 2886 arcs in 275 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1003/1003 places, 723/723 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1003 transition count 722
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 1001 transition count 720
Applied a total of 5 rules in 98 ms. Remains 1001 /1003 variables (removed 2) and now considering 720/723 (removed 3) transitions.
// Phase 1: matrix 720 rows 1001 cols
[2024-05-28 16:36:42] [INFO ] Computed 441 invariants in 36 ms
[2024-05-28 16:36:43] [INFO ] Implicit Places using invariants in 844 ms returned [994]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 875 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 1000/1003 places, 720/723 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1000 transition count 718
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 998 transition count 718
Applied a total of 4 rules in 29 ms. Remains 998 /1000 variables (removed 2) and now considering 718/720 (removed 2) transitions.
// Phase 1: matrix 718 rows 998 cols
[2024-05-28 16:36:43] [INFO ] Computed 440 invariants in 5 ms
[2024-05-28 16:36:44] [INFO ] Implicit Places using invariants in 530 ms returned [981, 985]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 532 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 996/1003 places, 718/723 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 994 transition count 716
Applied a total of 4 rules in 28 ms. Remains 994 /996 variables (removed 2) and now considering 716/718 (removed 2) transitions.
// Phase 1: matrix 716 rows 994 cols
[2024-05-28 16:36:44] [INFO ] Computed 438 invariants in 7 ms
[2024-05-28 16:36:44] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 16:36:44] [INFO ] Invariant cache hit.
[2024-05-28 16:36:45] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1518 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 994/1003 places, 716/723 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 3098 ms. Remains : 994/1003 places, 716/723 transitions.
Discarding 159 transitions out of 716. Remains 557
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 3166 ms. (12 steps per ms) remains 388/556 properties
BEST_FIRST walk for 402 steps (8 resets) in 33 ms. (11 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 55 ms. (7 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 26 ms. (14 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 30 ms. (13 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 388/388 properties
BEST_FIRST walk for 401 steps (8 resets) in 25 ms. (15 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 17 ms. (22 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 401 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 388/388 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 388/388 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 388/388 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 388/388 properties
[2024-05-28 16:36:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 697/697 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 697/1710 variables, and 697 constraints, problems are : Problem set: 0 solved, 388 unsolved in 5018 ms.
Refiners :[Domain max(s): 697/994 constraints, Positive P Invariants (semi-flows): 0/438 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/697 variables, 697/697 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/697 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (OVERLAPS) 16/713 variables, 314/1011 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/713 variables, 16/1027 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 0)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 1)
(s48 0)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 1)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 1)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 1)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 0)
(s112 1)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 1)
(s145 0)
(s146 1)
(s147 1)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 1)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 1)
(s170 0)
(s171 1)
(s172 1)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 1)
(s197 1)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 1)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 1)
(s213 0)
(s214 1)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 1)
(s220 0)
(s221 1)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 1)
(s245 0)
(s246 1)
(s247 1)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 1)
(s253 1)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 1)
(s265 0)
(s266 0)
(s267 1)
(s268 0)
(s269 1)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 1)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 1)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 1)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 1)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 1)
(s308 0)
(s309 1)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 1)
(s318 0)
(s319 1)
(s320 0)
(s321 1)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 1)
(s328 1)
(s329 0)
(s330 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/1710 variables, and 1027 constraints, problems are : Problem set: 0 solved, 388 unsolved in 5030 ms.
Refiners :[Domain max(s): 713/994 constraints, Positive P Invariants (semi-flows): 314/438 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 0/388 constraints, Known Traps: 0/0 constraints]
After SMT, in 10253ms problems are : Problem set: 0 solved, 388 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 697 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 45 times.
Drop transitions (Partial Free agglomeration) removed 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 994 transition count 716
Applied a total of 45 rules in 105 ms. Remains 994 /994 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 994/994 places, 716/716 transitions.
RANDOM walk for 4000000 steps (8 resets) in 94870 ms. (42 steps per ms) remains 137/388 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 238 ms. (167 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40002 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 237 ms. (168 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 137/137 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 137/137 properties
// Phase 1: matrix 716 rows 994 cols
[2024-05-28 16:37:25] [INFO ] Computed 438 invariants in 4 ms
[2024-05-28 16:37:25] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 246/246 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 7/253 variables, 111/357 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 7/364 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 741/994 variables, 327/691 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 741/1432 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/994 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 716/1710 variables, 994/2426 constraints. Problems are: Problem set: 0 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1710 variables, 12/2438 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1710 variables, 0/2438 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (OVERLAPS) 0/1710 variables, 0/2438 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 2438 constraints, problems are : Problem set: 0 solved, 137 unsolved in 20683 ms.
Refiners :[Domain max(s): 994/994 constraints, Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 994/994 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 246/246 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (OVERLAPS) 7/253 variables, 111/357 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 7/364 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 741/994 variables, 327/691 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/994 variables, 741/1432 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/994 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 716/1710 variables, 994/2426 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1710 variables, 12/2438 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1710 variables, 137/2575 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1710 variables, 0/2575 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 12 (OVERLAPS) 0/1710 variables, 0/2575 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1710/1710 variables, and 2575 constraints, problems are : Problem set: 0 solved, 137 unsolved in 45013 ms.
Refiners :[Domain max(s): 994/994 constraints, Positive P Invariants (semi-flows): 438/438 constraints, State Equation: 994/994 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 65759ms problems are : Problem set: 0 solved, 137 unsolved
Fused 137 Parikh solutions to 37 different solutions.
Parikh walk visited 136 properties in 31012 ms.
Support contains 2 out of 994 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 994/994 places, 716/716 transitions.
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 0 with 111 rules applied. Total rules applied 111 place count 994 transition count 716
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 993 transition count 715
Applied a total of 112 rules in 90 ms. Remains 993 /994 variables (removed 1) and now considering 715/716 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 993/994 places, 715/716 transitions.
RANDOM walk for 1433655 steps (2 resets) in 12471 ms. (114 steps per ms) remains 0/1 properties
Able to resolve query QuasiLiveness after proving 557 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 144921 ms.
ITS solved all properties within timeout

BK_STOP 1716914347271

--------------------
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 QuasiLiveness -timeout 180 -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="ShieldPPPt-PT-040A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldPPPt-PT-040A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r364-tall-171683777800412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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