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.r492-smll-171636266200134.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 Echo-PT-d04r03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266200134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 12 04:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 04:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 530K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-00
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-01
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-02
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-03
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-04
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-05
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-06
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-07
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-08
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-09
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-10
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-11
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-12
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-13
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-14
FORMULA_NAME Echo-PT-d04r03-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717215651378

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d04r03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:20:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:20:53] [INFO ] Load time of PNML (sax parser for PT used): 326 ms
[2024-06-01 04:20:54] [INFO ] Transformed 1019 places.
[2024-06-01 04:20:54] [INFO ] Transformed 850 transitions.
[2024-06-01 04:20:54] [INFO ] Found NUPN structural information;
[2024-06-01 04:20:54] [INFO ] Parsed PT model containing 1019 places and 850 transitions and 6340 arcs in 512 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (244 resets) in 3419 ms. (11 steps per ms) remains 2/13 properties
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 752 ms. (53 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 2/2 properties
// Phase 1: matrix 850 rows 1019 cols
[2024-06-01 04:20:55] [INFO ] Computed 513 invariants in 84 ms
Problem Echo-PT-d04r03-ReachabilityCardinality-2024-07 is UNSAT
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 151/197 variables, 29/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 151/226 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 66/263 variables, 22/249 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 66/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/315 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 69/332 variables, 14/329 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/332 variables, 69/398 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/332 variables, 4/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/402 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/359 variables, 6/408 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 27/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 1/436 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/365 variables, 1/437 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/365 variables, 6/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/365 variables, 0/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 486/851 variables, 292/735 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/851 variables, 486/1221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/851 variables, 0/1221 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 49/900 variables, 40/1261 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/900 variables, 49/1310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/900 variables, 0/1310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/905 variables, 1/1311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/905 variables, 5/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/905 variables, 0/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 112/1017 variables, 100/1416 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1017 variables, 112/1528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1017 variables, 0/1528 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 2/1019 variables, 2/1530 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1019 variables, 2/1532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1019 variables, 0/1532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 850/1869 variables, 1019/2551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1869 variables, 0/2551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 0/1869 variables, 0/2551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 2551 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2269 ms.
Refiners :[Domain max(s): 1019/1019 constraints, Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 398/398 constraints, State Equation: 1019/1019 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/54 variables, 8/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 45/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 38/92 variables, 14/76 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 38/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 68/160 variables, 14/128 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 68/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 45/205 variables, 10/206 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 45/251 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/205 variables, 0/251 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/221 variables, 3/254 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 16/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 448/669 variables, 220/490 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/669 variables, 448/938 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/669 variables, 0/938 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 55/724 variables, 47/985 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/724 variables, 55/1040 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 04:20:59] [INFO ] Deduced a trap composed of 14 places in 507 ms of which 52 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/724 variables, 1/1041 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/724 variables, 0/1041 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 244/968 variables, 156/1197 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/968 variables, 244/1441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 04:20:59] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 7 ms to minimize.
[2024-06-01 04:21:00] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 6 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/968 variables, 2/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/968 variables, 0/1443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 17/985 variables, 17/1460 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/985 variables, 17/1477 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 04:21:00] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 5 ms to minimize.
[2024-06-01 04:21:01] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 5 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/985 variables, 2/1479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/985 variables, 0/1479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 32/1017 variables, 22/1501 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1017 variables, 32/1533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 04:21:01] [INFO ] Deduced a trap composed of 14 places in 377 ms of which 6 ms to minimize.
[2024-06-01 04:21:02] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 5 ms to minimize.
[2024-06-01 04:21:02] [INFO ] Deduced a trap composed of 14 places in 267 ms of which 4 ms to minimize.
[2024-06-01 04:21:02] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 4 ms to minimize.
[2024-06-01 04:21:02] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 4 ms to minimize.
[2024-06-01 04:21:03] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 5 ms to minimize.
SMT process timed out in 7821ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1019 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1019/1019 places, 850/850 transitions.
Graph (complete) has 4450 edges and 1019 vertex of which 938 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.12 ms
Discarding 81 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 938 transition count 850
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 937 transition count 849
Applied a total of 9 rules in 350 ms. Remains 937 /1019 variables (removed 82) and now considering 849/850 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 937/1019 places, 849/850 transitions.
RANDOM walk for 40000 steps (252 resets) in 1379 ms. (28 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 470 ms. (84 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 408460 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 408460 steps, saw 72946 distinct states, run finished after 3012 ms. (steps per millisecond=135 ) properties seen :0
// Phase 1: matrix 849 rows 937 cols
[2024-06-01 04:21:08] [INFO ] Computed 432 invariants in 983 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 883/892 variables, 387/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 892/1786 variables, and 1279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45016 ms.
Refiners :[Domain max(s): 892/937 constraints, Generalized P Invariants (flows): 387/432 constraints, State Equation: 0/937 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 883/892 variables, 387/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 892/1786 variables, and 1279 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45034 ms.
Refiners :[Domain max(s): 892/937 constraints, Generalized P Invariants (flows): 387/432 constraints, State Equation: 0/937 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 91108ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 937 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 937/937 places, 849/849 transitions.
Applied a total of 0 rules in 54 ms. Remains 937 /937 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 937/937 places, 849/849 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 937/937 places, 849/849 transitions.
Applied a total of 0 rules in 44 ms. Remains 937 /937 variables (removed 0) and now considering 849/849 (removed 0) transitions.
[2024-06-01 04:22:38] [INFO ] Invariant cache hit.
[2024-06-01 04:23:18] [INFO ] Performed 60/937 implicitness test of which 1 returned IMPLICIT in 35 seconds.
[2024-06-01 04:23:48] [INFO ] Performed 234/937 implicitness test of which 6 returned IMPLICIT in 65 seconds.
[2024-06-01 04:24:29] [INFO ] Performed 375/937 implicitness test of which 9 returned IMPLICIT in 106 seconds.
[2024-06-01 04:25:01] [INFO ] Performed 377/937 implicitness test of which 9 returned IMPLICIT in 138 seconds.
[2024-06-01 04:25:18] [INFO ] Implicit Places using invariants in 160029 ms returned [21, 71, 163, 197, 209, 224, 236, 270, 362]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 160044 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 928/937 places, 849/849 transitions.
Applied a total of 0 rules in 41 ms. Remains 928 /928 variables (removed 0) and now considering 849/849 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 160131 ms. Remains : 928/937 places, 849/849 transitions.
RANDOM walk for 38409 steps (242 resets) in 1093 ms. (35 steps per ms) remains 0/1 properties
FORMULA Echo-PT-d04r03-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 265468 ms.
ITS solved all properties within timeout

BK_STOP 1717215919009

--------------------
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 ReachabilityCardinality -timeout 360 -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="Echo-PT-d04r03"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 Echo-PT-d04r03, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r492-smll-171636266200134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d04r03.tgz
mv Echo-PT-d04r03 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;