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.r564-tall-171734907700133.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 ltsminxred
Input is FireWire-PT-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r564-tall-171734907700133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K 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.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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 90K 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 1717361653199

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FireWire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:54:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-02 20:54:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:54:14] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 20:54:14] [INFO ] Transformed 116 places.
[2024-06-02 20:54:14] [INFO ] Transformed 368 transitions.
[2024-06-02 20:54:14] [INFO ] Found NUPN structural information;
[2024-06-02 20:54:14] [INFO ] Parsed PT model containing 116 places and 368 transitions and 1362 arcs in 176 ms.
Structural test allowed to assert that 11 places are NOT stable. Took 7 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
RANDOM walk for 40000 steps (2020 resets) in 1771 ms. (22 steps per ms) remains 39/105 properties
BEST_FIRST walk for 4003 steps (51 resets) in 42 ms. (93 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (55 resets) in 34 ms. (114 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (44 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (51 resets) in 17 ms. (222 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (52 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (57 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (58 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (48 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (57 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (46 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (44 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (62 resets) in 26 ms. (148 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (43 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (59 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (66 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (52 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (45 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (55 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (56 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (55 resets) in 9 ms. (400 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (44 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (51 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (40 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (56 resets) in 10 ms. (363 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (60 resets) in 12 ms. (307 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (65 resets) in 13 ms. (285 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (43 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 38/38 properties
[2024-06-02 20:54:15] [INFO ] Flow matrix only has 280 transitions (discarded 32 similar events)
// Phase 1: matrix 280 rows 116 cols
[2024-06-02 20:54:15] [INFO ] Computed 9 invariants in 7 ms
[2024-06-02 20:54:15] [INFO ] State equation strengthened by 41 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) 67/105 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 67/110 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 11/116 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 11/125 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 279/395 variables, 116/241 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 40/281 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (OVERLAPS) 1/396 variables, 1/282 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (OVERLAPS) 0/396 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 282 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1385 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 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) 67/105 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 67/110 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 12 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-06-02 20:54:17] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 11/116 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 11/133 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 20:54:18] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 12 (OVERLAPS) 279/395 variables, 116/250 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/395 variables, 40/290 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/395 variables, 38/328 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/395 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 16 (OVERLAPS) 1/396 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-02 20:54:19] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:54:19] [INFO ] Deduced a trap composed of 36 places in 85 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/396 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/396 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 19 (OVERLAPS) 0/396 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 396/396 variables, and 331 constraints, problems are : Problem set: 0 solved, 38 unsolved in 3875 ms.
Refiners :[Domain max(s): 116/116 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 11/11 constraints]
After SMT, in 5317ms problems are : Problem set: 0 solved, 38 unsolved
Fused 38 Parikh solutions to 37 different solutions.
Parikh walk visited 0 properties in 2580 ms.
Support contains 38 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 312/312 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 116 transition count 309
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 116 transition count 308
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 115 transition count 308
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 9 place count 113 transition count 306
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 1 with 4 rules applied. Total rules applied 13 place count 111 transition count 310
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 17 place count 111 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 111 transition count 298
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 111 transition count 300
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 29 place count 110 transition count 298
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 31 place count 110 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 109 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 108 transition count 295
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 33 place count 108 transition count 294
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 107 transition count 294
Applied a total of 35 rules in 80 ms. Remains 107 /116 variables (removed 9) and now considering 294/312 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 107/116 places, 294/312 transitions.
RANDOM walk for 4000000 steps (243593 resets) in 15520 ms. (257 steps per ms) remains 12/38 properties
BEST_FIRST walk for 4000003 steps (60460 resets) in 3411 ms. (1172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (60434 resets) in 3343 ms. (1196 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000002 steps (59909 resets) in 3306 ms. (1209 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000003 steps (60511 resets) in 3376 ms. (1184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4000004 steps (60658 resets) in 3427 ms. (1166 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4000003 steps (60949 resets) in 3272 ms. (1222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4000002 steps (60222 resets) in 3244 ms. (1232 steps per ms) remains 7/11 properties
BEST_FIRST walk for 4000004 steps (60935 resets) in 2651 ms. (1508 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (60305 resets) in 2806 ms. (1425 steps per ms) remains 7/7 properties
[2024-06-02 20:54:36] [INFO ] Flow matrix only has 267 transitions (discarded 27 similar events)
// Phase 1: matrix 267 rows 107 cols
[2024-06-02 20:54:36] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 20:54:36] [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) 37/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 122/166 variables, 44/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 113/279 variables, 14/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 18/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/280 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 90/370 variables, 44/184 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 44/228 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 22/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 4/374 variables, 4/256 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/374 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/374 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/374 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (OVERLAPS) 0/374 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 374/374 variables, and 262 constraints, problems are : Problem set: 0 solved, 7 unsolved in 309 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) 37/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:54:37] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 122/166 variables, 44/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 113/279 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 18/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/279 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/279 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 1/280 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 90/370 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 44/236 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/370 variables, 22/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/370 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 4/374 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/374 variables, 4/268 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/374 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/374 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 27 (OVERLAPS) 0/374 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 374/374 variables, and 270 constraints, problems are : Problem set: 0 solved, 7 unsolved in 499 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: 1/1 constraints]
After SMT, in 830ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1053 ms.
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 294/294 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 2 place count 106 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 105 transition count 290
Applied a total of 9 rules in 39 ms. Remains 105 /107 variables (removed 2) and now considering 290/294 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 105/107 places, 290/294 transitions.
RANDOM walk for 4000000 steps (244049 resets) in 8340 ms. (479 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000001 steps (60082 resets) in 2580 ms. (1549 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (60349 resets) in 2548 ms. (1569 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000004 steps (60335 resets) in 2642 ms. (1513 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (60528 resets) in 2570 ms. (1555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (60276 resets) in 2588 ms. (1544 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000003 steps (60554 resets) in 2568 ms. (1557 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (59860 resets) in 2607 ms. (1533 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 114856 steps, run visited all 7 properties in 222 ms. (steps per millisecond=517 )
Probabilistic random walk after 114856 steps, saw 26644 distinct states, run finished after 226 ms. (steps per millisecond=508 ) properties seen :7
Able to resolve query StableMarking after proving 106 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST BESTFIRST_WALK TOPOLOGICAL
Total runtime 32293 ms.
ITS solved all properties within timeout

BK_STOP 1717361686637

--------------------
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-06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FireWire-PT-06, 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 r564-tall-171734907700133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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