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.r012-smll-171620123700008.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 ASLink-PT-01a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r012-smll-171620123700008
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 201K 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 1716242383705

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 21:59:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 21:59:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 21:59:46] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-20 21:59:46] [INFO ] Transformed 431 places.
[2024-05-20 21:59:46] [INFO ] Transformed 735 transitions.
[2024-05-20 21:59:46] [INFO ] Found NUPN structural information;
[2024-05-20 21:59:46] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 601 ms.
Structural test allowed to assert that 45 places are NOT stable. Took 29 ms.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
RANDOM walk for 40000 steps (793 resets) in 3724 ms. (10 steps per ms) remains 66/386 properties
BEST_FIRST walk for 4003 steps (28 resets) in 80 ms. (49 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (27 resets) in 67 ms. (58 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (28 resets) in 93 ms. (42 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (25 resets) in 112 ms. (35 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (23 resets) in 101 ms. (39 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (24 resets) in 79 ms. (50 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (26 resets) in 46 ms. (85 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (28 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (23 resets) in 38 ms. (102 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (30 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (30 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (30 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (31 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (26 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (27 resets) in 38 ms. (102 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (26 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (27 resets) in 40 ms. (97 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (25 resets) in 44 ms. (88 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (25 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (23 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (27 resets) in 30 ms. (129 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (25 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (24 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (26 resets) in 28 ms. (138 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (33 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (29 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (26 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (27 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (23 resets) in 56 ms. (70 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (25 resets) in 27 ms. (143 steps per ms) remains 65/66 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (30 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (24 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (25 resets) in 21 ms. (181 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (36 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (29 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (25 resets) in 33 ms. (117 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (22 resets) in 23 ms. (166 steps per ms) remains 32/65 properties
BEST_FIRST walk for 4002 steps (28 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (34 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
// Phase 1: matrix 728 rows 431 cols
[2024-05-20 21:59:49] [INFO ] Computed 80 invariants in 64 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 26/58 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 62/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 62/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 300/420 variables, 50/194 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 300/494 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 11/431 variables, 6/500 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 11/511 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (OVERLAPS) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 942 constraints, problems are : Problem set: 0 solved, 32 unsolved in 3341 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 26/58 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 26/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 62/120 variables, 11/82 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 62/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 300/420 variables, 50/194 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 300/494 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-05-20 21:59:53] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 44 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 11/431 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 11/512 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/431 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 16 (OVERLAPS) 728/1159 variables, 431/943 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1159 variables, 32/975 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 975 constraints, problems are : Problem set: 0 solved, 32 unsolved in 5012 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 1/1 constraints]
After SMT, in 8522ms problems are : Problem set: 0 solved, 32 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 425 transition count 697
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 68 place count 394 transition count 697
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 68 place count 394 transition count 668
Deduced a syphon composed of 29 places in 9 ms
Ensure Unique test removed 11 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 137 place count 354 transition count 668
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 354 transition count 667
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 353 transition count 667
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 142 place count 350 transition count 651
Iterating global reduction 4 with 3 rules applied. Total rules applied 145 place count 350 transition count 651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 149 place count 349 transition count 648
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 151 place count 347 transition count 648
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 346 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 346 transition count 640
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 345 transition count 632
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 345 transition count 632
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 344 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 344 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 343 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 343 transition count 616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 342 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 342 transition count 608
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 162 place count 341 transition count 600
Iterating global reduction 6 with 1 rules applied. Total rules applied 163 place count 341 transition count 600
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 164 place count 340 transition count 592
Iterating global reduction 6 with 1 rules applied. Total rules applied 165 place count 340 transition count 592
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 166 place count 339 transition count 584
Iterating global reduction 6 with 1 rules applied. Total rules applied 167 place count 339 transition count 584
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 168 place count 338 transition count 576
Iterating global reduction 6 with 1 rules applied. Total rules applied 169 place count 338 transition count 576
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 337 transition count 568
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 337 transition count 568
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 172 place count 336 transition count 560
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 336 transition count 560
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 335 transition count 552
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 335 transition count 552
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 176 place count 334 transition count 544
Iterating global reduction 6 with 1 rules applied. Total rules applied 177 place count 334 transition count 544
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 178 place count 333 transition count 536
Iterating global reduction 6 with 1 rules applied. Total rules applied 179 place count 333 transition count 536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 180 place count 332 transition count 528
Iterating global reduction 6 with 1 rules applied. Total rules applied 181 place count 332 transition count 528
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 331 transition count 520
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 331 transition count 520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 197 place count 324 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 198 place count 323 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 199 place count 322 transition count 512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 199 place count 322 transition count 511
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 201 place count 321 transition count 511
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 202 place count 320 transition count 511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 204 place count 319 transition count 510
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 205 place count 318 transition count 509
Iterating global reduction 8 with 1 rules applied. Total rules applied 206 place count 318 transition count 509
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 318 transition count 508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 208 place count 317 transition count 508
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 209 place count 317 transition count 508
Applied a total of 209 rules in 532 ms. Remains 317 /431 variables (removed 114) and now considering 508/728 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 552 ms. Remains : 317/431 places, 508/728 transitions.
RANDOM walk for 4000000 steps (85669 resets) in 21275 ms. (188 steps per ms) remains 1/32 properties
BEST_FIRST walk for 4000001 steps (37138 resets) in 4184 ms. (955 steps per ms) remains 1/1 properties
// Phase 1: matrix 508 rows 317 cols
[2024-05-20 22:00:05] [INFO ] Computed 60 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/33 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 144/201 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 46/247 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/315 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/316 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/317 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 508/825 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/825 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 825/825 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/33 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 20/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/56 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/57 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 144/201 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 46/247 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/247 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 68/315 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/315 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/316 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/316 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/317 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/317 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 508/825 variables, 317/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/825 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/825 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/825 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 825/825 variables, and 378 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 317/317 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 864ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 317/317 places, 508/508 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 317 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 315 transition count 507
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 315 transition count 504
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 10 place count 311 transition count 504
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 309 transition count 504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 309 transition count 503
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 308 transition count 503
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 307 transition count 502
Ensure Unique test removed 1 places
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 306 transition count 502
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 19 place count 306 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 305 transition count 500
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 24 place count 303 transition count 498
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 25 place count 302 transition count 497
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 302 transition count 497
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 27 place count 302 transition count 496
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 29 place count 301 transition count 495
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 30 place count 301 transition count 495
Applied a total of 30 rules in 112 ms. Remains 301 /317 variables (removed 16) and now considering 495/508 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 301/317 places, 495/508 transitions.
RANDOM walk for 4000000 steps (85159 resets) in 9215 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (37291 resets) in 4007 ms. (998 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2150046 steps, run timeout after 9001 ms. (steps per millisecond=238 ) properties seen :0 out of 1
Probabilistic random walk after 2150046 steps, saw 628850 distinct states, run finished after 9014 ms. (steps per millisecond=238 ) properties seen :0
// Phase 1: matrix 495 rows 301 cols
[2024-05-20 22:00:19] [INFO ] Computed 55 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/135 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/189 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/191 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 107/298 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/299 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/301 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 495/796 variables, 301/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/796 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/796 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/135 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/189 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/191 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 107/298 variables, 27/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/298 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/299 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/301 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 495/796 variables, 301/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/796 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/796 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/796 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 796/796 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 361 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 301/301 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 792ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 457 ms.
Support contains 1 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 495/495 transitions.
Applied a total of 0 rules in 11 ms. Remains 301 /301 variables (removed 0) and now considering 495/495 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 301/301 places, 495/495 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 495/495 transitions.
Applied a total of 0 rules in 12 ms. Remains 301 /301 variables (removed 0) and now considering 495/495 (removed 0) transitions.
[2024-05-20 22:00:20] [INFO ] Invariant cache hit.
[2024-05-20 22:00:20] [INFO ] Implicit Places using invariants in 455 ms returned [0, 18, 19, 30, 48, 66, 85, 135, 136, 147, 148, 149, 167, 169, 172, 190, 191, 192, 193, 205, 211, 217, 223, 229, 235, 241, 247, 253, 259, 265]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 466 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 271/301 places, 495/495 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 271 transition count 451
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 227 transition count 451
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 88 place count 227 transition count 440
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 111 place count 215 transition count 440
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 123 place count 211 transition count 432
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 131 place count 203 transition count 432
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 146 place count 188 transition count 417
Iterating global reduction 4 with 15 rules applied. Total rules applied 161 place count 188 transition count 417
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 188 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 164 place count 188 transition count 413
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 166 place count 187 transition count 413
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 169 place count 184 transition count 410
Iterating global reduction 5 with 3 rules applied. Total rules applied 172 place count 184 transition count 410
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 173 place count 183 transition count 409
Iterating global reduction 5 with 1 rules applied. Total rules applied 174 place count 183 transition count 409
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 175 place count 182 transition count 408
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 182 transition count 408
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 214 place count 163 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 215 place count 163 transition count 388
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 218 place count 163 transition count 385
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 222 place count 159 transition count 385
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 225 place count 159 transition count 385
Applied a total of 225 rules in 77 ms. Remains 159 /271 variables (removed 112) and now considering 385/495 (removed 110) transitions.
// Phase 1: matrix 385 rows 159 cols
[2024-05-20 22:00:20] [INFO ] Computed 19 invariants in 3 ms
[2024-05-20 22:00:21] [INFO ] Implicit Places using invariants in 199 ms returned [87, 93, 96, 98]
[2024-05-20 22:00:21] [INFO ] Actually due to overlaps returned [87, 93, 98]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 203 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 156/301 places, 385/495 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 152 transition count 381
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 152 transition count 381
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 151 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 151 transition count 380
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 150 transition count 379
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 150 transition count 376
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 18 place count 147 transition count 376
Applied a total of 18 rules in 32 ms. Remains 147 /156 variables (removed 9) and now considering 376/385 (removed 9) transitions.
// Phase 1: matrix 376 rows 147 cols
[2024-05-20 22:00:21] [INFO ] Computed 16 invariants in 5 ms
[2024-05-20 22:00:21] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-20 22:00:21] [INFO ] Invariant cache hit.
[2024-05-20 22:00:21] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/301 places, 376/495 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1343 ms. Remains : 147/301 places, 376/495 transitions.
RANDOM walk for 4000000 steps (115643 resets) in 5672 ms. (705 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000000 steps (62408 resets) in 3441 ms. (1162 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 173664 steps, run visited all 1 properties in 594 ms. (steps per millisecond=292 )
Probabilistic random walk after 173664 steps, saw 70478 distinct states, run finished after 600 ms. (steps per millisecond=289 ) properties seen :1
Able to resolve query StableMarking after proving 387 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 38547 ms.
ITS solved all properties within timeout

BK_STOP 1716242424804

--------------------
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="ASLink-PT-01a"
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 ASLink-PT-01a, 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 r012-smll-171620123700008"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a 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 ;