fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912698900085
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Sudoku-COL-AN11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
320.031 30819.00 32719.00 2200.10 121 121 121 121 121 121 121 121 121 121 121 121 121 121 121 121 normal

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.r485-tall-167912698900085.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 itstools
Input is Sudoku-COL-AN11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698900085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.1K Feb 26 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 09:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679161013694

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN11
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-18 17:36:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 17:36:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:36:55] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 17:36:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:36:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 375 ms
[2023-03-18 17:36:55] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2023-03-18 17:36:55] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 17:36:55] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 17:36:55] [INFO ] Computed 3 place invariants in 3 ms
FORMULA Sudoku-COL-AN11-UpperBounds-15 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-14 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-12 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-10 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-08 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-06 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-04 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-02 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Sudoku-COL-AN11-UpperBounds-01 121 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-18 17:36:55] [INFO ] Invariant cache hit.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-18 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 17:36:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 17:36:55] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-18 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 17:36:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 17:36:55] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 2 ms.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 17:36:55] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 1 ms.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-18 17:36:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 17:36:55] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 17:36:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 17:36:55] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 1 ms.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:55] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:36:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:36:56] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 17:36:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 17:36:56] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121]
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2023-03-18 17:36:56] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 40 ms.
[2023-03-18 17:36:56] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 2251 ms. (steps per millisecond=4 ) properties (out of 6) seen :666
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 6) seen :18
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-18 17:37:00] [INFO ] Computed 363 place invariants in 28 ms
[2023-03-18 17:37:00] [INFO ] [Real]Absence check using 363 positive place invariants in 213 ms returned sat
[2023-03-18 17:37:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:01] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-18 17:37:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:37:01] [INFO ] [Nat]Absence check using 363 positive place invariants in 305 ms returned sat
[2023-03-18 17:37:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:02] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2023-03-18 17:37:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-18 17:37:02] [INFO ] Added : 0 causal constraints over 0 iterations in 169 ms. Result :sat
Minimization took 297 ms.
[2023-03-18 17:37:03] [INFO ] [Real]Absence check using 363 positive place invariants in 203 ms returned sat
[2023-03-18 17:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:04] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2023-03-18 17:37:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:37:04] [INFO ] [Nat]Absence check using 363 positive place invariants in 304 ms returned sat
[2023-03-18 17:37:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:05] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2023-03-18 17:37:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-18 17:37:05] [INFO ] Added : 0 causal constraints over 0 iterations in 169 ms. Result :sat
Minimization took 288 ms.
[2023-03-18 17:37:06] [INFO ] [Real]Absence check using 363 positive place invariants in 206 ms returned sat
[2023-03-18 17:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:06] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-18 17:37:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:37:07] [INFO ] [Nat]Absence check using 363 positive place invariants in 307 ms returned sat
[2023-03-18 17:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:07] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2023-03-18 17:37:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-18 17:37:08] [INFO ] Added : 0 causal constraints over 0 iterations in 163 ms. Result :sat
Minimization took 295 ms.
[2023-03-18 17:37:08] [INFO ] [Real]Absence check using 363 positive place invariants in 207 ms returned sat
[2023-03-18 17:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:09] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2023-03-18 17:37:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:37:10] [INFO ] [Nat]Absence check using 363 positive place invariants in 311 ms returned sat
[2023-03-18 17:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:10] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2023-03-18 17:37:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 46 ms.
[2023-03-18 17:37:10] [INFO ] Added : 0 causal constraints over 0 iterations in 153 ms. Result :sat
Minimization took 294 ms.
[2023-03-18 17:37:11] [INFO ] [Real]Absence check using 363 positive place invariants in 214 ms returned sat
[2023-03-18 17:37:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:12] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2023-03-18 17:37:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:37:12] [INFO ] [Nat]Absence check using 363 positive place invariants in 313 ms returned sat
[2023-03-18 17:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:13] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2023-03-18 17:37:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-18 17:37:13] [INFO ] Added : 0 causal constraints over 0 iterations in 154 ms. Result :sat
Minimization took 287 ms.
[2023-03-18 17:37:14] [INFO ] [Real]Absence check using 363 positive place invariants in 197 ms returned sat
[2023-03-18 17:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:14] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2023-03-18 17:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:37:15] [INFO ] [Nat]Absence check using 363 positive place invariants in 299 ms returned sat
[2023-03-18 17:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:37:16] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2023-03-18 17:37:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 47 ms.
[2023-03-18 17:37:16] [INFO ] Added : 0 causal constraints over 0 iterations in 149 ms. Result :sat
Minimization took 282 ms.
Current structural bounds on expressions (after SMT) : [121, 121, 121, 121, 121, 121] Max seen :[111, 111, 111, 111, 111, 111]
FORMULA Sudoku-COL-AN11-UpperBounds-13 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-11 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-09 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-07 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-05 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Sudoku-COL-AN11-UpperBounds-00 121 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 23656 ms.

BK_STOP 1679161044513

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Sudoku-COL-AN11"
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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN11, 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 r485-tall-167912698900085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN11.tgz
mv Sudoku-COL-AN11 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 ;