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-165277017400973.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-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017400973
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 22K Apr 30 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 30 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 30 13:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 149K 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-10-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652994391366

Running Version 202205111006
[2022-05-19 21:06:32] [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 21:06:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 21:06:32] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2022-05-19 21:06:32] [INFO ] Transformed 550 places.
[2022-05-19 21:06:32] [INFO ] Transformed 176 transitions.
[2022-05-19 21:06:32] [INFO ] Parsed PT model containing 550 places and 176 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 176 rows 550 cols
[2022-05-19 21:06:32] [INFO ] Computed 375 place invariants in 42 ms
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 693 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :4
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :2
// Phase 1: matrix 176 rows 550 cols
[2022-05-19 21:06:33] [INFO ] Computed 375 place invariants in 15 ms
[2022-05-19 21:06:33] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2022-05-19 21:06:33] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 78 ms returned sat
[2022-05-19 21:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:33] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-19 21:06:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:33] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2022-05-19 21:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:33] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-05-19 21:06:33] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2022-05-19 21:06:33] [INFO ] Added : 13 causal constraints over 3 iterations in 121 ms. Result :sat
Minimization took 48 ms.
[2022-05-19 21:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2022-05-19 21:06:34] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2022-05-19 21:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:34] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-05-19 21:06:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:34] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2022-05-19 21:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:34] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2022-05-19 21:06:34] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2022-05-19 21:06:34] [INFO ] Added : 53 causal constraints over 11 iterations in 248 ms. Result :sat
Minimization took 67 ms.
[2022-05-19 21:06:34] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:34] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2022-05-19 21:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:35] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2022-05-19 21:06:35] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2022-05-19 21:06:35] [INFO ] Added : 46 causal constraints over 10 iterations in 259 ms. Result :sat
Minimization took 44 ms.
[2022-05-19 21:06:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:35] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2022-05-19 21:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:35] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-19 21:06:35] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 17 ms.
[2022-05-19 21:06:35] [INFO ] Added : 35 causal constraints over 7 iterations in 172 ms. Result :sat
Minimization took 36 ms.
[2022-05-19 21:06:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:36] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-05-19 21:06:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:36] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2022-05-19 21:06:36] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2022-05-19 21:06:36] [INFO ] Added : 35 causal constraints over 7 iterations in 158 ms. Result :sat
Minimization took 50 ms.
[2022-05-19 21:06:36] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 45 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:36] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-19 21:06:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2022-05-19 21:06:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:37] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-05-19 21:06:37] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2022-05-19 21:06:37] [INFO ] Added : 24 causal constraints over 5 iterations in 127 ms. Result :sat
Minimization took 53 ms.
[2022-05-19 21:06:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:37] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2022-05-19 21:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:37] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-19 21:06:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:37] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2022-05-19 21:06:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:37] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2022-05-19 21:06:37] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2022-05-19 21:06:37] [INFO ] Added : 15 causal constraints over 3 iterations in 90 ms. Result :sat
Minimization took 33 ms.
[2022-05-19 21:06:37] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-19 21:06:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 44 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:38] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-19 21:06:38] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2022-05-19 21:06:38] [INFO ] Added : 15 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 34 ms.
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2022-05-19 21:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using state equation in 101 ms returned unsat
[2022-05-19 21:06:38] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:39] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2022-05-19 21:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:39] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2022-05-19 21:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:39] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2022-05-19 21:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:39] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-05-19 21:06:39] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2022-05-19 21:06:39] [INFO ] Added : 47 causal constraints over 10 iterations in 219 ms. Result :sat
Minimization took 50 ms.
[2022-05-19 21:06:39] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:39] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2022-05-19 21:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:39] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-19 21:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:40] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2022-05-19 21:06:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:40] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2022-05-19 21:06:40] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2022-05-19 21:06:40] [INFO ] Added : 47 causal constraints over 10 iterations in 194 ms. Result :sat
Minimization took 38 ms.
[2022-05-19 21:06:40] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:40] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 53 ms returned sat
[2022-05-19 21:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:40] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-19 21:06:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 21:06:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:40] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2022-05-19 21:06:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:40] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-19 21:06:40] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 16 ms.
[2022-05-19 21:06:41] [INFO ] Added : 23 causal constraints over 5 iterations in 126 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1, 121, 1, 121, 121, -1, 1, 1, 1, 6, 11, 11] Max seen :[0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-13 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 45 out of 550 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 391 are kept as prefixes of interest. Removing 159 places using SCC suffix rule.18 ms
Discarding 159 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Discarding 11 places :
Implicit places reduction removed 11 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 70 rules applied. Total rules applied 71 place count 380 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 379 transition count 104
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 72 place count 379 transition count 82
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 65 rules applied. Total rules applied 137 place count 336 transition count 82
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 137 place count 336 transition count 81
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 140 place count 334 transition count 81
Applied a total of 140 rules in 84 ms. Remains 334 /550 variables (removed 216) and now considering 81/176 (removed 95) transitions.
Finished structural reductions, in 1 iterations. Remains : 334/550 places, 81/176 transitions.
// Phase 1: matrix 81 rows 334 cols
[2022-05-19 21:06:41] [INFO ] Computed 253 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 33327 resets, run finished after 2593 ms. (steps per millisecond=385 ) properties (out of 7) seen :31
Incomplete Best-First random walk after 1000001 steps, including 5565 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 7) seen :24
Incomplete Best-First random walk after 1000001 steps, including 4876 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 7) seen :30
Incomplete Best-First random walk after 1000001 steps, including 4721 resets, run finished after 1019 ms. (steps per millisecond=981 ) properties (out of 7) seen :33
Incomplete Best-First random walk after 1000001 steps, including 2814 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 7) seen :26
Incomplete Best-First random walk after 1000001 steps, including 4988 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 7) seen :29
Incomplete Best-First random walk after 1000001 steps, including 4891 resets, run finished after 847 ms. (steps per millisecond=1180 ) properties (out of 7) seen :30
Incomplete Best-First random walk after 1000001 steps, including 4807 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 7) seen :30
// Phase 1: matrix 81 rows 334 cols
[2022-05-19 21:06:50] [INFO ] Computed 253 place invariants in 5 ms
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 31 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 6 ms returned unsat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 44 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 32 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 31 ms returned sat
[2022-05-19 21:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using state equation in 82 ms returned unsat
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 31 ms returned sat
[2022-05-19 21:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using state equation in 104 ms returned unsat
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using 11 positive and 242 generalized place invariants in 30 ms returned sat
[2022-05-19 21:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 21:06:51] [INFO ] [Real]Absence check using state equation in 94 ms returned unsat
Current structural bounds on expressions (after SMT) : [11, 11, 11, 11, 1, 1, 1] Max seen :[11, 11, 11, 11, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18884 ms.

BK_STOP 1652994411429

--------------------
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-10"
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-10, 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-165277017400973"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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