Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r560-tall-171734905700123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FireWire-PT-04, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905700123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 1717351613066

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:54] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:06:54] [INFO ] Transformed 113 places.
[2024-06-02 18:06:54] [INFO ] Transformed 364 transitions.
[2024-06-02 18:06:54] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:54] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 174 ms.
Structural test allowed to assert that 10 places are NOT stable. Took 6 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2253 resets) in 2546 ms. (15 steps per ms) remains 43/103 properties
BEST_FIRST walk for 4003 steps (58 resets) in 59 ms. (66 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (60 resets) in 39 ms. (100 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (51 resets) in 28 ms. (138 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (51 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (62 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (51 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (55 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (59 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (60 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (42 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (46 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (58 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (65 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (60 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (61 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (59 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (66 resets) in 14 ms. (266 steps per ms) remains 40/43 properties
BEST_FIRST walk for 4002 steps (62 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (52 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (54 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (61 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (41 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (55 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (62 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (42 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (51 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (62 resets) in 13 ms. (285 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (70 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (59 resets) in 16 ms. (235 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (58 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (52 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (60 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (68 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (60 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (61 resets) in 32 ms. (121 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (59 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (67 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (62 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
[2024-06-02 18:06:55] [INFO ] Flow matrix only has 276 transitions (discarded 32 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 18:06:55] [INFO ] Computed 8 invariants in 18 ms
[2024-06-02 18:06:55] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 64/104 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 64/109 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 8/112 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 8/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 275/387 variables, 112/232 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 39/271 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (OVERLAPS) 1/388 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 1/389 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 16 (OVERLAPS) 0/389 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 274 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1627 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 64/104 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 64/109 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 15 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-06-02 18:06:57] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 8/112 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:06:58] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 275/387 variables, 112/240 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 39/279 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 40/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/387 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 1/388 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-06-02 18:06:59] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 18 (OVERLAPS) 1/389 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/389 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 20 (OVERLAPS) 0/389 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 389/389 variables, and 323 constraints, problems are : Problem set: 0 solved, 40 unsolved in 4103 ms.
Refiners :[Domain max(s): 113/113 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 113/113 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 9/9 constraints]
After SMT, in 5816ms problems are : Problem set: 0 solved, 40 unsolved
Fused 40 Parikh solutions to 39 different solutions.
Parikh walk visited 1 properties in 2849 ms.
Support contains 39 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 308/308 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 113 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 112 transition count 304
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 112 transition count 303
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 111 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 109 transition count 307
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 109 transition count 303
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 109 transition count 295
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 109 transition count 297
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 108 transition count 295
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 108 transition count 293
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 108 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 107 transition count 292
Applied a total of 32 rules in 86 ms. Remains 107 /113 variables (removed 6) and now considering 292/308 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 107/113 places, 292/308 transitions.
RANDOM walk for 4000000 steps (256674 resets) in 19562 ms. (204 steps per ms) remains 12/39 properties
BEST_FIRST walk for 4000002 steps (64966 resets) in 3682 ms. (1086 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (64677 resets) in 4889 ms. (817 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000003 steps (64790 resets) in 4350 ms. (919 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000003 steps (64913 resets) in 3481 ms. (1148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000004 steps (64954 resets) in 3379 ms. (1183 steps per ms) remains 10/11 properties
BEST_FIRST walk for 4000003 steps (64771 resets) in 3360 ms. (1190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (64676 resets) in 3405 ms. (1174 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (64507 resets) in 3323 ms. (1203 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (64752 resets) in 5171 ms. (773 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (64518 resets) in 5199 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (64913 resets) in 5699 ms. (701 steps per ms) remains 7/10 properties
[2024-06-02 18:07:26] [INFO ] Flow matrix only has 265 transitions (discarded 27 similar events)
// Phase 1: matrix 265 rows 107 cols
[2024-06-02 18:07:26] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:07:26] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 35/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 121/163 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 113/276 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 15/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/277 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/277 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 91/368 variables, 45/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/368 variables, 45/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 22/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 4/372 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/372 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/372 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 262 constraints, problems are : Problem set: 0 solved, 7 unsolved in 399 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: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 35/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 121/163 variables, 42/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 113/276 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 15/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 18/135 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 7/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/277 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/277 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/277 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/277 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 91/368 variables, 45/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/368 variables, 45/235 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/368 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/368 variables, 22/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/368 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (OVERLAPS) 4/372 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/372 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/372 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/372 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (OVERLAPS) 0/372 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 269 constraints, problems are : Problem set: 0 solved, 7 unsolved in 466 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: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 890ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 292/292 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 290
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 105 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 105 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 292
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 105 transition count 291
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 104 transition count 290
Applied a total of 10 rules in 38 ms. Remains 104 /107 variables (removed 3) and now considering 290/292 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 104/107 places, 290/292 transitions.
RANDOM walk for 4000000 steps (256516 resets) in 9969 ms. (401 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (64891 resets) in 2958 ms. (1351 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (64256 resets) in 2903 ms. (1377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (63934 resets) in 2918 ms. (1370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (64439 resets) in 2875 ms. (1390 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (64215 resets) in 3002 ms. (1332 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (64427 resets) in 2937 ms. (1361 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (64697 resets) in 2907 ms. (1375 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 1851 steps, run visited all 7 properties in 31 ms. (steps per millisecond=59 )
Probabilistic random walk after 1851 steps, saw 1162 distinct states, run finished after 35 ms. (steps per millisecond=52 ) properties seen :7
Able to resolve query StableMarking after proving 104 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 42412 ms.
ITS solved all properties within timeout

BK_STOP 1717351656660

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-04"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FireWire-PT-04, 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 r560-tall-171734905700123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;