Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415200067.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is QuasiCertifProtocol-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415200067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 26K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 209K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 27 09:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 27 09:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 55K May 5 16:51 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 QuasiCertifProtocol-PT-02-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621233768747

Running Version 0
[2021-05-17 06:42:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 06:42:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:42:50] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2021-05-17 06:42:50] [INFO ] Transformed 86 places.
[2021-05-17 06:42:50] [INFO ] Transformed 56 transitions.
[2021-05-17 06:42:50] [INFO ] Parsed PT model containing 86 places and 56 transitions in 66 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 56 rows 86 cols
[2021-05-17 06:42:50] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 1640 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :15
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 565 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 559 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 562 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10000 steps, including 564 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 545 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 439 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 569 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 557 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 557 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10000 steps, including 560 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 561 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 570 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10000 steps, including 565 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 549 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 15) seen :14
// Phase 1: matrix 56 rows 86 cols
[2021-05-17 06:42:50] [INFO ] Computed 31 place invariants in 7 ms
[2021-05-17 06:42:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2021-05-17 06:42:50] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-17 06:42:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:50] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-17 06:42:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 06:42:50] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-17 06:42:50] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:42:50] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 9 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-17 06:42:51] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:42:51] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-17 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-17 06:42:51] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-17 06:42:51] [INFO ] Added : 28 causal constraints over 6 iterations in 37 ms. Result :sat
Minimization took 16 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:42:51] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:42:51] [INFO ] Added : 26 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 16 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:42:51] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:42:51] [INFO ] Added : 20 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 9 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-17 06:42:51] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:42:51] [INFO ] Added : 19 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 8 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 06:42:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-17 06:42:51] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:42:51] [INFO ] Added : 18 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 9 ms.
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2021-05-17 06:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-17 06:42:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-17 06:42:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:42:52] [INFO ] Added : 25 causal constraints over 5 iterations in 44 ms. Result :sat
Minimization took 16 ms.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 5 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 06:42:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-17 06:42:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:42:52] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-17 06:42:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-17 06:42:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 06:42:52] [INFO ] Added : 26 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 06:42:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-17 06:42:52] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 06:42:52] [INFO ] Added : 18 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [9, 3, 3, 9, 27, -1, 3, 1, -1, -1, 1, 3, -1, 3, -1] Max seen :[2, 3, 3, 2, 0, 0, 3, 1, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-02 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 2000 steps, including 101 resets, run finished after 6 ms. (steps per millisecond=333 ) properties (out of 11) seen :13 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 2700 steps, including 111 resets, run finished after 6 ms. (steps per millisecond=450 ) properties (out of 10) seen :24 could not realise parikh vector
Incomplete Parikh walk after 2500 steps, including 111 resets, run finished after 22 ms. (steps per millisecond=113 ) properties (out of 10) seen :21 could not realise parikh vector
Incomplete Parikh walk after 2600 steps, including 108 resets, run finished after 6 ms. (steps per millisecond=433 ) properties (out of 10) seen :21 could not realise parikh vector
Incomplete Parikh walk after 1900 steps, including 102 resets, run finished after 4 ms. (steps per millisecond=475 ) properties (out of 10) seen :11 could not realise parikh vector
Incomplete Parikh walk after 2000 steps, including 103 resets, run finished after 4 ms. (steps per millisecond=500 ) properties (out of 10) seen :12 could not realise parikh vector
Incomplete Parikh walk after 2400 steps, including 108 resets, run finished after 6 ms. (steps per millisecond=400 ) properties (out of 10) seen :17 could not realise parikh vector
Incomplete Parikh walk after 2600 steps, including 106 resets, run finished after 6 ms. (steps per millisecond=433 ) properties (out of 10) seen :21 could not realise parikh vector
Incomplete Parikh walk after 2800 steps, including 108 resets, run finished after 6 ms. (steps per millisecond=466 ) properties (out of 10) seen :24 could not realise parikh vector
Incomplete Parikh walk after 1100 steps, including 93 resets, run finished after 2 ms. (steps per millisecond=550 ) properties (out of 10) seen :7 could not realise parikh vector
Incomplete Parikh walk after 1100 steps, including 92 resets, run finished after 3 ms. (steps per millisecond=366 ) properties (out of 10) seen :7 could not realise parikh vector
Support contains 19 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 76 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 73 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 71 transition count 34
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 28 place count 71 transition count 29
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 43 place count 61 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 43 place count 61 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 59 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 57 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 56 transition count 25
Applied a total of 51 rules in 24 ms. Remains 56 /86 variables (removed 30) and now considering 25/56 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 56/86 places, 25/56 transitions.
// Phase 1: matrix 25 rows 56 cols
[2021-05-17 06:42:52] [INFO ] Computed 31 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 114421 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 27030 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 27030 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 46346 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 45934 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 46319 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000000 steps, including 46332 resets, run finished after 400 ms. (steps per millisecond=2500 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 1000001 steps, including 46368 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000000 steps, including 46117 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 46316 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 10) seen :24
Incomplete Best-First random walk after 1000001 steps, including 46312 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 10) seen :23
// Phase 1: matrix 25 rows 56 cols
[2021-05-17 06:42:58] [INFO ] Computed 31 place invariants in 2 ms
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 10 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 13 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 6 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 9 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 3 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 4 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using 0 positive and 31 generalized place invariants in 5 ms returned sat
[2021-05-17 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 06:42:58] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 3, 9, 3, 1, 1, 1, 1, 1, 1] Max seen :[3, 3, 9, 3, 1, 1, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-05 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621233778683

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is QuasiCertifProtocol-PT-02, 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 r178-tajo-162089415200067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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