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.r466-smll-171620124200018.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 ltsminxred
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 r466-smll-171620124200018
=====================================================================

--------------------
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 1717182099493

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:01:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:01:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:01:42] [INFO ] Load time of PNML (sax parser for PT used): 197 ms
[2024-05-31 19:01:42] [INFO ] Transformed 626 places.
[2024-05-31 19:01:42] [INFO ] Transformed 1008 transitions.
[2024-05-31 19:01:42] [INFO ] Found NUPN structural information;
[2024-05-31 19:01:42] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 516 ms.
Structural test allowed to assert that 68 places are NOT stable. Took 15 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
RANDOM walk for 40000 steps (483 resets) in 3375 ms. (11 steps per ms) remains 106/558 properties
BEST_FIRST walk for 400 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 106/106 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 106/106 properties
// Phase 1: matrix 998 rows 626 cols
[2024-05-31 19:01:43] [INFO ] Computed 118 invariants in 71 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 27/133 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 27/151 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 84/217 variables, 16/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 84/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 398/615 variables, 77/329 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 398/727 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 (/ 3.0 43.0))
(s2 (/ 1.0 86.0))
(s3 (/ 1.0 86.0))
(s4 (/ 1.0 86.0))
(s5 (/ 1.0 86.0))
(s6 (/ 1.0 86.0))
(s7 (/ 1.0 86.0))
(s8 (/ 1.0 86.0))
(s9 (/ 1.0 86.0))
(s10 (/ 1.0 86.0))
(s11 (/ 1.0 86.0))
(s12 (/ 1.0 86.0))
(s13 (/ 1.0 86.0))
(s14 (/ 65.0 86.0))
(s15 (/ 1.0 86.0))
(s16 (/ 1.0 86.0))
(s17 (/ 1.0 86.0))
(s18 0.0)
(s19 (/ 1.0 43.0))
(s20 (/ 3.0 86.0))
(s21 (/ 81.0 86.0))
(s22 0.0)
(s23 (/ 1.0 86.0))
(s24 (/ 5.0 86.0))
(s25 (/ 1.0 86.0))
(s26 (/ 1.0 86.0))
(s27 (/ 1.0 86.0))
(s28 (/ 1.0 86.0))
(s29 (/ 1.0 86.0))
(s30 (/ 1.0 86.0))
(s31 (/ 71.0 86.0))
(s32 (/ 1.0 86.0))
(s33 (/ 1.0 86.0))
(s34 (/ 1.0 86.0))
(s35 (/ 15.0 43.0))
(s36 (/ 1.0 86.0))
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 (/ 55.0 86.0))
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 (/ 85.0 86.0))
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 (/ 1.0 86.0))
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 69.0 86.0))
(s73 (/ 1.0 86.0))
(s74 (/ 1.0 86.0))
(s75 (/ 1.0 86.0))
(s76 (/ 1.0 86.0))
(s77 (/ 1.0 86.0))
(s78 (/ 1.0 86.0))
(s79 (/ 1.0 86.0))
(s80 (/ 1.0 86.0))
(s81 (/ 1.0 86.0))
(s82 (/ 1.0 86.0))
(s83 (/ 1.0 86.0))
(s84 (/ 1.0 86.0))
(s85 (/ 1.0 86.0))
(s86 (/ 1.0 86.0))
(s87 (/ 1.0 86.0))
(s88 (/ 1.0 86.0))
(s89 (/ 1.0 86.0))
(s90 (/ 1.0 86.0))
(s91 (/ 1.0 86.0))
(s92 (/ 8.0 43.0))
(s93 (/ 1.0 86.0))
(s94 (/ 1.0 86.0))
(s95 (/ 1.0 86.0))
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 (/ 27.0 43.0))
(s101 0.0)
(s102 0.0)
(s103 (/ 1.0 86.0))
(s104 (/ 1.0 86.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1624 variables, and 727 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5074 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: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 6/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 27/133 variables, 12/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 27/151 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 84/217 variables, 16/168 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 84/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 398/615 variables, 77/329 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 398/727 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2024-05-31 19:01:51] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 35 ms to minimize.
[2024-05-31 19:01:53] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 615/1624 variables, and 729 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5019 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/106 constraints, Known Traps: 2/2 constraints]
After SMT, in 10327ms problems are : Problem set: 0 solved, 106 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 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 5 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 51 rules applied. Total rules applied 51 place count 618 transition count 955
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 94 place count 575 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 94 place count 575 transition count 909
Deduced a syphon composed of 46 places in 3 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 203 place count 512 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 204 place count 512 transition count 908
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 205 place count 511 transition count 908
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 208 place count 508 transition count 892
Iterating global reduction 4 with 3 rules applied. Total rules applied 211 place count 508 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 215 place count 507 transition count 889
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 217 place count 505 transition count 889
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 218 place count 504 transition count 881
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 504 transition count 881
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 220 place count 503 transition count 873
Iterating global reduction 6 with 1 rules applied. Total rules applied 221 place count 503 transition count 873
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 222 place count 502 transition count 865
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 502 transition count 865
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 224 place count 501 transition count 857
Iterating global reduction 6 with 1 rules applied. Total rules applied 225 place count 501 transition count 857
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 226 place count 500 transition count 849
Iterating global reduction 6 with 1 rules applied. Total rules applied 227 place count 500 transition count 849
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 228 place count 499 transition count 841
Iterating global reduction 6 with 1 rules applied. Total rules applied 229 place count 499 transition count 841
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 230 place count 498 transition count 833
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 498 transition count 833
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 232 place count 497 transition count 825
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 497 transition count 825
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 234 place count 496 transition count 817
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 496 transition count 817
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 236 place count 495 transition count 809
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 495 transition count 809
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 238 place count 494 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 494 transition count 801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 240 place count 493 transition count 793
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 493 transition count 793
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 242 place count 492 transition count 785
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 492 transition count 785
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 244 place count 491 transition count 777
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 491 transition count 777
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 246 place count 490 transition count 769
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 490 transition count 769
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 248 place count 489 transition count 761
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 489 transition count 761
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 269 place count 479 transition count 751
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 270 place count 479 transition count 751
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 478 transition count 750
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 273 place count 476 transition count 750
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 273 place count 476 transition count 746
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 281 place count 472 transition count 746
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 282 place count 471 transition count 746
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 284 place count 470 transition count 745
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 285 place count 469 transition count 744
Iterating global reduction 8 with 1 rules applied. Total rules applied 286 place count 469 transition count 744
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 287 place count 469 transition count 743
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 288 place count 468 transition count 743
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 289 place count 468 transition count 743
Applied a total of 289 rules in 648 ms. Remains 468 /626 variables (removed 158) and now considering 743/998 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 468/626 places, 743/998 transitions.
RANDOM walk for 4000000 steps (68502 resets) in 40732 ms. (98 steps per ms) remains 34/106 properties
BEST_FIRST walk for 400003 steps (2334 resets) in 1147 ms. (348 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2329 resets) in 1014 ms. (394 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2322 resets) in 1062 ms. (376 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2353 resets) in 1004 ms. (398 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2324 resets) in 1019 ms. (392 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2318 resets) in 1010 ms. (395 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2341 resets) in 1016 ms. (393 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2293 resets) in 1072 ms. (372 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2336 resets) in 1058 ms. (377 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2332 resets) in 1008 ms. (396 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2339 resets) in 1021 ms. (391 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2355 resets) in 1004 ms. (398 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2290 resets) in 997 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2347 resets) in 1009 ms. (396 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2365 resets) in 997 ms. (400 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2365 resets) in 1025 ms. (389 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2332 resets) in 1006 ms. (397 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2302 resets) in 1007 ms. (396 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2339 resets) in 1001 ms. (399 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2313 resets) in 1004 ms. (398 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (2334 resets) in 1008 ms. (396 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2337 resets) in 1483 ms. (269 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2364 resets) in 1647 ms. (242 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (2333 resets) in 1685 ms. (237 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2341 resets) in 1542 ms. (259 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2338 resets) in 1688 ms. (236 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (2353 resets) in 1676 ms. (238 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (2327 resets) in 1515 ms. (263 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2375 resets) in 1416 ms. (282 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400001 steps (2329 resets) in 1421 ms. (281 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400004 steps (2349 resets) in 1001 ms. (399 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2338 resets) in 1774 ms. (225 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2374 resets) in 1008 ms. (396 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400002 steps (2351 resets) in 1337 ms. (298 steps per ms) remains 34/34 properties
// Phase 1: matrix 743 rows 468 cols
[2024-05-31 19:02:19] [INFO ] Computed 89 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 14/48 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 129/178 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 23/201 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 15/216 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/216 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 4/220 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/220 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 133/353 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/353 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (OVERLAPS) 44/397 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/397 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (OVERLAPS) 68/465 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/465 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 20 (OVERLAPS) 1/466 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/466 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 22 (OVERLAPS) 2/468 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/468 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 24 (OVERLAPS) 743/1211 variables, 468/557 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1211 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 26 (OVERLAPS) 0/1211 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1211/1211 variables, and 557 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5952 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 14/48 variables, 7/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 129/178 variables, 22/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 23/201 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-05-31 19:02:26] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 15/216 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 13 (OVERLAPS) 4/220 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/220 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 15 (OVERLAPS) 133/353 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 17 (OVERLAPS) 44/397 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/397 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 19 (OVERLAPS) 68/465 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/465 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 21 (OVERLAPS) 1/466 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/466 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 23 (OVERLAPS) 2/468 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/468 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 25 (OVERLAPS) 743/1211 variables, 468/558 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1211 variables, 34/592 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1211 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 28 (OVERLAPS) 0/1211 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1211/1211 variables, and 592 constraints, problems are : Problem set: 0 solved, 34 unsolved in 7715 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 468/468 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 1/1 constraints]
After SMT, in 13724ms problems are : Problem set: 0 solved, 34 unsolved
Fused 34 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 7917 ms.
Support contains 34 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 743/743 transitions.
Ensure Unique test removed 3 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 7 rules applied. Total rules applied 7 place count 465 transition count 739
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 460 transition count 739
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 460 transition count 738
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 459 transition count 738
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 457 transition count 731
Ensure Unique test removed 1 places
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 456 transition count 731
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 2 with 3 rules applied. Total rules applied 22 place count 455 transition count 729
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 454 transition count 729
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 4 with 8 rules applied. Total rules applied 31 place count 450 transition count 725
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 449 transition count 724
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 449 transition count 724
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 449 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 35 place count 448 transition count 723
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 37 place count 448 transition count 723
Applied a total of 37 rules in 138 ms. Remains 448 /468 variables (removed 20) and now considering 723/743 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 448/468 places, 723/743 transitions.
RANDOM walk for 4000000 steps (64563 resets) in 27428 ms. (145 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 1506 ms. (265 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2267 resets) in 1546 ms. (258 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2241 resets) in 1622 ms. (246 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2225 resets) in 1915 ms. (208 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2275 resets) in 1420 ms. (281 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2258 resets) in 1015 ms. (393 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2244 resets) in 1029 ms. (388 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2256 resets) in 1012 ms. (394 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2261 resets) in 1438 ms. (277 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2241 resets) in 1450 ms. (275 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1467 ms. (272 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2263 resets) in 1012 ms. (394 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2260 resets) in 1028 ms. (388 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2240 resets) in 983 ms. (406 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2235 resets) in 1032 ms. (387 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2196 resets) in 1025 ms. (389 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1044 ms. (382 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2240 resets) in 1018 ms. (392 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2239 resets) in 1001 ms. (399 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2241 resets) in 1041 ms. (383 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2247 resets) in 1001 ms. (399 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2211 resets) in 1057 ms. (378 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400001 steps (2226 resets) in 1004 ms. (398 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2230 resets) in 998 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2232 resets) in 1014 ms. (394 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1014 ms. (394 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2192 resets) in 1034 ms. (386 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2189 resets) in 1007 ms. (396 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2201 resets) in 1032 ms. (387 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2239 resets) in 1009 ms. (396 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400002 steps (2262 resets) in 1024 ms. (390 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400003 steps (2209 resets) in 1049 ms. (380 steps per ms) remains 33/33 properties
BEST_FIRST walk for 400004 steps (2240 resets) in 998 ms. (400 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 3564212 steps, run timeout after 57001 ms. (steps per millisecond=62 ) properties seen :16 out of 33
Probabilistic random walk after 3564212 steps, saw 1114806 distinct states, run finished after 57010 ms. (steps per millisecond=62 ) properties seen :16
// Phase 1: matrix 723 rows 448 cols
[2024-05-31 19:03:57] [INFO ] Computed 83 invariants in 16 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 2858 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 4730 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 7621ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 2453 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 3 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 32 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 32 ms. Remains : 440/448 places, 717/723 transitions.
RANDOM walk for 4000000 steps (64563 resets) in 22578 ms. (177 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2177 resets) in 821 ms. (486 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 816 ms. (489 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2263 resets) in 842 ms. (474 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2254 resets) in 803 ms. (497 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2244 resets) in 829 ms. (481 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2187 resets) in 834 ms. (479 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2244 resets) in 805 ms. (496 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2237 resets) in 813 ms. (491 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2254 resets) in 841 ms. (475 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2186 resets) in 836 ms. (477 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2190 resets) in 842 ms. (474 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (2223 resets) in 839 ms. (476 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2177 resets) in 841 ms. (475 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2203 resets) in 826 ms. (483 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (2251 resets) in 827 ms. (483 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (2192 resets) in 819 ms. (487 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (2240 resets) in 830 ms. (481 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 1722113 steps, run timeout after 30001 ms. (steps per millisecond=57 ) properties seen :0 out of 17
Probabilistic random walk after 1722113 steps, saw 620750 distinct states, run finished after 30002 ms. (steps per millisecond=57 ) properties seen :0
// Phase 1: matrix 717 rows 440 cols
[2024-05-31 19:04:48] [INFO ] Computed 81 invariants in 9 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 3103 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 4480 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 7604ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 2347 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 14 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 14 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 14 ms. Remains 440 /440 variables (removed 0) and now considering 717/717 (removed 0) transitions.
[2024-05-31 19:04:58] [INFO ] Invariant cache hit.
[2024-05-31 19:04:59] [INFO ] Implicit Places using invariants in 624 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-31 19:04:59] [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 639 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 1 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 147 ms. Remains 265 /405 variables (removed 140) and now considering 578/717 (removed 139) transitions.
// Phase 1: matrix 578 rows 265 cols
[2024-05-31 19:04:59] [INFO ] Computed 39 invariants in 8 ms
[2024-05-31 19:04:59] [INFO ] Implicit Places using invariants in 347 ms returned [95, 101, 104, 106, 109, 119, 120, 174, 191, 197, 200, 202]
[2024-05-31 19:04:59] [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 354 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 0 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 76 ms. Remains 234 /255 variables (removed 21) and now considering 556/578 (removed 22) transitions.
// Phase 1: matrix 556 rows 234 cols
[2024-05-31 19:04:59] [INFO ] Computed 29 invariants in 8 ms
[2024-05-31 19:04:59] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 19:04:59] [INFO ] Invariant cache hit.
[2024-05-31 19:05:00] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1054 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 2286 ms. Remains : 234/440 places, 556/717 transitions.
RANDOM walk for 4000000 steps (95638 resets) in 20280 ms. (197 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (3974 resets) in 857 ms. (466 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4007 resets) in 842 ms. (474 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (4012 resets) in 855 ms. (467 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4026 resets) in 860 ms. (464 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (3998 resets) in 831 ms. (480 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4026 resets) in 854 ms. (467 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3987 resets) in 1224 ms. (326 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4028 resets) in 1362 ms. (293 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (3980 resets) in 1428 ms. (279 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3980 resets) in 1342 ms. (297 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (3979 resets) in 1200 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4012 resets) in 1200 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (4036 resets) in 1115 ms. (358 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4061 resets) in 1146 ms. (348 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (3961 resets) in 1286 ms. (310 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (4029 resets) in 1117 ms. (357 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (4041 resets) in 984 ms. (406 steps per ms) remains 17/17 properties
Finished probabilistic random walk after 1518719 steps, run visited all 17 properties in 7015 ms. (steps per millisecond=216 )
Probabilistic random walk after 1518719 steps, saw 610223 distinct states, run finished after 7028 ms. (steps per millisecond=216 ) properties seen :17
Able to resolve query StableMarking after proving 559 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 218072 ms.
ITS solved all properties within timeout

BK_STOP 1717182320009

--------------------
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="ltsminxred"
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 ltsminxred"
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 r466-smll-171620124200018"
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 ;