fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r357-smll-167891805700077
Last Updated
May 14, 2023

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
339.380 14470.00 21644.00 349.90 2001 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2000 2001 normal

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.r357-smll-167891805700077.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 RobotManipulation-PT-01000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891805700077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 05:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 05:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 05:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 05:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 05:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 05:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 5 18:23 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-01000-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-01000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678975287607

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=RobotManipulation-PT-01000
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-16 14:01:30] [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-16 14:01:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:01:30] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2023-03-16 14:01:30] [INFO ] Transformed 15 places.
[2023-03-16 14:01:30] [INFO ] Transformed 11 transitions.
[2023-03-16 14:01:30] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 14:01:30] [INFO ] Computed 6 place invariants in 8 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=910 ) properties (out of 16) seen :12002
FORMULA RobotManipulation-PT-01000-UpperBounds-15 2001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-00 2001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :4034
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :4135
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :4111
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :4390
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :4170
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :4954
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :4030
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :4954
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :4131
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :4119
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :4194
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :4186
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :4366
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :4151
[2023-03-16 14:01:30] [INFO ] Invariant cache hit.
[2023-03-16 14:01:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-16 14:01:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
[2023-03-16 14:01:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 14:01:30] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-16 14:01:30] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 14:01:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 11 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned unsat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned unsat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:01:31] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:01:31] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-16 14:01:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:01:32] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:01:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 14:01:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 14:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-16 14:01:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:01:32] [INFO ] Added : 8 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 5 ms.
[2023-03-16 14:01:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-16 14:01:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 14:01:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 14:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 14:01:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 14:01:32] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-16 14:01:32] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2000, 2001, 2001, 2001, 2001, 2000, 2000, 2000, 2001, 2000, 2001, 2001, 2001, 2000] Max seen :[2000, 36, 36, 155, 56, 2000, 2000, 2000, 36, 50, 56, 56, 155, 50]
FORMULA RobotManipulation-PT-01000-UpperBounds-08 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-07 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-06 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-01 2000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-14 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-01000-UpperBounds-10 2000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 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 2 place count 13 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 4 place count 12 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 6 place count 11 transition count 9
Applied a total of 6 rules in 25 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 11/15 places, 9/11 transitions.
// Phase 1: matrix 9 rows 11 cols
[2023-03-16 14:01:40] [INFO ] Computed 4 place invariants in 1 ms
FORMULA RobotManipulation-PT-01000-UpperBounds-13 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-12 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-11 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-05 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-04 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-03 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-01000-UpperBounds-02 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000511 steps, including 2 resets, run finished after 203 ms. (steps per millisecond=4928 ) properties (out of 0) seen :0
All properties solved without resorting to model-checking.
Total runtime 10963 ms.

BK_STOP 1678975302077

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="RobotManipulation-PT-01000"
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 RobotManipulation-PT-01000, 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 r357-smll-167891805700077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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