About the Execution of LoLa+red for Diffusion2D-PT-D30N010
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.r135-smll-167819413700189.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 lolaxred
Input is Diffusion2D-PT-D30N010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413700189
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.7K Feb 26 04:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 04:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 04:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 04:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 04:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 04:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.0M 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678291180021
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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 15:59:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 15:59:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 15:59:44] [INFO ] Load time of PNML (sax parser for PT used): 541 ms
[2023-03-08 15:59:44] [INFO ] Transformed 900 places.
[2023-03-08 15:59:44] [INFO ] Transformed 6844 transitions.
[2023-03-08 15:59:44] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 735 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-08 15:59:44] [INFO ] Computed 1 place invariants in 119 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :73
FORMULA Diffusion2D-PT-D30N010-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 15) seen :7
[2023-03-08 15:59:44] [INFO ] Invariant cache hit.
[2023-03-08 15:59:45] [INFO ] [Real]Absence check using 1 positive place invariants in 28 ms returned sat
[2023-03-08 15:59:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 15:59:47] [INFO ] [Real]Absence check using state equation in 2304 ms returned sat
[2023-03-08 15:59:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 757 ms.
[2023-03-08 15:59:49] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-08 15:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 15:59:50] [INFO ] [Real]Absence check using state equation in 1668 ms returned sat
[2023-03-08 15:59:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 15:59:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-08 15:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 15:59:53] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2023-03-08 15:59:54] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 766 ms.
[2023-03-08 15:59:54] [INFO ] [Real]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-08 15:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 15:59:56] [INFO ] [Real]Absence check using state equation in 1795 ms returned sat
[2023-03-08 15:59:57] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 752 ms.
[2023-03-08 15:59:57] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 15:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 15:59:59] [INFO ] [Real]Absence check using state equation in 1879 ms returned sat
[2023-03-08 15:59:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-08 16:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:01] [INFO ] [Nat]Absence check using state equation in 1767 ms returned sat
[2023-03-08 16:00:02] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 648 ms.
[2023-03-08 16:00:02] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:04] [INFO ] [Real]Absence check using state equation in 1795 ms returned sat
[2023-03-08 16:00:05] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 531 ms.
[2023-03-08 16:00:05] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-08 16:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:07] [INFO ] [Real]Absence check using state equation in 1934 ms returned sat
[2023-03-08 16:00:08] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 509 ms.
[2023-03-08 16:00:08] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 16:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:10] [INFO ] [Real]Absence check using state equation in 1819 ms returned sat
[2023-03-08 16:00:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 16:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:12] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2023-03-08 16:00:13] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 502 ms.
[2023-03-08 16:00:13] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-08 16:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:15] [INFO ] [Real]Absence check using state equation in 1814 ms returned sat
[2023-03-08 16:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:17] [INFO ] [Nat]Absence check using state equation in 1637 ms returned sat
[2023-03-08 16:00:17] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 450 ms.
[2023-03-08 16:00:18] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-08 16:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:19] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2023-03-08 16:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 16:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:21] [INFO ] [Nat]Absence check using state equation in 1717 ms returned sat
[2023-03-08 16:00:22] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 701 ms.
[2023-03-08 16:00:22] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2023-03-08 16:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:24] [INFO ] [Real]Absence check using state equation in 2075 ms returned sat
[2023-03-08 16:00:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 18 ms returned sat
[2023-03-08 16:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:26] [INFO ] [Nat]Absence check using state equation in 1804 ms returned sat
[2023-03-08 16:00:27] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 730 ms.
[2023-03-08 16:00:28] [INFO ] [Real]Absence check using 1 positive place invariants in 17 ms returned sat
[2023-03-08 16:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:30] [INFO ] [Real]Absence check using state equation in 2011 ms returned sat
[2023-03-08 16:00:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:32] [INFO ] [Nat]Absence check using state equation in 1966 ms returned sat
[2023-03-08 16:00:33] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 437 ms.
[2023-03-08 16:00:33] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-08 16:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:34] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2023-03-08 16:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:36] [INFO ] [Nat]Absence check using state equation in 1670 ms returned sat
[2023-03-08 16:00:37] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 522 ms.
[2023-03-08 16:00:37] [INFO ] [Real]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 16:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:39] [INFO ] [Real]Absence check using state equation in 1807 ms returned sat
[2023-03-08 16:00:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-08 16:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:41] [INFO ] [Nat]Absence check using state equation in 1943 ms returned sat
[2023-03-08 16:00:42] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 733 ms.
[2023-03-08 16:00:42] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:44] [INFO ] [Real]Absence check using state equation in 1499 ms returned sat
[2023-03-08 16:00:45] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 464 ms.
[2023-03-08 16:00:45] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:46] [INFO ] [Real]Absence check using state equation in 1629 ms returned sat
[2023-03-08 16:00:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 16:00:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-08 16:00:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 16:00:48] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2023-03-08 16:00:49] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 442 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10] Max seen :[1, 9, 1, 8, 1, 7, 8, 9, 0, 0, 0, 9, 0, 1, 9]
Support contains 15 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6614 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 17 ms
Free SCC test removed 884 places
Drop transitions removed 6614 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 6810 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 16 transition count 28
Applied a total of 7 rules in 51 ms. Remains 16 /900 variables (removed 884) and now considering 28/6844 (removed 6816) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 16/900 places, 28/6844 transitions.
// Phase 1: matrix 28 rows 16 cols
[2023-03-08 16:00:49] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 15) seen :150
FORMULA Diffusion2D-PT-D30N010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 66652 ms.
ITS solved all properties within timeout
BK_STOP 1678291251167
--------------------
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 UpperBounds -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="Diffusion2D-PT-D30N010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Diffusion2D-PT-D30N010, 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 r135-smll-167819413700189"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N010.tgz
mv Diffusion2D-PT-D30N010 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 '
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 ;