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.r520-tall-171662337900142.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 RERS17pb113-PT-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337900142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15M May 18 16:43 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 RERS17pb113-PT-4-ReachabilityCardinality-2024-00
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-01
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-02
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2023-03
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-04
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2023-05
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-06
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-07
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-08
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-09
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-10
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-11
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2023-12
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2023-13
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-14
FORMULA_NAME RERS17pb113-PT-4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717224157237

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:42:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:42:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:42:39] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2024-06-01 06:42:39] [INFO ] Transformed 639 places.
[2024-06-01 06:42:39] [INFO ] Transformed 31353 transitions.
[2024-06-01 06:42:39] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 922 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3617 ms. (11 steps per ms) remains 8/16 properties
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2023-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 490 ms. (81 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
[2024-06-01 06:42:41] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2024-06-01 06:42:41] [INFO ] Computed 25 invariants in 108 ms
[2024-06-01 06:42:42] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 520/630 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/630 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 9/639 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18965/18965 variables, and 664 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5066 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 639/639 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 520/630 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:42:49] [INFO ] Deduced a trap composed of 25 places in 1249 ms of which 22 ms to minimize.
[2024-06-01 06:42:50] [INFO ] Deduced a trap composed of 65 places in 1006 ms of which 3 ms to minimize.
[2024-06-01 06:42:51] [INFO ] Deduced a trap composed of 41 places in 842 ms of which 2 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 66 places in 825 ms of which 1 ms to minimize.
[2024-06-01 06:42:52] [INFO ] Deduced a trap composed of 65 places in 680 ms of which 1 ms to minimize.
SMT process timed out in 11204ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 110 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 629 transition count 31353
Applied a total of 10 rules in 363 ms. Remains 629 /639 variables (removed 10) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 629/639 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1693 ms. (23 steps per ms) remains 7/8 properties
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 7/7 properties
[2024-06-01 06:42:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 629 cols
[2024-06-01 06:42:54] [INFO ] Computed 15 invariants in 72 ms
[2024-06-01 06:42:54] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 57/155 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 474/629 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem RERS17pb113-PT-4-ReachabilityCardinality-2024-08 is UNSAT
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 18326/18955 variables, 629/644 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18955 variables, 829/1473 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 18955/18955 variables, and 1473 constraints, problems are : Problem set: 1 solved, 6 unsolved in 45034 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 629/629 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 59/140 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 489/629 variables, 12/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-06-01 06:43:41] [INFO ] Deduced a trap composed of 66 places in 1219 ms of which 6 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 114 places in 1148 ms of which 5 ms to minimize.
[2024-06-01 06:43:43] [INFO ] Deduced a trap composed of 41 places in 791 ms of which 2 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 65 places in 709 ms of which 1 ms to minimize.
[2024-06-01 06:43:44] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 2 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 65 places in 956 ms of which 6 ms to minimize.
[2024-06-01 06:43:46] [INFO ] Deduced a trap composed of 65 places in 544 ms of which 1 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 49 places in 515 ms of which 0 ms to minimize.
[2024-06-01 06:43:47] [INFO ] Deduced a trap composed of 49 places in 414 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/629 variables, 9/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18955/18955 variables, and 653 constraints, problems are : Problem set: 1 solved, 6 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 629/629 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 90794ms problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 31353/31353 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 628 transition count 31353
Applied a total of 1 rules in 318 ms. Remains 628 /629 variables (removed 1) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 319 ms. Remains : 628/629 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1888 ms. (21 steps per ms) remains 5/6 properties
FORMULA RERS17pb113-PT-4-ReachabilityCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 5/5 properties
[2024-06-01 06:44:26] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 628 cols
[2024-06-01 06:44:26] [INFO ] Computed 14 invariants in 73 ms
[2024-06-01 06:44:26] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 495/628 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18326/18954 variables, 628/642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18954 variables, 829/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18954 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/18954 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18954/18954 variables, and 1471 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68802 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 495/628 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 41 places in 948 ms of which 2 ms to minimize.
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 41 places in 757 ms of which 1 ms to minimize.
[2024-06-01 06:45:38] [INFO ] Deduced a trap composed of 65 places in 553 ms of which 0 ms to minimize.
[2024-06-01 06:45:39] [INFO ] Deduced a trap composed of 49 places in 517 ms of which 0 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 49 places in 857 ms of which 1 ms to minimize.
[2024-06-01 06:45:40] [INFO ] Deduced a trap composed of 49 places in 682 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:45:42] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18954/18954 variables, and 649 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75035 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 144351ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 31353/31353 transitions.
Applied a total of 0 rules in 175 ms. Remains 628 /628 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 628/628 places, 31353/31353 transitions.
RANDOM walk for 40000 steps (8 resets) in 1390 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 22925 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :0 out of 5
Probabilistic random walk after 22925 steps, saw 20661 distinct states, run finished after 3016 ms. (steps per millisecond=7 ) properties seen :0
[2024-06-01 06:46:54] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:46:54] [INFO ] Invariant cache hit.
[2024-06-01 06:46:54] [INFO ] State equation strengthened by 829 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 495/628 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 18326/18954 variables, 628/642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18954 variables, 829/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18954 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/18954 variables, 0/1471 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18954/18954 variables, and 1471 constraints, problems are : Problem set: 0 solved, 5 unsolved in 74883 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 829/829 constraints, PredecessorRefiner: 5/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 54/133 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 495/628 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:11] [INFO ] Deduced a trap composed of 25 places in 874 ms of which 2 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 41 places in 786 ms of which 1 ms to minimize.
[2024-06-01 06:48:12] [INFO ] Deduced a trap composed of 65 places in 546 ms of which 1 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 65 places in 707 ms of which 1 ms to minimize.
[2024-06-01 06:48:13] [INFO ] Deduced a trap composed of 65 places in 477 ms of which 0 ms to minimize.
[2024-06-01 06:48:14] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 1 ms to minimize.
[2024-06-01 06:48:15] [INFO ] Deduced a trap composed of 49 places in 525 ms of which 0 ms to minimize.
[2024-06-01 06:48:15] [INFO ] Deduced a trap composed of 49 places in 413 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/628 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:17] [INFO ] Deduced a trap composed of 65 places in 531 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 06:48:18] [INFO ] Deduced a trap composed of 41 places in 467 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 18954/18954 variables, and 652 constraints, problems are : Problem set: 0 solved, 5 unsolved in 90034 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 628/628 constraints, ReadFeed: 0/829 constraints, PredecessorRefiner: 3/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 165326ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 79 out of 628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 31353/31353 transitions.
Applied a total of 0 rules in 265 ms. Remains 628 /628 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 628/628 places, 31353/31353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 628/628 places, 31353/31353 transitions.
Applied a total of 0 rules in 183 ms. Remains 628 /628 variables (removed 0) and now considering 31353/31353 (removed 0) transitions.
[2024-06-01 06:49:40] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:49:40] [INFO ] Invariant cache hit.
[2024-06-01 06:49:42] [INFO ] Implicit Places using invariants in 2120 ms returned []
Implicit Place search using SMT only with invariants took 2145 ms to find 0 implicit places.
Running 31352 sub problems to find dead transitions.
[2024-06-01 06:49:42] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
[2024-06-01 06:49:42] [INFO ] Invariant cache hit.
[2024-06-01 06:49:43] [INFO ] State equation strengthened by 829 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-00
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-01
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-02
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2023-03
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-04
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2023-05
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-06
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-07
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-08
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-09
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-10
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-11
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2023-12
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2023-13
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-14
Could not compute solution for formula : RERS17pb113-PT-4-ReachabilityCardinality-2024-15

BK_STOP 1717224694078

--------------------
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
mcc2024
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_0_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_1_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_2_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2023-03
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_3_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_4_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2023-05
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_5_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_6_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_7_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_8_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_9_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_10_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_11_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2023-12
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_12_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2023-13
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_13_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/641/inv_14_
rfs formula name RERS17pb113-PT-4-ReachabilityCardinality-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/641/inv_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="RERS17pb113-PT-4"
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 RERS17pb113-PT-4, 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 r520-tall-171662337900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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