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.r464-smll-171620118400366.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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118400366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 12 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 15:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 15:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:23 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 1.3M 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 Anderson-PT-10-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717259637586

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:34:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:34:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:34:00] [INFO ] Load time of PNML (sax parser for PT used): 548 ms
[2024-06-01 16:34:00] [INFO ] Transformed 621 places.
[2024-06-01 16:34:00] [INFO ] Transformed 2480 transitions.
[2024-06-01 16:34:00] [INFO ] Found NUPN structural information;
[2024-06-01 16:34:00] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 813 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3140 ms. (12 steps per ms) remains 4/14 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 666 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 236 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 339 ms. (117 steps per ms) remains 4/4 properties
// Phase 1: matrix 2480 rows 621 cols
[2024-06-01 16:34:02] [INFO ] Computed 23 invariants in 93 ms
[2024-06-01 16:34:02] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 552/602 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 552/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/621 variables, 12/625 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 19/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2480/3101 variables, 621/1265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 90/1355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/3101 variables, 0/1355 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3101/3101 variables, and 1355 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3704 ms.
Refiners :[Domain max(s): 621/621 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 621/621 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem Anderson-PT-10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 552/602 variables, 11/61 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/602 variables, 552/613 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/602 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 19/621 variables, 12/625 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 19/644 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 16:34:08] [INFO ] Deduced a trap composed of 197 places in 1257 ms of which 107 ms to minimize.
[2024-06-01 16:34:10] [INFO ] Deduced a trap composed of 187 places in 1264 ms of which 11 ms to minimize.
[2024-06-01 16:34:11] [INFO ] Deduced a trap composed of 240 places in 1082 ms of which 8 ms to minimize.
[2024-06-01 16:34:12] [INFO ] Deduced a trap composed of 153 places in 1248 ms of which 9 ms to minimize.
SMT process timed out in 9989ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 621 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 70 Pre rules applied. Total rules applied 0 place count 621 transition count 2410
Deduced a syphon composed of 70 places in 4 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 0 with 140 rules applied. Total rules applied 140 place count 551 transition count 2410
Discarding 163 places :
Symmetric choice reduction at 0 with 163 rule applications. Total rules 303 place count 388 transition count 717
Iterating global reduction 0 with 163 rules applied. Total rules applied 466 place count 388 transition count 717
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 488 place count 377 transition count 706
Applied a total of 488 rules in 232 ms. Remains 377 /621 variables (removed 244) and now considering 706/2480 (removed 1774) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 377/621 places, 706/2480 transitions.
RANDOM walk for 40000 steps (8 resets) in 608 ms. (65 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/3 properties
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
// Phase 1: matrix 706 rows 377 cols
[2024-06-01 16:34:13] [INFO ] Computed 23 invariants in 18 ms
[2024-06-01 16:34:13] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 349/361 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/366 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/377 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 706/1083 variables, 377/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 90/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1083 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1083 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1083/1083 variables, and 490 constraints, problems are : Problem set: 0 solved, 1 unsolved in 712 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 377/377 constraints, ReadFeed: 90/90 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 349/361 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/366 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/377 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 706/1083 variables, 377/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1083 variables, 90/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1083 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1083 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1083 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1083/1083 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 377/377 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2018ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 12 out of 377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 377/377 places, 706/706 transitions.
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 8 Pre rules applied. Total rules applied 0 place count 377 transition count 698
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 369 transition count 698
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 363 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 363 transition count 602
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 38 place count 358 transition count 597
Applied a total of 38 rules in 143 ms. Remains 358 /377 variables (removed 19) and now considering 597/706 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 358/377 places, 597/706 transitions.
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 699751 steps, run timeout after 3010 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 699751 steps, saw 505166 distinct states, run finished after 3022 ms. (steps per millisecond=231 ) properties seen :0
// Phase 1: matrix 597 rows 358 cols
[2024-06-01 16:34:18] [INFO ] Computed 23 invariants in 16 ms
[2024-06-01 16:34:18] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 330/342 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/347 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/358 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 597/955 variables, 358/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 90/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/955 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/955 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 955/955 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 358/358 constraints, ReadFeed: 90/90 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 330/342 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/347 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/358 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 597/955 variables, 358/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/955 variables, 90/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/955 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/955 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/955 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 955/955 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1181 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 358/358 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2174ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 12 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 597/597 transitions.
Applied a total of 0 rules in 36 ms. Remains 358 /358 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 358/358 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 597/597 transitions.
Applied a total of 0 rules in 42 ms. Remains 358 /358 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2024-06-01 16:34:20] [INFO ] Invariant cache hit.
[2024-06-01 16:34:21] [INFO ] Implicit Places using invariants in 1058 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 357/358 places, 597/597 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 357 transition count 518
Reduce places removed 79 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 89 rules applied. Total rules applied 168 place count 278 transition count 508
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 178 place count 268 transition count 508
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 188 place count 268 transition count 498
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 198 place count 258 transition count 498
Applied a total of 198 rules in 62 ms. Remains 258 /357 variables (removed 99) and now considering 498/597 (removed 99) transitions.
// Phase 1: matrix 498 rows 258 cols
[2024-06-01 16:34:22] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 16:34:22] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-06-01 16:34:22] [INFO ] Invariant cache hit.
[2024-06-01 16:34:23] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:34:24] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 258/358 places, 498/597 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3254 ms. Remains : 258/358 places, 498/597 transitions.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 871100 steps, run timeout after 3001 ms. (steps per millisecond=290 ) properties seen :0 out of 1
Probabilistic random walk after 871100 steps, saw 607398 distinct states, run finished after 3001 ms. (steps per millisecond=290 ) properties seen :0
[2024-06-01 16:34:27] [INFO ] Invariant cache hit.
[2024-06-01 16:34:27] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/234 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/239 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/258 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 498/756 variables, 258/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/756 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 756/756 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 258/258 constraints, ReadFeed: 90/90 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 222/234 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/239 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/258 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 498/756 variables, 258/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 90/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/756 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/756 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 756/756 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 777 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 258/258 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1149ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 12 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 498/498 transitions.
Applied a total of 0 rules in 32 ms. Remains 258 /258 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 258/258 places, 498/498 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 498/498 transitions.
Applied a total of 0 rules in 17 ms. Remains 258 /258 variables (removed 0) and now considering 498/498 (removed 0) transitions.
[2024-06-01 16:34:28] [INFO ] Invariant cache hit.
[2024-06-01 16:34:28] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-01 16:34:28] [INFO ] Invariant cache hit.
[2024-06-01 16:34:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-06-01 16:34:30] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1571 ms to find 0 implicit places.
[2024-06-01 16:34:30] [INFO ] Redundant transitions in 39 ms returned []
Running 488 sub problems to find dead transitions.
[2024-06-01 16:34:30] [INFO ] Invariant cache hit.
[2024-06-01 16:34:30] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 101 places in 200 ms of which 3 ms to minimize.
[2024-06-01 16:34:37] [INFO ] Deduced a trap composed of 99 places in 178 ms of which 4 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 75 places in 353 ms of which 4 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 101 places in 381 ms of which 5 ms to minimize.
[2024-06-01 16:34:38] [INFO ] Deduced a trap composed of 93 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:34:39] [INFO ] Deduced a trap composed of 97 places in 284 ms of which 5 ms to minimize.
[2024-06-01 16:34:39] [INFO ] Deduced a trap composed of 83 places in 271 ms of which 4 ms to minimize.
[2024-06-01 16:34:39] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 5 ms to minimize.
[2024-06-01 16:34:39] [INFO ] Deduced a trap composed of 96 places in 228 ms of which 5 ms to minimize.
[2024-06-01 16:34:40] [INFO ] Deduced a trap composed of 101 places in 277 ms of which 4 ms to minimize.
[2024-06-01 16:34:40] [INFO ] Deduced a trap composed of 119 places in 323 ms of which 4 ms to minimize.
[2024-06-01 16:34:40] [INFO ] Deduced a trap composed of 97 places in 271 ms of which 5 ms to minimize.
[2024-06-01 16:34:41] [INFO ] Deduced a trap composed of 102 places in 334 ms of which 5 ms to minimize.
[2024-06-01 16:34:41] [INFO ] Deduced a trap composed of 67 places in 350 ms of which 4 ms to minimize.
[2024-06-01 16:34:41] [INFO ] Deduced a trap composed of 92 places in 315 ms of which 5 ms to minimize.
[2024-06-01 16:34:42] [INFO ] Deduced a trap composed of 101 places in 322 ms of which 4 ms to minimize.
[2024-06-01 16:34:42] [INFO ] Deduced a trap composed of 65 places in 318 ms of which 5 ms to minimize.
[2024-06-01 16:34:42] [INFO ] Deduced a trap composed of 89 places in 342 ms of which 5 ms to minimize.
[2024-06-01 16:34:43] [INFO ] Deduced a trap composed of 90 places in 339 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-06-01 16:34:48] [INFO ] Deduced a trap composed of 87 places in 340 ms of which 5 ms to minimize.
[2024-06-01 16:34:48] [INFO ] Deduced a trap composed of 79 places in 328 ms of which 4 ms to minimize.
[2024-06-01 16:34:48] [INFO ] Deduced a trap composed of 78 places in 326 ms of which 4 ms to minimize.
[2024-06-01 16:34:49] [INFO ] Deduced a trap composed of 114 places in 326 ms of which 5 ms to minimize.
[2024-06-01 16:34:49] [INFO ] Deduced a trap composed of 100 places in 286 ms of which 4 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 106 places in 333 ms of which 5 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 88 places in 324 ms of which 5 ms to minimize.
[2024-06-01 16:34:50] [INFO ] Deduced a trap composed of 77 places in 317 ms of which 5 ms to minimize.
[2024-06-01 16:34:51] [INFO ] Deduced a trap composed of 110 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:34:51] [INFO ] Deduced a trap composed of 104 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:34:51] [INFO ] Deduced a trap composed of 106 places in 304 ms of which 5 ms to minimize.
[2024-06-01 16:34:52] [INFO ] Deduced a trap composed of 96 places in 316 ms of which 4 ms to minimize.
[2024-06-01 16:34:52] [INFO ] Deduced a trap composed of 100 places in 308 ms of which 5 ms to minimize.
[2024-06-01 16:34:52] [INFO ] Deduced a trap composed of 94 places in 294 ms of which 4 ms to minimize.
[2024-06-01 16:34:52] [INFO ] Deduced a trap composed of 111 places in 327 ms of which 4 ms to minimize.
[2024-06-01 16:34:53] [INFO ] Deduced a trap composed of 89 places in 317 ms of which 6 ms to minimize.
[2024-06-01 16:34:53] [INFO ] Deduced a trap composed of 111 places in 323 ms of which 5 ms to minimize.
[2024-06-01 16:34:53] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 4 ms to minimize.
[2024-06-01 16:34:54] [INFO ] Deduced a trap composed of 83 places in 330 ms of which 4 ms to minimize.
[2024-06-01 16:34:54] [INFO ] Deduced a trap composed of 82 places in 292 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/756 variables, and 61 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/258 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 40/61 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/756 variables, and 61 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/11 constraints, State Equation: 0/258 constraints, ReadFeed: 0/90 constraints, PredecessorRefiner: 0/488 constraints, Known Traps: 40/40 constraints]
After SMT, in 60664ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62321 ms. Remains : 258/258 places, 498/498 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 98 Pre rules applied. Total rules applied 0 place count 258 transition count 400
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 160 transition count 400
Applied a total of 196 rules in 15 ms. Remains 160 /258 variables (removed 98) and now considering 400/498 (removed 98) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 400 rows 160 cols
[2024-06-01 16:35:30] [INFO ] Computed 22 invariants in 6 ms
[2024-06-01 16:35:30] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-01 16:35:30] [INFO ] [Real]Absence check using 11 positive and 11 generalized place invariants in 47 ms returned sat
[2024-06-01 16:35:30] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 16:35:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-01 16:35:31] [INFO ] [Nat]Absence check using 11 positive and 11 generalized place invariants in 23 ms returned sat
[2024-06-01 16:35:31] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 16:35:31] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 16:35:31] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 665 ms.
[2024-06-01 16:35:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 16:35:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 258 places, 498 transitions and 1976 arcs took 14 ms.
[2024-06-01 16:35:31] [INFO ] Flatten gal took : 174 ms
Total runtime 91863 ms.
There are residual formulas that ITS could not solve within timeout
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 : Anderson-PT-10-ReachabilityCardinality-2024-07

BK_STOP 1717259732385

--------------------
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 Anderson-PT-10-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/707/inv_0_
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="Anderson-PT-10"
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 Anderson-PT-10, 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 r464-smll-171620118400366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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