fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821200669
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1234.415 61194.00 75872.00 625.20 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 1 normal

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.r132-tall-165271821200669.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 MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821200669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 15K Apr 29 16:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 29 16:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 29 16:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 16:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 9 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652826830681

Running Version 202205111006
[2022-05-17 22:33:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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, 3600]
[2022-05-17 22:33:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:33:52] [INFO ] Load time of PNML (sax parser for PT used): 395 ms
[2022-05-17 22:33:52] [INFO ] Transformed 4260 places.
[2022-05-17 22:33:52] [INFO ] Transformed 6027 transitions.
[2022-05-17 22:33:52] [INFO ] Parsed PT model containing 4260 places and 6027 transitions in 547 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Normalized transition count is 5755 out of 6027 initially.
// Phase 1: matrix 5755 rows 4260 cols
[2022-05-17 22:33:52] [INFO ] Computed 497 place invariants in 318 ms
Incomplete random walk after 10000 steps, including 239 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :5
[2022-05-17 22:33:53] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2022-05-17 22:33:53] [INFO ] Computed 497 place invariants in 167 ms
[2022-05-17 22:33:54] [INFO ] [Real]Absence check using 46 positive place invariants in 64 ms returned sat
[2022-05-17 22:33:54] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 145 ms returned unsat
[2022-05-17 22:33:54] [INFO ] [Real]Absence check using 46 positive place invariants in 55 ms returned sat
[2022-05-17 22:33:54] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 128 ms returned unsat
[2022-05-17 22:33:55] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2022-05-17 22:33:55] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 120 ms returned unsat
[2022-05-17 22:33:55] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2022-05-17 22:33:56] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 125 ms returned unsat
[2022-05-17 22:33:56] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2022-05-17 22:33:56] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 165 ms returned sat
[2022-05-17 22:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:01] [INFO ] [Real]Absence check using state equation in 4417 ms returned unknown
[2022-05-17 22:34:01] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2022-05-17 22:34:01] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 121 ms returned unsat
[2022-05-17 22:34:02] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2022-05-17 22:34:02] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 132 ms returned unsat
[2022-05-17 22:34:02] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2022-05-17 22:34:02] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 123 ms returned unsat
[2022-05-17 22:34:03] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2022-05-17 22:34:03] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 153 ms returned sat
[2022-05-17 22:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:07] [INFO ] [Real]Absence check using state equation in 4416 ms returned unknown
[2022-05-17 22:34:08] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2022-05-17 22:34:08] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 133 ms returned unsat
[2022-05-17 22:34:08] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2022-05-17 22:34:09] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 125 ms returned unsat
[2022-05-17 22:34:09] [INFO ] [Real]Absence check using 46 positive place invariants in 48 ms returned sat
[2022-05-17 22:34:09] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 161 ms returned sat
[2022-05-17 22:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:14] [INFO ] [Real]Absence check using state equation in 4426 ms returned unknown
[2022-05-17 22:34:14] [INFO ] [Real]Absence check using 46 positive place invariants in 47 ms returned sat
[2022-05-17 22:34:14] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 142 ms returned sat
[2022-05-17 22:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:19] [INFO ] [Real]Absence check using state equation in 4462 ms returned unknown
[2022-05-17 22:34:19] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2022-05-17 22:34:19] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 136 ms returned unsat
[2022-05-17 22:34:20] [INFO ] [Real]Absence check using 46 positive place invariants in 45 ms returned sat
[2022-05-17 22:34:20] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 121 ms returned unsat
[2022-05-17 22:34:20] [INFO ] [Real]Absence check using 46 positive place invariants in 46 ms returned sat
[2022-05-17 22:34:20] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 127 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 4260 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.21 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 1088 transitions
Trivial Post-agglo rules discarded 1088 transitions
Performed 1088 trivial Post agglomeration. Transition count delta: 1088
Iterating post reduction 0 with 1088 rules applied. Total rules applied 1089 place count 4232 transition count 4939
Reduce places removed 1088 places and 0 transitions.
Iterating post reduction 1 with 1088 rules applied. Total rules applied 2177 place count 3144 transition count 4939
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 136 Pre rules applied. Total rules applied 2177 place count 3144 transition count 4803
Deduced a syphon composed of 136 places in 5 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 2449 place count 3008 transition count 4803
Discarding 952 places :
Symmetric choice reduction at 2 with 952 rule applications. Total rules 3401 place count 2056 transition count 3851
Iterating global reduction 2 with 952 rules applied. Total rules applied 4353 place count 2056 transition count 3851
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 4353 place count 2056 transition count 3843
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 4369 place count 2048 transition count 3843
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 4607 place count 1810 transition count 2891
Iterating global reduction 2 with 238 rules applied. Total rules applied 4845 place count 1810 transition count 2891
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 4879 place count 1793 transition count 2874
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 5039 place count 1793 transition count 3428
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 5199 place count 1633 transition count 3428
Applied a total of 5199 rules in 1605 ms. Remains 1633 /4260 variables (removed 2627) and now considering 3428/6027 (removed 2599) transitions.
Finished structural reductions, in 1 iterations. Remains : 1633/4260 places, 3428/6027 transitions.
Normalized transition count is 3030 out of 3428 initially.
// Phase 1: matrix 3030 rows 1633 cols
[2022-05-17 22:34:22] [INFO ] Computed 469 place invariants in 42 ms
Incomplete random walk after 1000000 steps, including 39551 resets, run finished after 12713 ms. (steps per millisecond=78 ) properties (out of 4) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6883 resets, run finished after 2935 ms. (steps per millisecond=340 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6882 resets, run finished after 2871 ms. (steps per millisecond=348 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6882 resets, run finished after 2797 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
[2022-05-17 22:34:43] [INFO ] Flow matrix only has 3030 transitions (discarded 398 similar events)
// Phase 1: matrix 3030 rows 1633 cols
[2022-05-17 22:34:43] [INFO ] Computed 469 place invariants in 41 ms
[2022-05-17 22:34:44] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2022-05-17 22:34:44] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 88 ms returned sat
[2022-05-17 22:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:44] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2022-05-17 22:34:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:34:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-17 22:34:45] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 78 ms returned sat
[2022-05-17 22:34:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:46] [INFO ] [Nat]Absence check using state equation in 884 ms returned sat
[2022-05-17 22:34:46] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2022-05-17 22:34:46] [INFO ] [Nat]Added 1634 Read/Feed constraints in 242 ms returned unsat
[2022-05-17 22:34:46] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2022-05-17 22:34:46] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 74 ms returned sat
[2022-05-17 22:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:47] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2022-05-17 22:34:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:34:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 28 ms returned sat
[2022-05-17 22:34:47] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 78 ms returned sat
[2022-05-17 22:34:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:48] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2022-05-17 22:34:49] [INFO ] [Nat]Added 1634 Read/Feed constraints in 321 ms returned unsat
[2022-05-17 22:34:49] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2022-05-17 22:34:49] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 80 ms returned sat
[2022-05-17 22:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:50] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2022-05-17 22:34:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 22:34:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2022-05-17 22:34:50] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 70 ms returned sat
[2022-05-17 22:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 22:34:51] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2022-05-17 22:34:51] [INFO ] [Nat]Added 1634 Read/Feed constraints in 256 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0] Max seen :[0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 60027 ms.

BK_STOP 1652826891875

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -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 3600 -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="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821200669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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