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-167903716700167.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 ShieldIIPs-PT-100A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 868K 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 ShieldIIPs-PT-100A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-100A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679431713242

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=ShieldIIPs-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:48:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 20:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:48:36] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2023-03-21 20:48:36] [INFO ] Transformed 2503 places.
[2023-03-21 20:48:36] [INFO ] Transformed 2403 transitions.
[2023-03-21 20:48:36] [INFO ] Found NUPN structural information;
[2023-03-21 20:48:36] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 306 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 677 ms. (steps per millisecond=14 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:48:38] [INFO ] Computed 901 place invariants in 25 ms
[2023-03-21 20:48:40] [INFO ] [Real]Absence check using 901 positive place invariants in 525 ms returned sat
[2023-03-21 20:48:40] [INFO ] After 1661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 20:48:41] [INFO ] [Nat]Absence check using 901 positive place invariants in 335 ms returned sat
[2023-03-21 20:48:58] [INFO ] After 15977ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-21 20:48:58] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 16 ms to minimize.
[2023-03-21 20:48:59] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 1 ms to minimize.
[2023-03-21 20:48:59] [INFO ] Deduced a trap composed of 24 places in 221 ms of which 1 ms to minimize.
[2023-03-21 20:48:59] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 0 ms to minimize.
[2023-03-21 20:48:59] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 2 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2126 ms
[2023-03-21 20:49:05] [INFO ] After 23494ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-21 20:49:05] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldIIPs-PT-100A-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 2779 ms.
Support contains 217 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 590 times.
Drop transitions removed 590 transitions
Iterating global reduction 0 with 590 rules applied. Total rules applied 594 place count 2501 transition count 2401
Applied a total of 594 rules in 577 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 99472 steps, run timeout after 6002 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 99472 steps, saw 95442 distinct states, run finished after 6003 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:49:17] [INFO ] Computed 901 place invariants in 46 ms
[2023-03-21 20:49:19] [INFO ] [Real]Absence check using 873 positive place invariants in 740 ms returned sat
[2023-03-21 20:49:19] [INFO ] [Real]Absence check using 873 positive and 28 generalized place invariants in 198 ms returned sat
[2023-03-21 20:49:19] [INFO ] After 1854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 20:49:20] [INFO ] [Nat]Absence check using 873 positive place invariants in 318 ms returned sat
[2023-03-21 20:49:20] [INFO ] [Nat]Absence check using 873 positive and 28 generalized place invariants in 6 ms returned sat
[2023-03-21 20:49:42] [INFO ] After 21403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:49:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:49:44] [INFO ] After 2319ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-21 20:49:44] [INFO ] After 2331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 20:49:44] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1999 ms.
Support contains 217 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 100 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 90 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:49:46] [INFO ] Invariant cache hit.
[2023-03-21 20:49:49] [INFO ] Implicit Places using invariants in 2321 ms returned []
[2023-03-21 20:49:49] [INFO ] Invariant cache hit.
[2023-03-21 20:49:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:49:55] [INFO ] Implicit Places using invariants and state equation in 6752 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9083 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 92 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9266 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 59371 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59371 steps, saw 56255 distinct states, run finished after 3002 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:50:00] [INFO ] Computed 900 place invariants in 47 ms
[2023-03-21 20:50:01] [INFO ] [Real]Absence check using 872 positive place invariants in 242 ms returned sat
[2023-03-21 20:50:01] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 7 ms returned sat
[2023-03-21 20:50:01] [INFO ] After 1047ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 20:50:02] [INFO ] [Nat]Absence check using 872 positive place invariants in 341 ms returned sat
[2023-03-21 20:50:02] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 46 ms returned sat
[2023-03-21 20:50:18] [INFO ] After 15244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:50:18] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 1 ms to minimize.
[2023-03-21 20:50:19] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2023-03-21 20:50:19] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 1 ms to minimize.
[2023-03-21 20:50:19] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 18 places in 179 ms of which 1 ms to minimize.
[2023-03-21 20:50:20] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 1 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-21 20:50:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3414 ms
[2023-03-21 20:50:26] [INFO ] After 23159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-21 20:50:26] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1415 ms.
Support contains 217 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:50:27] [INFO ] Invariant cache hit.
[2023-03-21 20:50:30] [INFO ] Implicit Places using invariants in 2735 ms returned []
[2023-03-21 20:50:30] [INFO ] Invariant cache hit.
[2023-03-21 20:50:36] [INFO ] Implicit Places using invariants and state equation in 5778 ms returned []
Implicit Place search using SMT with State Equation took 8540 ms to find 0 implicit places.
[2023-03-21 20:50:36] [INFO ] Redundant transitions in 433 ms returned []
[2023-03-21 20:50:36] [INFO ] Invariant cache hit.
[2023-03-21 20:50:38] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10672 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 112 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-21 20:50:38] [INFO ] Invariant cache hit.
[2023-03-21 20:50:40] [INFO ] [Real]Absence check using 872 positive place invariants in 338 ms returned sat
[2023-03-21 20:50:40] [INFO ] [Real]Absence check using 872 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-21 20:50:40] [INFO ] After 1411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 20:50:41] [INFO ] [Nat]Absence check using 872 positive place invariants in 416 ms returned sat
[2023-03-21 20:50:41] [INFO ] [Nat]Absence check using 872 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-21 20:51:07] [INFO ] After 26016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2023-03-21 20:51:09] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Deduced a trap composed of 5 places in 469 ms of which 13 ms to minimize.
[2023-03-21 20:51:10] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2023-03-21 20:51:11] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:51:12] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 0 ms to minimize.
[2023-03-21 20:51:13] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
[2023-03-21 20:51:13] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 1 ms to minimize.
[2023-03-21 20:51:13] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-21 20:51:14] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2023-03-21 20:51:14] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-21 20:51:14] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2023-03-21 20:51:15] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 0 ms to minimize.
[2023-03-21 20:51:15] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 0 ms to minimize.
[2023-03-21 20:51:16] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 26 ms to minimize.
[2023-03-21 20:51:16] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-21 20:51:16] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-21 20:51:16] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-21 20:51:17] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 0 ms to minimize.
[2023-03-21 20:51:17] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-21 20:51:17] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 14 ms to minimize.
[2023-03-21 20:51:20] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 0 ms to minimize.
[2023-03-21 20:51:21] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 0 ms to minimize.
[2023-03-21 20:51:21] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 13 ms to minimize.
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2023-03-21 20:51:22] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-21 20:51:23] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 5 places in 228 ms of which 0 ms to minimize.
[2023-03-21 20:51:24] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 14 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 5 places in 252 ms of which 0 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-21 20:51:25] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 2 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2023-03-21 20:51:26] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 1 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2023-03-21 20:51:27] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 18308 ms
[2023-03-21 20:51:32] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-21 20:51:33] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-21 20:51:33] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-21 20:51:33] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 27 ms to minimize.
[2023-03-21 20:51:33] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-21 20:51:34] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 14 ms to minimize.
[2023-03-21 20:51:34] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-21 20:51:35] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 13 ms to minimize.
[2023-03-21 20:51:35] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 22 ms to minimize.
[2023-03-21 20:51:35] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 13 ms to minimize.
[2023-03-21 20:51:35] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2023-03-21 20:51:36] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:51:36] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2023-03-21 20:51:36] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-21 20:51:37] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2023-03-21 20:51:37] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2023-03-21 20:51:37] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-21 20:51:38] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 0 ms to minimize.
[2023-03-21 20:51:38] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-21 20:51:38] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5903 ms
[2023-03-21 20:51:44] [INFO ] Deduced a trap composed of 10 places in 499 ms of which 0 ms to minimize.
[2023-03-21 20:51:49] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2023-03-21 20:51:50] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 1 ms to minimize.
[2023-03-21 20:51:51] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2023-03-21 20:51:51] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-21 20:51:51] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 1 ms to minimize.
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-21 20:51:52] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2023-03-21 20:51:53] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 9 places in 491 ms of which 1 ms to minimize.
[2023-03-21 20:51:54] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 1 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2023-03-21 20:51:55] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-21 20:51:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 12339 ms
[2023-03-21 20:51:56] [INFO ] After 74273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9395 ms.
[2023-03-21 20:52:05] [INFO ] After 85359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 20:52:05] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 27 ms.
[2023-03-21 20:52:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2401 transitions and 12067 arcs took 23 ms.
[2023-03-21 20:52:06] [INFO ] Flatten gal took : 437 ms
Total runtime 209957 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/819/inv_0_ --invariant=/tmp/819/inv_1_ --invariant=/tmp/819/inv_2_ --invariant=/tmp/819/inv_3_ --invariant=/tmp/819/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11443080 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16093792 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.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

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-100A"
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 ShieldIIPs-PT-100A, 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-167903716700167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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