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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 667K 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 1716263936452

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 03:58:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-21 03:58:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 03:58:59] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-21 03:58:59] [INFO ] Transformed 401 places.
[2024-05-21 03:58:59] [INFO ] Transformed 1328 transitions.
[2024-05-21 03:58:59] [INFO ] Found NUPN structural information;
[2024-05-21 03:58:59] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 573 ms.
RANDOM walk for 40000 steps (8 resets) in 4006 ms. (9 steps per ms) remains 39/401 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4000 steps (8 resets) in 75 ms. (52 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
// Phase 1: matrix 1328 rows 401 cols
[2024-05-21 03:59:01] [INFO ] Computed 19 invariants in 52 ms
[2024-05-21 03:59:01] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 342/379 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 342/387 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 8/387 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 14/401 variables, 10/406 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 14/420 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1328/1729 variables, 401/821 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1729 variables, 56/877 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1729 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1729/1729 variables, and 877 constraints, problems are : Problem set: 0 solved, 37 unsolved in 5067 ms.
Refiners :[Domain max(s): 401/401 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 401/401 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (OVERLAPS) 342/379 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 342/387 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 8/387 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 14/401 variables, 10/406 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 14/420 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-21 03:59:08] [INFO ] Deduced a trap composed of 183 places in 552 ms of which 72 ms to minimize.
[2024-05-21 03:59:09] [INFO ] Deduced a trap composed of 179 places in 602 ms of which 26 ms to minimize.
[2024-05-21 03:59:10] [INFO ] Deduced a trap composed of 177 places in 498 ms of which 11 ms to minimize.
[2024-05-21 03:59:10] [INFO ] Deduced a trap composed of 160 places in 509 ms of which 7 ms to minimize.
[2024-05-21 03:59:11] [INFO ] Deduced a trap composed of 117 places in 611 ms of which 7 ms to minimize.
[2024-05-21 03:59:11] [INFO ] Deduced a trap composed of 112 places in 610 ms of which 6 ms to minimize.
SMT process timed out in 10437ms, After SMT, problems are : Problem set: 0 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 401 transition count 1306
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 379 transition count 1306
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 122 place count 301 transition count 444
Iterating global reduction 0 with 78 rules applied. Total rules applied 200 place count 301 transition count 444
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 268 place count 267 transition count 410
Applied a total of 268 rules in 153 ms. Remains 267 /401 variables (removed 134) and now considering 410/1328 (removed 918) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 267/401 places, 410/1328 transitions.
RANDOM walk for 4000000 steps (8 resets) in 23898 ms. (167 steps per ms) remains 15/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 917 ms. (435 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (8 resets) in 918 ms. (435 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 911 ms. (438 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400000 steps (8 resets) in 916 ms. (436 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 901 ms. (443 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 912 ms. (438 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 919 ms. (434 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (8 resets) in 938 ms. (425 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 903 ms. (442 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400000 steps (8 resets) in 943 ms. (423 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400000 steps (8 resets) in 915 ms. (436 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (8 resets) in 938 ms. (425 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400001 steps (8 resets) in 922 ms. (433 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 909 ms. (439 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400002 steps (8 resets) in 911 ms. (438 steps per ms) remains 15/15 properties
// Phase 1: matrix 410 rows 267 cols
[2024-05-21 03:59:22] [INFO ] Computed 19 invariants in 8 ms
[2024-05-21 03:59:22] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 234/249 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 9/258 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/267 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 410/677 variables, 267/286 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 56/342 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/677 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 677/677 variables, and 342 constraints, problems are : Problem set: 0 solved, 15 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 267/267 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 234/249 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 211 places in 160 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-21 03:59:23] [INFO ] Deduced a trap composed of 215 places in 340 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 9/258 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 9/267 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 410/677 variables, 267/288 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 56/344 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/677 variables, 15/359 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/677 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/677 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 677/677 variables, and 359 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3242 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 267/267 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 4265ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 5 properties in 1685 ms.
Support contains 10 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 410/410 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 243 transition count 386
Applied a total of 48 rules in 43 ms. Remains 243 /267 variables (removed 24) and now considering 386/410 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 243/267 places, 386/410 transitions.
RANDOM walk for 4000000 steps (8 resets) in 15072 ms. (265 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 7085 ms. (564 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 7109 ms. (562 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6730 ms. (594 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6797 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6859 ms. (583 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6777 ms. (590 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 6954 ms. (575 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6769 ms. (590 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6712 ms. (595 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 6731 ms. (594 steps per ms) remains 9/9 properties
// Phase 1: matrix 386 rows 243 cols
[2024-05-21 03:59:50] [INFO ] Computed 19 invariants in 9 ms
[2024-05-21 03:59:50] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 215/224 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/234 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 386/629 variables, 243/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 56/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/629 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 629/629 variables, and 318 constraints, problems are : Problem set: 0 solved, 9 unsolved in 645 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 215/224 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 10/234 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 386/629 variables, 243/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/629 variables, 56/318 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/629 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/629 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/629 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 629/629 variables, and 327 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1329 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 243/243 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1995ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 1758 ms.
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 386/386 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 385
Applied a total of 2 rules in 27 ms. Remains 242 /243 variables (removed 1) and now considering 385/386 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 242/243 places, 385/386 transitions.
RANDOM walk for 4000000 steps (8 resets) in 13883 ms. (288 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 6748 ms. (592 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6743 ms. (593 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 6530 ms. (612 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 6408 ms. (624 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (8 resets) in 6442 ms. (620 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6431 ms. (621 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 6403 ms. (624 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 7156 ms. (558 steps per ms) remains 8/8 properties
// Phase 1: matrix 385 rows 242 cols
[2024-05-21 04:00:13] [INFO ] Computed 19 invariants in 4 ms
[2024-05-21 04:00:13] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 215/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/233 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/242 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 385/627 variables, 242/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/627 variables, 56/317 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/627 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/627 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 627/627 variables, and 317 constraints, problems are : Problem set: 0 solved, 8 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 242/242 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 215/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 04:00:14] [INFO ] Deduced a trap composed of 209 places in 191 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 04:00:14] [INFO ] Deduced a trap composed of 209 places in 185 ms of which 2 ms to minimize.
[2024-05-21 04:00:14] [INFO ] Deduced a trap composed of 208 places in 237 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 10/233 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 04:00:15] [INFO ] Deduced a trap composed of 193 places in 262 ms of which 4 ms to minimize.
[2024-05-21 04:00:15] [INFO ] Deduced a trap composed of 201 places in 256 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 9/242 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 385/627 variables, 242/266 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/627 variables, 56/322 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/627 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 627/627 variables, and 330 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2746 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 242/242 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
After SMT, in 3306ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 2 properties in 878 ms.
Support contains 6 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 385/385 transitions.
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 6 place count 239 transition count 382
Applied a total of 6 rules in 22 ms. Remains 239 /242 variables (removed 3) and now considering 382/385 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 239/242 places, 382/385 transitions.
RANDOM walk for 4000000 steps (8 resets) in 12559 ms. (318 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 5293 ms. (755 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000000 steps (8 resets) in 5280 ms. (757 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000000 steps (8 resets) in 5291 ms. (755 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 5275 ms. (758 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 5287 ms. (756 steps per ms) remains 5/5 properties
// Phase 1: matrix 382 rows 239 cols
[2024-05-21 04:00:28] [INFO ] Computed 19 invariants in 7 ms
[2024-05-21 04:00:28] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 214/219 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/230 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 9/239 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 382/621 variables, 239/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 56/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/621 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 621/621 variables, and 314 constraints, problems are : Problem set: 0 solved, 5 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 239/239 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 214/219 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/230 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 9/239 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 382/621 variables, 239/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 56/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/621 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/621 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/621 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 621/621 variables, and 319 constraints, problems are : Problem set: 0 solved, 5 unsolved in 918 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 239/239 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1362ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 2 properties in 439 ms.
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 382/382 transitions.
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 6 place count 236 transition count 379
Applied a total of 6 rules in 30 ms. Remains 236 /239 variables (removed 3) and now considering 379/382 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 236/239 places, 379/382 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10472 ms. (381 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 4678 ms. (854 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 4631 ms. (863 steps per ms) remains 2/3 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 4359 ms. (917 steps per ms) remains 2/2 properties
// Phase 1: matrix 379 rows 236 cols
[2024-05-21 04:00:36] [INFO ] Computed 19 invariants in 3 ms
[2024-05-21 04:00:36] [INFO ] State equation strengthened by 56 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 211/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/227 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/236 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 379/615 variables, 236/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/615 variables, 56/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/615 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 615/615 variables, and 311 constraints, problems are : Problem set: 0 solved, 2 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 236/236 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 211/213 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/227 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 9/236 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 04:00:37] [INFO ] Deduced a trap composed of 90 places in 274 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 379/615 variables, 236/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/615 variables, 56/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/615 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/615 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 615/615 variables, and 314 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 236/236 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1427ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 159 ms.
Support contains 2 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 379/379 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 235 transition count 378
Applied a total of 2 rules in 29 ms. Remains 235 /236 variables (removed 1) and now considering 378/379 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 235/236 places, 378/379 transitions.
RANDOM walk for 4000000 steps (8 resets) in 10125 ms. (395 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 4525 ms. (883 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 4354 ms. (918 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 37103 steps, run visited all 2 properties in 182 ms. (steps per millisecond=203 )
Probabilistic random walk after 37103 steps, saw 22960 distinct states, run finished after 191 ms. (steps per millisecond=194 ) properties seen :2
Able to resolve query StableMarking after proving 401 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 104690 ms.
ITS solved all properties within timeout

BK_STOP 1716264043426

--------------------
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="Anderson-PT-08"
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 Anderson-PT-08, 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-171620124100218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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