fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856412800101
Last Updated
May 14, 2023

About the Execution of ITS-Tools for IBMB2S565S3960-PT-none

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
492.651 15270.00 22720.00 241.50 7 7 7 3 7 7 3 3 3 3 1 3 7 2 7 3 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.r229-tall-167856412800101.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 IBMB2S565S3960-PT-none, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856412800101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.3K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 05:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 05:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 127K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-00
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-01
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-02
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-03
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-04
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-05
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-06
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-07
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-08
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-09
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-10
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-11
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-12
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-13
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-14
FORMULA_NAME IBMB2S565S3960-PT-none-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679440814084

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=IBMB2S565S3960-PT-none
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-21 23:20:15] [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-21 23:20:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:20:15] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-21 23:20:15] [INFO ] Transformed 273 places.
[2023-03-21 23:20:15] [INFO ] Transformed 179 transitions.
[2023-03-21 23:20:15] [INFO ] Parsed PT model containing 273 places and 179 transitions and 572 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 179 rows 273 cols
[2023-03-21 23:20:15] [INFO ] Computed 101 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 45 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :43
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :17
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :20
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :17
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :11
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :25
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :16
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :14
[2023-03-21 23:20:15] [INFO ] Invariant cache hit.
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 26 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using state equation in 60 ms returned unsat
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 19 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:16] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-21 23:20:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:16] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-21 23:20:16] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-21 23:20:17] [INFO ] Added : 152 causal constraints over 31 iterations in 543 ms. Result :sat
Minimization took 74 ms.
[2023-03-21 23:20:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:17] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:17] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-21 23:20:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:17] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:17] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-21 23:20:17] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-21 23:20:18] [INFO ] Added : 152 causal constraints over 31 iterations in 449 ms. Result :sat
Minimization took 89 ms.
[2023-03-21 23:20:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:18] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:18] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-21 23:20:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:18] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-21 23:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:18] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-21 23:20:18] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-21 23:20:18] [INFO ] Added : 157 causal constraints over 32 iterations in 484 ms. Result :sat
Minimization took 68 ms.
[2023-03-21 23:20:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:19] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-21 23:20:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-21 23:20:19] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-21 23:20:19] [INFO ] Added : 86 causal constraints over 18 iterations in 260 ms. Result :sat
Minimization took 33 ms.
[2023-03-21 23:20:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 16 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:19] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-21 23:20:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:19] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-21 23:20:19] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-21 23:20:20] [INFO ] Added : 154 causal constraints over 32 iterations in 435 ms. Result :sat
Minimization took 44 ms.
[2023-03-21 23:20:20] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:20] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:20] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-21 23:20:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:20] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:20] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-21 23:20:20] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-21 23:20:20] [INFO ] Added : 142 causal constraints over 29 iterations in 442 ms. Result :sat
Minimization took 67 ms.
[2023-03-21 23:20:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:21] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 12 ms returned sat
[2023-03-21 23:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:21] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-21 23:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:21] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:21] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-21 23:20:21] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-21 23:20:21] [INFO ] Added : 148 causal constraints over 30 iterations in 456 ms. Result :sat
Minimization took 66 ms.
[2023-03-21 23:20:21] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:21] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 22 ms returned sat
[2023-03-21 23:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:21] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-21 23:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:22] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-21 23:20:22] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-21 23:20:22] [INFO ] Added : 148 causal constraints over 30 iterations in 453 ms. Result :sat
Minimization took 68 ms.
[2023-03-21 23:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:22] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2023-03-21 23:20:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:22] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-21 23:20:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:23] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-21 23:20:23] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-21 23:20:23] [INFO ] Added : 143 causal constraints over 29 iterations in 434 ms. Result :sat
Minimization took 71 ms.
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 14 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 17 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using state equation in 56 ms returned unsat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 15 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:24] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-21 23:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-21 23:20:24] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 13 ms returned sat
[2023-03-21 23:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:24] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-21 23:20:24] [INFO ] Computed and/alt/rep : 178/299/178 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-21 23:20:24] [INFO ] Added : 145 causal constraints over 29 iterations in 397 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 100, 250, 100, 100, 250, 300, 300, 100, 1, 2100, 7, 2, 7, 900] Max seen :[7, 7, 3, 0, 3, 6, 0, 1, 1, 1, 1, 1, 7, 2, 7, 1]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 273 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 273/273 places, 179/179 transitions.
Graph (complete) has 415 edges and 273 vertex of which 224 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Ensure Unique test removed 80 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 116 edges and 144 vertex of which 20 / 144 are part of one of the 1 SCC in 2 ms
Free SCC test removed 19 places
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 142 rules applied. Total rules applied 143 place count 125 transition count 92
Reduce places removed 56 places and 0 transitions.
Drop transitions removed 22 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 80 rules applied. Total rules applied 223 place count 69 transition count 68
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 229 place count 68 transition count 63
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 234 place count 63 transition count 63
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 234 place count 63 transition count 46
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 35 rules applied. Total rules applied 269 place count 45 transition count 46
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 275 place count 39 transition count 40
Iterating global reduction 4 with 6 rules applied. Total rules applied 281 place count 39 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 282 place count 39 transition count 39
Performed 8 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 300 place count 29 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 301 place count 29 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 302 place count 28 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 28 transition count 28
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 6 with 2 rules applied. Total rules applied 305 place count 27 transition count 27
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 307 place count 27 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 308 place count 26 transition count 26
Applied a total of 308 rules in 34 ms. Remains 26 /273 variables (removed 247) and now considering 26/179 (removed 153) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 26/273 places, 26/179 transitions.
// Phase 1: matrix 26 rows 26 cols
[2023-03-21 23:20:25] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000002 steps, including 36103 resets, run finished after 216 ms. (steps per millisecond=4629 ) properties (out of 10) seen :31
Incomplete Best-First random walk after 1000001 steps, including 8328 resets, run finished after 245 ms. (steps per millisecond=4081 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 1000001 steps, including 8604 resets, run finished after 255 ms. (steps per millisecond=3921 ) properties (out of 10) seen :28
Incomplete Best-First random walk after 1000001 steps, including 7606 resets, run finished after 228 ms. (steps per millisecond=4385 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 1000000 steps, including 23255 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 1000001 steps, including 8648 resets, run finished after 246 ms. (steps per millisecond=4065 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 1000001 steps, including 8636 resets, run finished after 237 ms. (steps per millisecond=4219 ) properties (out of 10) seen :27
Incomplete Best-First random walk after 1000000 steps, including 8585 resets, run finished after 247 ms. (steps per millisecond=4048 ) properties (out of 10) seen :30
Incomplete Best-First random walk after 1000001 steps, including 8650 resets, run finished after 233 ms. (steps per millisecond=4291 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 1000001 steps, including 8614 resets, run finished after 243 ms. (steps per millisecond=4115 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 1000001 steps, including 8615 resets, run finished after 240 ms. (steps per millisecond=4166 ) properties (out of 10) seen :27
[2023-03-21 23:20:27] [INFO ] Invariant cache hit.
[2023-03-21 23:20:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:20:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 5 ms returned unsat
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-21 23:20:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:20:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 3, 7, 7, 3, 3, 3, 3, 3, 3] Max seen :[7, 3, 7, 7, 3, 3, 3, 3, 3, 3]
FORMULA IBMB2S565S3960-PT-none-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-11 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-09 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA IBMB2S565S3960-PT-none-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13046 ms.

BK_STOP 1679440829354

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBMB2S565S3960-PT-none"
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 IBMB2S565S3960-PT-none, 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 r229-tall-167856412800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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