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-171683760400119.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 ShieldIIPs-PT-030A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K 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.6K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 11 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 11 15:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 15:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 253K 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 ShieldIIPs-PT-030A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717227875103

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:44:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:44:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:44:36] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-01 07:44:36] [INFO ] Transformed 753 places.
[2024-06-01 07:44:36] [INFO ] Transformed 723 transitions.
[2024-06-01 07:44:36] [INFO ] Found NUPN structural information;
[2024-06-01 07:44:36] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (24 resets) in 1799 ms. (22 steps per ms) remains 3/16 properties
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 516 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 826 ms. (48 steps per ms) remains 3/3 properties
// Phase 1: matrix 723 rows 753 cols
[2024-06-01 07:44:37] [INFO ] Computed 271 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 638/753 variables, 268/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 638/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 723/1476 variables, 753/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1476 variables, 0/1777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1476/1476 variables, and 1777 constraints, problems are : Problem set: 0 solved, 3 unsolved in 880 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 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/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 638/753 variables, 268/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/753 variables, 638/1024 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:44:39] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 12 ms to minimize.
[2024-06-01 07:44:39] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/753 variables, 2/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/753 variables, 0/1026 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 723/1476 variables, 753/1779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1476 variables, 3/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1476 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1476 variables, 0/1782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1476/1476 variables, and 1782 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2196 ms.
Refiners :[Domain max(s): 753/753 constraints, Positive P Invariants (semi-flows): 271/271 constraints, State Equation: 753/753 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 2/2 constraints]
After SMT, in 3213ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-03 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1628 ms.
Support contains 84 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 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 753 transition count 722
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 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 172 times.
Drop transitions (Partial Free agglomeration) removed 172 transitions
Iterating global reduction 0 with 172 rules applied. Total rules applied 176 place count 751 transition count 721
Applied a total of 176 rules in 164 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 751/753 places, 721/723 transitions.
RANDOM walk for 40000 steps (19 resets) in 1519 ms. (26 steps per ms) remains 1/2 properties
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
// Phase 1: matrix 721 rows 751 cols
[2024-06-01 07:44:43] [INFO ] Computed 271 invariants in 18 ms
[2024-06-01 07:44:43] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 719/731 variables, 258/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 719/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 4/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 0/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/751 variables, 10/1006 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/751 variables, 20/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:44:43] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 3/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 0/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 721/1472 variables, 751/1780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1472 variables, 4/1784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1472 variables, 0/1784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1472 variables, 0/1784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1472/1472 variables, and 1784 constraints, problems are : Problem set: 0 solved, 1 unsolved in 873 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 261/261 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 751/751 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/12 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 719/731 variables, 258/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 719/992 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 4/996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:44:44] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:44:44] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:44:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 3/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 0/999 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/751 variables, 10/1009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/751 variables, 20/1029 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/751 variables, 3/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:44:44] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/751 variables, 1/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/751 variables, 0/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 721/1472 variables, 751/1784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1472 variables, 4/1788 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1472 variables, 1/1789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:44:44] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 5 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:44:45] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:44:46] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:44:47] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:44:47] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:44:47] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1472 variables, 18/1807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1472 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1472 variables, 0/1807 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1472/1472 variables, and 1807 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3272 ms.
Refiners :[Domain max(s): 751/751 constraints, Positive P Invariants (semi-flows): 261/261 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 751/751 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 4176ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 157 ms.
Support contains 3 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 751 transition count 721
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 750 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 749 transition count 720
Applied a total of 36 rules in 106 ms. Remains 749 /751 variables (removed 2) and now considering 720/721 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 749/751 places, 720/721 transitions.
RANDOM walk for 24383 steps (5 resets) in 318 ms. (76 steps per ms) remains 0/1 properties
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 11595 ms.
ITS solved all properties within timeout

BK_STOP 1717227887880

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-030A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-030A, examination is ReachabilityFireability"
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-171683760400119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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