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.r032-oct2-167813615800278.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 gold2022
Input is AutoFlight-PT-05b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r032-oct2-167813615800278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.0K Feb 25 18:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 14K Feb 25 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 18:09 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 113K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678837291819

Running Version 202205111006
[2023-03-14 23:41:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-14 23:41:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 23:41:34] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-14 23:41:34] [INFO ] Transformed 482 places.
[2023-03-14 23:41:34] [INFO ] Transformed 480 transitions.
[2023-03-14 23:41:34] [INFO ] Found NUPN structural information;
[2023-03-14 23:41:34] [INFO ] Parsed PT model containing 482 places and 480 transitions in 392 ms.
Structural test allowed to assert that 286 places are NOT stable. Took 20 ms.
Incomplete random walk after 10000 steps, including 41 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 196) seen :87
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=2 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=9 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 109) seen :0
Running SMT prover for 109 properties.
// Phase 1: matrix 480 rows 482 cols
[2023-03-14 23:41:35] [INFO ] Computed 34 place invariants in 27 ms
[2023-03-14 23:41:38] [INFO ] After 2720ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:109
[2023-03-14 23:41:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 74 ms returned sat
[2023-03-14 23:41:40] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-14 23:41:46] [INFO ] After 4013ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :109
[2023-03-14 23:41:46] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 13 ms to minimize.
[2023-03-14 23:41:46] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 2 ms to minimize.
[2023-03-14 23:41:46] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 2 ms to minimize.
[2023-03-14 23:41:46] [INFO ] Deduced a trap composed of 31 places in 149 ms of which 2 ms to minimize.
[2023-03-14 23:41:47] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 1 ms to minimize.
[2023-03-14 23:41:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1042 ms
[2023-03-14 23:41:47] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 1 ms to minimize.
[2023-03-14 23:41:47] [INFO ] Deduced a trap composed of 72 places in 263 ms of which 1 ms to minimize.
[2023-03-14 23:41:47] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 1 ms to minimize.
[2023-03-14 23:41:47] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 0 ms to minimize.
[2023-03-14 23:41:48] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2023-03-14 23:41:48] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2023-03-14 23:41:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1072 ms
[2023-03-14 23:41:48] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 1 ms to minimize.
[2023-03-14 23:41:48] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 0 ms to minimize.
[2023-03-14 23:41:48] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 0 ms to minimize.
[2023-03-14 23:41:49] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2023-03-14 23:41:49] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 1 ms to minimize.
[2023-03-14 23:41:49] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 1 ms to minimize.
[2023-03-14 23:41:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 921 ms
[2023-03-14 23:41:49] [INFO ] Deduced a trap composed of 76 places in 131 ms of which 1 ms to minimize.
[2023-03-14 23:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-14 23:41:50] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 1 ms to minimize.
[2023-03-14 23:41:50] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 1 ms to minimize.
[2023-03-14 23:41:50] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 1 ms to minimize.
[2023-03-14 23:41:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 574 ms
[2023-03-14 23:41:51] [INFO ] Deduced a trap composed of 75 places in 222 ms of which 14 ms to minimize.
[2023-03-14 23:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-14 23:41:51] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
[2023-03-14 23:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-14 23:41:52] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 0 ms to minimize.
[2023-03-14 23:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-03-14 23:41:52] [INFO ] Deduced a trap composed of 60 places in 221 ms of which 0 ms to minimize.
[2023-03-14 23:41:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-14 23:41:53] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 1 ms to minimize.
[2023-03-14 23:41:53] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 0 ms to minimize.
[2023-03-14 23:41:53] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 0 ms to minimize.
[2023-03-14 23:41:53] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 1 ms to minimize.
[2023-03-14 23:41:53] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 1 ms to minimize.
[2023-03-14 23:41:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 937 ms
[2023-03-14 23:41:54] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 0 ms to minimize.
[2023-03-14 23:41:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-14 23:41:54] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2023-03-14 23:41:54] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2023-03-14 23:41:54] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2023-03-14 23:41:55] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2023-03-14 23:41:55] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-03-14 23:41:55] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2023-03-14 23:41:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 934 ms
[2023-03-14 23:41:55] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 0 ms to minimize.
[2023-03-14 23:41:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2023-03-14 23:41:56] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 0 ms to minimize.
[2023-03-14 23:41:56] [INFO ] Deduced a trap composed of 71 places in 291 ms of which 27 ms to minimize.
[2023-03-14 23:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 545 ms
[2023-03-14 23:41:56] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 0 ms to minimize.
[2023-03-14 23:41:57] [INFO ] Deduced a trap composed of 50 places in 95 ms of which 1 ms to minimize.
[2023-03-14 23:41:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-14 23:41:59] [INFO ] Deduced a trap composed of 47 places in 184 ms of which 0 ms to minimize.
[2023-03-14 23:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2023-03-14 23:42:00] [INFO ] After 18196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :109
Attempting to minimize the solution found.
Minimization took 3041 ms.
[2023-03-14 23:42:03] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :109
Parikh walk visited 106 properties in 30053 ms.
Support contains 3 out of 482 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 482 transition count 293
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 222 rules applied. Total rules applied 409 place count 295 transition count 258
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 419 place count 285 transition count 258
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 419 place count 285 transition count 193
Deduced a syphon composed of 65 places in 5 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 549 place count 220 transition count 193
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 594 place count 175 transition count 148
Iterating global reduction 3 with 45 rules applied. Total rules applied 639 place count 175 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 639 place count 175 transition count 133
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 669 place count 160 transition count 133
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 747 place count 121 transition count 94
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 767 place count 121 transition count 74
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 787 place count 101 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 788 place count 100 transition count 73
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 4 with 46 rules applied. Total rules applied 834 place count 81 transition count 46
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 861 place count 54 transition count 46
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 861 place count 54 transition count 32
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 889 place count 40 transition count 32
Applied a total of 889 rules in 113 ms. Remains 40 /482 variables (removed 442) and now considering 32/480 (removed 448) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/482 places, 32/480 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=4 )
Able to resolve query StableMarking after proving 197 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 59617 ms.

BK_STOP 1678837353657

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination StableMarking -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-05b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2022"
echo " Input is AutoFlight-PT-05b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r032-oct2-167813615800278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;