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.r011-oct2-167813600200431.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 smartxred
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 r011-oct2-167813600200431
=====================================================================

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

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 19:24:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 19:24:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:24:08] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2023-03-13 19:24:08] [INFO ] Transformed 390 places.
[2023-03-13 19:24:08] [INFO ] Transformed 388 transitions.
[2023-03-13 19:24:08] [INFO ] Found NUPN structural information;
[2023-03-13 19:24:08] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 181 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 49 resets, run finished after 379 ms. (steps per millisecond=26 ) 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-12 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-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 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 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 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-13 19:24:09] [INFO ] Computed 28 place invariants in 14 ms
[2023-03-13 19:24:09] [INFO ] After 433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 19:24:09] [INFO ] [Nat]Absence check using 27 positive place invariants in 52 ms returned sat
[2023-03-13 19:24:09] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 26 ms returned sat
[2023-03-13 19:24:10] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 8 ms to minimize.
[2023-03-13 19:24:10] [INFO ] Deduced a trap composed of 62 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 13 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 629 ms
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 1 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 0 ms to minimize.
[2023-03-13 19:24:11] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 14 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 54 places in 134 ms of which 1 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 1 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 0 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:24:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1328 ms
[2023-03-13 19:24:12] [INFO ] After 2936ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 397 ms.
[2023-03-13 19:24:13] [INFO ] After 3747ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA AutoFlight-PT-04b-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 99 ms.
Support contains 103 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 390 transition count 317
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 76 rules applied. Total rules applied 147 place count 319 transition count 312
Reduce places removed 2 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 2 with 28 rules applied. Total rules applied 175 place count 317 transition count 286
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 208 place count 291 transition count 279
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 208 place count 291 transition count 249
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 268 place count 261 transition count 249
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 290 place count 239 transition count 227
Iterating global reduction 4 with 22 rules applied. Total rules applied 312 place count 239 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 314 place count 239 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 314 place count 239 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 322 place count 235 transition count 221
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 384 place count 204 transition count 190
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 390 place count 204 transition count 184
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 393 place count 204 transition count 181
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 396 place count 201 transition count 181
Applied a total of 396 rules in 78 ms. Remains 201 /390 variables (removed 189) and now considering 181/388 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 201/390 places, 181/388 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 661059 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 661059 steps, saw 110083 distinct states, run finished after 3005 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 181 rows 201 cols
[2023-03-13 19:24:16] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-13 19:24:16] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 19:24:16] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2023-03-13 19:24:16] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 19:24:17] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 19:24:17] [INFO ] After 192ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 19:24:17] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-13 19:24:17] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2023-03-13 19:24:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-13 19:24:17] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-13 19:24:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2023-03-13 19:24:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2023-03-13 19:24:17] [INFO ] After 743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-13 19:24:18] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA AutoFlight-PT-04b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 19 ms.
Support contains 88 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 181/181 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 201 transition count 177
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 197 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 196 transition count 176
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 196 transition count 173
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 16 place count 193 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 192 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 192 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 188 transition count 168
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 31 place count 188 transition count 163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 36 place count 183 transition count 163
Applied a total of 36 rules in 31 ms. Remains 183 /201 variables (removed 18) and now considering 163/181 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 183/201 places, 163/181 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 163 rows 183 cols
[2023-03-13 19:24:18] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-13 19:24:18] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 19:24:18] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2023-03-13 19:24:18] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 19:24:18] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 19:24:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 19:24:18] [INFO ] After 83ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 19:24:19] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2023-03-13 19:24:19] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2023-03-13 19:24:19] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 0 ms to minimize.
[2023-03-13 19:24:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2023-03-13 19:24:19] [INFO ] After 550ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-13 19:24:19] [INFO ] After 882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 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.
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 183 transition count 162
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 182 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 181 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 181 transition count 161
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 175 transition count 155
Applied a total of 16 rules in 17 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 17 ms. Remains : 175/183 places, 155/163 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1608719 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :{1=1}
Probabilistic random walk after 1608719 steps, saw 227243 distinct states, run finished after 3002 ms. (steps per millisecond=535 ) 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-13 19:24:22] [INFO ] Computed 28 place invariants in 3 ms
[2023-03-13 19:24:22] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:24:22] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-13 19:24:22] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 19:24:23] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:23] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 19:24:23] [INFO ] After 129ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:23] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2023-03-13 19:24:23] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2023-03-13 19:24:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 259 ms
[2023-03-13 19:24:23] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-13 19:24:23] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 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 1 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 20 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 20 ms. Remains : 174/175 places, 154/155 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1977139 steps, run timeout after 3001 ms. (steps per millisecond=658 ) properties seen :{}
Probabilistic random walk after 1977139 steps, saw 271561 distinct states, run finished after 3001 ms. (steps per millisecond=658 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 154 rows 174 cols
[2023-03-13 19:24:26] [INFO ] Computed 28 place invariants in 53 ms
[2023-03-13 19:24:26] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:24:27] [INFO ] [Nat]Absence check using 26 positive place invariants in 14 ms returned sat
[2023-03-13 19:24:27] [INFO ] [Nat]Absence check using 26 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 19:24:27] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 19:24:27] [INFO ] After 107ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:27] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2023-03-13 19:24:27] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2023-03-13 19:24:27] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2023-03-13 19:24:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 291 ms
[2023-03-13 19:24:27] [INFO ] After 497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-13 19:24:27] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 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 8 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 9 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 8 ms. Remains 174 /174 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-13 19:24:27] [INFO ] Invariant cache hit.
[2023-03-13 19:24:27] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-13 19:24:27] [INFO ] Invariant cache hit.
[2023-03-13 19:24:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-13 19:24:28] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-13 19:24:28] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-13 19:24:28] [INFO ] Invariant cache hit.
[2023-03-13 19:24:28] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 622 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.2 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 1 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 9 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-13 19:24:28] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-13 19:24:28] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 19:24:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-13 19:24:28] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-13 19:24:28] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:28] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2023-03-13 19:24:28] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-03-13 19:24:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2023-03-13 19:24:29] [INFO ] After 450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-13 19:24:29] [INFO ] After 607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 19:24:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-13 19:24:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 154 transitions and 438 arcs took 4 ms.
[2023-03-13 19:24:29] [INFO ] Flatten gal took : 44 ms
Total runtime 21347 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutoFlight (PT), instance 04b
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 174 places, 154 transitions, 438 arcs.
Final Score: 2168.498
Took : 4 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678735474930

--------------------
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'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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
ERROR in file model.sm near line 773:
syntax error

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="smartxred"
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 smartxred"
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 r011-oct2-167813600200431"
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 ;