fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r114-smll-165264477100053
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for GlobalResAllocation-COL-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
179.203 6047.00 10781.00 141.80 22 22 44 22 22 11 22 22 11 11 22 22 22 22 44 44 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477100053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GlobalResAllocation-COL-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.0K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 GlobalResAllocation-COL-11-UpperBounds-00
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-01
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-02
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-03
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-04
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-05
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-06
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-07
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-08
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-09
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-10
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-11
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-12
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-13
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-14
FORMULA_NAME GlobalResAllocation-COL-11-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652686400238

Running Version 202205111006
[2022-05-16 07:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 07:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:33:22] [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.
[2022-05-16 07:33:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 07:33:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1399 ms
[2022-05-16 07:33:24] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 297 PT places and 2705087.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
[2022-05-16 07:33:24] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 10 ms.
[2022-05-16 07:33:24] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 07:33:24] [INFO ] Computed 3 place invariants in 9 ms
FORMULA GlobalResAllocation-COL-11-UpperBounds-12 22 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-UpperBounds-09 11 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-UpperBounds-08 11 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-UpperBounds-00 22 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 07:33:24] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 07:33:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:24] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 07:33:24] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 07:33:24] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 15 ms.
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:33:24] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 07:33:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:24] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 07:33:24] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 07:33:24] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 07:33:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 07:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-16 07:33:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 07:33:25] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 07:33:25] [INFO ] Computed and/alt/rep : 3/21/3 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 07:33:25] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [22, 44, 22, 22, 22, 22, 22, 22, 22, 44, 44]
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 22
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 07:33:25] [INFO ] Unfolded HLPN to a Petri net with 45 places and 77 transitions 319 arcs in 26 ms.
[2022-05-16 07:33:25] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 11) seen :308
FORMULA GlobalResAllocation-COL-11-UpperBounds-15 44 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-14 44 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-13 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-11 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-10 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-07 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-06 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-04 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-03 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-02 44 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GlobalResAllocation-COL-11-UpperBounds-01 22 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 3582 ms.

BK_STOP 1652686406285

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="GlobalResAllocation-COL-11"
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-4028"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-COL-11, 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 r114-smll-165264477100053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-11.tgz
mv GlobalResAllocation-COL-11 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;