Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r043-smll-171620180000075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r043-smll-171620180000075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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-2024-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716278791469

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-21 08:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 08:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:06:35] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2024-05-21 08:06:35] [INFO ] Transformed 390 places.
[2024-05-21 08:06:35] [INFO ] Transformed 388 transitions.
[2024-05-21 08:06:35] [INFO ] Found NUPN structural information;
[2024-05-21 08:06:35] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 50 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 16) seen :6
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) 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 9) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 388 rows 390 cols
[2024-05-21 08:06:37] [INFO ] Computed 28 invariants in 27 ms
[2024-05-21 08:06:37] [INFO ] [Real]Absence check using 27 positive place invariants in 29 ms returned sat
[2024-05-21 08:06:37] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-21 08:06:37] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 08:06:38] [INFO ] [Nat]Absence check using 27 positive place invariants in 22 ms returned sat
[2024-05-21 08:06:38] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-21 08:06:38] [INFO ] After 826ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2024-05-21 08:06:39] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 13 ms to minimize.
[2024-05-21 08:06:39] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 1 ms to minimize.
[2024-05-21 08:06:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 557 ms
[2024-05-21 08:06:40] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 2 ms to minimize.
[2024-05-21 08:06:40] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 3 ms to minimize.
[2024-05-21 08:06:40] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 3 ms to minimize.
[2024-05-21 08:06:40] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
[2024-05-21 08:06:40] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 0 ms to minimize.
[2024-05-21 08:06:41] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2024-05-21 08:06:41] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-21 08:06:41] [INFO ] Deduced a trap composed of 31 places in 134 ms of which 0 ms to minimize.
[2024-05-21 08:06:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1665 ms
[2024-05-21 08:06:41] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2024-05-21 08:06:41] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 0 ms to minimize.
[2024-05-21 08:06:42] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 1 ms to minimize.
[2024-05-21 08:06:42] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 1 ms to minimize.
[2024-05-21 08:06:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 758 ms
[2024-05-21 08:06:42] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 1 ms to minimize.
[2024-05-21 08:06:42] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 1 ms to minimize.
[2024-05-21 08:06:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2024-05-21 08:06:43] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 1 ms to minimize.
[2024-05-21 08:06:43] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 1 ms to minimize.
[2024-05-21 08:06:43] [INFO ] Deduced a trap composed of 99 places in 227 ms of which 1 ms to minimize.
[2024-05-21 08:06:43] [INFO ] Deduced a trap composed of 29 places in 226 ms of which 1 ms to minimize.
[2024-05-21 08:06:44] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 1 ms to minimize.
[2024-05-21 08:06:44] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 1 ms to minimize.
[2024-05-21 08:06:44] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 2 ms to minimize.
[2024-05-21 08:06:44] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 1 ms to minimize.
[2024-05-21 08:06:45] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 1 ms to minimize.
[2024-05-21 08:06:45] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 4 ms to minimize.
[2024-05-21 08:06:45] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2024-05-21 08:06:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2846 ms
[2024-05-21 08:06:45] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2024-05-21 08:06:45] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2024-05-21 08:06:46] [INFO ] Deduced a trap composed of 69 places in 157 ms of which 1 ms to minimize.
[2024-05-21 08:06:46] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 1 ms to minimize.
[2024-05-21 08:06:46] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 1 ms to minimize.
[2024-05-21 08:06:46] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 1 ms to minimize.
[2024-05-21 08:06:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1093 ms
[2024-05-21 08:06:47] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2024-05-21 08:06:47] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 2 ms to minimize.
[2024-05-21 08:06:47] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
[2024-05-21 08:06:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 581 ms
[2024-05-21 08:06:47] [INFO ] After 9294ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 615 ms.
[2024-05-21 08:06:48] [INFO ] After 10366ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
TestFail conflict detected : techniques TOPOLOGICAL PARIKH_WALK answered differently (false)on formula AutoFlight-PT-04b-ReachabilityFireability-2024-10
Parikh walk visited 0 properties in 137 ms.
Support contains 126 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 390 transition count 341
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 53 rules applied. Total rules applied 100 place count 343 transition count 335
Reduce places removed 2 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 32 rules applied. Total rules applied 132 place count 341 transition count 305
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 164 place count 311 transition count 303
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 26 Pre rules applied. Total rules applied 164 place count 311 transition count 277
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 216 place count 285 transition count 277
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 231 place count 270 transition count 262
Iterating global reduction 4 with 15 rules applied. Total rules applied 246 place count 270 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 246 place count 270 transition count 261
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 248 place count 269 transition count 261
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 302 place count 242 transition count 234
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 310 place count 242 transition count 226
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 4 with 2 rules applied. Total rules applied 312 place count 241 transition count 225
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 313 place count 241 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 240 transition count 224
Applied a total of 314 rules in 246 ms. Remains 240 /390 variables (removed 150) and now considering 224/388 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 240/390 places, 224/388 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 224 rows 240 cols
[2024-05-21 08:06:49] [INFO ] Computed 28 invariants in 8 ms
[2024-05-21 08:06:49] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2024-05-21 08:06:49] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 08:06:49] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 08:06:49] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2024-05-21 08:06:49] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 08:06:49] [INFO ] After 456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-21 08:06:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:06:50] [INFO ] After 288ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-21 08:06:50] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 0 ms to minimize.
[2024-05-21 08:06:50] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-21 08:06:50] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-21 08:06:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 400 ms
[2024-05-21 08:06:50] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 53 places in 115 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 0 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-21 08:06:51] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1177 ms
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 08:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-21 08:06:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 615 ms
[2024-05-21 08:06:52] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-21 08:06:53] [INFO ] Deduced a trap composed of 49 places in 103 ms of which 3 ms to minimize.
[2024-05-21 08:06:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 260 ms
[2024-05-21 08:06:53] [INFO ] After 3154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 350 ms.
[2024-05-21 08:06:53] [INFO ] After 4128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 121 ms.
Support contains 123 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 224/224 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 240 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 239 transition count 223
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 239 transition count 222
Applied a total of 3 rules in 32 ms. Remains 239 /240 variables (removed 1) and now considering 222/224 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 239/240 places, 222/224 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 477472 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477472 steps, saw 71908 distinct states, run finished after 3003 ms. (steps per millisecond=158 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 222 rows 239 cols
[2024-05-21 08:06:57] [INFO ] Computed 28 invariants in 3 ms
[2024-05-21 08:06:57] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 08:06:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2024-05-21 08:06:57] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 08:06:57] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 08:06:57] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:06:57] [INFO ] After 187ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 1 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 0 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 0 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 0 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 1 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 0 ms to minimize.
[2024-05-21 08:06:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 862 ms
[2024-05-21 08:06:58] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 4 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 3 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
[2024-05-21 08:06:59] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 18 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 0 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-21 08:06:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 394 ms
[2024-05-21 08:06:59] [INFO ] After 2045ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 271 ms.
[2024-05-21 08:06:59] [INFO ] After 2715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 86 ms.
Support contains 123 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 222/222 transitions.
Applied a total of 0 rules in 15 ms. Remains 239 /239 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 239/239 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 222/222 transitions.
Applied a total of 0 rules in 14 ms. Remains 239 /239 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-21 08:07:00] [INFO ] Invariant cache hit.
[2024-05-21 08:07:00] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-21 08:07:00] [INFO ] Invariant cache hit.
[2024-05-21 08:07:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 08:07:00] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-05-21 08:07:00] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-21 08:07:00] [INFO ] Invariant cache hit.
[2024-05-21 08:07:01] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 239/239 places, 222/222 transitions.
Graph (complete) has 382 edges and 239 vertex of which 236 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 236 transition count 219
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 233 transition count 219
Applied a total of 7 rules in 25 ms. Remains 233 /239 variables (removed 6) and now considering 219/222 (removed 3) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 219 rows 233 cols
[2024-05-21 08:07:01] [INFO ] Computed 25 invariants in 3 ms
[2024-05-21 08:07:01] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 08:07:01] [INFO ] [Nat]Absence check using 24 positive place invariants in 18 ms returned sat
[2024-05-21 08:07:01] [INFO ] [Nat]Absence check using 24 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-21 08:07:01] [INFO ] After 412ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 1 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 1 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 1 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 39 places in 108 ms of which 1 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 1 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 0 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 51 places in 107 ms of which 0 ms to minimize.
[2024-05-21 08:07:02] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 56 places in 89 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1554 ms
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2024-05-21 08:07:03] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 863 ms
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-05-21 08:07:04] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-21 08:07:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 572 ms
[2024-05-21 08:07:05] [INFO ] After 3646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 212 ms.
[2024-05-21 08:07:05] [INFO ] After 4032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-21 08:07:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-21 08:07:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 239 places, 222 transitions and 574 arcs took 3 ms.
[2024-05-21 08:07:05] [INFO ] Flatten gal took : 98 ms
Total runtime 30887 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutoFlight-PT-04b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityFireability

FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716278827522

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type EXCL) for 3 AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 16 (type EXCL) for AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: result : true
lola: markings : 557
lola: fired transitions : 577
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 12 (type FNDP) for AutoFlight-PT-04b-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 13 (type EQUN) for AutoFlight-PT-04b-ReachabilityFireability-2024-08 (obsolete)
lola: CANCELED task # 15 (type SRCH) for AutoFlight-PT-04b-ReachabilityFireability-2024-08 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 27 (type EXCL) for 0 AutoFlight-PT-04b-ReachabilityFireability-2024-04
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 23 (type FNDP) for 0 AutoFlight-PT-04b-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type EQUN) for 0 AutoFlight-PT-04b-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type SRCH) for 0 AutoFlight-PT-04b-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 12 (type FNDP) for AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: result : true
lola: fired transitions : 34
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-13.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 13 (type EQUN) for AutoFlight-PT-04b-ReachabilityFireability-2024-08
lola: result : true
lola: FINISHED task # 27 (type EXCL) for AutoFlight-PT-04b-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 1782
lola: fired transitions : 1828
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 23 (type FNDP) for AutoFlight-PT-04b-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 24 (type EQUN) for AutoFlight-PT-04b-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 26 (type SRCH) for AutoFlight-PT-04b-ReachabilityFireability-2024-04 (obsolete)
lola: LAUNCH task # 31 (type EXCL) for 6 AutoFlight-PT-04b-ReachabilityFireability-2024-12
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 29 (type FNDP) for 9 AutoFlight-PT-04b-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 9 AutoFlight-PT-04b-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 35 (type SRCH) for 9 AutoFlight-PT-04b-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 23 (type FNDP) for AutoFlight-PT-04b-ReachabilityFireability-2024-04
lola: result : unknown
lola: fired transitions : 15419
lola: tried executions : 312
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 35 (type SRCH) for AutoFlight-PT-04b-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 53
lola: fired transitions : 52
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 29 (type FNDP) for AutoFlight-PT-04b-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 33 (type EQUN) for AutoFlight-PT-04b-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 20 (type FNDP) for 6 AutoFlight-PT-04b-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type EQUN) for 6 AutoFlight-PT-04b-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 6 AutoFlight-PT-04b-ReachabilityFireability-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 31 (type EXCL) for AutoFlight-PT-04b-ReachabilityFireability-2024-12
lola: result : true
lola: markings : 1726
lola: fired transitions : 1871
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 20 (type FNDP) for AutoFlight-PT-04b-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 21 (type EQUN) for AutoFlight-PT-04b-ReachabilityFireability-2024-12 (obsolete)
lola: CANCELED task # 30 (type SRCH) for AutoFlight-PT-04b-ReachabilityFireability-2024-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutoFlight-PT-04b-ReachabilityFireability-2024-04: AG false tandem / relaxed
AutoFlight-PT-04b-ReachabilityFireability-2024-08: EF true tandem / relaxed
AutoFlight-PT-04b-ReachabilityFireability-2024-12: AG false tandem / relaxed
AutoFlight-PT-04b-ReachabilityFireability-2024-15: EF true tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r043-smll-171620180000075"
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 ;