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.r466-smll-171620124700223.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 Anderson-PT-09, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124700223
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 12 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 927K May 18 16:42 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 1717201402267

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:23:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-01 00:23:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:23:25] [INFO ] Load time of PNML (sax parser for PT used): 517 ms
[2024-06-01 00:23:25] [INFO ] Transformed 505 places.
[2024-06-01 00:23:25] [INFO ] Transformed 1845 transitions.
[2024-06-01 00:23:25] [INFO ] Found NUPN structural information;
[2024-06-01 00:23:25] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 773 ms.
RANDOM walk for 40000 steps (8 resets) in 4166 ms. (9 steps per ms) remains 57/505 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (8 resets) in 101 ms. (39 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
// Phase 1: matrix 1845 rows 505 cols
[2024-06-01 00:23:27] [INFO ] Computed 21 invariants in 85 ms
[2024-06-01 00:23:27] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 430/482 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 430/491 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 9/491 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 9/501 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 14/505 variables, 11/512 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 14/526 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 1845/2350 variables, 505/1031 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2350 variables, 72/1103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2350/2350 variables, and 1103 constraints, problems are : Problem set: 0 solved, 52 unsolved in 5064 ms.
Refiners :[Domain max(s): 505/505 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 505/505 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 430/482 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/482 variables, 430/491 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 9/491 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 9/501 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/491 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 14/505 variables, 11/512 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 14/526 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-01 00:23:37] [INFO ] Deduced a trap composed of 135 places in 1015 ms of which 96 ms to minimize.
[2024-06-01 00:23:38] [INFO ] Deduced a trap composed of 161 places in 1075 ms of which 9 ms to minimize.
SMT process timed out in 10523ms, After SMT, problems are : Problem set: 0 solved, 52 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 505 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 25 Pre rules applied. Total rules applied 0 place count 505 transition count 1820
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 50 place count 480 transition count 1820
Discarding 97 places :
Symmetric choice reduction at 0 with 97 rule applications. Total rules 147 place count 383 transition count 571
Iterating global reduction 0 with 97 rules applied. Total rules applied 244 place count 383 transition count 571
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 3 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 338 place count 336 transition count 524
Applied a total of 338 rules in 324 ms. Remains 336 /505 variables (removed 169) and now considering 524/1845 (removed 1321) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 336/505 places, 524/1845 transitions.
RANDOM walk for 4000000 steps (8 resets) in 31393 ms. (127 steps per ms) remains 37/52 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1279 ms. (312 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1275 ms. (313 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1289 ms. (310 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1277 ms. (312 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1281 ms. (312 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1282 ms. (311 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1374 ms. (290 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1310 ms. (305 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1288 ms. (310 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1280 ms. (312 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1290 ms. (309 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1283 ms. (311 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1280 ms. (312 steps per ms) remains 37/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1297 ms. (308 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1315 ms. (303 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1320 ms. (302 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1322 ms. (302 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1331 ms. (300 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1292 ms. (309 steps per ms) remains 34/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1288 ms. (310 steps per ms) remains 32/34 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1199 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1221 ms. (327 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1213 ms. (329 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1213 ms. (329 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1219 ms. (327 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1216 ms. (328 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1256 ms. (318 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1228 ms. (325 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1220 ms. (327 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1224 ms. (326 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1223 ms. (326 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1218 ms. (328 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1216 ms. (328 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1218 ms. (328 steps per ms) remains 32/32 properties
// Phase 1: matrix 524 rows 336 cols
[2024-06-01 00:23:59] [INFO ] Computed 21 invariants in 14 ms
[2024-06-01 00:23:59] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 285/317 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (OVERLAPS) 9/326 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 10/336 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 524/860 variables, 336/357 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/860 variables, 72/429 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/860 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/860 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 860/860 variables, and 429 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2202 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 336/336 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 285/317 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 00:24:02] [INFO ] Deduced a trap composed of 294 places in 218 ms of which 4 ms to minimize.
[2024-06-01 00:24:02] [INFO ] Deduced a trap composed of 297 places in 222 ms of which 4 ms to minimize.
[2024-06-01 00:24:02] [INFO ] Deduced a trap composed of 285 places in 218 ms of which 3 ms to minimize.
[2024-06-01 00:24:02] [INFO ] Deduced a trap composed of 277 places in 174 ms of which 4 ms to minimize.
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 280 places in 224 ms of which 3 ms to minimize.
[2024-06-01 00:24:03] [INFO ] Deduced a trap composed of 274 places in 225 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/317 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 9/326 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 10/336 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 00:24:04] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 00:24:05] [INFO ] Deduced a trap composed of 132 places in 304 ms of which 4 ms to minimize.
[2024-06-01 00:24:05] [INFO ] Deduced a trap composed of 139 places in 243 ms of which 3 ms to minimize.
[2024-06-01 00:24:05] [INFO ] Deduced a trap composed of 124 places in 283 ms of which 4 ms to minimize.
[2024-06-01 00:24:06] [INFO ] Deduced a trap composed of 216 places in 290 ms of which 4 ms to minimize.
[2024-06-01 00:24:06] [INFO ] Deduced a trap composed of 216 places in 288 ms of which 3 ms to minimize.
[2024-06-01 00:24:06] [INFO ] Deduced a trap composed of 148 places in 269 ms of which 3 ms to minimize.
[2024-06-01 00:24:06] [INFO ] Deduced a trap composed of 182 places in 305 ms of which 5 ms to minimize.
[2024-06-01 00:24:07] [INFO ] Deduced a trap composed of 157 places in 414 ms of which 6 ms to minimize.
[2024-06-01 00:24:07] [INFO ] Deduced a trap composed of 135 places in 351 ms of which 4 ms to minimize.
[2024-06-01 00:24:07] [INFO ] Deduced a trap composed of 201 places in 207 ms of which 3 ms to minimize.
[2024-06-01 00:24:08] [INFO ] Deduced a trap composed of 150 places in 303 ms of which 4 ms to minimize.
[2024-06-01 00:24:08] [INFO ] Deduced a trap composed of 205 places in 284 ms of which 3 ms to minimize.
[2024-06-01 00:24:08] [INFO ] Deduced a trap composed of 201 places in 343 ms of which 5 ms to minimize.
[2024-06-01 00:24:09] [INFO ] Deduced a trap composed of 145 places in 335 ms of which 4 ms to minimize.
[2024-06-01 00:24:09] [INFO ] Deduced a trap composed of 140 places in 306 ms of which 4 ms to minimize.
[2024-06-01 00:24:09] [INFO ] Deduced a trap composed of 173 places in 287 ms of which 4 ms to minimize.
[2024-06-01 00:24:10] [INFO ] Deduced a trap composed of 152 places in 281 ms of which 4 ms to minimize.
[2024-06-01 00:24:10] [INFO ] Deduced a trap composed of 138 places in 382 ms of which 5 ms to minimize.
[2024-06-01 00:24:10] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 3 ms to minimize.
[2024-06-01 00:24:11] [INFO ] Deduced a trap composed of 138 places in 304 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 00:24:11] [INFO ] Deduced a trap composed of 135 places in 357 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 524/860 variables, 336/385 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/860 variables, 72/457 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/860 variables, 32/489 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 15 (OVERLAPS) 0/860 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 860/860 variables, and 489 constraints, problems are : Problem set: 0 solved, 32 unsolved in 15834 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 336/336 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 28/28 constraints]
After SMT, in 18078ms problems are : Problem set: 0 solved, 32 unsolved
Parikh walk visited 3 properties in 1986 ms.
Support contains 29 out of 336 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 336/336 places, 524/524 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 316 transition count 504
Applied a total of 40 rules in 45 ms. Remains 316 /336 variables (removed 20) and now considering 504/524 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 316/336 places, 504/524 transitions.
RANDOM walk for 4000000 steps (8 resets) in 24918 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1220 ms. (327 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1232 ms. (324 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1221 ms. (327 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1226 ms. (326 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1227 ms. (325 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1214 ms. (329 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1223 ms. (326 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1232 ms. (324 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1209 ms. (330 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1213 ms. (329 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1227 ms. (325 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1204 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1201 ms. (332 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1214 ms. (329 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1204 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1186 ms. (336 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1219 ms. (327 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1185 ms. (337 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1177 ms. (339 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1206 ms. (331 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1211 ms. (330 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1208 ms. (330 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1211 ms. (330 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1173 ms. (340 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1192 ms. (335 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1210 ms. (330 steps per ms) remains 28/28 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1191 ms. (335 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1168 ms. (342 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1195 ms. (334 steps per ms) remains 27/27 properties
Finished probabilistic random walk after 1912184 steps, run visited all 27 properties in 13929 ms. (steps per millisecond=137 )
Probabilistic random walk after 1912184 steps, saw 1130206 distinct states, run finished after 13935 ms. (steps per millisecond=137 ) properties seen :27
Able to resolve query StableMarking after proving 505 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 85844 ms.
ITS solved all properties within timeout

BK_STOP 1717201490501

--------------------
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="Anderson-PT-09"
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 Anderson-PT-09, 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 r466-smll-171620124700223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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