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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 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 279K 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 1716242605910

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-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 22:03:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-20 22:03:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:03:28] [INFO ] Load time of PNML (sax parser for PT used): 308 ms
[2024-05-20 22:03:29] [INFO ] Transformed 626 places.
[2024-05-20 22:03:29] [INFO ] Transformed 1008 transitions.
[2024-05-20 22:03:29] [INFO ] Found NUPN structural information;
[2024-05-20 22:03:29] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 606 ms.
Structural test allowed to assert that 68 places are NOT stable. Took 21 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (462 resets) in 4360 ms. (9 steps per ms) remains 102/558 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 16 ms. (23 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
BEST_FIRST walk for 401 steps (8 resets) in 10 ms. (36 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 102/102 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 102/102 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 102/102 properties
// Phase 1: matrix 998 rows 626 cols
[2024-05-20 22:03:30] [INFO ] Computed 118 invariants in 109 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 29/131 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 29/150 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 81/212 variables, 15/166 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 81/247 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 403/615 variables, 77/324 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 403/727 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1624 variables, and 727 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5108 ms.
Refiners :[Domain max(s): 615/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 84/90 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 6/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 29/131 variables, 13/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 29/150 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 81/212 variables, 15/166 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 81/247 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 403/615 variables, 77/324 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 403/727 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-20 22:03:38] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 33 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 1/728 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1624 variables, and 728 constraints, problems are : Problem set: 0 solved, 102 unsolved in 5017 ms.
Refiners :[Domain max(s): 615/626 constraints, Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 84/90 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 0/102 constraints, Known Traps: 1/1 constraints]
After SMT, in 10462ms problems are : Problem set: 0 solved, 102 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 102 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 4 places
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 619 transition count 955
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 93 place count 576 transition count 955
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 93 place count 576 transition count 909
Deduced a syphon composed of 46 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 202 place count 513 transition count 909
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 203 place count 513 transition count 908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 204 place count 512 transition count 908
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 207 place count 509 transition count 892
Iterating global reduction 4 with 3 rules applied. Total rules applied 210 place count 509 transition count 892
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 214 place count 508 transition count 889
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 216 place count 506 transition count 889
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 217 place count 505 transition count 881
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 505 transition count 881
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 219 place count 504 transition count 873
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 504 transition count 873
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 221 place count 503 transition count 865
Iterating global reduction 6 with 1 rules applied. Total rules applied 222 place count 503 transition count 865
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 223 place count 502 transition count 857
Iterating global reduction 6 with 1 rules applied. Total rules applied 224 place count 502 transition count 857
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 225 place count 501 transition count 849
Iterating global reduction 6 with 1 rules applied. Total rules applied 226 place count 501 transition count 849
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 227 place count 500 transition count 841
Iterating global reduction 6 with 1 rules applied. Total rules applied 228 place count 500 transition count 841
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 229 place count 499 transition count 833
Iterating global reduction 6 with 1 rules applied. Total rules applied 230 place count 499 transition count 833
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 231 place count 498 transition count 825
Iterating global reduction 6 with 1 rules applied. Total rules applied 232 place count 498 transition count 825
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 233 place count 497 transition count 817
Iterating global reduction 6 with 1 rules applied. Total rules applied 234 place count 497 transition count 817
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 235 place count 496 transition count 809
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 496 transition count 809
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 237 place count 495 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 238 place count 495 transition count 801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 239 place count 494 transition count 793
Iterating global reduction 6 with 1 rules applied. Total rules applied 240 place count 494 transition count 793
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 241 place count 493 transition count 785
Iterating global reduction 6 with 1 rules applied. Total rules applied 242 place count 493 transition count 785
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 243 place count 492 transition count 777
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 492 transition count 777
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 245 place count 491 transition count 769
Iterating global reduction 6 with 1 rules applied. Total rules applied 246 place count 491 transition count 769
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 247 place count 490 transition count 761
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 490 transition count 761
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 270 place count 479 transition count 750
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 271 place count 479 transition count 750
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 478 transition count 749
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 273 place count 477 transition count 749
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 273 place count 477 transition count 746
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 279 place count 474 transition count 746
Applied a total of 279 rules in 622 ms. Remains 474 /626 variables (removed 152) and now considering 746/998 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 645 ms. Remains : 474/626 places, 746/998 transitions.
RANDOM walk for 4000000 steps (63754 resets) in 44004 ms. (90 steps per ms) remains 41/102 properties
BEST_FIRST walk for 400003 steps (2237 resets) in 1166 ms. (342 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2202 resets) in 1132 ms. (353 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2173 resets) in 1157 ms. (345 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2199 resets) in 1132 ms. (353 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2201 resets) in 1142 ms. (349 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2200 resets) in 1162 ms. (343 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2177 resets) in 1218 ms. (328 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2183 resets) in 1139 ms. (350 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400000 steps (2227 resets) in 1171 ms. (341 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2161 resets) in 1160 ms. (344 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2201 resets) in 1140 ms. (350 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2219 resets) in 1133 ms. (352 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2182 resets) in 1161 ms. (344 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2177 resets) in 1156 ms. (345 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2206 resets) in 1159 ms. (344 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2217 resets) in 1196 ms. (334 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2206 resets) in 1148 ms. (348 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2191 resets) in 1159 ms. (344 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2170 resets) in 1148 ms. (348 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2210 resets) in 1186 ms. (336 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2186 resets) in 1223 ms. (326 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2204 resets) in 1154 ms. (346 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2190 resets) in 1141 ms. (350 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2220 resets) in 1148 ms. (348 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2208 resets) in 1165 ms. (343 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2191 resets) in 1219 ms. (327 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2213 resets) in 1124 ms. (355 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2158 resets) in 1144 ms. (349 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1146 ms. (348 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400000 steps (2177 resets) in 1132 ms. (353 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400004 steps (2236 resets) in 1128 ms. (354 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2207 resets) in 1148 ms. (348 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2209 resets) in 1130 ms. (353 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400002 steps (2210 resets) in 1131 ms. (353 steps per ms) remains 41/41 properties
BEST_FIRST walk for 400001 steps (2176 resets) in 1157 ms. (345 steps per ms) remains 33/41 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 1056 ms. (378 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2230 resets) in 1056 ms. (378 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2217 resets) in 1048 ms. (381 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2178 resets) in 1050 ms. (380 steps per ms) remains 33/33 properties
// Phase 1: matrix 746 rows 474 cols
[2024-05-20 22:04:06] [INFO ] Computed 92 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 11/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 112/157 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 6/163 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 129/292 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 68/360 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (OVERLAPS) 1/361 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/361 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (OVERLAPS) 110/471 variables, 30/89 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/471 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 18 (OVERLAPS) 1/472 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/472 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 20 (OVERLAPS) 2/474 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/474 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 22 (OVERLAPS) 746/1220 variables, 474/566 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1220 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 24 (OVERLAPS) 0/1220 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1220/1220 variables, and 566 constraints, problems are : Problem set: 0 solved, 33 unsolved in 4104 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 11/44 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 1/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 112/157 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 6/163 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 129/292 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-20 22:04:11] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 68/360 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 15 (OVERLAPS) 1/361 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 17 (OVERLAPS) 110/471 variables, 30/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/471 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 19 (OVERLAPS) 1/472 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/472 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 21 (OVERLAPS) 2/474 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/474 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 23 (OVERLAPS) 746/1220 variables, 474/567 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1220 variables, 33/600 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1220 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 26 (OVERLAPS) 0/1220 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1220/1220 variables, and 600 constraints, problems are : Problem set: 0 solved, 33 unsolved in 7642 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 66/66 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 1/1 constraints]
After SMT, in 11803ms problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 7763 ms.
Support contains 33 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 746/746 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 470 transition count 742
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 464 transition count 742
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 464 transition count 740
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 462 transition count 740
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 461 transition count 740
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 21 place count 459 transition count 733
Ensure Unique test removed 1 places
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 458 transition count 733
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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 457 transition count 731
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 456 transition count 731
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 36 place count 452 transition count 727
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 38 place count 450 transition count 725
Iterating global reduction 5 with 2 rules applied. Total rules applied 40 place count 450 transition count 725
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 42 place count 450 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 44 place count 448 transition count 723
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 47 place count 448 transition count 723
Applied a total of 47 rules in 127 ms. Remains 448 /474 variables (removed 26) and now considering 723/746 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 448/474 places, 723/746 transitions.
RANDOM walk for 4000000 steps (64736 resets) in 25520 ms. (156 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2260 resets) in 999 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2168 resets) in 1009 ms. (396 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2275 resets) in 993 ms. (402 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2213 resets) in 1015 ms. (393 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2239 resets) in 1006 ms. (397 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2272 resets) in 1011 ms. (395 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2232 resets) in 1011 ms. (395 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2231 resets) in 1002 ms. (398 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2263 resets) in 1002 ms. (398 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2244 resets) in 1770 ms. (225 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2209 resets) in 992 ms. (402 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2209 resets) in 996 ms. (401 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2199 resets) in 984 ms. (406 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2238 resets) in 991 ms. (403 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2199 resets) in 1051 ms. (380 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2254 resets) in 1090 ms. (366 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2252 resets) in 1029 ms. (388 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2258 resets) in 1032 ms. (387 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2187 resets) in 1053 ms. (379 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2184 resets) in 1020 ms. (391 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2188 resets) in 1017 ms. (392 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2223 resets) in 1035 ms. (386 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2274 resets) in 998 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2229 resets) in 1024 ms. (390 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2194 resets) in 1026 ms. (389 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2246 resets) in 1024 ms. (390 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2251 resets) in 1001 ms. (399 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2230 resets) in 1023 ms. (390 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2226 resets) in 1033 ms. (386 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1022 ms. (391 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2254 resets) in 1024 ms. (390 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2175 resets) in 1031 ms. (387 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2236 resets) in 1023 ms. (390 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 3240691 steps, run timeout after 48001 ms. (steps per millisecond=67 ) properties seen :16 out of 33
Probabilistic random walk after 3240691 steps, saw 1004489 distinct states, run finished after 48010 ms. (steps per millisecond=67 ) properties seen :16
// Phase 1: matrix 723 rows 448 cols
[2024-05-20 22:05:30] [INFO ] Computed 83 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 95/156 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 30/186 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 145/331 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 47/378 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/446 variables, 23/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/446 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/447 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 1/448 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/448 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 723/1171 variables, 448/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1171 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 0/1171 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1171/1171 variables, and 531 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2096 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 95/156 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 30/186 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 145/331 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 47/378 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/378 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/446 variables, 23/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/446 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/447 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/447 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 1/448 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/448 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 723/1171 variables, 448/531 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1171 variables, 17/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1171 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 0/1171 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1171/1171 variables, and 548 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3187 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 5306ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 2040 ms.
Support contains 17 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 723/723 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 448 transition count 720
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 445 transition count 720
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 445 transition count 717
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 440 transition count 717
Applied a total of 14 rules in 36 ms. Remains 440 /448 variables (removed 8) and now considering 717/723 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 440/448 places, 717/723 transitions.
RANDOM walk for 4000000 steps (64734 resets) in 22545 ms. (177 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2225 resets) in 887 ms. (450 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2230 resets) in 868 ms. (460 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2228 resets) in 867 ms. (460 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2248 resets) in 860 ms. (464 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2267 resets) in 865 ms. (461 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2190 resets) in 869 ms. (459 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2208 resets) in 898 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2244 resets) in 856 ms. (466 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2200 resets) in 855 ms. (467 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2235 resets) in 882 ms. (453 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2250 resets) in 867 ms. (460 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2213 resets) in 888 ms. (449 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2223 resets) in 870 ms. (459 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2229 resets) in 889 ms. (449 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2207 resets) in 890 ms. (448 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2247 resets) in 854 ms. (467 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2238 resets) in 887 ms. (450 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 1728869 steps, run timeout after 30001 ms. (steps per millisecond=57 ) properties seen :0 out of 17
Probabilistic random walk after 1728869 steps, saw 600589 distinct states, run finished after 30001 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 717 rows 440 cols
[2024-05-20 22:06:17] [INFO ] Computed 81 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 100/161 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 21/182 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 141/323 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 46/369 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/437 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/438 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 2/440 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 717/1157 variables, 440/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1157 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 0/1157 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1157/1157 variables, and 521 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2464 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/61 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 100/161 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 21/182 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 141/323 variables, 16/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/323 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 46/369 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/369 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 68/437 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 1/438 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/438 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 2/440 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/440 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 717/1157 variables, 440/521 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1157 variables, 17/538 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1157 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 0/1157 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1157/1157 variables, and 538 constraints, problems are : Problem set: 0 solved, 17 unsolved in 4464 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 62/62 constraints, State Equation: 440/440 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 6967ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 2217 ms.
Support contains 17 out of 440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 717/717 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 717/717 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 440/440 places, 717/717 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 440/440 places, 717/717 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-20 22:06:27] [INFO ] Invariant cache hit.
[2024-05-20 22:06:27] [INFO ] Implicit Places using invariants in 754 ms returned [0, 19, 31, 49, 67, 142, 160, 161, 162, 180, 198, 267, 271, 272, 275, 286, 287, 288, 306, 308, 311, 329, 330, 331, 332, 344, 350, 356, 362, 368, 374, 380, 386, 392, 398, 404]
[2024-05-20 22:06:27] [INFO ] Actually due to overlaps returned [306, 288, 31, 49, 162, 180, 311, 161, 287, 330, 160, 286, 308, 329, 0, 271, 272, 19, 67, 198, 332, 374, 392, 404, 142, 275, 331, 344, 350, 356, 362, 368, 380, 386, 398]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 773 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 405/440 places, 717/717 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 404 transition count 659
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 346 transition count 659
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 117 place count 346 transition count 645
Deduced a syphon composed of 14 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 146 place count 331 transition count 645
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 158 place count 327 transition count 637
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 166 place count 319 transition count 637
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 181 place count 304 transition count 622
Iterating global reduction 4 with 15 rules applied. Total rules applied 196 place count 304 transition count 622
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 199 place count 304 transition count 619
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 199 place count 304 transition count 618
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 201 place count 303 transition count 618
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 300 transition count 615
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 300 transition count 615
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 208 place count 299 transition count 614
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 299 transition count 614
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 210 place count 298 transition count 613
Iterating global reduction 5 with 1 rules applied. Total rules applied 211 place count 298 transition count 613
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 261 place count 273 transition count 588
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 262 place count 273 transition count 587
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 263 place count 272 transition count 586
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 272 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 265 place count 272 transition count 585
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 271 place count 272 transition count 579
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 278 place count 265 transition count 579
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 279 place count 265 transition count 578
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 285 place count 265 transition count 578
Applied a total of 285 rules in 126 ms. Remains 265 /405 variables (removed 140) and now considering 578/717 (removed 139) transitions.
// Phase 1: matrix 578 rows 265 cols
[2024-05-20 22:06:27] [INFO ] Computed 39 invariants in 6 ms
[2024-05-20 22:06:28] [INFO ] Implicit Places using invariants in 305 ms returned [95, 101, 104, 106, 109, 119, 120, 174, 191, 197, 200, 202]
[2024-05-20 22:06:28] [INFO ] Actually due to overlaps returned [119, 120, 95, 101, 106, 191, 197, 202, 109, 174]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 311 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/440 places, 578/717 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 246 transition count 569
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 246 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 244 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 244 transition count 567
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 241 transition count 564
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 29 place count 241 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 35 place count 241 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 235 transition count 557
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 235 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 234 transition count 556
Applied a total of 43 rules in 70 ms. Remains 234 /255 variables (removed 21) and now considering 556/578 (removed 22) transitions.
// Phase 1: matrix 556 rows 234 cols
[2024-05-20 22:06:28] [INFO ] Computed 29 invariants in 7 ms
[2024-05-20 22:06:28] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-20 22:06:28] [INFO ] Invariant cache hit.
[2024-05-20 22:06:29] [INFO ] Implicit Places using invariants and state equation in 1002 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 234/440 places, 556/717 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2675 ms. Remains : 234/440 places, 556/717 transitions.
RANDOM walk for 4000000 steps (95499 resets) in 19195 ms. (208 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4033 resets) in 867 ms. (460 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4005 resets) in 875 ms. (456 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4006 resets) in 847 ms. (471 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4045 resets) in 871 ms. (458 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4042 resets) in 853 ms. (468 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3999 resets) in 845 ms. (472 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4055 resets) in 833 ms. (479 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400000 steps (3995 resets) in 846 ms. (472 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3956 resets) in 841 ms. (475 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4010 resets) in 879 ms. (454 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (4071 resets) in 820 ms. (487 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (3967 resets) in 876 ms. (456 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (3998 resets) in 847 ms. (471 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (3962 resets) in 1082 ms. (369 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (3998 resets) in 982 ms. (406 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (4009 resets) in 868 ms. (460 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4035 resets) in 889 ms. (449 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 1518719 steps, run visited all 17 properties in 6571 ms. (steps per millisecond=231 )
Probabilistic random walk after 1518719 steps, saw 610223 distinct states, run finished after 6579 ms. (steps per millisecond=230 ) properties seen :17
Able to resolve query StableMarking after proving 559 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 197223 ms.
ITS solved all properties within timeout

BK_STOP 1716242805674

--------------------
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-02a"
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-02a, 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-171620123700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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