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.r288-smll-167863554200234.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 ParamProductionCell-PT-1, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r288-smll-167863554200234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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 Liveness

=== Now, execution of the tool begins

BK_START 1678907973768

Running Version 202205111006
[2023-03-15 19:19:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -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-15 19:19:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:19:36] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2023-03-15 19:19:36] [INFO ] Transformed 231 places.
[2023-03-15 19:19:36] [INFO ] Transformed 202 transitions.
[2023-03-15 19:19:36] [INFO ] Found NUPN structural information;
[2023-03-15 19:19:36] [INFO ] Parsed PT model containing 231 places and 202 transitions in 493 ms.
Built sparse matrix representations for Structural reductions in 13 ms.13655KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 49 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 231/231 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 30 ms. Remains 231 /231 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:19:36] [INFO ] Computed 59 place invariants in 37 ms
[2023-03-15 19:19:37] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:19:37] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-15 19:19:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:19:37] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2023-03-15 19:19:37] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:19:37] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-15 19:19:38] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 231/231 places, 202/202 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1814 ms (no deadlock found). (steps per millisecond=689 )
Random directed walk for 1250000 steps, including 0 resets, run took 1581 ms (no deadlock found). (steps per millisecond=790 )
// Phase 1: matrix 202 rows 231 cols
[2023-03-15 19:19:41] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-15 19:19:41] [INFO ] [Real]Absence check using 35 positive place invariants in 73 ms returned sat
[2023-03-15 19:19:41] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 152 ms returned sat
[2023-03-15 19:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:19:43] [INFO ] [Real]Absence check using state equation in 1283 ms returned sat
[2023-03-15 19:19:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:19:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2023-03-15 19:19:43] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-15 19:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:19:45] [INFO ] [Nat]Absence check using state equation in 2472 ms returned sat
[2023-03-15 19:19:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 19:19:45] [INFO ] [Nat]Added 68 Read/Feed constraints in 63 ms returned sat
[2023-03-15 19:19:46] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 5 ms to minimize.
[2023-03-15 19:19:46] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2023-03-15 19:19:46] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 1 ms to minimize.
[2023-03-15 19:19:46] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 3 ms to minimize.
[2023-03-15 19:19:47] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-15 19:19:47] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-15 19:19:47] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2023-03-15 19:19:47] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2023-03-15 19:19:47] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 2 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 1 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-15 19:19:48] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 0 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 1 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 0 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2023-03-15 19:19:49] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 1 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 1 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-15 19:19:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 30 trap constraints in 4894 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 231/231 places, 202/202 transitions.
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 0 place count 231 transition count 188
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 217 transition count 188
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 211 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 211 transition count 182
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 76 place count 193 transition count 164
Applied a total of 76 rules in 57 ms. Remains 193 /231 variables (removed 38) and now considering 164/202 (removed 38) transitions.
// Phase 1: matrix 164 rows 193 cols
[2023-03-15 19:19:50] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-15 19:19:51] [INFO ] Implicit Places using invariants in 291 ms returned [1, 2, 9, 14, 15, 16, 17, 18, 22, 28, 31, 32, 35, 36, 40, 41, 51, 54, 55, 61, 64, 65, 71, 77, 78, 80, 92, 93, 95, 97, 98, 119, 132, 133, 135, 137, 138, 160, 162, 163, 166, 167, 172, 173, 175, 184]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 295 ms to find 46 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 147/231 places, 164/202 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 0 with 27 rules applied. Total rules applied 27 place count 147 transition count 137
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 120 transition count 137
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 54 place count 120 transition count 130
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 68 place count 113 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 111 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 111 transition count 128
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 152 place count 71 transition count 88
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 2 with 2 rules applied. Total rules applied 154 place count 70 transition count 87
Applied a total of 154 rules in 24 ms. Remains 70 /147 variables (removed 77) and now considering 87/164 (removed 77) transitions.
// Phase 1: matrix 87 rows 70 cols
[2023-03-15 19:19:51] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-15 19:19:51] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 87 rows 70 cols
[2023-03-15 19:19:51] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-15 19:19:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 19:19:51] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 70/231 places, 87/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 70/231 places, 87/202 transitions.
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 86) seen :62
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 87 rows 70 cols
[2023-03-15 19:19:53] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-15 19:19:53] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-15 19:19:53] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-15 19:19:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-15 19:19:54] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :24
[2023-03-15 19:19:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-15 19:19:54] [INFO ] After 163ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :24
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 158 ms
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 3 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 188 ms
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 48 ms
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 75 ms
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-15 19:19:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 82 ms
[2023-03-15 19:19:54] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :24 sat :0
[2023-03-15 19:19:54] [INFO ] After 1137ms SMT Verify possible using all constraints in natural domain returned unsat :24 sat :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 18833 ms.

BK_STOP 1678907995015

--------------------
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
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -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 Liveness -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="ParamProductionCell-PT-1"
export BK_EXAMINATION="Liveness"
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 ParamProductionCell-PT-1, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r288-smll-167863554200234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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