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.r258-tall-165303545400203.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 Sudoku-PT-AN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 6.2K Apr 30 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Apr 30 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 12:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 12:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 1.9K 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

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

=== Now, execution of the tool begins

BK_START 1653091776573

Running Version 202205111006
[2022-05-21 00:09:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-21 00:09:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 00:09:37] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-21 00:09:37] [INFO ] Transformed 4 places.
[2022-05-21 00:09:37] [INFO ] Transformed 1 transitions.
[2022-05-21 00:09:37] [INFO ] Found NUPN structural information;
[2022-05-21 00:09:37] [INFO ] Completing missing partition info from NUPN : creating a component with [Columns_0_0]
[2022-05-21 00:09:37] [INFO ] Parsed PT model containing 4 places and 1 transitions in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN01-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 7 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2022-05-21 00:09:38] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-21 00:09:38] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 1 rows 4 cols
[2022-05-21 00:09:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 00:09:38] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 4 cols
[2022-05-21 00:09:38] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 00:09:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2022-05-21 00:09:38] [INFO ] Flatten gal took : 11 ms
[2022-05-21 00:09:38] [INFO ] Flatten gal took : 2 ms
[2022-05-21 00:09:38] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-21 00:09:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-21 00:09:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-21 00:09:40] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 9 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(true U true))))'
Support contains 0 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Graph (complete) has 3 edges and 4 vertex of which 0 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 0 /4 variables (removed 4) and now considering 0/1 (removed 1) transitions.
[2022-05-21 00:09:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:09:40] [INFO ] Implicit Places using invariants in 7 ms returned []
[2022-05-21 00:09:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:09:40] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2022-05-21 00:09:40] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 00:09:40] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:09:40] [INFO ] Dead Transitions using invariants and state equation in 7 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/4 places, 0/1 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/4 places, 0/1 transitions.
Stuttering acceptance computed with spot in 30 ms :[true]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN01-LTLCardinality-05 finished in 123 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((F(p0)||p1)))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 00:09:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 00:09:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 00:09:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 00:09:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-21 00:09:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 00:09:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 00:09:41] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1 0), p0:(AND (EQ s0 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN01-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN01-LTLCardinality-08 finished in 745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 00:09:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 00:09:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 00:09:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 00:09:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-21 00:09:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 2 cols
[2022-05-21 00:09:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 00:09:41] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 1/1 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 0) (OR (EQ s1 0) (EQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 57 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN01-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN01-LTLCardinality-10 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p1)&&p0))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2022-05-21 00:09:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-21 00:09:42] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 1 rows 3 cols
[2022-05-21 00:09:42] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-21 00:09:42] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 1 rows 3 cols
[2022-05-21 00:09:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-21 00:09:42] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s0 1)), p1:(AND (EQ s1 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN01-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN01-LTLCardinality-14 finished in 215 ms.
All properties solved by simple procedures.
Total runtime 4801 ms.

BK_STOP 1653091782881

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

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