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-171734905700118.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-03, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r560-tall-171734905700118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 141K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 86K 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 1717351585022

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-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:06:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 18:06:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:06:26] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:06:26] [INFO ] Transformed 112 places.
[2024-06-02 18:06:26] [INFO ] Transformed 356 transitions.
[2024-06-02 18:06:26] [INFO ] Found NUPN structural information;
[2024-06-02 18:06:26] [INFO ] Parsed PT model containing 112 places and 356 transitions and 1308 arcs in 179 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 7 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
RANDOM walk for 40000 steps (2010 resets) in 2318 ms. (17 steps per ms) remains 41/101 properties
BEST_FIRST walk for 4004 steps (52 resets) in 96 ms. (41 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (57 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (50 resets) in 27 ms. (142 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (50 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (53 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (50 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (74 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (48 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (41 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (59 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (65 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (45 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (52 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (59 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (55 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (47 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (50 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (54 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (46 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (39 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (65 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (55 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (54 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (42 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (50 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (61 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (54 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (53 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (59 resets) in 25 ms. (154 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (51 resets) in 11 ms. (333 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (55 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
[2024-06-02 18:06:27] [INFO ] Flow matrix only has 271 transitions (discarded 32 similar events)
// Phase 1: matrix 271 rows 112 cols
[2024-06-02 18:06:27] [INFO ] Computed 9 invariants in 16 ms
[2024-06-02 18:06:27] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 62/101 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 62/106 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 11/112 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 270/382 variables, 112/233 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 40/273 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/383 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/383 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 274 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1599 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 62/101 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 62/106 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-02 18:06:29] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 12 ms to minimize.
[2024-06-02 18:06:29] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 2 ms to minimize.
[2024-06-02 18:06:30] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 11/112 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 11/124 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-02 18:06:30] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 270/382 variables, 112/237 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 40/277 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 39/316 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-02 18:06:31] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-02 18:06:31] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/382 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/382 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 16 (OVERLAPS) 1/383 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 18 (OVERLAPS) 0/383 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 319 constraints, problems are : Problem set: 0 solved, 39 unsolved in 4213 ms.
Refiners :[Domain max(s): 112/112 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 112/112 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 6/6 constraints]
After SMT, in 5896ms problems are : Problem set: 0 solved, 39 unsolved
Fused 39 Parikh solutions to 38 different solutions.
Parikh walk visited 17 properties in 3663 ms.
Support contains 22 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 303/303 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 112 transition count 299
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 111 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 110 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 110 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 108 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 17 place count 105 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 23 place count 105 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 34 place count 105 transition count 285
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 105 transition count 287
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 2 with 3 rules applied. Total rules applied 38 place count 104 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 104 transition count 283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 103 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 102 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 42 place count 102 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 44 place count 101 transition count 281
Applied a total of 44 rules in 114 ms. Remains 101 /112 variables (removed 11) and now considering 281/303 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 101/112 places, 281/303 transitions.
RANDOM walk for 4000000 steps (244161 resets) in 23076 ms. (173 steps per ms) remains 12/22 properties
BEST_FIRST walk for 4000004 steps (60474 resets) in 5281 ms. (757 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60271 resets) in 5845 ms. (684 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60333 resets) in 4900 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60238 resets) in 5067 ms. (789 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4000004 steps (60218 resets) in 3363 ms. (1189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (60195 resets) in 3394 ms. (1178 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (60976 resets) in 3298 ms. (1212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (60254 resets) in 3247 ms. (1231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000002 steps (60463 resets) in 3251 ms. (1230 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (60071 resets) in 3252 ms. (1229 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000002 steps (60064 resets) in 3047 ms. (1312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000002 steps (60427 resets) in 3019 ms. (1324 steps per ms) remains 9/9 properties
[2024-06-02 18:07:01] [INFO ] Flow matrix only has 253 transitions (discarded 28 similar events)
// Phase 1: matrix 253 rows 101 cols
[2024-06-02 18:07:01] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 18:07:01] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 50/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 177/236 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 71/307 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/308 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 43/351 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/351 variables, 12/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 3/354 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/354 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/354 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 148 constraints, problems are : Problem set: 0 solved, 9 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 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, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 50/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 177/236 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 71/307 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 27/110 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 9/119 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 18:07:01] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/308 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/308 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 43/351 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 12/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/351 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 3/354 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/354 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/354 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 0/354 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 354/354 variables, and 158 constraints, problems are : Problem set: 0 solved, 9 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 1026ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 2828 ms.
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 281/281 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 276
Applied a total of 4 rules in 17 ms. Remains 99 /101 variables (removed 2) and now considering 276/281 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 99/101 places, 276/281 transitions.
RANDOM walk for 4000000 steps (243719 resets) in 10747 ms. (372 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (60413 resets) in 4229 ms. (945 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (60238 resets) in 4076 ms. (981 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000003 steps (60590 resets) in 4071 ms. (982 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000001 steps (60006 resets) in 4225 ms. (946 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (60112 resets) in 4289 ms. (932 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000002 steps (60518 resets) in 3929 ms. (1017 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (60476 resets) in 3672 ms. (1089 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (60767 resets) in 4005 ms. (998 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000000 steps (60355 resets) in 4119 ms. (970 steps per ms) remains 8/8 properties
[2024-06-02 18:07:20] [INFO ] Flow matrix only has 248 transitions (discarded 28 similar events)
// Phase 1: matrix 248 rows 99 cols
[2024-06-02 18:07:20] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 18:07:20] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 116/155 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 102/257 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/258 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 83/341 variables, 38/116 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 21/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 6/347 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/347 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 145 constraints, problems are : Problem set: 0 solved, 8 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 31/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 116/155 variables, 39/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 102/257 variables, 17/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 1/258 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 83/341 variables, 38/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 21/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 6/347 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/347 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 347/347 variables, and 153 constraints, problems are : Problem set: 0 solved, 8 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 793ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1337 ms.
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 276/276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 271
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 271
Applied a total of 4 rules in 18 ms. Remains 97 /99 variables (removed 2) and now considering 271/276 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 97/99 places, 271/276 transitions.
RANDOM walk for 4000000 steps (243602 resets) in 12816 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (60484 resets) in 3622 ms. (1104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (60051 resets) in 3667 ms. (1090 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (60161 resets) in 3966 ms. (1008 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000003 steps (60419 resets) in 3042 ms. (1314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (60554 resets) in 2990 ms. (1337 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (59904 resets) in 3076 ms. (1299 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000001 steps (60685 resets) in 3011 ms. (1328 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000002 steps (60424 resets) in 2980 ms. (1341 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 4311 steps, run visited all 8 properties in 48 ms. (steps per millisecond=89 )
Probabilistic random walk after 4311 steps, saw 2063 distinct states, run finished after 52 ms. (steps per millisecond=82 ) properties seen :8
Able to resolve query StableMarking after proving 102 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 69566 ms.
ITS solved all properties within timeout

BK_STOP 1717351655865

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

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