About the Execution of ITS-Tools for Diffusion2D-PT-D30N050
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.r133-smll-167819410400197.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 itstools
Input is Diffusion2D-PT-D30N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819410400197
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.6K Feb 26 04:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 04:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 04:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 04:25 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 27K 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 15K Feb 26 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Feb 26 04:27 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-D30N050-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D30N050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678343703591
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D30N050
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 06:35:07] [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]
[2023-03-09 06:35:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 06:35:07] [INFO ] Load time of PNML (sax parser for PT used): 450 ms
[2023-03-09 06:35:07] [INFO ] Transformed 900 places.
[2023-03-09 06:35:07] [INFO ] Transformed 6844 transitions.
[2023-03-09 06:35:07] [INFO ] Parsed PT model containing 900 places and 6844 transitions and 13688 arcs in 625 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 6844 rows 900 cols
[2023-03-09 06:35:08] [INFO ] Computed 1 place invariants in 136 ms
Incomplete random walk after 10014 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 16) seen :148
FORMULA Diffusion2D-PT-D30N050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
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 :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 :1
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 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 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :0
[2023-03-09 06:35:08] [INFO ] Invariant cache hit.
[2023-03-09 06:35:08] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2023-03-09 06:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:11] [INFO ] [Real]Absence check using state equation in 2349 ms returned sat
[2023-03-09 06:35:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-09 06:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:13] [INFO ] [Nat]Absence check using state equation in 1880 ms returned sat
[2023-03-09 06:35:14] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 714 ms.
[2023-03-09 06:35:14] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:16] [INFO ] [Real]Absence check using state equation in 1691 ms returned sat
[2023-03-09 06:35:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 06:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:18] [INFO ] [Nat]Absence check using state equation in 1789 ms returned sat
[2023-03-09 06:35:19] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 655 ms.
[2023-03-09 06:35:19] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:21] [INFO ] [Real]Absence check using state equation in 1691 ms returned sat
[2023-03-09 06:35:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 06:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:24] [INFO ] [Nat]Absence check using state equation in 2102 ms returned sat
[2023-03-09 06:35:25] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 613 ms.
[2023-03-09 06:35:25] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:26] [INFO ] [Real]Absence check using state equation in 1666 ms returned sat
[2023-03-09 06:35:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:29] [INFO ] [Nat]Absence check using state equation in 1713 ms returned sat
[2023-03-09 06:35:29] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 577 ms.
[2023-03-09 06:35:30] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-09 06:35:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:32] [INFO ] [Real]Absence check using state equation in 2115 ms returned sat
[2023-03-09 06:35:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 06:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:34] [INFO ] [Nat]Absence check using state equation in 1866 ms returned sat
[2023-03-09 06:35:35] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 554 ms.
[2023-03-09 06:35:35] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-09 06:35:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:37] [INFO ] [Real]Absence check using state equation in 1927 ms returned sat
[2023-03-09 06:35:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:39] [INFO ] [Nat]Absence check using state equation in 1840 ms returned sat
[2023-03-09 06:35:40] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 452 ms.
[2023-03-09 06:35:40] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:42] [INFO ] [Real]Absence check using state equation in 1701 ms returned sat
[2023-03-09 06:35:43] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 538 ms.
[2023-03-09 06:35:43] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:44] [INFO ] [Real]Absence check using state equation in 1627 ms returned sat
[2023-03-09 06:35:45] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 595 ms.
[2023-03-09 06:35:46] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:47] [INFO ] [Real]Absence check using state equation in 1425 ms returned sat
[2023-03-09 06:35:48] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 586 ms.
[2023-03-09 06:35:48] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-09 06:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:50] [INFO ] [Real]Absence check using state equation in 1526 ms returned sat
[2023-03-09 06:35:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 06:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:52] [INFO ] [Nat]Absence check using state equation in 1678 ms returned sat
[2023-03-09 06:35:52] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 506 ms.
[2023-03-09 06:35:52] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 06:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:54] [INFO ] [Real]Absence check using state equation in 1846 ms returned sat
[2023-03-09 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 06:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:56] [INFO ] [Nat]Absence check using state equation in 1652 ms returned sat
[2023-03-09 06:35:57] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 456 ms.
[2023-03-09 06:35:57] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:35:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:35:59] [INFO ] [Real]Absence check using state equation in 1766 ms returned sat
[2023-03-09 06:35:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:35:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-09 06:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:01] [INFO ] [Nat]Absence check using state equation in 1768 ms returned sat
[2023-03-09 06:36:02] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 615 ms.
[2023-03-09 06:36:02] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:04] [INFO ] [Real]Absence check using state equation in 1691 ms returned sat
[2023-03-09 06:36:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:36:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-09 06:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:06] [INFO ] [Nat]Absence check using state equation in 1825 ms returned sat
[2023-03-09 06:36:07] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 556 ms.
[2023-03-09 06:36:07] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:09] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2023-03-09 06:36:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:36:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 06:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:11] [INFO ] [Nat]Absence check using state equation in 1914 ms returned sat
[2023-03-09 06:36:12] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 556 ms.
[2023-03-09 06:36:12] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-09 06:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:14] [INFO ] [Real]Absence check using state equation in 1681 ms returned sat
[2023-03-09 06:36:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 06:36:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 20 ms returned sat
[2023-03-09 06:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 06:36:16] [INFO ] [Nat]Absence check using state equation in 1882 ms returned sat
[2023-03-09 06:36:17] [INFO ] Computed and/alt/rep : 6836/52948/6836 causal constraints (skipped 0 transitions) in 445 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[0, 0, 0, 0, 0, 0, 4, 1, 1, 49, 0, 0, 49, 0, 0]
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 6616 edges and 900 vertex of which 885 / 900 are part of one of the 1 SCC in 21 ms
Free SCC test removed 884 places
Drop transitions removed 6616 transitions
Ensure Unique test removed 198 transitions
Reduce isomorphic transitions removed 6814 transitions.
Applied a total of 1 rules in 80 ms. Remains 16 /900 variables (removed 884) and now considering 30/6844 (removed 6814) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 16/900 places, 30/6844 transitions.
// Phase 1: matrix 30 rows 16 cols
[2023-03-09 06:36:17] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=3690 ) properties (out of 15) seen :750
FORMULA Diffusion2D-PT-D30N050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Diffusion2D-PT-D30N050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 70542 ms.
BK_STOP 1678343778672
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="Diffusion2D-PT-D30N050"
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-5348"
echo " Executing tool itstools"
echo " Input is Diffusion2D-PT-D30N050, 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 r133-smll-167819410400197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Diffusion2D-PT-D30N050.tgz
mv Diffusion2D-PT-D30N050 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 ;