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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 73K 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 1748771982751

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-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 09:59:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 09:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 09:59:45] [INFO ] Load time of PNML (sax parser for PT used): 312 ms
[2025-06-01 09:59:45] [INFO ] Transformed 163 places.
[2025-06-01 09:59:45] [INFO ] Transformed 348 transitions.
[2025-06-01 09:59:45] [INFO ] Found NUPN structural information;
[2025-06-01 09:59:45] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 558 ms.
Graph (trivial) has 278 edges and 163 vertex of which 6 / 163 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Structural test allowed to assert that 28 places are NOT stable. Took 47 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
RANDOM walk for 40000 steps (3702 resets) in 4207 ms. (9 steps per ms) remains 69/135 properties
BEST_FIRST walk for 4004 steps (46 resets) in 37 ms. (105 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (45 resets) in 34 ms. (114 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (46 resets) in 29 ms. (133 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (46 resets) in 54 ms. (72 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (47 resets) in 40 ms. (97 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (45 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (48 resets) in 50 ms. (78 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (47 resets) in 74 ms. (53 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (46 resets) in 36 ms. (108 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (46 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (47 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (51 resets) in 12 ms. (307 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (43 resets) in 11 ms. (333 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (48 resets) in 21 ms. (181 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (45 resets) in 18 ms. (210 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 68/69 properties
BEST_FIRST walk for 4003 steps (47 resets) in 18 ms. (210 steps per ms) remains 68/68 properties
BEST_FIRST walk for 4004 steps (45 resets) in 10 ms. (364 steps per ms) remains 67/68 properties
BEST_FIRST walk for 4004 steps (48 resets) in 38 ms. (102 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (46 resets) in 29 ms. (133 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (43 resets) in 56 ms. (70 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4002 steps (46 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (44 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (43 resets) in 29 ms. (133 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (48 resets) in 33 ms. (117 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4003 steps (47 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4004 steps (47 resets) in 31 ms. (125 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (46 resets) in 25 ms. (154 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (44 resets) in 28 ms. (138 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (44 resets) in 41 ms. (95 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (44 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (45 resets) in 27 ms. (142 steps per ms) remains 62/63 properties
BEST_FIRST walk for 4004 steps (46 resets) in 13 ms. (286 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (48 resets) in 27 ms. (142 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (43 resets) in 27 ms. (143 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (49 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (45 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (47 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (44 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (47 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (45 resets) in 25 ms. (154 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 30 ms. (129 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 32 ms. (121 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (47 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (47 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (48 resets) in 16 ms. (235 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (46 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (45 resets) in 20 ms. (190 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 18 ms. (210 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4004 steps (46 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (44 resets) in 37 ms. (105 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (46 resets) in 19 ms. (200 steps per ms) remains 62/62 properties
[2025-06-01 09:59:48] [INFO ] Flow matrix only has 301 transitions (discarded 15 similar events)
// Phase 1: matrix 301 rows 160 cols
[2025-06-01 09:59:48] [INFO ] Computed 18 invariants in 22 ms
[2025-06-01 09:59:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 37/99 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 61/160 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 61/178 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 300/460 variables, 160/338 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 1/461 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 339 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5056 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 37/99 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 37/109 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 09:59:54] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 33 ms to minimize.
[2025-06-01 09:59:54] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2025-06-01 09:59:54] [INFO ] Deduced a trap composed of 40 places in 101 ms of which 3 ms to minimize.
[2025-06-01 09:59:54] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2025-06-01 09:59:54] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2025-06-01 09:59:54] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 3 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 6 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 2 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 38 places in 103 ms of which 3 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 2 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 4 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 2 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2025-06-01 09:59:55] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-01 09:59:56] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2025-06-01 09:59:56] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:59:56] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
[2025-06-01 09:59:56] [INFO ] Deduced a trap composed of 41 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 18/127 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 09:59:56] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2025-06-01 09:59:56] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 09:59:57] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2025-06-01 09:59:57] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 2 ms to minimize.
[2025-06-01 09:59:57] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2025-06-01 09:59:57] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2025-06-01 09:59:58] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 2 ms to minimize.
[2025-06-01 09:59:58] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2025-06-01 09:59:58] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
SMT process timed out in 10243ms, After SMT, problems are : Problem set: 0 solved, 62 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 316/316 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 160 transition count 300
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 63 place count 113 transition count 206
Iterating global reduction 1 with 47 rules applied. Total rules applied 110 place count 113 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 110 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 110 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 118 place count 110 transition count 198
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 132 place count 103 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 137 place count 103 transition count 226
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 103 transition count 224
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 141 place count 101 transition count 224
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 101 transition count 224
Applied a total of 142 rules in 141 ms. Remains 101 /160 variables (removed 59) and now considering 224/316 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 101/160 places, 224/316 transitions.
RANDOM walk for 4000000 steps (726869 resets) in 30849 ms. (129 steps per ms) remains 38/62 properties
BEST_FIRST walk for 400002 steps (11049 resets) in 479 ms. (833 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10975 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10939 resets) in 488 ms. (818 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10916 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11045 resets) in 483 ms. (826 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11006 resets) in 482 ms. (828 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10942 resets) in 487 ms. (819 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10973 resets) in 509 ms. (784 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10963 resets) in 478 ms. (835 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10953 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11034 resets) in 478 ms. (835 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10886 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10959 resets) in 485 ms. (823 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11019 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10865 resets) in 482 ms. (828 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11057 resets) in 494 ms. (808 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11004 resets) in 482 ms. (828 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10995 resets) in 485 ms. (823 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10996 resets) in 478 ms. (835 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11045 resets) in 481 ms. (829 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10974 resets) in 479 ms. (833 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11031 resets) in 487 ms. (819 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10992 resets) in 483 ms. (826 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10939 resets) in 481 ms. (829 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10988 resets) in 635 ms. (628 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10980 resets) in 488 ms. (818 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11010 resets) in 613 ms. (651 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11047 resets) in 717 ms. (557 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10992 resets) in 666 ms. (599 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10937 resets) in 485 ms. (823 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10942 resets) in 495 ms. (806 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10936 resets) in 480 ms. (831 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (10964 resets) in 484 ms. (824 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11029 resets) in 485 ms. (823 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (10947 resets) in 480 ms. (831 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400004 steps (11093 resets) in 513 ms. (778 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400003 steps (11016 resets) in 634 ms. (629 steps per ms) remains 38/38 properties
BEST_FIRST walk for 400002 steps (10950 resets) in 685 ms. (583 steps per ms) remains 38/38 properties
[2025-06-01 10:00:12] [INFO ] Flow matrix only has 202 transitions (discarded 22 similar events)
// Phase 1: matrix 202 rows 101 cols
[2025-06-01 10:00:12] [INFO ] Computed 18 invariants in 6 ms
[2025-06-01 10:00:12] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 40/78 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 23/101 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 202/303 variables, 101/119 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 9/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 128 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 40/78 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:14] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2025-06-01 10:00:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2025-06-01 10:00:14] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2025-06-01 10:00:14] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2025-06-01 10:00:14] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 2 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 2 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 11 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 23/101 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 3 ms to minimize.
[2025-06-01 10:00:15] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 2 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 12 ms to minimize.
[2025-06-01 10:00:16] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2025-06-01 10:00:17] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 2 ms to minimize.
[2025-06-01 10:00:18] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 2 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2025-06-01 10:00:19] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 3 ms to minimize.
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2025-06-01 10:00:20] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-06-01 10:00:21] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2025-06-01 10:00:22] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/101 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 202/303 variables, 101/203 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 9/212 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 38/250 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 250 constraints, problems are : Problem set: 0 solved, 38 unsolved in 9870 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 84/84 constraints]
After SMT, in 11566ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 25 different solutions.
Parikh walk visited 35 properties in 2302 ms.
Support contains 3 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 224/224 transitions.
Graph (complete) has 518 edges and 101 vertex of which 92 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output 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 5 place count 92 transition count 220
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 88 transition count 219
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 45 place count 53 transition count 149
Iterating global reduction 2 with 35 rules applied. Total rules applied 80 place count 53 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 47 transition count 137
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 47 transition count 137
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 96 place count 47 transition count 133
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 44 transition count 124
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 44 transition count 124
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 104 place count 42 transition count 120
Iterating global reduction 3 with 2 rules applied. Total rules applied 106 place count 42 transition count 120
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 116 place count 42 transition count 110
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 39 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 39 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 127 place count 39 transition count 116
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 39 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 132 place count 38 transition count 226
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 38 transition count 225
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 37 transition count 166
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 37 transition count 166
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 137 place count 35 transition count 161
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 35 transition count 161
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 6 with 22 rules applied. Total rules applied 161 place count 35 transition count 139
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 170 place count 35 transition count 139
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 178 place count 35 transition count 139
Applied a total of 178 rules in 87 ms. Remains 35 /101 variables (removed 66) and now considering 139/224 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 35/101 places, 139/224 transitions.
RANDOM walk for 4000000 steps (388728 resets) in 11484 ms. (348 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (62530 resets) in 2671 ms. (1497 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (62655 resets) in 2737 ms. (1460 steps per ms) remains 3/3 properties
BEST_FIRST walk for 3560456 steps (55842 resets) in 3248 ms. (1095 steps per ms) remains 0/3 properties
Able to resolve query StableMarking after proving 137 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 46680 ms.
ITS solved all properties within timeout

BK_STOP 1748772031905

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

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