Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r229-tall-165286034500527.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVs-PT-040B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-165286034500527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 6.3K Apr 30 06:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 06:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 06:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 30 06:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 498K May 10 09:34 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1653038056674

Running Version 202205111006
[2022-05-20 09:14:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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]
[2022-05-20 09:14:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:14:18] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2022-05-20 09:14:18] [INFO ] Transformed 1603 places.
[2022-05-20 09:14:18] [INFO ] Transformed 1803 transitions.
[2022-05-20 09:14:18] [INFO ] Found NUPN structural information;
[2022-05-20 09:14:18] [INFO ] Parsed PT model containing 1603 places and 1803 transitions in 292 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1603 transition count 1642
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1442 transition count 1642
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 322 place count 1442 transition count 1442
Deduced a syphon composed of 200 places in 17 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 722 place count 1242 transition count 1442
Discarding 280 places :
Symmetric choice reduction at 2 with 280 rule applications. Total rules 1002 place count 962 transition count 1162
Iterating global reduction 2 with 280 rules applied. Total rules applied 1282 place count 962 transition count 1162
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 1282 place count 962 transition count 1042
Deduced a syphon composed of 120 places in 5 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 1522 place count 842 transition count 1042
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 280
Deduced a syphon composed of 280 places in 2 ms
Reduce places removed 280 places and 0 transitions.
Iterating global reduction 2 with 560 rules applied. Total rules applied 2082 place count 562 transition count 762
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 2082 rules in 365 ms. Remains 562 /1603 variables (removed 1041) and now considering 762/1803 (removed 1041) transitions.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:14:18] [INFO ] Computed 161 place invariants in 25 ms
[2022-05-20 09:14:19] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:14:19] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 09:14:19] [INFO ] Implicit Places using invariants and state equation in 554 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:14:19] [INFO ] Computed 161 place invariants in 6 ms
[2022-05-20 09:14:19] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 562/1603 places, 762/1803 transitions.
Finished structural reductions, in 1 iterations. Remains : 562/1603 places, 762/1803 transitions.
Discarding 240 transitions out of 762. Remains 522
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 521) seen :475
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 46) 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 46) 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 46) 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 46) 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 46) 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 46) 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 46) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) 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 45) 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 45) 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 45) 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 45) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 45) 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 45) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) 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 45) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) 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 44) seen :0
Running SMT prover for 44 properties.
// Phase 1: matrix 762 rows 562 cols
[2022-05-20 09:14:20] [INFO ] Computed 161 place invariants in 8 ms
[2022-05-20 09:14:21] [INFO ] [Real]Absence check using 161 positive place invariants in 21 ms returned sat
[2022-05-20 09:14:23] [INFO ] After 2985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:44
[2022-05-20 09:14:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2022-05-20 09:14:26] [INFO ] After 1909ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :44
[2022-05-20 09:14:26] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 16 ms to minimize.
[2022-05-20 09:14:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 0 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 513 ms
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-05-20 09:14:27] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 0 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1163 ms
[2022-05-20 09:14:28] [INFO ] Deduced a trap composed of 47 places in 42 ms of which 1 ms to minimize.
[2022-05-20 09:14:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 0 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 0 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2022-05-20 09:14:29] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 847 ms
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 0 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2022-05-20 09:14:30] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1096 ms
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2022-05-20 09:14:31] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2022-05-20 09:14:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 297 ms
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 238 ms
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 0 ms to minimize.
[2022-05-20 09:14:32] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 570 ms
[2022-05-20 09:14:33] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2022-05-20 09:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2022-05-20 09:14:34] [INFO ] After 9186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :44
Attempting to minimize the solution found.
Minimization took 1641 ms.
[2022-05-20 09:14:35] [INFO ] After 11742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :44
Parikh walk visited 15 properties in 11231 ms.
Support contains 80 out of 562 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 562/562 places, 762/762 transitions.
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 0 with 68 rules applied. Total rules applied 68 place count 562 transition count 762
Applied a total of 68 rules in 90 ms. Remains 562 /562 variables (removed 0) and now considering 762/762 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 562/562 places, 762/762 transitions.
Finished random walk after 25975 steps, including 54 resets, run visited all 29 properties in 541 ms. (steps per millisecond=48 )
Able to resolve query QuasiLiveness after proving 522 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 29713 ms.

BK_STOP 1653038087586

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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 QuasiLiveness -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="ShieldRVs-PT-040B"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVs-PT-040B, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r229-tall-165286034500527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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