Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717200607.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717200607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 20:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 20:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 20:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 20:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 20:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 92K Mar 5 18:23 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 ShieldPPPt-PT-005B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679461800083

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-005B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:10:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 05:10:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:10:03] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-22 05:10:03] [INFO ] Transformed 393 places.
[2023-03-22 05:10:03] [INFO ] Transformed 358 transitions.
[2023-03-22 05:10:03] [INFO ] Found NUPN structural information;
[2023-03-22 05:10:03] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 358 rows 393 cols
[2023-03-22 05:10:04] [INFO ] Computed 56 place invariants in 15 ms
[2023-03-22 05:10:05] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 05:10:05] [INFO ] [Nat]Absence check using 56 positive place invariants in 50 ms returned sat
[2023-03-22 05:10:05] [INFO ] After 308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 05:10:06] [INFO ] Deduced a trap composed of 18 places in 355 ms of which 20 ms to minimize.
[2023-03-22 05:10:06] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 7 ms to minimize.
[2023-03-22 05:10:06] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2023-03-22 05:10:06] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 14 ms to minimize.
[2023-03-22 05:10:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-22 05:10:06] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 0 ms to minimize.
[2023-03-22 05:10:07] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 0 ms to minimize.
[2023-03-22 05:10:07] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2023-03-22 05:10:07] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-22 05:10:07] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-22 05:10:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1690 ms
[2023-03-22 05:10:08] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 0 ms to minimize.
[2023-03-22 05:10:08] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 1 ms to minimize.
[2023-03-22 05:10:08] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-22 05:10:08] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-22 05:10:08] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 9 ms to minimize.
[2023-03-22 05:10:08] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 13 ms to minimize.
[2023-03-22 05:10:09] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2023-03-22 05:10:09] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2023-03-22 05:10:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1538 ms
[2023-03-22 05:10:09] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 1 ms to minimize.
[2023-03-22 05:10:09] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 29 ms to minimize.
[2023-03-22 05:10:09] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-22 05:10:09] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 13 ms to minimize.
[2023-03-22 05:10:10] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2023-03-22 05:10:10] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
[2023-03-22 05:10:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1118 ms
[2023-03-22 05:10:10] [INFO ] After 4988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-22 05:10:10] [INFO ] After 5522ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 86 ms.
Support contains 66 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 358/358 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 393 transition count 305
Reduce places removed 53 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 69 rules applied. Total rules applied 122 place count 340 transition count 289
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 139 place count 324 transition count 288
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 139 place count 324 transition count 267
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 181 place count 303 transition count 267
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 205 place count 279 transition count 243
Iterating global reduction 3 with 24 rules applied. Total rules applied 229 place count 279 transition count 243
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 229 place count 279 transition count 236
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 243 place count 272 transition count 236
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 357 place count 215 transition count 179
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 367 place count 210 transition count 179
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 370 place count 210 transition count 176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 373 place count 207 transition count 176
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 380 place count 207 transition count 176
Applied a total of 380 rules in 120 ms. Remains 207 /393 variables (removed 186) and now considering 176/358 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 207/393 places, 176/358 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :1
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 176 rows 207 cols
[2023-03-22 05:10:11] [INFO ] Computed 56 place invariants in 4 ms
[2023-03-22 05:10:11] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:10:11] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-22 05:10:11] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:10:11] [INFO ] After 95ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:11] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-22 05:10:11] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-22 05:10:11] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-22 05:10:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2023-03-22 05:10:12] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2023-03-22 05:10:12] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-22 05:10:12] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-22 05:10:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2023-03-22 05:10:12] [INFO ] After 755ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-22 05:10:12] [INFO ] After 1229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 63 out of 207 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 207/207 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 207 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 206 transition count 175
Applied a total of 2 rules in 7 ms. Remains 206 /207 variables (removed 1) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 206/207 places, 175/176 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 293022 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293022 steps, saw 205752 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 175 rows 206 cols
[2023-03-22 05:10:15] [INFO ] Computed 56 place invariants in 2 ms
[2023-03-22 05:10:15] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:10:15] [INFO ] [Nat]Absence check using 56 positive place invariants in 12 ms returned sat
[2023-03-22 05:10:16] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:10:16] [INFO ] After 138ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:16] [INFO ] Deduced a trap composed of 6 places in 105 ms of which 27 ms to minimize.
[2023-03-22 05:10:16] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-22 05:10:16] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 27 ms to minimize.
[2023-03-22 05:10:16] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 26 ms to minimize.
[2023-03-22 05:10:16] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 14 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1042 ms
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 17 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-22 05:10:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 500 ms
[2023-03-22 05:10:17] [INFO ] After 1794ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 195 ms.
[2023-03-22 05:10:18] [INFO ] After 2327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 26 ms.
Support contains 63 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 175/175 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 175/175 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-22 05:10:18] [INFO ] Invariant cache hit.
[2023-03-22 05:10:18] [INFO ] Implicit Places using invariants in 615 ms returned []
[2023-03-22 05:10:18] [INFO ] Invariant cache hit.
[2023-03-22 05:10:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-22 05:10:19] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-22 05:10:19] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 05:10:19] [INFO ] Invariant cache hit.
[2023-03-22 05:10:19] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1359 ms. Remains : 206/206 places, 175/175 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 206 transition count 175
Applied a total of 8 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 175 rows 206 cols
[2023-03-22 05:10:19] [INFO ] Computed 56 place invariants in 1 ms
[2023-03-22 05:10:19] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 05:10:19] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-22 05:10:19] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 05:10:19] [INFO ] After 142ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:19] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 0 ms to minimize.
[2023-03-22 05:10:20] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-22 05:10:20] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-22 05:10:20] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
[2023-03-22 05:10:20] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 1 ms to minimize.
[2023-03-22 05:10:20] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 38 ms to minimize.
[2023-03-22 05:10:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 631 ms
[2023-03-22 05:10:20] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 12 places in 535 ms of which 2 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 0 ms to minimize.
[2023-03-22 05:10:21] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 0 ms to minimize.
[2023-03-22 05:10:22] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2023-03-22 05:10:22] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-22 05:10:22] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 6 ms to minimize.
[2023-03-22 05:10:22] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-22 05:10:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1850 ms
[2023-03-22 05:10:22] [INFO ] After 2730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-22 05:10:22] [INFO ] After 3106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 05:10:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 18 ms.
[2023-03-22 05:10:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 175 transitions and 571 arcs took 2 ms.
[2023-03-22 05:10:23] [INFO ] Flatten gal took : 72 ms
Total runtime 19660 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/698/inv_0_ --invariant=/tmp/698/inv_1_ --inv-par
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679461828151

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldPPPt-PT-005B-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/698/inv_0_
rfs formula name ShieldPPPt-PT-005B-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/698/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 206 places, 175 transitions and 571 arcs
pnml2lts-sym: Petri net ShieldPPPt_PT_005B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 175->164 groups
pnml2lts-sym: Regrouping took 0.040 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 206; there are 164 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/698/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/698/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 4.520 real 17.970 user 0.000 sys
pnml2lts-sym: max token count: 1

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="ShieldPPPt-PT-005B"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-005B, 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 r393-oct2-167903717200607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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