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.r098-smll-174860112200153.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 FireWire-PT-01, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112200153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K 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.6K 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 84K 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 1748677699579

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 07:48:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 07:48:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 07:48:22] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2025-05-31 07:48:22] [INFO ] Transformed 107 places.
[2025-05-31 07:48:22] [INFO ] Transformed 346 transitions.
[2025-05-31 07:48:22] [INFO ] Found NUPN structural information;
[2025-05-31 07:48:22] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 504 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 18 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2191 resets) in 3871 ms. (10 steps per ms) remains 38/97 properties
BEST_FIRST walk for 4004 steps (64 resets) in 51 ms. (77 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (69 resets) in 68 ms. (58 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (64 resets) in 47 ms. (83 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (63 resets) in 68 ms. (58 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (47 resets) in 54 ms. (72 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (70 resets) in 43 ms. (90 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (68 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (52 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (51 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (62 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (52 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (45 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (55 resets) in 55 ms. (71 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (55 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (72 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (64 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (59 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (62 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (50 resets) in 31 ms. (125 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (65 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (64 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (49 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (44 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (57 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (56 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (76 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (49 resets) in 15 ms. (250 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (62 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (51 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (58 resets) in 34 ms. (114 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (51 resets) in 18 ms. (210 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (60 resets) in 11 ms. (333 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (54 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (58 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (71 resets) in 16 ms. (235 steps per ms) remains 38/38 properties
[2025-05-31 07:48:24] [INFO ] Flow matrix only has 261 transitions (discarded 32 similar events)
// Phase 1: matrix 261 rows 107 cols
[2025-05-31 07:48:24] [INFO ] Computed 8 invariants in 17 ms
[2025-05-31 07:48:24] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 60/98 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 60/103 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 8/106 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 260/366 variables, 106/220 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 39/259 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 1/367 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/367 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (OVERLAPS) 1/368 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/368 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (OVERLAPS) 0/368 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 368/368 variables, and 262 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3790 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 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, 38/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 60/98 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 60/103 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-05-31 07:48:29] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 51 ms to minimize.
[2025-05-31 07:48:29] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-05-31 07:48:29] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 8/106 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 260/366 variables, 106/223 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 39/262 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/366 variables, 38/300 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2025-05-31 07:48:31] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/366 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/366 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (OVERLAPS) 1/367 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/367 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (OVERLAPS) 1/368 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 304 constraints, problems are : Problem set: 0 solved, 38 unsolved in 5022 ms.
Refiners :[Domain max(s): 107/107 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 4/4 constraints]
After SMT, in 8943ms problems are : Problem set: 0 solved, 38 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 293/293 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 107 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 106 transition count 288
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 105 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 103 transition count 292
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 103 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 23 place count 103 transition count 280
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 27 place count 102 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 102 transition count 278
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 102 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 101 transition count 277
Applied a total of 32 rules in 226 ms. Remains 101 /107 variables (removed 6) and now considering 277/293 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 101/107 places, 277/293 transitions.
RANDOM walk for 4000000 steps (256158 resets) in 24286 ms. (164 steps per ms) remains 12/38 properties
BEST_FIRST walk for 4000003 steps (64277 resets) in 3845 ms. (1040 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (65134 resets) in 3905 ms. (1024 steps per ms) remains 9/12 properties
BEST_FIRST walk for 4000004 steps (64520 resets) in 3388 ms. (1180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (65018 resets) in 3385 ms. (1181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (64826 resets) in 3720 ms. (1074 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (63968 resets) in 3964 ms. (1008 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (65206 resets) in 4350 ms. (919 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (64419 resets) in 3681 ms. (1086 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (65280 resets) in 3624 ms. (1103 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (64853 resets) in 3660 ms. (1092 steps per ms) remains 9/9 properties
[2025-05-31 07:48:52] [INFO ] Flow matrix only has 250 transitions (discarded 27 similar events)
// Phase 1: matrix 250 rows 101 cols
[2025-05-31 07:48:52] [INFO ] Computed 8 invariants in 4 ms
[2025-05-31 07:48:52] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 51/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 176/236 variables, 60/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 67/303 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 17/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 28/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 1/304 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 44/348 variables, 21/211 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 21/232 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 12/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 3/351 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/351 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/351 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/351 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 0/351 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 250 constraints, problems are : Problem set: 0 solved, 9 unsolved in 922 ms.
Refiners :[Domain max(s): 101/101 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 51/60 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 176/236 variables, 60/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 67/303 variables, 17/139 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 17/156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 28/187 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 9/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/304 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/304 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/304 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 44/348 variables, 21/220 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 21/241 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/348 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/348 variables, 12/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 3/351 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/351 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/351 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/351 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 0/351 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 259 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1318 ms.
Refiners :[Domain max(s): 101/101 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2272ms problems are : Problem set: 0 solved, 9 unsolved
Finished Parikh walk after 11937 steps, including 835 resets, run visited all 3 properties in 158 ms. (steps per millisecond=75 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 1665 ms.
Able to resolve query StableMarking after proving 98 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 34326 ms.
ITS solved all properties within timeout

BK_STOP 1748677736546

--------------------
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="FireWire-PT-01"
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 FireWire-PT-01, 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 r098-smll-174860112200153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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