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

About the Execution of LTSMin+red for BugTracking-PT-q3m002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
893.056 26227.00 47072.00 108.90 FTTFTFTFTFTFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694500324.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q3m002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 10K Feb 26 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 07:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 07:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 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 16M 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 BugTracking-PT-q3m002-LTLFireability-00
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-01
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-02
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-03
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-04
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-05
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-06
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-07
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-08
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-09
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-10
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-11
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-12
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-13
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-14
FORMULA_NAME BugTracking-PT-q3m002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678625262309

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 12:47:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 12:47:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 12:47:45] [INFO ] Load time of PNML (sax parser for PT used): 746 ms
[2023-03-12 12:47:45] [INFO ] Transformed 754 places.
[2023-03-12 12:47:45] [INFO ] Transformed 27370 transitions.
[2023-03-12 12:47:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 975 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 514 places in 114 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BugTracking-PT-q3m002-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m002-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 78 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 12:47:45] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 12:47:45] [INFO ] Computed 8 place invariants in 40 ms
[2023-03-12 12:47:46] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-12 12:47:46] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 12:47:46] [INFO ] Invariant cache hit.
[2023-03-12 12:47:46] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 12:47:47] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2023-03-12 12:47:47] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 12:47:47] [INFO ] Invariant cache hit.
[2023-03-12 12:47:48] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3094 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 3 out of 237 places after structural reductions.
[2023-03-12 12:47:49] [INFO ] Flatten gal took : 286 ms
[2023-03-12 12:47:49] [INFO ] Flatten gal took : 157 ms
[2023-03-12 12:47:49] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 241 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 95 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 158915 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158915 steps, saw 92804 distinct states, run finished after 3002 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:47:52] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 12:47:52] [INFO ] Invariant cache hit.
[2023-03-12 12:47:53] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 12:47:53] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:47:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 12:47:54] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:47:54] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 12:47:54] [INFO ] After 125ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:47:54] [INFO ] After 262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-12 12:47:54] [INFO ] After 1019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 255 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199909 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199909 steps, saw 98358 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 12:47:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 12:47:57] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-12 12:47:58] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 12:47:58] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:47:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 12:47:58] [INFO ] After 478ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:47:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 12:47:59] [INFO ] After 173ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 12:47:59] [INFO ] Deduced a trap composed of 19 places in 257 ms of which 1 ms to minimize.
[2023-03-12 12:47:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 434 ms
[2023-03-12 12:47:59] [INFO ] After 678ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-12 12:47:59] [INFO ] After 1343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 58 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 12:47:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 12:47:59] [INFO ] Invariant cache hit.
[2023-03-12 12:48:00] [INFO ] Implicit Places using invariants in 359 ms returned []
[2023-03-12 12:48:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 12:48:00] [INFO ] Invariant cache hit.
[2023-03-12 12:48:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 12:48:01] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1966 ms to find 0 implicit places.
[2023-03-12 12:48:02] [INFO ] Redundant transitions in 297 ms returned []
[2023-03-12 12:48:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 12:48:02] [INFO ] Invariant cache hit.
[2023-03-12 12:48:03] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3275 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 292 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 12:48:03] [INFO ] Computed 9 place invariants in 31 ms
[2023-03-12 12:48:03] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 12:48:03] [INFO ] After 498ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 12:48:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 12:48:04] [INFO ] After 410ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 12:48:04] [INFO ] After 488ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-12 12:48:04] [INFO ] After 576ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0))||(F(!p0)&&X(X(F(p0))))))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 63 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 12:48:04] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 12:48:04] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 12:48:04] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-12 12:48:04] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 12:48:04] [INFO ] Invariant cache hit.
[2023-03-12 12:48:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 12:48:06] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2160 ms to find 0 implicit places.
[2023-03-12 12:48:07] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-12 12:48:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 12:48:07] [INFO ] Invariant cache hit.
[2023-03-12 12:48:08] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3401 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 231 ms :[p0]
Running random walk in product with property : BugTracking-PT-q3m002-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s66 1) (GEQ s144 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]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA BugTracking-PT-q3m002-LTLFireability-06 TRUE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m002-LTLFireability-06 finished in 3710 ms.
All properties solved by simple procedures.
Total runtime 23977 ms.
ITS solved all properties within timeout

BK_STOP 1678625288536

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -timeout 360 -rebuildPNML

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="BugTracking-PT-q3m002"
export BK_EXAMINATION="LTLFireability"
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 BugTracking-PT-q3m002, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694500324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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