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.r169-tall-167838855300054.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 ltsminxred
Input is Echo-PT-d02r09, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855300054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 14:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 303K Mar 5 18:22 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 Echo-PT-d02r09-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r09-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678465476531

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 16:24:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 16:24:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:24:38] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2023-03-10 16:24:38] [INFO ] Transformed 735 places.
[2023-03-10 16:24:38] [INFO ] Transformed 570 transitions.
[2023-03-10 16:24:38] [INFO ] Found NUPN structural information;
[2023-03-10 16:24:38] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r09-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 61 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 14) seen :12
FORMULA Echo-PT-d02r09-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r09-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 570 rows 735 cols
[2023-03-10 16:24:39] [INFO ] Computed 369 place invariants in 43 ms
[2023-03-10 16:24:39] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 16:24:39] [INFO ] [Nat]Absence check using 85 positive place invariants in 24 ms returned sat
[2023-03-10 16:24:39] [INFO ] [Nat]Absence check using 85 positive and 284 generalized place invariants in 54 ms returned sat
[2023-03-10 16:24:56] [INFO ] After 17025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 16:24:58] [INFO ] Deduced a trap composed of 10 places in 371 ms of which 7 ms to minimize.
[2023-03-10 16:24:58] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-10 16:24:58] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 4 ms to minimize.
[2023-03-10 16:24:58] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 1 ms to minimize.
[2023-03-10 16:24:59] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 2 ms to minimize.
[2023-03-10 16:24:59] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 1 ms to minimize.
[2023-03-10 16:24:59] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-10 16:25:00] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2023-03-10 16:25:00] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 0 ms to minimize.
[2023-03-10 16:25:00] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 1 ms to minimize.
[2023-03-10 16:25:00] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-10 16:25:00] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2023-03-10 16:25:00] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-10 16:25:01] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-10 16:25:01] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2023-03-10 16:25:01] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-10 16:25:01] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-10 16:25:01] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2023-03-10 16:25:02] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-10 16:25:02] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2023-03-10 16:25:02] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2023-03-10 16:25:02] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2023-03-10 16:25:03] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-10 16:25:03] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 0 ms to minimize.
[2023-03-10 16:25:03] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 0 ms to minimize.
[2023-03-10 16:25:03] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-10 16:25:04] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-10 16:25:04] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2023-03-10 16:25:04] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 16:25:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 16:25:04] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 8 ms.
Support contains 72 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 570/570 transitions.
Graph (complete) has 2466 edges and 735 vertex of which 657 are kept as prefixes of interest. Removing 78 places using SCC suffix rule.3 ms
Discarding 78 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 657 transition count 570
Applied a total of 3 rules in 102 ms. Remains 657 /735 variables (removed 78) and now considering 570/570 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 657/735 places, 570/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
FORMULA Echo-PT-d02r09-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 570 rows 657 cols
[2023-03-10 16:25:05] [INFO ] Computed 291 place invariants in 160 ms
[2023-03-10 16:25:05] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:25:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-10 16:25:06] [INFO ] [Nat]Absence check using 9 positive and 282 generalized place invariants in 611 ms returned sat
[2023-03-10 16:25:11] [INFO ] After 5577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:25:12] [INFO ] After 5969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 249 ms.
[2023-03-10 16:25:12] [INFO ] After 7070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 31 out of 657 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 657/657 places, 570/570 transitions.
Graph (complete) has 1915 edges and 657 vertex of which 647 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 647 transition count 566
Applied a total of 4 rules in 37 ms. Remains 647 /657 variables (removed 10) and now considering 566/570 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 647/657 places, 566/570 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 659726 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659726 steps, saw 116752 distinct states, run finished after 3002 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 566 rows 647 cols
[2023-03-10 16:25:15] [INFO ] Computed 282 place invariants in 135 ms
[2023-03-10 16:25:15] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:25:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-10 16:25:16] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 574 ms returned sat
[2023-03-10 16:25:28] [INFO ] After 12291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:25:29] [INFO ] After 13204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-10 16:25:30] [INFO ] After 14287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 16 ms.
Support contains 31 out of 647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 30 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 647/647 places, 566/566 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 25 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
[2023-03-10 16:25:30] [INFO ] Invariant cache hit.
[2023-03-10 16:25:31] [INFO ] Implicit Places using invariants in 1851 ms returned []
[2023-03-10 16:25:31] [INFO ] Invariant cache hit.
[2023-03-10 16:25:38] [INFO ] Implicit Places using invariants and state equation in 6601 ms returned []
Implicit Place search using SMT with State Equation took 8467 ms to find 0 implicit places.
[2023-03-10 16:25:38] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-10 16:25:38] [INFO ] Invariant cache hit.
[2023-03-10 16:25:39] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9614 ms. Remains : 647/647 places, 566/566 transitions.
Applied a total of 0 rules in 41 ms. Remains 647 /647 variables (removed 0) and now considering 566/566 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-10 16:25:39] [INFO ] Invariant cache hit.
[2023-03-10 16:25:39] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:25:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-10 16:25:40] [INFO ] [Nat]Absence check using 3 positive and 279 generalized place invariants in 512 ms returned sat
[2023-03-10 16:25:52] [INFO ] After 11738ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-10 16:25:52] [INFO ] After 12094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 303 ms.
[2023-03-10 16:25:53] [INFO ] After 13155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-10 16:25:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-10 16:25:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 647 places, 566 transitions and 2902 arcs took 4 ms.
[2023-03-10 16:25:53] [INFO ] Flatten gal took : 98 ms
Total runtime 75131 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/585/inv_0_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11832584 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098336 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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="Echo-PT-d02r09"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d02r09, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855300054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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