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.r112-smll-174867016600418.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 HealthRecord-PT-17, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-smll-174867016600418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 175K 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 1748772158059

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 10:02:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 10:02:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:02:41] [INFO ] Load time of PNML (sax parser for PT used): 339 ms
[2025-06-01 10:02:41] [INFO ] Transformed 624 places.
[2025-06-01 10:02:41] [INFO ] Transformed 828 transitions.
[2025-06-01 10:02:41] [INFO ] Found NUPN structural information;
[2025-06-01 10:02:41] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 589 ms.
Graph (trivial) has 749 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 13 ms
Free SCC test removed 66 places
Structural test allowed to assert that 266 places are NOT stable. Took 67 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
RANDOM walk for 40000 steps (366 resets) in 4573 ms. (8 steps per ms) remains 310/358 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 30 ms. (12 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 20 ms. (19 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 401 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 310/310 properties
[2025-06-01 10:02:43] [INFO ] Flow matrix only has 733 transitions (discarded 20 similar events)
// Phase 1: matrix 733 rows 558 cols
[2025-06-01 10:02:43] [INFO ] Computed 18 invariants in 37 ms
[2025-06-01 10:02:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 310/1291 variables, and 310 constraints, problems are : Problem set: 0 solved, 310 unsolved in 5141 ms.
Refiners :[Domain max(s): 310/558 constraints, Positive P Invariants (semi-flows): 0/10 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/558 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 310/310 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/310 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (OVERLAPS) 48/358 variables, 10/320 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 48/368 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2025-06-01 10:02:53] [INFO ] Deduced a trap composed of 96 places in 307 ms of which 45 ms to minimize.
[2025-06-01 10:02:53] [INFO ] Deduced a trap composed of 91 places in 229 ms of which 5 ms to minimize.
[2025-06-01 10:02:53] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 4 ms to minimize.
[2025-06-01 10:02:53] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
SMT process timed out in 10526ms, After SMT, problems are : Problem set: 0 solved, 310 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 310 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 753/753 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 558 transition count 591
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 158 rules applied. Total rules applied 320 place count 417 transition count 574
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 329 place count 408 transition count 574
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 329 place count 408 transition count 564
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 349 place count 398 transition count 564
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 385 place count 380 transition count 546
Performed 7 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 399 place count 373 transition count 592
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 406 place count 373 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 426 place count 373 transition count 565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 428 place count 372 transition count 575
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 453 place count 372 transition count 550
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 478 place count 347 transition count 550
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 487 place count 347 transition count 550
Applied a total of 487 rules in 263 ms. Remains 347 /558 variables (removed 211) and now considering 550/753 (removed 203) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 347/558 places, 550/753 transitions.
RANDOM walk for 4000000 steps (438989 resets) in 57982 ms. (68 steps per ms) remains 138/310 properties
BEST_FIRST walk for 40004 steps (597 resets) in 270 ms. (147 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (595 resets) in 82 ms. (481 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (603 resets) in 85 ms. (465 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (591 resets) in 85 ms. (465 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (594 resets) in 84 ms. (470 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (594 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (580 resets) in 85 ms. (465 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (595 resets) in 84 ms. (470 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (598 resets) in 82 ms. (481 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (596 resets) in 83 ms. (476 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (601 resets) in 86 ms. (459 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (583 resets) in 90 ms. (439 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (595 resets) in 84 ms. (470 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (598 resets) in 84 ms. (470 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (577 resets) in 98 ms. (404 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (580 resets) in 127 ms. (312 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (597 resets) in 127 ms. (312 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (603 resets) in 133 ms. (298 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (588 resets) in 125 ms. (317 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (579 resets) in 125 ms. (317 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (592 resets) in 127 ms. (312 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (591 resets) in 125 ms. (317 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (583 resets) in 124 ms. (320 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (598 resets) in 133 ms. (298 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (599 resets) in 126 ms. (314 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (592 resets) in 126 ms. (314 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (588 resets) in 127 ms. (312 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (591 resets) in 125 ms. (317 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (594 resets) in 126 ms. (314 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (602 resets) in 131 ms. (303 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (593 resets) in 105 ms. (377 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (592 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (584 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (578 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (606 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (596 resets) in 102 ms. (388 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (590 resets) in 99 ms. (400 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (576 resets) in 103 ms. (384 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (598 resets) in 104 ms. (380 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (588 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (598 resets) in 100 ms. (396 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (598 resets) in 106 ms. (373 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (593 resets) in 101 ms. (392 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (594 resets) in 88 ms. (449 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (581 resets) in 83 ms. (476 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (588 resets) in 82 ms. (481 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (587 resets) in 89 ms. (444 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (600 resets) in 84 ms. (470 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (593 resets) in 83 ms. (476 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (605 resets) in 84 ms. (470 steps per ms) remains 138/138 properties
// Phase 1: matrix 550 rows 347 cols
[2025-06-01 10:03:11] [INFO ] Computed 18 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 102/240 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 102/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 107/347 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 107/365 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 550/897 variables, 347/712 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/897 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/897 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 897/897 variables, and 712 constraints, problems are : Problem set: 0 solved, 138 unsolved in 16219 ms.
Refiners :[Domain max(s): 347/347 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 347/347 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 138/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 102/240 variables, 10/148 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 102/250 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:28] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 3 ms to minimize.
[2025-06-01 10:03:28] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 66 places in 89 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2025-06-01 10:03:29] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2025-06-01 10:03:30] [INFO ] Deduced a trap composed of 69 places in 155 ms of which 3 ms to minimize.
[2025-06-01 10:03:30] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2025-06-01 10:03:30] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 3 ms to minimize.
[2025-06-01 10:03:30] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 3 ms to minimize.
[2025-06-01 10:03:30] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 3 ms to minimize.
[2025-06-01 10:03:30] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 4 ms to minimize.
[2025-06-01 10:03:31] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2025-06-01 10:03:31] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2025-06-01 10:03:31] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 2 ms to minimize.
[2025-06-01 10:03:31] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 19/269 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:31] [INFO ] Deduced a trap composed of 72 places in 115 ms of which 2 ms to minimize.
[2025-06-01 10:03:31] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 3 ms to minimize.
[2025-06-01 10:03:32] [INFO ] Deduced a trap composed of 67 places in 118 ms of which 2 ms to minimize.
[2025-06-01 10:03:32] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2025-06-01 10:03:32] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 2 ms to minimize.
[2025-06-01 10:03:32] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2025-06-01 10:03:32] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 107/347 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 107/391 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:34] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 3 ms to minimize.
[2025-06-01 10:03:34] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 2 ms to minimize.
[2025-06-01 10:03:35] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2025-06-01 10:03:35] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 4 ms to minimize.
[2025-06-01 10:03:35] [INFO ] Deduced a trap composed of 57 places in 238 ms of which 5 ms to minimize.
[2025-06-01 10:03:36] [INFO ] Deduced a trap composed of 77 places in 322 ms of which 5 ms to minimize.
[2025-06-01 10:03:36] [INFO ] Deduced a trap composed of 82 places in 310 ms of which 5 ms to minimize.
[2025-06-01 10:03:36] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 6 ms to minimize.
[2025-06-01 10:03:37] [INFO ] Deduced a trap composed of 57 places in 270 ms of which 5 ms to minimize.
[2025-06-01 10:03:37] [INFO ] Deduced a trap composed of 57 places in 321 ms of which 6 ms to minimize.
[2025-06-01 10:03:37] [INFO ] Deduced a trap composed of 78 places in 260 ms of which 5 ms to minimize.
[2025-06-01 10:03:38] [INFO ] Deduced a trap composed of 90 places in 310 ms of which 5 ms to minimize.
[2025-06-01 10:03:38] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 5 ms to minimize.
[2025-06-01 10:03:38] [INFO ] Deduced a trap composed of 88 places in 262 ms of which 4 ms to minimize.
[2025-06-01 10:03:39] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 4 ms to minimize.
[2025-06-01 10:03:39] [INFO ] Deduced a trap composed of 82 places in 275 ms of which 4 ms to minimize.
[2025-06-01 10:03:39] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 5 ms to minimize.
[2025-06-01 10:03:39] [INFO ] Deduced a trap composed of 77 places in 250 ms of which 5 ms to minimize.
[2025-06-01 10:03:40] [INFO ] Deduced a trap composed of 75 places in 267 ms of which 4 ms to minimize.
[2025-06-01 10:03:40] [INFO ] Deduced a trap composed of 79 places in 250 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:41] [INFO ] Deduced a trap composed of 90 places in 317 ms of which 6 ms to minimize.
[2025-06-01 10:03:41] [INFO ] Deduced a trap composed of 78 places in 343 ms of which 7 ms to minimize.
[2025-06-01 10:03:41] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 6 ms to minimize.
[2025-06-01 10:03:42] [INFO ] Deduced a trap composed of 88 places in 327 ms of which 5 ms to minimize.
[2025-06-01 10:03:42] [INFO ] Deduced a trap composed of 57 places in 283 ms of which 5 ms to minimize.
[2025-06-01 10:03:42] [INFO ] Deduced a trap composed of 73 places in 280 ms of which 5 ms to minimize.
[2025-06-01 10:03:43] [INFO ] Deduced a trap composed of 86 places in 299 ms of which 7 ms to minimize.
[2025-06-01 10:03:43] [INFO ] Deduced a trap composed of 58 places in 257 ms of which 5 ms to minimize.
[2025-06-01 10:03:43] [INFO ] Deduced a trap composed of 56 places in 249 ms of which 4 ms to minimize.
[2025-06-01 10:03:43] [INFO ] Deduced a trap composed of 87 places in 207 ms of which 3 ms to minimize.
[2025-06-01 10:03:43] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2025-06-01 10:03:44] [INFO ] Deduced a trap composed of 56 places in 97 ms of which 3 ms to minimize.
[2025-06-01 10:03:44] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 3 ms to minimize.
[2025-06-01 10:03:44] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 3 ms to minimize.
[2025-06-01 10:03:44] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 4 ms to minimize.
[2025-06-01 10:03:44] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 4 ms to minimize.
[2025-06-01 10:03:45] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 3 ms to minimize.
[2025-06-01 10:03:45] [INFO ] Deduced a trap composed of 80 places in 179 ms of which 3 ms to minimize.
[2025-06-01 10:03:45] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 3 ms to minimize.
[2025-06-01 10:03:45] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:46] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 3 ms to minimize.
[2025-06-01 10:03:46] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 3 ms to minimize.
[2025-06-01 10:03:46] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 3 ms to minimize.
[2025-06-01 10:03:46] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2025-06-01 10:03:46] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2025-06-01 10:03:47] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2025-06-01 10:03:47] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2025-06-01 10:03:47] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 4 ms to minimize.
[2025-06-01 10:03:47] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 3 ms to minimize.
[2025-06-01 10:03:47] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2025-06-01 10:03:48] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 3 ms to minimize.
[2025-06-01 10:03:48] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 3 ms to minimize.
[2025-06-01 10:03:48] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2025-06-01 10:03:48] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 3 ms to minimize.
[2025-06-01 10:03:48] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 3 ms to minimize.
[2025-06-01 10:03:48] [INFO ] Deduced a trap composed of 86 places in 147 ms of which 3 ms to minimize.
[2025-06-01 10:03:49] [INFO ] Deduced a trap composed of 80 places in 121 ms of which 2 ms to minimize.
[2025-06-01 10:03:49] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2025-06-01 10:03:49] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2025-06-01 10:03:49] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:49] [INFO ] Deduced a trap composed of 56 places in 84 ms of which 2 ms to minimize.
[2025-06-01 10:03:50] [INFO ] Deduced a trap composed of 75 places in 155 ms of which 3 ms to minimize.
[2025-06-01 10:03:50] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 2 ms to minimize.
[2025-06-01 10:03:50] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
[2025-06-01 10:03:50] [INFO ] Deduced a trap composed of 76 places in 179 ms of which 4 ms to minimize.
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 3 ms to minimize.
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2025-06-01 10:03:51] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 3 ms to minimize.
[2025-06-01 10:03:52] [INFO ] Deduced a trap composed of 77 places in 212 ms of which 4 ms to minimize.
[2025-06-01 10:03:52] [INFO ] Deduced a trap composed of 77 places in 289 ms of which 5 ms to minimize.
[2025-06-01 10:03:52] [INFO ] Deduced a trap composed of 90 places in 256 ms of which 4 ms to minimize.
[2025-06-01 10:03:52] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 4 ms to minimize.
[2025-06-01 10:03:53] [INFO ] Deduced a trap composed of 77 places in 234 ms of which 4 ms to minimize.
[2025-06-01 10:03:53] [INFO ] Deduced a trap composed of 77 places in 267 ms of which 5 ms to minimize.
[2025-06-01 10:03:53] [INFO ] Deduced a trap composed of 79 places in 271 ms of which 5 ms to minimize.
[2025-06-01 10:03:54] [INFO ] Deduced a trap composed of 87 places in 267 ms of which 4 ms to minimize.
[2025-06-01 10:03:54] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 4 ms to minimize.
[2025-06-01 10:03:54] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 4 ms to minimize.
[2025-06-01 10:03:55] [INFO ] Deduced a trap composed of 84 places in 257 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:03:55] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2025-06-01 10:03:56] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 3 ms to minimize.
[2025-06-01 10:03:56] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 3 ms to minimize.
[2025-06-01 10:03:56] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2025-06-01 10:03:57] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2025-06-01 10:03:57] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
[2025-06-01 10:03:57] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 4 ms to minimize.
[2025-06-01 10:03:57] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2025-06-01 10:03:58] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2025-06-01 10:03:58] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 2 ms to minimize.
[2025-06-01 10:03:58] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2025-06-01 10:03:58] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
[2025-06-01 10:03:58] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 3 ms to minimize.
[2025-06-01 10:03:58] [INFO ] Deduced a trap composed of 77 places in 117 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/347 variables, 14/485 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:04:00] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:04:01] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 2 ms to minimize.
[2025-06-01 10:04:02] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2025-06-01 10:04:02] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2025-06-01 10:04:02] [INFO ] Deduced a trap composed of 57 places in 75 ms of which 2 ms to minimize.
[2025-06-01 10:04:02] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2025-06-01 10:04:02] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 2 ms to minimize.
[2025-06-01 10:04:03] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 7/493 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:04:04] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2025-06-01 10:04:05] [INFO ] Deduced a trap composed of 93 places in 191 ms of which 3 ms to minimize.
[2025-06-01 10:04:05] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 3 ms to minimize.
[2025-06-01 10:04:05] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2025-06-01 10:04:05] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 3 ms to minimize.
[2025-06-01 10:04:05] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 3 ms to minimize.
[2025-06-01 10:04:06] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2025-06-01 10:04:06] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 3 ms to minimize.
[2025-06-01 10:04:06] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 9/502 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2025-06-01 10:04:07] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 4 ms to minimize.
[2025-06-01 10:04:08] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 3 ms to minimize.
[2025-06-01 10:04:08] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2025-06-01 10:04:08] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
[2025-06-01 10:04:09] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 3 ms to minimize.
[2025-06-01 10:04:09] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 3 ms to minimize.
[2025-06-01 10:04:09] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 3 ms to minimize.
[2025-06-01 10:04:09] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2025-06-01 10:04:10] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2025-06-01 10:04:10] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 10/512 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/897 variables, and 512 constraints, problems are : Problem set: 0 solved, 138 unsolved in 45011 ms.
Refiners :[Domain max(s): 347/347 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/347 constraints, PredecessorRefiner: 0/138 constraints, Known Traps: 147/147 constraints]
After SMT, in 61273ms problems are : Problem set: 0 solved, 138 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 138 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 550/550 transitions.
Graph (complete) has 1004 edges and 347 vertex of which 338 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 338 transition count 485
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 76 rules applied. Total rules applied 142 place count 273 transition count 474
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 147 place count 268 transition count 474
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 147 place count 268 transition count 470
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 155 place count 264 transition count 470
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 202 place count 217 transition count 360
Iterating global reduction 3 with 47 rules applied. Total rules applied 249 place count 217 transition count 360
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 254 place count 212 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 259 place count 212 transition count 350
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 268 place count 212 transition count 341
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 292 place count 200 transition count 329
Performed 11 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 314 place count 189 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 315 place count 189 transition count 378
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 317 place count 189 transition count 376
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 189 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 321 place count 187 transition count 374
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 331 place count 187 transition count 374
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 339 place count 187 transition count 374
Applied a total of 339 rules in 116 ms. Remains 187 /347 variables (removed 160) and now considering 374/550 (removed 176) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 187/347 places, 374/550 transitions.
RANDOM walk for 4000000 steps (425456 resets) in 45571 ms. (87 steps per ms) remains 15/138 properties
BEST_FIRST walk for 400003 steps (4596 resets) in 399 ms. (1000 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4545 resets) in 518 ms. (770 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4602 resets) in 488 ms. (818 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (4591 resets) in 364 ms. (1095 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4611 resets) in 361 ms. (1104 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4586 resets) in 357 ms. (1117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4597 resets) in 363 ms. (1098 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (4618 resets) in 363 ms. (1098 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4617 resets) in 361 ms. (1104 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (4604 resets) in 362 ms. (1101 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (4641 resets) in 356 ms. (1120 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4588 resets) in 358 ms. (1114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (4642 resets) in 362 ms. (1101 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4601 resets) in 361 ms. (1104 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (4631 resets) in 358 ms. (1114 steps per ms) remains 15/15 properties
[2025-06-01 10:04:26] [INFO ] Flow matrix only has 351 transitions (discarded 23 similar events)
// Phase 1: matrix 351 rows 187 cols
[2025-06-01 10:04:26] [INFO ] Computed 9 invariants in 3 ms
[2025-06-01 10:04:26] [INFO ] State equation strengthened by 7 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) 15/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 157/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 351/538 variables, 187/196 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/538 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 538/538 variables, and 203 constraints, problems are : Problem set: 0 solved, 15 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 7/7 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) 15/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 157/187 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-06-01 10:04:27] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 3 ms to minimize.
[2025-06-01 10:04:27] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2025-06-01 10:04:27] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 3 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 37 places in 183 ms of which 3 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 2 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 3 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 2 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 2 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 2 ms to minimize.
[2025-06-01 10:04:28] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2025-06-01 10:04:29] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2025-06-01 10:04:29] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2025-06-01 10:04:29] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2025-06-01 10:04:29] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2025-06-01 10:04:29] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 3 ms to minimize.
[2025-06-01 10:04:29] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 3 ms to minimize.
[2025-06-01 10:04:30] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2025-06-01 10:04:30] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 3 ms to minimize.
[2025-06-01 10:04:30] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2025-06-01 10:04:30] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2025-06-01 10:04:30] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 351/538 variables, 187/218 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 15/240 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/538 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 538/538 variables, and 240 constraints, problems are : Problem set: 0 solved, 15 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 187/187 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 22/22 constraints]
After SMT, in 5739ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1486 ms.
Support contains 15 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 374/374 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 187 transition count 288
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 187 place count 101 transition count 273
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 209 place count 79 transition count 229
Iterating global reduction 2 with 22 rules applied. Total rules applied 231 place count 79 transition count 229
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 233 place count 77 transition count 225
Iterating global reduction 2 with 2 rules applied. Total rules applied 235 place count 77 transition count 225
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 76 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 76 transition count 224
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 75 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 75 transition count 220
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 245 place count 75 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 251 place count 72 transition count 211
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 255 place count 70 transition count 221
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 256 place count 70 transition count 220
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 261 place count 70 transition count 220
Applied a total of 261 rules in 45 ms. Remains 70 /187 variables (removed 117) and now considering 220/374 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 70/187 places, 220/374 transitions.
RANDOM walk for 4000000 steps (423949 resets) in 22323 ms. (179 steps per ms) remains 11/15 properties
BEST_FIRST walk for 4000004 steps (46777 resets) in 3308 ms. (1208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (46895 resets) in 5199 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (46843 resets) in 6754 ms. (592 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (46796 resets) in 6238 ms. (641 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (46915 resets) in 5676 ms. (704 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (46811 resets) in 7340 ms. (544 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (46728 resets) in 7008 ms. (570 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (46912 resets) in 6545 ms. (611 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (46777 resets) in 7273 ms. (549 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (46884 resets) in 6883 ms. (581 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (46867 resets) in 6479 ms. (617 steps per ms) remains 11/11 properties
[2025-06-01 10:05:07] [INFO ] Flow matrix only has 199 transitions (discarded 21 similar events)
// Phase 1: matrix 199 rows 70 cols
[2025-06-01 10:05:07] [INFO ] Computed 9 invariants in 2 ms
[2025-06-01 10:05:07] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 49/70 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 199/269 variables, 70/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 95 constraints, problems are : Problem set: 0 solved, 11 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 10/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 49/70 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 199/269 variables, 70/79 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 16/95 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 11/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 106 constraints, problems are : Problem set: 0 solved, 11 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 70/70 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1041ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 320 ms.
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 220/220 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 70 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 66 transition count 216
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 64 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 64 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 63 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 63 transition count 209
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 62 transition count 207
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 62 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 61 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 61 transition count 203
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 61 transition count 197
Applied a total of 24 rules in 40 ms. Remains 61 /70 variables (removed 9) and now considering 197/220 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 61/70 places, 197/220 transitions.
RANDOM walk for 4000000 steps (421191 resets) in 37599 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47354 resets) in 8062 ms. (496 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47441 resets) in 6097 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47345 resets) in 5767 ms. (693 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47512 resets) in 6886 ms. (580 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (47436 resets) in 6882 ms. (581 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47378 resets) in 7050 ms. (567 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (47419 resets) in 4749 ms. (842 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47630 resets) in 6512 ms. (614 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47456 resets) in 6269 ms. (637 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (47412 resets) in 6899 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (47380 resets) in 6464 ms. (618 steps per ms) remains 11/11 properties
Finished probabilistic random walk after 4121 steps, run visited all 11 properties in 76 ms. (steps per millisecond=54 )
Probabilistic random walk after 4121 steps, saw 1512 distinct states, run finished after 83 ms. (steps per millisecond=49 ) properties seen :11
Able to resolve query StableMarking after proving 360 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 191534 ms.
ITS solved all properties within timeout

BK_STOP 1748772352407

--------------------
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="HealthRecord-PT-17"
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 HealthRecord-PT-17, 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 r112-smll-174867016600418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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