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-167903716800270.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 ShieldIIPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800270
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 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.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 167K 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 ShieldIIPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679435841176

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:57:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 21:57:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:57:24] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-21 21:57:24] [INFO ] Transformed 703 places.
[2023-03-21 21:57:24] [INFO ] Transformed 653 transitions.
[2023-03-21 21:57:24] [INFO ] Found NUPN structural information;
[2023-03-21 21:57:24] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 14) seen :8
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-21 21:57:25] [INFO ] Computed 91 place invariants in 34 ms
[2023-03-21 21:57:26] [INFO ] After 648ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 21:57:26] [INFO ] [Nat]Absence check using 91 positive place invariants in 36 ms returned sat
[2023-03-21 21:57:27] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-21 21:57:28] [INFO ] Deduced a trap composed of 30 places in 319 ms of which 9 ms to minimize.
[2023-03-21 21:57:28] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2023-03-21 21:57:28] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 0 ms to minimize.
[2023-03-21 21:57:28] [INFO ] Deduced a trap composed of 24 places in 217 ms of which 2 ms to minimize.
[2023-03-21 21:57:28] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 1 ms to minimize.
[2023-03-21 21:57:29] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 1 ms to minimize.
[2023-03-21 21:57:29] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 2 ms to minimize.
[2023-03-21 21:57:29] [INFO ] Deduced a trap composed of 28 places in 155 ms of which 1 ms to minimize.
[2023-03-21 21:57:29] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 1 ms to minimize.
[2023-03-21 21:57:30] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2023-03-21 21:57:30] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2023-03-21 21:57:30] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 0 ms to minimize.
[2023-03-21 21:57:30] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 1 ms to minimize.
[2023-03-21 21:57:30] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-21 21:57:30] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2023-03-21 21:57:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3371 ms
[2023-03-21 21:57:31] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 0 ms to minimize.
[2023-03-21 21:57:31] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 1 ms to minimize.
[2023-03-21 21:57:31] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 1 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 0 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 2 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 1 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 0 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2370 ms
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 3 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 4 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 1 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 1 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1323 ms
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 21 places in 255 ms of which 1 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 0 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 0 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 32 places in 164 ms of which 13 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 0 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1268 ms
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 25 places in 140 ms of which 2 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1542 ms
[2023-03-21 21:57:37] [INFO ] After 11150ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 548 ms.
[2023-03-21 21:57:38] [INFO ] After 12099ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 143 ms.
Support contains 71 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 703 transition count 529
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 126 rules applied. Total rules applied 250 place count 579 transition count 527
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 264 place count 578 transition count 514
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 277 place count 565 transition count 514
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 45 Pre rules applied. Total rules applied 277 place count 565 transition count 469
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 367 place count 520 transition count 469
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 421 place count 466 transition count 415
Iterating global reduction 4 with 54 rules applied. Total rules applied 475 place count 466 transition count 415
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 475 place count 466 transition count 393
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 519 place count 444 transition count 393
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 4 with 284 rules applied. Total rules applied 803 place count 302 transition count 251
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 847 place count 280 transition count 260
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 849 place count 280 transition count 258
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 851 place count 278 transition count 258
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 857 place count 278 transition count 258
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 858 place count 277 transition count 257
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 860 place count 275 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 860 place count 275 transition count 256
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 862 place count 274 transition count 256
Applied a total of 862 rules in 140 ms. Remains 274 /703 variables (removed 429) and now considering 256/653 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 274/703 places, 256/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 256 rows 274 cols
[2023-03-21 21:57:39] [INFO ] Computed 89 place invariants in 1 ms
[2023-03-21 21:57:39] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 21:57:39] [INFO ] [Nat]Absence check using 89 positive place invariants in 13 ms returned sat
[2023-03-21 21:57:39] [INFO ] After 269ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 21:57:39] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-21 21:57:39] [INFO ] After 177ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 470 ms
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 0 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 827 ms
[2023-03-21 21:57:41] [INFO ] After 2202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-21 21:57:42] [INFO ] After 2754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 86 ms.
Support contains 69 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 256/256 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 274 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 273 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 272 transition count 254
Applied a total of 4 rules in 30 ms. Remains 272 /274 variables (removed 2) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 272/274 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 4) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 272 cols
[2023-03-21 21:57:42] [INFO ] Computed 89 place invariants in 2 ms
[2023-03-21 21:57:42] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:57:42] [INFO ] [Nat]Absence check using 89 positive place invariants in 38 ms returned sat
[2023-03-21 21:57:43] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 21:57:43] [INFO ] After 125ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 1 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 508 ms
[2023-03-21 21:57:43] [INFO ] After 833ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2023-03-21 21:57:44] [INFO ] After 1347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 54 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 254/254 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 253
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 271 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 270 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4 place count 270 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 10 place count 267 transition count 249
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 265 transition count 247
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 265 transition count 247
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 24 place count 260 transition count 242
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 28 place count 258 transition count 243
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 258 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 257 transition count 242
Applied a total of 30 rules in 48 ms. Remains 257 /272 variables (removed 15) and now considering 242/254 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 257/272 places, 242/254 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 301089 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301089 steps, saw 164065 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 242 rows 257 cols
[2023-03-21 21:57:47] [INFO ] Computed 89 place invariants in 1 ms
[2023-03-21 21:57:47] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:57:47] [INFO ] [Nat]Absence check using 89 positive place invariants in 13 ms returned sat
[2023-03-21 21:57:47] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:47] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-21 21:57:47] [INFO ] After 174ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:47] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 634 ms
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 25 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 0 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 391 ms
[2023-03-21 21:57:48] [INFO ] After 1313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-21 21:57:49] [INFO ] After 1605ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 54 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 257 /257 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 257/257 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 257 /257 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2023-03-21 21:57:49] [INFO ] Invariant cache hit.
[2023-03-21 21:57:49] [INFO ] Implicit Places using invariants in 155 ms returned [238]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 256/257 places, 242/242 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 255 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 255 transition count 241
Applied a total of 2 rules in 15 ms. Remains 255 /256 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 255 cols
[2023-03-21 21:57:49] [INFO ] Computed 88 place invariants in 2 ms
[2023-03-21 21:57:49] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-21 21:57:49] [INFO ] Invariant cache hit.
[2023-03-21 21:57:49] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 21:57:49] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/257 places, 241/242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 620 ms. Remains : 255/257 places, 241/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 322749 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 322749 steps, saw 176461 distinct states, run finished after 3002 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 21:57:52] [INFO ] Invariant cache hit.
[2023-03-21 21:57:52] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:57:53] [INFO ] [Nat]Absence check using 88 positive place invariants in 18 ms returned sat
[2023-03-21 21:57:53] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 21:57:53] [INFO ] After 173ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 0 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 676 ms
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 0 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 12 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-21 21:57:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 789 ms
[2023-03-21 21:57:55] [INFO ] After 1773ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 123 ms.
[2023-03-21 21:57:55] [INFO ] After 2187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 54 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 241/241 transitions.
Applied a total of 0 rules in 6 ms. Remains 255 /255 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 255/255 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 241/241 transitions.
Applied a total of 0 rules in 16 ms. Remains 255 /255 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2023-03-21 21:57:55] [INFO ] Invariant cache hit.
[2023-03-21 21:57:55] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-21 21:57:55] [INFO ] Invariant cache hit.
[2023-03-21 21:57:55] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-21 21:57:55] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-21 21:57:55] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-21 21:57:55] [INFO ] Invariant cache hit.
[2023-03-21 21:57:55] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 772 ms. Remains : 255/255 places, 241/241 transitions.
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 255 transition count 241
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 255 transition count 240
Applied a total of 20 rules in 14 ms. Remains 255 /255 variables (removed 0) and now considering 240/241 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 240 rows 255 cols
[2023-03-21 21:57:55] [INFO ] Computed 88 place invariants in 2 ms
[2023-03-21 21:57:56] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 21:57:56] [INFO ] [Nat]Absence check using 88 positive place invariants in 14 ms returned sat
[2023-03-21 21:57:56] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-21 21:57:56] [INFO ] After 104ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:56] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
[2023-03-21 21:57:56] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-03-21 21:57:56] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 606 ms
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 315 ms
[2023-03-21 21:57:57] [INFO ] After 1149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-21 21:57:57] [INFO ] After 1657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-21 21:57:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 17 ms.
[2023-03-21 21:57:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 255 places, 241 transitions and 966 arcs took 2 ms.
[2023-03-21 21:57:58] [INFO ] Flatten gal took : 107 ms
Total runtime 33599 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 --invariant=/tmp/824/inv_0_ --invariant=/tmp/824/inv_1_ --inv-par
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679435880512

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldIIPt-PT-010B-ReachabilityCardinality-08
rfs formula type EF
rfs formula formula --invariant=/tmp/824/inv_0_
rfs formula name ShieldIIPt-PT-010B-ReachabilityCardinality-15
rfs formula type EF
rfs formula formula --invariant=/tmp/824/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 255 places, 241 transitions and 966 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_010B 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: 241->176 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 255; there are 176 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: Exploration took 180992 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.670 real 6.690 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 2.01796789796872e+33 states, 3226 nodes
pnml2lts-sym: group_next: 1965 nodes total
pnml2lts-sym: group_explored: 1698 nodes, 1525 short vectors total
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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-010B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716800270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;