Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 7.1K Apr 30 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 30 13:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 13:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 55K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1652992545081

Running Version 202205111006
[2022-05-19 20:35:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 20:35:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:35:46] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2022-05-19 20:35:46] [INFO ] Transformed 86 places.
[2022-05-19 20:35:46] [INFO ] Transformed 56 transitions.
[2022-05-19 20:35:46] [INFO ] Parsed PT model containing 86 places and 56 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 56 rows 86 cols
[2022-05-19 20:35:46] [INFO ] Computed 31 place invariants in 11 ms
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1648 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :9
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 563 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 551 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 555 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 568 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 564 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 564 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 558 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10000 steps, including 562 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 563 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 562 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10000 steps, including 567 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :7
// Phase 1: matrix 56 rows 86 cols
[2022-05-19 20:35:46] [INFO ] Computed 31 place invariants in 8 ms
[2022-05-19 20:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:35:46] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 9 ms returned sat
[2022-05-19 20:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-19 20:35:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:46] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:46] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-19 20:35:46] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-19 20:35:46] [INFO ] Added : 15 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 177 ms.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 20:35:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 20:35:47] [INFO ] Added : 29 causal constraints over 6 iterations in 58 ms. Result :sat
Minimization took 18 ms.
[2022-05-19 20:35:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 11 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-19 20:35:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 20:35:47] [INFO ] Added : 29 causal constraints over 6 iterations in 42 ms. Result :sat
Minimization took 21 ms.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-19 20:35:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-19 20:35:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 20:35:47] [INFO ] Added : 28 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 18 ms.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-05-19 20:35:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-19 20:35:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 20:35:47] [INFO ] Added : 15 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 19 ms.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-19 20:35:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:47] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-19 20:35:47] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 20:35:47] [INFO ] Added : 28 causal constraints over 6 iterations in 37 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 20:35:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 20:35:48] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 12 ms.
[2022-05-19 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-19 20:35:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-19 20:35:48] [INFO ] Added : 20 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 10 ms.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 8 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-19 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-19 20:35:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 20:35:48] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 14 ms.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 6 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-19 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-19 20:35:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 20:35:48] [INFO ] Added : 17 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 10 ms.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-19 20:35:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:48] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-19 20:35:48] [INFO ] Computed and/alt/rep : 52/91/52 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-19 20:35:48] [INFO ] Added : 26 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1, 3, 9, 3, 27, 9, 3, -1, -1, 1, 1, 1, 3] Max seen :[0, 3, 0, 3, 0, 0, 0, 0, 0, 0, 1, 1, 0]
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-05 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 20 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 70 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 69 transition count 31
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 69 transition count 21
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 59 place count 51 transition count 21
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 59 place count 51 transition count 19
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 48 transition count 19
Applied a total of 64 rules in 21 ms. Remains 48 /86 variables (removed 38) and now considering 19/56 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/86 places, 19/56 transitions.
// Phase 1: matrix 19 rows 48 cols
[2022-05-19 20:35:48] [INFO ] Computed 29 place invariants in 0 ms
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-04 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 109736 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 43527 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000000 steps, including 38194 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 30798 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 38208 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 34492 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 6) seen :18
Incomplete Best-First random walk after 1000001 steps, including 41742 resets, run finished after 349 ms. (steps per millisecond=2865 ) properties (out of 6) seen :17
// Phase 1: matrix 19 rows 48 cols
[2022-05-19 20:35:52] [INFO ] Computed 29 place invariants in 3 ms
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using state equation in 3 ms returned unsat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 4 ms returned unsat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using state equation in 2 ms returned unsat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 5 ms returned unsat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 4 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using 2 positive and 27 generalized place invariants in 3 ms returned sat
[2022-05-19 20:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:35:52] [INFO ] [Real]Absence check using state equation in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 9, 3, 1, 1, 1] Max seen :[3, 9, 3, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-11 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-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-06 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-02-UpperBounds-01 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6246 ms.

BK_STOP 1652992553501

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="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 r168-tall-165277017400957"
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 ;