fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r204-oct2-165281598800085
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RobotManipulation-PT-02000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1376.852 10592.00 15772.00 61.00 4000 4000 4000 4000 4000 4001 4000 4000 4000 4001 4000 4000 4000 4000 4000 4000 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281598800085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 RobotManipulation-PT-02000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598800085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 7.9K Apr 29 13:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 29 13:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 13:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-02000-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652945736056

Running Version 202205111006
[2022-05-19 07:35:37] [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-19 07:35:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:35:37] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2022-05-19 07:35:37] [INFO ] Transformed 15 places.
[2022-05-19 07:35:37] [INFO ] Transformed 11 transitions.
[2022-05-19 07:35:37] [INFO ] Parsed PT model containing 15 places and 11 transitions in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:35:37] [INFO ] Computed 6 place invariants in 13 ms
FORMULA RobotManipulation-PT-02000-UpperBounds-12 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-09 4001 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-08 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 12008 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1200 ) properties (out of 13) seen :16001
FORMULA RobotManipulation-PT-02000-UpperBounds-05 4001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :12836
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :12828
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :12464
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :12171
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 12) seen :12095
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :12832
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 12) seen :12311
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :12163
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 12) seen :12315
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 12) seen :12096
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 12) seen :12110
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 12) seen :12472
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:35:37] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 07:35:37] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 07:35:37] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 07:35:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2022-05-19 07:35:37] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 07:35:37] [INFO ] Added : 8 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 07:35:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-19 07:35:37] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 07:35:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 07:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 07:35:38] [INFO ] Added : 8 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 4 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Added : 9 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 8 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 16 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Added : 8 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Added : 8 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 24 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 07:35:38] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-19 07:35:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 6 ms returned sat
[2022-05-19 07:35:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 07:35:38] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-19 07:35:38] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 07:35:38] [INFO ] Added : 9 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [4001, 4001, 8001, 4001, 4000, 4001, 4001, 4001, 4000, 4000, 4000, 8001] Max seen :[209, 209, 153, 42, 4000, 209, 152, 53, 209, 4000, 4000, 153]
FORMULA RobotManipulation-PT-02000-UpperBounds-14 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-13 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-11 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 13 transition count 10
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 10 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/15 places, 9/11 transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-19 07:35:45] [INFO ] Computed 5 place invariants in 0 ms
FORMULA RobotManipulation-PT-02000-UpperBounds-15 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-02 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000238 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8266 ) properties (out of 6) seen :24000
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=5524 ) properties (out of 6) seen :12003
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=6060 ) properties (out of 6) seen :12003
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=5347 ) properties (out of 6) seen :8059
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=5524 ) properties (out of 6) seen :12003
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=4629 ) properties (out of 6) seen :4005
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=5181 ) properties (out of 6) seen :8040
// Phase 1: matrix 9 rows 12 cols
[2022-05-19 07:35:46] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned unsat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned unsat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned unsat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned unsat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:35:46] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [4000, 4000, 4000, 4000, 4000, 4000] Max seen :[4000, 4000, 4000, 4000, 4000, 4000]
FORMULA RobotManipulation-PT-02000-UpperBounds-10 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-07 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-06 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-03 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-01 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-00 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9401 ms.

BK_STOP 1652945746648

--------------------
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="RobotManipulation-PT-02000"
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 RobotManipulation-PT-02000, 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 r204-oct2-165281598800085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-02000.tgz
mv RobotManipulation-PT-02000 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 ;