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.r528-tall-171683761300518.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 ShieldPPPs-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761300518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 13 13:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 13 13:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 907K 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 ShieldPPPs-PT-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717253752068

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:55:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:55:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:55:53] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2024-06-01 14:55:53] [INFO ] Transformed 3103 places.
[2024-06-01 14:55:53] [INFO ] Transformed 2603 transitions.
[2024-06-01 14:55:53] [INFO ] Found NUPN structural information;
[2024-06-01 14:55:53] [INFO ] Parsed PT model containing 3103 places and 2603 transitions and 10006 arcs in 432 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2362 ms. (16 steps per ms) remains 6/14 properties
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 762 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 600 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 954 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 593 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1331 ms. (30 steps per ms) remains 6/6 properties
// Phase 1: matrix 2603 rows 3103 cols
[2024-06-01 14:55:56] [INFO ] Computed 1101 invariants in 41 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 242/343 variables, 111/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 242/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2760/3103 variables, 990/1444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3103 variables, 2760/4204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3103 variables, 0/4204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2603/5706 variables, 3103/7307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5706 variables, 0/7307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/5706 variables, 0/7307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5706/5706 variables, and 7307 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3007 ms.
Refiners :[Domain max(s): 3103/3103 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 3103/3103 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 242/343 variables, 111/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 242/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2760/3103 variables, 990/1444 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3103 variables, 2760/4204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 14 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:56:00] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3103 variables, 4/4208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3103 variables, 0/4208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2603/5706 variables, 3103/7311 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5706 variables, 6/7317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5706/5706 variables, and 7317 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5023 ms.
Refiners :[Domain max(s): 3103/3103 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 3103/3103 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 8191ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 3103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3103/3103 places, 2603/2603 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 38 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 3101 transition count 2601
Partial Free-agglomeration rule applied 823 times.
Drop transitions (Partial Free agglomeration) removed 823 transitions
Iterating global reduction 0 with 823 rules applied. Total rules applied 827 place count 3101 transition count 2601
Applied a total of 827 rules in 827 ms. Remains 3101 /3103 variables (removed 2) and now considering 2601/2603 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 844 ms. Remains : 3101/3103 places, 2601/2603 transitions.
RANDOM walk for 40000 steps (8 resets) in 1462 ms. (27 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 588 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 528 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 549 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 513 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 556 ms. (71 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 83261 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 6
Probabilistic random walk after 83261 steps, saw 81450 distinct states, run finished after 3007 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 2601 rows 3101 cols
[2024-06-01 14:56:09] [INFO ] Computed 1101 invariants in 88 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 240/341 variables, 110/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 240/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2651/2992 variables, 936/1387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2992 variables, 2651/4038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2992 variables, 0/4038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 109/3101 variables, 55/4093 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3101 variables, 109/4202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 0/4202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2601/5702 variables, 3101/7303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5702 variables, 0/7303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/5702 variables, 0/7303 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5702/5702 variables, and 7303 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2983 ms.
Refiners :[Domain max(s): 3101/3101 constraints, Positive P Invariants (semi-flows): 1046/1046 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 3101/3101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 240/341 variables, 110/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 240/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/341 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2651/2992 variables, 936/1387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2992 variables, 2651/4038 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:56:13] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 3 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:56:14] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 14:56:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-06-01 14:56:15] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:56:15] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:56:15] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2992 variables, 18/4056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2992 variables, 0/4056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 109/3101 variables, 55/4111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3101 variables, 109/4220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 2 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:56:16] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/3101 variables, 8/4228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 14:56:17] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/3101 variables, 1/4229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3101 variables, 0/4229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2601/5702 variables, 3101/7330 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/5702 variables, 6/7336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5702/5702 variables, and 7336 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45029 ms.
Refiners :[Domain max(s): 3101/3101 constraints, Positive P Invariants (semi-flows): 1046/1046 constraints, Generalized P Invariants (flows): 55/55 constraints, State Equation: 3101/3101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 27/27 constraints]
After SMT, in 48179ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 3101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 164 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 3101/3101 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3101/3101 places, 2601/2601 transitions.
Applied a total of 0 rules in 160 ms. Remains 3101 /3101 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2024-06-01 14:56:57] [INFO ] Invariant cache hit.
[2024-06-01 14:57:00] [INFO ] Implicit Places using invariants in 2411 ms returned []
[2024-06-01 14:57:00] [INFO ] Invariant cache hit.
[2024-06-01 14:57:05] [INFO ] Implicit Places using invariants and state equation in 5489 ms returned []
Implicit Place search using SMT with State Equation took 7911 ms to find 0 implicit places.
[2024-06-01 14:57:05] [INFO ] Redundant transitions in 161 ms returned []
Running 2600 sub problems to find dead transitions.
[2024-06-01 14:57:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3100 variables, 3100/3100 constraints. Problems are: Problem set: 0 solved, 2600 unsolved
SMT process timed out in 31676ms, After SMT, problems are : Problem set: 0 solved, 2600 unsolved
Search for dead transitions found 0 dead transitions in 31709ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39973 ms. Remains : 3101/3101 places, 2601/2601 transitions.
[2024-06-01 14:57:37] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 14:57:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3101 places, 2601 transitions and 12278 arcs took 20 ms.
[2024-06-01 14:57:38] [INFO ] Flatten gal took : 424 ms
Total runtime 105213 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 : ShieldPPPs-PT-100A-ReachabilityCardinality-2024-00
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityCardinality-2024-03
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityCardinality-2024-04
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityCardinality-2024-05
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityCardinality-2024-08
Could not compute solution for formula : ShieldPPPs-PT-100A-ReachabilityCardinality-2024-14

BK_STOP 1717253858788

--------------------
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 ShieldPPPs-PT-100A-ReachabilityCardinality-2024-00
rfs formula type EF
rfs formula formula --invariant=/tmp/634/inv_0_
rfs formula name ShieldPPPs-PT-100A-ReachabilityCardinality-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/634/inv_1_
rfs formula name ShieldPPPs-PT-100A-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/634/inv_2_
rfs formula name ShieldPPPs-PT-100A-ReachabilityCardinality-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/634/inv_3_
rfs formula name ShieldPPPs-PT-100A-ReachabilityCardinality-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/634/inv_4_
rfs formula name ShieldPPPs-PT-100A-ReachabilityCardinality-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/634/inv_5_
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="ShieldPPPs-PT-100A"
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 ShieldPPPs-PT-100A, 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 r528-tall-171683761300518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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