Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654351700461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is NeoElection-COL-4, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654351700461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 11 18:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 11 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 18:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 81K May 18 16:43 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 NeoElection-COL-4-UpperBounds-00
FORMULA_NAME NeoElection-COL-4-UpperBounds-01
FORMULA_NAME NeoElection-COL-4-UpperBounds-02
FORMULA_NAME NeoElection-COL-4-UpperBounds-03
FORMULA_NAME NeoElection-COL-4-UpperBounds-04
FORMULA_NAME NeoElection-COL-4-UpperBounds-05
FORMULA_NAME NeoElection-COL-4-UpperBounds-06
FORMULA_NAME NeoElection-COL-4-UpperBounds-07
FORMULA_NAME NeoElection-COL-4-UpperBounds-08
FORMULA_NAME NeoElection-COL-4-UpperBounds-09
FORMULA_NAME NeoElection-COL-4-UpperBounds-10
FORMULA_NAME NeoElection-COL-4-UpperBounds-11
FORMULA_NAME NeoElection-COL-4-UpperBounds-12
FORMULA_NAME NeoElection-COL-4-UpperBounds-13
FORMULA_NAME NeoElection-COL-4-UpperBounds-14
FORMULA_NAME NeoElection-COL-4-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716680022170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeoElection-COL-4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2024-05-25 23:33:43] [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]
[2024-05-25 23:33:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 23:33:43] [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.
[2024-05-25 23:33:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 23:33:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 644 ms
[2024-05-25 23:33:44] [INFO ] Detected 6 constant HL places corresponding to 870 PT places.
[2024-05-25 23:33:44] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 1830 PT places and 3990.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2024-05-25 23:33:44] [INFO ] Built PT skeleton of HLPN with 18 places and 22 transitions 98 arcs in 4 ms.
[2024-05-25 23:33:44] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 7 transitions.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 23:33:44] [INFO ] Computed 1 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 4, 16, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 12, 0, 0] Max Struct:[+inf, 4, 16, 4, 4, 0, 4, 4, 0, 4, 0, 0, 0, 12, 0, 0]
FORMULA NeoElection-COL-4-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-13 12 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-02 16 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA NeoElection-COL-4-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-25 23:33:44] [INFO ] Invariant cache hit.
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 23:33:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 23:33:44] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:33:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 23:33:44] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:33:44] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:33:44] [INFO ] Added : 5 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 23:33:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:33:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 23:33:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 23:33:44] [INFO ] Added : 6 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 23:33:44] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 23:33:44] [INFO ] Computed and/alt/rep : 6/10/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 23:33:44] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 4, 4, 4, 4]
Symmetric sort wr.t. initial and guards and successors and join/free detected :MT
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI1 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 3, 0]] contains constants of sort MT
Transition T_poll__handleAI2 : constants on arcs in [[9:1*[$m, $s, 3, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 2 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP1 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 4, 0]] contains constants of sort MT
Transition T_poll__handleAnnP2 : constants on arcs in [[9:1*[$m, $s, 4, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 3 subsets.
Arc [9:1*[$m, $s, 1, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$m, $s, 1, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 4 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP1 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP2 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP3 : constants on arcs in [[9:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [11:1*[$m, $s, 1, $p]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[11:1*[$m, $s, 1, $p]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$s, $m, 2, 0]] contains constants of sort MT
Transition T_poll__handleAnsP4 : constants on arcs in [[9:1*[$s, $m, 2, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 5 subsets.
Arc [9:1*[$m, $s, 0, 0]] contains constants of sort MT
Transition T_poll__handleAskP : constants on arcs in [[9:1*[$m, $s, 0, 0]]] introduces in MT(6) partition with 1 elements that refines current partition to 6 subsets.
Domain [M(5), POS(4), M(5)] of place P_masterList breaks symmetries in sort M
Arc [15:1*[$m, (MOD (ADD $i 1) 4)]] contains successor/predecessor on variables of sort POS
Symmetric sort wr.t. initial and guards and successors and join/free detected :STAGE
Arc [16:1*[$m, 0]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 0]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [16:1*[$m, 1]] contains constants of sort STAGE
Transition T_poll__iAmPrimary : constants on arcs in [[16:1*[$m, 1]]] introduces in STAGE(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :NEGSTEP
Arc [8:1*[$m, $r, 1]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 1]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 2 subsets.
Arc [8:1*[$m, $r, 2]] contains constants of sort NEGSTEP
Transition T_poll__handleAI1 : constants on arcs in [[8:1*[$m, $r, 2]]] introduces in NEGSTEP(3) partition with 1 elements that refines current partition to 3 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :BOOL
Arc [7:1*[$m, 0, $pm]] contains constants of sort BOOL
Transition T_poll__handleAI2 : constants on arcs in [[7:1*[$m, 0, $pm]]] introduces in BOOL(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-25 23:33:44] [INFO ] Unfolded HLPN to a Petri net with 1830 places and 1984 transitions 11141 arcs in 71 ms.
[2024-05-25 23:33:44] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Deduced a syphon composed of 1687 places in 12 ms
Reduce places removed 1703 places and 1857 transitions.
Reduce places removed 5 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 4, 4, 4, 4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, 4, 4, 4, 4]
[2024-05-25 23:33:44] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
// Phase 1: matrix 118 rows 122 cols
[2024-05-25 23:33:44] [INFO ] Computed 35 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[144, 4, 4, 4, 4]
RANDOM walk for 10000 steps (59 resets) in 68 ms. (144 steps per ms)
FORMULA NeoElection-COL-4-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NeoElection-COL-4-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NeoElection-COL-4-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA NeoElection-COL-4-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (5 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[12] Max Struct:[144]
[2024-05-25 23:33:45] [INFO ] Flow matrix only has 118 transitions (discarded 9 similar events)
[2024-05-25 23:33:45] [INFO ] Invariant cache hit.
[2024-05-25 23:33:45] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[12] Max Struct:[12]
FORMULA NeoElection-COL-4-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-25 23:33:45] [INFO ] Flatten gal took : 39 ms
[2024-05-25 23:33:45] [INFO ] Flatten gal took : 17 ms
[2024-05-25 23:33:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5779020458970522294.gal : 13 ms
[2024-05-25 23:33:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17934158488049531399.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5779020458970522294.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17934158488049531399.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:281)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:343)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 1924 ms.

BK_STOP 1716680025400

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="NeoElection-COL-4"
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-5568"
echo " Executing tool itstools"
echo " Input is NeoElection-COL-4, 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 r246-tall-171654351700461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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