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.r078-tall-171620515500343.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 CloudDeployment-PT-2b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-171620515500343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 166K May 18 16:42 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 StableMarking

=== Now, execution of the tool begins

BK_START 1716272949138

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-2b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 06:29:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-21 06:29:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 06:29:10] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-21 06:29:10] [INFO ] Transformed 556 places.
[2024-05-21 06:29:10] [INFO ] Transformed 684 transitions.
[2024-05-21 06:29:10] [INFO ] Found NUPN structural information;
[2024-05-21 06:29:10] [INFO ] Parsed PT model containing 556 places and 684 transitions and 1987 arcs in 203 ms.
Graph (trivial) has 568 edges and 556 vertex of which 168 / 556 are part of one of the 16 SCC in 5 ms
Free SCC test removed 152 places
Structural test allowed to assert that 217 places are NOT stable. Took 24 ms.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
RANDOM walk for 40000 steps (860 resets) in 1681 ms. (23 steps per ms) remains 174/339 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 15 ms. (25 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 400 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 4 ms. (80 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 174/174 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 174/174 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 174/174 properties
[2024-05-21 06:29:11] [INFO ] Flow matrix only has 499 transitions (discarded 15 similar events)
// Phase 1: matrix 499 rows 404 cols
[2024-05-21 06:29:11] [INFO ] Computed 9 invariants in 19 ms
[2024-05-21 06:29:11] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 229/403 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 229/412 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 498/901 variables, 403/815 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 (/ 1.0 4.0))
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 (/ 1.0 4.0))
(s29 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 901/903 variables, and 815 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5066 ms.
Refiners :[Domain max(s): 403/404 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 403/404 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (OVERLAPS) 229/403 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 229/412 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 498/901 variables, 403/815 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/901 variables, 174/989 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 901/903 variables, and 989 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5014 ms.
Refiners :[Domain max(s): 403/404 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 403/404 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 10194ms problems are : Problem set: 0 solved, 174 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 174 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 514/514 transitions.
Graph (complete) has 922 edges and 404 vertex of which 400 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 400 transition count 377
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 253 place count 283 transition count 377
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 253 place count 283 transition count 373
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 261 place count 279 transition count 373
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 281 place count 259 transition count 353
Iterating global reduction 2 with 20 rules applied. Total rules applied 301 place count 259 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 303 place count 259 transition count 351
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 341 place count 240 transition count 332
Performed 13 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 367 place count 227 transition count 363
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 368 place count 227 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 388 place count 227 transition count 342
Free-agglomeration rule applied 22 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 410 place count 227 transition count 318
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 443 place count 205 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 448 place count 205 transition count 302
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 449 place count 205 transition count 302
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 450 place count 204 transition count 301
Applied a total of 450 rules in 131 ms. Remains 204 /404 variables (removed 200) and now considering 301/514 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 204/404 places, 301/514 transitions.
RANDOM walk for 4000000 steps (144126 resets) in 20090 ms. (199 steps per ms) remains 18/174 properties
BEST_FIRST walk for 400004 steps (3383 resets) in 446 ms. (894 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (3473 resets) in 465 ms. (858 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (3419 resets) in 432 ms. (923 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (3317 resets) in 449 ms. (888 steps per ms) remains 8/18 properties
BEST_FIRST walk for 400004 steps (3429 resets) in 290 ms. (1374 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400004 steps (3388 resets) in 303 ms. (1315 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400003 steps (3379 resets) in 289 ms. (1379 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400003 steps (3483 resets) in 293 ms. (1360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400004 steps (3387 resets) in 295 ms. (1351 steps per ms) remains 8/8 properties
BEST_FIRST walk for 400004 steps (3402 resets) in 298 ms. (1337 steps per ms) remains 8/8 properties
[2024-05-21 06:29:29] [INFO ] Flow matrix only has 299 transitions (discarded 2 similar events)
// Phase 1: matrix 299 rows 204 cols
[2024-05-21 06:29:29] [INFO ] Computed 9 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 71/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 125/204 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 299/503 variables, 204/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/503 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 213 constraints, problems are : Problem set: 0 solved, 8 unsolved in 251 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 71/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 125/204 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 299/503 variables, 204/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 221 constraints, problems are : Problem set: 0 solved, 8 unsolved in 365 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 630ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 4 properties in 302 ms.
Support contains 4 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 301/301 transitions.
Graph (complete) has 661 edges and 204 vertex of which 196 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 196 transition count 199
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 180 place count 118 transition count 199
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 180 place count 118 transition count 187
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 204 place count 106 transition count 187
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 231 place count 79 transition count 154
Iterating global reduction 2 with 27 rules applied. Total rules applied 258 place count 79 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 262 place count 79 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 262 place count 79 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 264 place count 78 transition count 149
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 302 place count 59 transition count 130
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 289 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 3 rules applied. Total rules applied 305 place count 58 transition count 128
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 321 place count 50 transition count 145
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 327 place count 50 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 349 place count 50 transition count 117
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 353 place count 50 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 363 place count 46 transition count 107
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 365 place count 44 transition count 101
Iterating global reduction 6 with 2 rules applied. Total rules applied 367 place count 44 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 369 place count 44 transition count 99
Applied a total of 369 rules in 39 ms. Remains 44 /204 variables (removed 160) and now considering 99/301 (removed 202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 44/204 places, 99/301 transitions.
RANDOM walk for 4000000 steps (192451 resets) in 6953 ms. (575 steps per ms) remains 0/4 properties
Able to resolve query StableMarking after proving 341 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 22993 ms.
ITS solved all properties within timeout

BK_STOP 1716272973328

--------------------
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 StableMarking -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="CloudDeployment-PT-2b"
export BK_EXAMINATION="StableMarking"
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 CloudDeployment-PT-2b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r078-tall-171620515500343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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