About the Execution of ITS-Tools for DrinkVendingMachine-COL-48
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-167819411400605.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 DrinkVendingMachine-COL-48, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r133-smll-167819411400605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 11K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K 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 DrinkVendingMachine-COL-48-UpperBounds-00
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-01
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-02
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-03
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-04
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-05
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-06
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-07
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-08
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-09
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-10
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-11
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-12
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-13
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-14
FORMULA_NAME DrinkVendingMachine-COL-48-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678628420796
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=DrinkVendingMachine-COL-48
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-12 13:40:23] [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-12 13:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:40:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-12 13:40:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 13:40:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 698 ms
[2023-03-12 13:40:24] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 576 PT places and 1.040901408E9 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2023-03-12 13:40:24] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 5 ms.
[2023-03-12 13:40:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 7 rows 6 cols
[2023-03-12 13:40:24] [INFO ] Computed 3 place invariants in 3 ms
FORMULA DrinkVendingMachine-COL-48-UpperBounds-14 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-12 48 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-11 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-10 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-08 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-07 48 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-06 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-05 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DrinkVendingMachine-COL-48-UpperBounds-02 192 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-12 13:40:24] [INFO ] Invariant cache hit.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-12 13:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-12 13:40:24] [INFO ] Added : 2 causal constraints over 1 iterations in 43 ms. Result :sat
Minimization took 8 ms.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:24] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:24] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 13:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 13:40:24] [INFO ] Added : 2 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 13:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:24] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-12 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:24] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-12 13:40:24] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-12 13:40:25] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 13:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 3/11/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 13:40:25] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [48, 48, 192, 48, 48, 192, 192]
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:192) in guard (AND (GT $x 143) (LEQ $x 191))introduces in Quality(192) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:192) in guard (AND (GT $x 95) (LEQ $x 143))introduces in Quality(192) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:192) in guard (AND (GT $x 47) (LEQ $x 95))introduces in Quality(192) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:192) in guard (LEQ $x 47)introduces in Quality(192) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 192 reducing to 4 values.
For transition elaborate3:(AND (GT $x 143) (LEQ $x 191)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 95) (LEQ $x 143)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 47) (LEQ $x 95)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 47) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 48
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 48
[2023-03-12 13:40:25] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 43 ms.
[2023-03-12 13:40:25] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 7) seen :480
FORMULA DrinkVendingMachine-COL-48-UpperBounds-09 48 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-48-UpperBounds-04 48 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-48-UpperBounds-01 48 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DrinkVendingMachine-COL-48-UpperBounds-00 48 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :471
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :471
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :465
// Phase 1: matrix 10 rows 12 cols
[2023-03-12 13:40:25] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:25] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-12 13:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:25] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-12 13:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:40:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-12 13:40:25] [INFO ] Computed and/alt/rep : 6/11/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-12 13:40:25] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [192, 192, 192] Max seen :[157, 157, 157]
FORMULA DrinkVendingMachine-COL-48-UpperBounds-15 192 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DrinkVendingMachine-COL-48-UpperBounds-13 192 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DrinkVendingMachine-COL-48-UpperBounds-03 192 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 2501 ms.
BK_STOP 1678628426883
--------------------
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="DrinkVendingMachine-COL-48"
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 DrinkVendingMachine-COL-48, 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-167819411400605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-48.tgz
mv DrinkVendingMachine-COL-48 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 ;