fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597900431
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutoFlight-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
503.943 31118.00 58688.00 72.00 FFTTFTTFFFTFTTTT normal

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.r009-oct2-167813597900431.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 AutoFlight-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900431
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 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 AutoFlight-PT-04b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678627992604

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=AutoFlight-PT-04b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:33:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:33:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:33:16] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-12 13:33:16] [INFO ] Transformed 390 places.
[2023-03-12 13:33:16] [INFO ] Transformed 388 transitions.
[2023-03-12 13:33:16] [INFO ] Found NUPN structural information;
[2023-03-12 13:33:16] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 49 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-12 13:33:17] [INFO ] Computed 28 place invariants in 13 ms
[2023-03-12 13:33:18] [INFO ] After 547ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 13:33:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 27 ms returned sat
[2023-03-12 13:33:18] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 16 ms returned sat
[2023-03-12 13:33:19] [INFO ] After 846ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 13:33:20] [INFO ] Deduced a trap composed of 40 places in 444 ms of which 43 ms to minimize.
[2023-03-12 13:33:20] [INFO ] Deduced a trap composed of 34 places in 365 ms of which 1 ms to minimize.
[2023-03-12 13:33:20] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 16 ms to minimize.
[2023-03-12 13:33:20] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2023-03-12 13:33:21] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2023-03-12 13:33:21] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 2 ms to minimize.
[2023-03-12 13:33:21] [INFO ] Deduced a trap composed of 36 places in 142 ms of which 0 ms to minimize.
[2023-03-12 13:33:21] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 4 ms to minimize.
[2023-03-12 13:33:21] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2023-03-12 13:33:21] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 1 ms to minimize.
[2023-03-12 13:33:22] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 1 ms to minimize.
[2023-03-12 13:33:22] [INFO ] Deduced a trap composed of 44 places in 191 ms of which 1 ms to minimize.
[2023-03-12 13:33:22] [INFO ] Deduced a trap composed of 40 places in 155 ms of which 1 ms to minimize.
[2023-03-12 13:33:22] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 0 ms to minimize.
[2023-03-12 13:33:22] [INFO ] Deduced a trap composed of 91 places in 202 ms of which 1 ms to minimize.
[2023-03-12 13:33:23] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 1 ms to minimize.
[2023-03-12 13:33:23] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 13 ms to minimize.
[2023-03-12 13:33:23] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 1 ms to minimize.
[2023-03-12 13:33:23] [INFO ] Deduced a trap composed of 38 places in 152 ms of which 0 ms to minimize.
[2023-03-12 13:33:24] [INFO ] Deduced a trap composed of 61 places in 549 ms of which 1 ms to minimize.
[2023-03-12 13:33:24] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 1 ms to minimize.
[2023-03-12 13:33:24] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4730 ms
[2023-03-12 13:33:24] [INFO ] Deduced a trap composed of 56 places in 157 ms of which 1 ms to minimize.
[2023-03-12 13:33:25] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 1 ms to minimize.
[2023-03-12 13:33:25] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2023-03-12 13:33:25] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 1 ms to minimize.
[2023-03-12 13:33:25] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 0 ms to minimize.
[2023-03-12 13:33:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 740 ms
[2023-03-12 13:33:25] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2023-03-12 13:33:25] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 0 ms to minimize.
[2023-03-12 13:33:26] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 0 ms to minimize.
[2023-03-12 13:33:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 626 ms
[2023-03-12 13:33:26] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 13 ms to minimize.
[2023-03-12 13:33:26] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2023-03-12 13:33:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2023-03-12 13:33:26] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
[2023-03-12 13:33:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-12 13:33:26] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2023-03-12 13:33:26] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 13 ms to minimize.
[2023-03-12 13:33:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-03-12 13:33:27] [INFO ] After 8252ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 434 ms.
[2023-03-12 13:33:27] [INFO ] After 9067ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA AutoFlight-PT-04b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 6 different solutions.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 105 ms.
Support contains 87 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 390 transition count 309
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 86 rules applied. Total rules applied 165 place count 311 transition count 302
Reduce places removed 2 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 2 with 22 rules applied. Total rules applied 187 place count 309 transition count 282
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 212 place count 289 transition count 277
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 34 Pre rules applied. Total rules applied 212 place count 289 transition count 243
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 280 place count 255 transition count 243
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 308 place count 227 transition count 215
Iterating global reduction 4 with 28 rules applied. Total rules applied 336 place count 227 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 339 place count 227 transition count 212
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 339 place count 227 transition count 207
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 349 place count 222 transition count 207
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 413 place count 190 transition count 175
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 418 place count 190 transition count 170
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 425 place count 190 transition count 163
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 432 place count 183 transition count 163
Applied a total of 432 rules in 91 ms. Remains 183 /390 variables (removed 207) and now considering 163/388 (removed 225) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 183/390 places, 163/388 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 788911 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 788911 steps, saw 122141 distinct states, run finished after 3002 ms. (steps per millisecond=262 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 163 rows 183 cols
[2023-03-12 13:33:30] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 13:33:31] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 13:33:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-12 13:33:31] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 14 ms returned sat
[2023-03-12 13:33:31] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 13:33:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 13:33:31] [INFO ] After 125ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 13:33:31] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-12 13:33:31] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2023-03-12 13:33:31] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2023-03-12 13:33:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 320 ms
[2023-03-12 13:33:32] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2023-03-12 13:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-12 13:33:32] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-12 13:33:32] [INFO ] After 1278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA AutoFlight-PT-04b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 24 ms.
Support contains 79 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 163/163 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 183 transition count 162
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 182 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 180 transition count 160
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 180 transition count 158
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 178 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 177 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 177 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 16 place count 175 transition count 155
Applied a total of 16 rules in 15 ms. Remains 175 /183 variables (removed 8) and now considering 155/163 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 175/183 places, 155/163 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1810699 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :{1=1}
Probabilistic random walk after 1810699 steps, saw 259066 distinct states, run finished after 3002 ms. (steps per millisecond=603 ) properties seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 155 rows 175 cols
[2023-03-12 13:33:35] [INFO ] Computed 28 place invariants in 17 ms
[2023-03-12 13:33:35] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:33:35] [INFO ] [Nat]Absence check using 26 positive place invariants in 37 ms returned sat
[2023-03-12 13:33:35] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-12 13:33:35] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:33:35] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 13:33:36] [INFO ] After 98ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:33:36] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-12 13:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-12 13:33:36] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-12 13:33:36] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 78 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 155/155 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 174 transition count 154
Applied a total of 2 rules in 17 ms. Remains 174 /175 variables (removed 1) and now considering 154/155 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 174/175 places, 154/155 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1948412 steps, run timeout after 3001 ms. (steps per millisecond=649 ) properties seen :{}
Probabilistic random walk after 1948412 steps, saw 277235 distinct states, run finished after 3013 ms. (steps per millisecond=646 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 174 cols
[2023-03-12 13:33:39] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-12 13:33:39] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:33:39] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-12 13:33:39] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-12 13:33:39] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:33:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 13:33:39] [INFO ] After 107ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:33:40] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 1 ms to minimize.
[2023-03-12 13:33:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-12 13:33:40] [INFO ] After 442ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 136 ms.
[2023-03-12 13:33:40] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 78 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 154/154 transitions.
Applied a total of 0 rules in 10 ms. Remains 174 /174 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 174/174 places, 154/154 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 154/154 transitions.
Applied a total of 0 rules in 11 ms. Remains 174 /174 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-12 13:33:40] [INFO ] Invariant cache hit.
[2023-03-12 13:33:40] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-12 13:33:40] [INFO ] Invariant cache hit.
[2023-03-12 13:33:40] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-12 13:33:40] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-12 13:33:40] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-12 13:33:40] [INFO ] Invariant cache hit.
[2023-03-12 13:33:40] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 174/174 places, 154/154 transitions.
Graph (complete) has 294 edges and 174 vertex of which 168 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output 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 2 place count 168 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 167 transition count 153
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 167 transition count 146
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 160 transition count 146
Applied a total of 17 rules in 14 ms. Remains 160 /174 variables (removed 14) and now considering 146/154 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 160 cols
[2023-03-12 13:33:40] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-12 13:33:41] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:33:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-12 13:33:41] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-12 13:33:41] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:33:41] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 0 ms to minimize.
[2023-03-12 13:33:41] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2023-03-12 13:33:41] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2023-03-12 13:33:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 341 ms
[2023-03-12 13:33:41] [INFO ] After 511ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-12 13:33:41] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:33:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 13 ms.
[2023-03-12 13:33:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 154 transitions and 438 arcs took 3 ms.
[2023-03-12 13:33:42] [INFO ] Flatten gal took : 55 ms
Total runtime 25636 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/656/inv_0_ --inv-par
FORMULA AutoFlight-PT-04b-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678628023722

--------------------
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
rfs formula name AutoFlight-PT-04b-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/656/inv_0_
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 174 places, 154 transitions and 438 arcs
pnml2lts-sym: Petri net AutoFlight_PT_04b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 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: 154->150 groups
pnml2lts-sym: Regrouping took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 174; there are 150 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/656/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 0.360 real 1.390 user 0.030 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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r009-oct2-167813597900431"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b 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 ;