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-167813615800268.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-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r032-oct2-167813615800268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-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 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678837265205

Running Version 202205111006
[2023-03-14 23:41:07] [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:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 23:41:07] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2023-03-14 23:41:07] [INFO ] Transformed 390 places.
[2023-03-14 23:41:07] [INFO ] Transformed 388 transitions.
[2023-03-14 23:41:07] [INFO ] Found NUPN structural information;
[2023-03-14 23:41:07] [INFO ] Parsed PT model containing 390 places and 388 transitions in 360 ms.
Structural test allowed to assert that 231 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 159) seen :73
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 86) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 86) seen :0
Running SMT prover for 86 properties.
// Phase 1: matrix 388 rows 390 cols
[2023-03-14 23:41:08] [INFO ] Computed 28 place invariants in 19 ms
[2023-03-14 23:41:10] [INFO ] After 1363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:86
[2023-03-14 23:41:12] [INFO ] [Nat]Absence check using 27 positive place invariants in 24 ms returned sat
[2023-03-14 23:41:12] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 8 ms returned sat
[2023-03-14 23:41:16] [INFO ] After 3473ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :86
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 33 ms to minimize.
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 3 ms to minimize.
[2023-03-14 23:41:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 528 ms
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 1 ms to minimize.
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 26 ms to minimize.
[2023-03-14 23:41:17] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 1 ms to minimize.
[2023-03-14 23:41:18] [INFO ] Deduced a trap composed of 71 places in 531 ms of which 1 ms to minimize.
[2023-03-14 23:41:19] [INFO ] Deduced a trap composed of 65 places in 796 ms of which 1 ms to minimize.
[2023-03-14 23:41:19] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 1 ms to minimize.
[2023-03-14 23:41:19] [INFO ] Deduced a trap composed of 65 places in 275 ms of which 1 ms to minimize.
[2023-03-14 23:41:20] [INFO ] Deduced a trap composed of 69 places in 947 ms of which 2 ms to minimize.
[2023-03-14 23:41:20] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
[2023-03-14 23:41:20] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 1 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 1 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Deduced a trap composed of 77 places in 126 ms of which 0 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 0 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3995 ms
[2023-03-14 23:41:21] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 0 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 0 ms to minimize.
[2023-03-14 23:41:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 401 ms
[2023-03-14 23:41:22] [INFO ] Deduced a trap composed of 61 places in 755 ms of which 0 ms to minimize.
[2023-03-14 23:41:22] [INFO ] Deduced a trap composed of 64 places in 199 ms of which 13 ms to minimize.
[2023-03-14 23:41:23] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 1 ms to minimize.
[2023-03-14 23:41:23] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 1 ms to minimize.
[2023-03-14 23:41:23] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2023-03-14 23:41:23] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 0 ms to minimize.
[2023-03-14 23:41:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1514 ms
[2023-03-14 23:41:23] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 1 ms to minimize.
[2023-03-14 23:41:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-14 23:41:24] [INFO ] Deduced a trap composed of 62 places in 276 ms of which 1 ms to minimize.
[2023-03-14 23:41:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 344 ms
[2023-03-14 23:41:25] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 1 ms to minimize.
[2023-03-14 23:41:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2023-03-14 23:41:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2023-03-14 23:41:25] [INFO ] Deduced a trap composed of 67 places in 147 ms of which 1 ms to minimize.
[2023-03-14 23:41:25] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 1 ms to minimize.
[2023-03-14 23:41:25] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 0 ms to minimize.
[2023-03-14 23:41:26] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 0 ms to minimize.
[2023-03-14 23:41:26] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 0 ms to minimize.
[2023-03-14 23:41:26] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 0 ms to minimize.
[2023-03-14 23:41:26] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 0 ms to minimize.
[2023-03-14 23:41:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1089 ms
[2023-03-14 23:41:26] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 1 ms to minimize.
[2023-03-14 23:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-03-14 23:41:27] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2023-03-14 23:41:27] [INFO ] Deduced a trap composed of 53 places in 138 ms of which 0 ms to minimize.
[2023-03-14 23:41:27] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2023-03-14 23:41:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 517 ms
[2023-03-14 23:41:29] [INFO ] After 16504ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :86
Attempting to minimize the solution found.
Minimization took 2771 ms.
[2023-03-14 23:41:32] [INFO ] After 22315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :86
Fused 86 Parikh solutions to 85 different solutions.
Parikh walk visited 61 properties in 8461 ms.
Support contains 25 out of 390 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 390 transition count 251
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 165 rules applied. Total rules applied 302 place count 253 transition count 223
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 310 place count 245 transition count 223
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 310 place count 245 transition count 174
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 408 place count 196 transition count 174
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 441 place count 163 transition count 141
Iterating global reduction 3 with 33 rules applied. Total rules applied 474 place count 163 transition count 141
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 474 place count 163 transition count 129
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 498 place count 151 transition count 129
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 568 place count 116 transition count 94
Free-agglomeration rule applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 584 place count 116 transition count 78
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 600 place count 100 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 601 place count 99 transition count 77
Reduce places removed 12 places and 0 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 4 with 22 rules applied. Total rules applied 623 place count 87 transition count 67
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 633 place count 77 transition count 67
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 633 place count 77 transition count 57
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 653 place count 67 transition count 57
Applied a total of 653 rules in 57 ms. Remains 67 /390 variables (removed 323) and now considering 57/388 (removed 331) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/390 places, 57/388 transitions.
Finished random walk after 54 steps, including 0 resets, run visited all 25 properties in 4 ms. (steps per millisecond=13 )
Able to resolve query StableMarking after proving 160 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 33834 ms.

BK_STOP 1678837301262

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.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-04b"
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-04b, 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-167813615800268"
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 [ "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 ;