Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r196-tall-174889278500113.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is ResAllocation-PT-R050C002, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889278500113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 212K May 29 14:32 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 1748954412044

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ResAllocation-PT-R050C002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 12:40:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-03 12:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:40:13] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-03 12:40:13] [INFO ] Transformed 200 places.
[2025-06-03 12:40:13] [INFO ] Transformed 102 transitions.
[2025-06-03 12:40:13] [INFO ] Found NUPN structural information;
[2025-06-03 12:40:13] [INFO ] Parsed PT model containing 200 places and 102 transitions and 500 arcs in 190 ms.
Structural test allowed to assert that 2 places are NOT stable. Took 7 ms.
RANDOM walk for 40000 steps (59 resets) in 2425 ms. (16 steps per ms) remains 47/198 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 47/47 properties
// Phase 1: matrix 102 rows 200 cols
[2025-06-03 12:40:14] [INFO ] Computed 100 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 64/111 variables, 32/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 17/128 variables, 17/175 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 68/196 variables, 128/320 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 12/208 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (OVERLAPS) 12/220 variables, 8/348 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/220 variables, 8/356 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/220 variables, 4/360 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/220 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 19 (OVERLAPS) 12/232 variables, 8/368 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/232 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/232 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/232 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 23 (OVERLAPS) 12/244 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/244 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/244 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/244 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 27 (OVERLAPS) 12/256 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/256 variables, 8/416 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/256 variables, 4/420 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/256 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 31 (OVERLAPS) 12/268 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/268 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/268 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/268 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 35 (OVERLAPS) 12/280 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/280 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/280 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/280 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 39 (OVERLAPS) 12/292 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/292 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/292 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/292 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 43 (OVERLAPS) 10/302 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/302 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/302 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/302 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 47 (OVERLAPS) 0/302 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 500 constraints, problems are : Problem set: 0 solved, 47 unsolved in 4032 ms.
Refiners :[Domain max(s): 200/200 constraints, Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 64/111 variables, 32/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 64/158 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 17/128 variables, 17/175 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 68/196 variables, 128/320 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 44/364 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 12:40:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 18 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 12/208 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/208 variables, 3/388 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2025-06-03 12:40:21] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-06-03 12:40:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/208 variables, 2/390 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/208 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 19 (OVERLAPS) 12/220 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/220 variables, 8/406 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/220 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/220 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 23 (OVERLAPS) 12/232 variables, 8/418 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/232 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/232 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 232/302 variables, and 430 constraints, problems are : Problem set: 0 solved, 47 unsolved in 5013 ms.
Refiners :[Domain max(s): 152/200 constraints, Positive P Invariants (semi-flows): 76/100 constraints, State Equation: 152/200 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints]
After SMT, in 9103ms problems are : Problem set: 0 solved, 47 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 102/102 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 200 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 199 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 199 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 197 transition count 100
Applied a total of 5 rules in 47 ms. Remains 197 /200 variables (removed 3) and now considering 100/102 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 197/200 places, 100/102 transitions.
RANDOM walk for 4000000 steps (6523 resets) in 26254 ms. (152 steps per ms) remains 39/47 properties
BEST_FIRST walk for 400004 steps (65 resets) in 1060 ms. (377 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 796 ms. (501 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (65 resets) in 692 ms. (577 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 673 ms. (593 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 675 ms. (591 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (65 resets) in 679 ms. (588 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 673 ms. (593 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 674 ms. (592 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (64 resets) in 682 ms. (585 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 669 ms. (597 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 677 ms. (589 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (65 resets) in 690 ms. (578 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 689 ms. (579 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 684 ms. (583 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 677 ms. (589 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 734 ms. (544 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 691 ms. (578 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (64 resets) in 680 ms. (587 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 668 ms. (597 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 680 ms. (587 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 672 ms. (594 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 666 ms. (599 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 674 ms. (592 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400002 steps (64 resets) in 663 ms. (602 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 664 ms. (601 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 672 ms. (594 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (64 resets) in 682 ms. (585 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400003 steps (64 resets) in 675 ms. (591 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 667 ms. (598 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 670 ms. (596 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 672 ms. (594 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (65 resets) in 675 ms. (591 steps per ms) remains 39/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 668 ms. (597 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400004 steps (64 resets) in 673 ms. (593 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (65 resets) in 674 ms. (592 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 668 ms. (597 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 677 ms. (589 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 678 ms. (589 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (64 resets) in 672 ms. (594 steps per ms) remains 37/38 properties
// Phase 1: matrix 100 rows 197 cols
[2025-06-03 12:40:38] [INFO ] Computed 99 invariants in 3 ms
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, 13/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 46/83 variables, 24/74 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 46/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 10/93 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 50/143 variables, 93/233 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 12/155 variables, 8/241 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/155 variables, 8/249 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/155 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (OVERLAPS) 12/167 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/167 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (OVERLAPS) 12/179 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/179 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/179 variables, 4/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/179 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (OVERLAPS) 12/191 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/191 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/191 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/191 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (OVERLAPS) 12/203 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/203 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/203 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/203 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (OVERLAPS) 12/215 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/215 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/215 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/215 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (OVERLAPS) 12/227 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/227 variables, 8/369 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/227 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/227 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (OVERLAPS) 12/239 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/239 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/239 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/239 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 43 (OVERLAPS) 12/251 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/251 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/251 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/251 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (OVERLAPS) 12/263 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/263 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/263 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/263 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (OVERLAPS) 12/275 variables, 8/441 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/275 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/275 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/275 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (OVERLAPS) 12/287 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/287 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/287 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/287 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 59 (OVERLAPS) 10/297 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/297 variables, 8/489 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/297 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/297 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 63 (OVERLAPS) 0/297 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 493 constraints, problems are : Problem set: 0 solved, 37 unsolved in 3152 ms.
Refiners :[Domain max(s): 197/197 constraints, Positive P Invariants (semi-flows): 99/99 constraints, State Equation: 197/197 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, 13/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 46/83 variables, 24/74 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 46/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (OVERLAPS) 10/93 variables, 10/130 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 50/143 variables, 93/233 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 34/267 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2025-06-03 12:40:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2025-06-03 12:40:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2025-06-03 12:40:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/143 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 12/155 variables, 8/278 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/155 variables, 8/286 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 18 (OVERLAPS) 12/167 variables, 8/301 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 8/309 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/167 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 22 (OVERLAPS) 12/179 variables, 8/321 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/179 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/179 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/179 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 26 (OVERLAPS) 12/191 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/191 variables, 8/349 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/191 variables, 4/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/191 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 30 (OVERLAPS) 12/203 variables, 8/361 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/203 variables, 8/369 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/203 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/203 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 34 (OVERLAPS) 12/215 variables, 8/381 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/215 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/215 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/215 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 38 (OVERLAPS) 12/227 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/227 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/227 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/227 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 42 (OVERLAPS) 12/239 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/239 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/239 variables, 4/433 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/239 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 46 (OVERLAPS) 12/251 variables, 8/441 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/251 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/251 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/251 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 50 (OVERLAPS) 12/263 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/263 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/263 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/263 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 54 (OVERLAPS) 12/275 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/275 variables, 8/489 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/275 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/275 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 58 (OVERLAPS) 12/287 variables, 8/501 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/287 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/287 variables, 4/513 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/287 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 62 (OVERLAPS) 10/297 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/297 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/297 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/297 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 66 (OVERLAPS) 0/297 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 533 constraints, problems are : Problem set: 0 solved, 37 unsolved in 12293 ms.
Refiners :[Domain max(s): 197/197 constraints, Positive P Invariants (semi-flows): 99/99 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 3/3 constraints]
After SMT, in 15466ms problems are : Problem set: 0 solved, 37 unsolved
Fused 37 Parikh solutions to 23 different solutions.
Finished Parikh walk after 40878 steps, including 109 resets, run visited all 11 properties in 637 ms. (steps per millisecond=64 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 37 properties in 753 ms.
Able to resolve query StableMarking after proving 199 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 41265 ms.
ITS solved all properties within timeout

BK_STOP 1748954454666

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ResAllocation-PT-R050C002"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is ResAllocation-PT-R050C002, 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 r196-tall-174889278500113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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