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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 23:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 22:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 22:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 265K 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 ShieldIIPt-PT-050A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldIIPt-PT-050A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717239255186

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:54:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:54:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:54:16] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-01 10:54:16] [INFO ] Transformed 953 places.
[2024-06-01 10:54:16] [INFO ] Transformed 703 transitions.
[2024-06-01 10:54:16] [INFO ] Found NUPN structural information;
[2024-06-01 10:54:16] [INFO ] Parsed PT model containing 953 places and 703 transitions and 3006 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3384 ms. (11 steps per ms) remains 9/13 properties
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 379 ms. (105 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 733 ms. (54 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1286 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 9/9 properties
// Phase 1: matrix 702 rows 953 cols
[2024-06-01 10:54:19] [INFO ] Computed 451 invariants in 21 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 138/267 variables, 120/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 138/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 686/953 variables, 331/718 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 686/1404 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1655 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1655/1655 variables, and 2357 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1573 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 138/267 variables, 120/249 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 138/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 686/953 variables, 331/718 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 686/1404 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/953 variables, 0/1404 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 702/1655 variables, 953/2357 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1655 variables, 9/2366 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1655 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1655 variables, 0/2366 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1655/1655 variables, and 2366 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3260 ms.
Refiners :[Domain max(s): 953/953 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 953/953 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 4973ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 31690 ms.
Support contains 127 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 702/702 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 701
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 701
Partial Free-agglomeration rule applied 71 times.
Drop transitions (Partial Free agglomeration) removed 71 transitions
Iterating global reduction 0 with 71 rules applied. Total rules applied 73 place count 952 transition count 701
Applied a total of 73 rules in 164 ms. Remains 952 /953 variables (removed 1) and now considering 701/702 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 952/953 places, 701/702 transitions.
RANDOM walk for 40000 steps (8 resets) in 1081 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 145734 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :5 out of 8
Probabilistic random walk after 145734 steps, saw 143822 distinct states, run finished after 3006 ms. (steps per millisecond=48 ) properties seen :5
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 701 rows 952 cols
[2024-06-01 10:55:00] [INFO ] Computed 451 invariants in 4 ms
[2024-06-01 10:55:00] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 79/141 variables, 63/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 79/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 811/952 variables, 388/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 811/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 701/1653 variables, 952/2355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 38/2393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 0/2393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1653 variables, 0/2393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1653/1653 variables, and 2393 constraints, problems are : Problem set: 0 solved, 3 unsolved in 685 ms.
Refiners :[Domain max(s): 952/952 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 952/952 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 79/141 variables, 63/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 79/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 811/952 variables, 388/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 811/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/1403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 701/1653 variables, 952/2355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1653 variables, 38/2393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1653 variables, 3/2396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1653 variables, 0/2396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1653 variables, 0/2396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1653/1653 variables, and 2396 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1436 ms.
Refiners :[Domain max(s): 952/952 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 952/952 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2157ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldIIPt-PT-050A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 9150 ms.
Support contains 53 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 701/701 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 700
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 951 transition count 700
Applied a total of 20 rules in 225 ms. Remains 951 /952 variables (removed 1) and now considering 700/701 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 951/952 places, 700/701 transitions.
RANDOM walk for 40000 steps (8 resets) in 478 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 295951 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 295951 steps, saw 290425 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
// Phase 1: matrix 700 rows 951 cols
[2024-06-01 10:55:14] [INFO ] Computed 451 invariants in 4 ms
[2024-06-01 10:55:14] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/122 variables, 55/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 829/951 variables, 396/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 829/1402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 700/1651 variables, 951/2353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1651 variables, 48/2401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1651 variables, 0/2401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1651 variables, 0/2401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1651/1651 variables, and 2401 constraints, problems are : Problem set: 0 solved, 1 unsolved in 489 ms.
Refiners :[Domain max(s): 951/951 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 951/951 constraints, ReadFeed: 48/48 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/53 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 69/122 variables, 55/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 69/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 829/951 variables, 396/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 829/1402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/951 variables, 0/1402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 700/1651 variables, 951/2353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1651 variables, 48/2401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1651 variables, 1/2402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1651 variables, 0/2402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1651 variables, 0/2402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1651/1651 variables, and 2402 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1214 ms.
Refiners :[Domain max(s): 951/951 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 951/951 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1730ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2430 ms.
Support contains 53 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 27 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 951/951 places, 700/700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 700/700 transitions.
Applied a total of 0 rules in 25 ms. Remains 951 /951 variables (removed 0) and now considering 700/700 (removed 0) transitions.
[2024-06-01 10:55:18] [INFO ] Invariant cache hit.
[2024-06-01 10:55:19] [INFO ] Implicit Places using invariants in 544 ms returned [943, 944]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 552 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 949/951 places, 700/700 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 949 transition count 699
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 948 transition count 699
Applied a total of 2 rules in 29 ms. Remains 948 /949 variables (removed 1) and now considering 699/700 (removed 1) transitions.
// Phase 1: matrix 699 rows 948 cols
[2024-06-01 10:55:19] [INFO ] Computed 449 invariants in 10 ms
[2024-06-01 10:55:20] [INFO ] Implicit Places using invariants in 531 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 532 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 947/951 places, 699/700 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 698
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 698
Applied a total of 2 rules in 65 ms. Remains 946 /947 variables (removed 1) and now considering 698/699 (removed 1) transitions.
// Phase 1: matrix 698 rows 946 cols
[2024-06-01 10:55:20] [INFO ] Computed 448 invariants in 3 ms
[2024-06-01 10:55:20] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-06-01 10:55:20] [INFO ] Invariant cache hit.
[2024-06-01 10:55:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 10:55:22] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 946/951 places, 698/700 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3105 ms. Remains : 946/951 places, 698/700 transitions.
RANDOM walk for 40000 steps (8 resets) in 350 ms. (113 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 297908 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 297908 steps, saw 292364 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
[2024-06-01 10:55:25] [INFO ] Invariant cache hit.
[2024-06-01 10:55:25] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/122 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 824/946 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 698/1644 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1644 variables, 45/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1644 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1644 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1644/1644 variables, and 1439 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 946/946 constraints, ReadFeed: 45/45 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/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 69/122 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 824/946 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 698/1644 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1644 variables, 45/1439 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1644 variables, 1/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1644 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1644 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1644/1644 variables, and 1440 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 946/946 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1539ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1961 ms.
Support contains 53 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 24 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 946/946 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 698/698 transitions.
Applied a total of 0 rules in 22 ms. Remains 946 /946 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2024-06-01 10:55:28] [INFO ] Invariant cache hit.
[2024-06-01 10:55:29] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-06-01 10:55:29] [INFO ] Invariant cache hit.
[2024-06-01 10:55:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 10:55:30] [INFO ] Implicit Places using invariants and state equation in 1393 ms returned []
Implicit Place search using SMT with State Equation took 1860 ms to find 0 implicit places.
[2024-06-01 10:55:30] [INFO ] Redundant transitions in 42 ms returned []
Running 697 sub problems to find dead transitions.
[2024-06-01 10:55:30] [INFO ] Invariant cache hit.
[2024-06-01 10:55:30] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (OVERLAPS) 1/946 variables, 448/448 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (OVERLAPS) 698/1644 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 697 unsolved
SMT process timed out in 30213ms, After SMT, problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 30222ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32162 ms. Remains : 946/946 places, 698/698 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 40 times.
Drop transitions (Partial Free agglomeration) removed 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 946 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 946 transition count 658
Applied a total of 80 rules in 86 ms. Remains 946 /946 variables (removed 0) and now considering 658/698 (removed 40) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 658 rows 946 cols
[2024-06-01 10:56:01] [INFO ] Computed 448 invariants in 3 ms
[2024-06-01 10:56:01] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:56:01] [INFO ] [Nat]Absence check using 448 positive place invariants in 58 ms returned sat
[2024-06-01 10:56:01] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:56:01] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:56:02] [INFO ] After 887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1130 ms.
[2024-06-01 10:56:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 10:56:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 946 places, 698 transitions and 3205 arcs took 22 ms.
[2024-06-01 10:56:02] [INFO ] Flatten gal took : 156 ms
Total runtime 106085 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 : ShieldIIPt-PT-050A-ReachabilityCardinality-2024-09

BK_STOP 1717239362684

--------------------
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 ShieldIIPt-PT-050A-ReachabilityCardinality-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/619/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="ShieldIIPt-PT-050A"
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 ShieldIIPt-PT-050A, 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-171683760800326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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