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

About the Execution of Smart+red for QuasiCertifProtocol-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
401.063 57342.00 68453.00 313.50 10 1 19 19 19 361 1 19 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 42K Feb 26 01:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 289K Feb 26 01:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 89K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 593K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 360K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679560488013

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:34:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 08:34:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:34:49] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-23 08:34:49] [INFO ] Transformed 1398 places.
[2023-03-23 08:34:49] [INFO ] Transformed 296 transitions.
[2023-03-23 08:34:49] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 296 rows 1398 cols
[2023-03-23 08:34:49] [INFO ] Computed 1103 place invariants in 80 ms
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 442 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 15) seen :15
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :19
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :15
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :14
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :13
[2023-03-23 08:34:50] [INFO ] Invariant cache hit.
[2023-03-23 08:34:50] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2023-03-23 08:34:50] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 179 ms returned sat
[2023-03-23 08:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:51] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2023-03-23 08:34:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:34:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-23 08:34:51] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 162 ms returned sat
[2023-03-23 08:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:51] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-23 08:34:51] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2023-03-23 08:34:52] [INFO ] Added : 41 causal constraints over 9 iterations in 452 ms. Result :sat
Minimization took 75 ms.
[2023-03-23 08:34:52] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-23 08:34:52] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 170 ms returned sat
[2023-03-23 08:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:52] [INFO ] [Real]Absence check using state equation in 314 ms returned unsat
[2023-03-23 08:34:53] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:34:53] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 169 ms returned sat
[2023-03-23 08:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:53] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2023-03-23 08:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:34:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:34:53] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 177 ms returned sat
[2023-03-23 08:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:54] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2023-03-23 08:34:54] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 31 ms.
[2023-03-23 08:34:54] [INFO ] Added : 39 causal constraints over 8 iterations in 372 ms. Result :sat
Minimization took 101 ms.
[2023-03-23 08:34:54] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:34:55] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 167 ms returned sat
[2023-03-23 08:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:55] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-23 08:34:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:34:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-23 08:34:55] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 174 ms returned sat
[2023-03-23 08:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:56] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-03-23 08:34:56] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 34 ms.
[2023-03-23 08:34:56] [INFO ] Added : 41 causal constraints over 9 iterations in 407 ms. Result :sat
Minimization took 132 ms.
[2023-03-23 08:34:57] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:34:57] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 196 ms returned sat
[2023-03-23 08:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:57] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2023-03-23 08:34:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:34:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:34:57] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 190 ms returned sat
[2023-03-23 08:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:58] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-23 08:34:58] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 26 ms.
[2023-03-23 08:34:59] [INFO ] Added : 89 causal constraints over 18 iterations in 740 ms. Result :sat
Minimization took 219 ms.
[2023-03-23 08:34:59] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:34:59] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 173 ms returned sat
[2023-03-23 08:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:34:59] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-23 08:34:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:35:00] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 170 ms returned sat
[2023-03-23 08:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:00] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-23 08:35:00] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2023-03-23 08:35:01] [INFO ] Added : 41 causal constraints over 9 iterations in 368 ms. Result :sat
Minimization took 84 ms.
[2023-03-23 08:35:01] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:01] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 170 ms returned sat
[2023-03-23 08:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:01] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2023-03-23 08:35:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:35:02] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 175 ms returned sat
[2023-03-23 08:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:02] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2023-03-23 08:35:02] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2023-03-23 08:35:02] [INFO ] Added : 60 causal constraints over 12 iterations in 479 ms. Result :sat
Minimization took 84 ms.
[2023-03-23 08:35:03] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:03] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 173 ms returned sat
[2023-03-23 08:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:03] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2023-03-23 08:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-23 08:35:04] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 179 ms returned sat
[2023-03-23 08:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:04] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-23 08:35:04] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2023-03-23 08:35:04] [INFO ] Added : 40 causal constraints over 8 iterations in 348 ms. Result :sat
Minimization took 78 ms.
[2023-03-23 08:35:04] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-23 08:35:05] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 164 ms returned sat
[2023-03-23 08:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:05] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-23 08:35:05] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 25 ms.
[2023-03-23 08:35:06] [INFO ] Added : 82 causal constraints over 17 iterations in 802 ms. Result :sat
Minimization took 103 ms.
[2023-03-23 08:35:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:06] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 169 ms returned sat
[2023-03-23 08:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:07] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2023-03-23 08:35:07] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2023-03-23 08:35:07] [INFO ] Added : 81 causal constraints over 17 iterations in 701 ms. Result :sat
Minimization took 84 ms.
[2023-03-23 08:35:08] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:08] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 171 ms returned sat
[2023-03-23 08:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:08] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-23 08:35:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:35:09] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 178 ms returned sat
[2023-03-23 08:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:09] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2023-03-23 08:35:09] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2023-03-23 08:35:10] [INFO ] Added : 81 causal constraints over 17 iterations in 652 ms. Result :sat
Minimization took 83 ms.
[2023-03-23 08:35:10] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:10] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 176 ms returned sat
[2023-03-23 08:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:10] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2023-03-23 08:35:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-23 08:35:11] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 172 ms returned sat
[2023-03-23 08:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:11] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-23 08:35:11] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2023-03-23 08:35:12] [INFO ] Added : 89 causal constraints over 18 iterations in 671 ms. Result :sat
Minimization took 87 ms.
[2023-03-23 08:35:12] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-23 08:35:12] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 176 ms returned sat
[2023-03-23 08:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:13] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-23 08:35:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:13] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 174 ms returned sat
[2023-03-23 08:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:13] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2023-03-23 08:35:13] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 31 ms.
[2023-03-23 08:35:14] [INFO ] Added : 97 causal constraints over 20 iterations in 764 ms. Result :sat
Minimization took 87 ms.
[2023-03-23 08:35:14] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:35:14] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 171 ms returned sat
[2023-03-23 08:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:15] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-23 08:35:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:35:15] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 170 ms returned sat
[2023-03-23 08:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:15] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-23 08:35:16] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 38 ms.
[2023-03-23 08:35:16] [INFO ] Added : 21 causal constraints over 5 iterations in 262 ms. Result :sat
Minimization took 78 ms.
[2023-03-23 08:35:16] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-23 08:35:16] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 170 ms returned sat
[2023-03-23 08:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:17] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2023-03-23 08:35:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:35:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-23 08:35:17] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 171 ms returned sat
[2023-03-23 08:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:17] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-23 08:35:17] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 17 ms.
[2023-03-23 08:35:18] [INFO ] Added : 79 causal constraints over 16 iterations in 632 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1, 19, 361, -1, -1, 1, 361, -1, 1, 19, 19, 19, 1, -1] Max seen :[0, 19, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-02 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 423 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 978 are kept as prefixes of interest. Removing 420 places using SCC suffix rule.5 ms
Discarding 420 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Drop transitions removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Discarding 19 places :
Implicit places reduction removed 19 places
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 959 transition count 161
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 152 place count 942 transition count 161
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 152 place count 942 transition count 141
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 229 place count 885 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 229 place count 885 transition count 140
Deduced a syphon composed of 1 places in 1 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 232 place count 883 transition count 140
Applied a total of 232 rules in 109 ms. Remains 883 /1398 variables (removed 515) and now considering 140/296 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 883/1398 places, 140/296 transitions.
// Phase 1: matrix 140 rows 883 cols
[2023-03-23 08:35:19] [INFO ] Computed 743 place invariants in 13 ms
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 19607 resets, run finished after 9255 ms. (steps per millisecond=108 ) properties (out of 6) seen :46
Incomplete Best-First random walk after 1000001 steps, including 894 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 6) seen :410
Incomplete Best-First random walk after 1000001 steps, including 1484 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 6) seen :48
Interrupted Best-First random walk after 868890 steps, including 1534 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 46
Incomplete Best-First random walk after 1000001 steps, including 1826 resets, run finished after 1758 ms. (steps per millisecond=568 ) properties (out of 6) seen :44
Incomplete Best-First random walk after 1000001 steps, including 1783 resets, run finished after 1548 ms. (steps per millisecond=645 ) properties (out of 6) seen :44
Incomplete Best-First random walk after 1000000 steps, including 1766 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 6) seen :43
[2023-03-23 08:35:42] [INFO ] Invariant cache hit.
[2023-03-23 08:35:42] [INFO ] [Real]Absence check using 360 positive place invariants in 68 ms returned sat
[2023-03-23 08:35:42] [INFO ] [Real]Absence check using 360 positive and 383 generalized place invariants in 59 ms returned sat
[2023-03-23 08:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:42] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-23 08:35:43] [INFO ] [Real]Absence check using 360 positive place invariants in 55 ms returned sat
[2023-03-23 08:35:43] [INFO ] [Real]Absence check using 360 positive and 383 generalized place invariants in 42 ms returned unsat
[2023-03-23 08:35:43] [INFO ] [Real]Absence check using 360 positive place invariants in 65 ms returned sat
[2023-03-23 08:35:43] [INFO ] [Real]Absence check using 360 positive and 383 generalized place invariants in 116 ms returned sat
[2023-03-23 08:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:43] [INFO ] [Real]Absence check using state equation in 417 ms returned unsat
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using 360 positive place invariants in 68 ms returned sat
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using 360 positive and 383 generalized place invariants in 54 ms returned sat
[2023-03-23 08:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using state equation in 13 ms returned unsat
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using 360 positive place invariants in 60 ms returned sat
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using 360 positive and 383 generalized place invariants in 25 ms returned unsat
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using 360 positive place invariants in 58 ms returned sat
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using 360 positive and 383 generalized place invariants in 55 ms returned sat
[2023-03-23 08:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:35:44] [INFO ] [Real]Absence check using state equation in 84 ms returned unsat
Current structural bounds on expressions (after SMT) : [19, 19, 361, 19, 1, 1] Max seen :[19, 19, 361, 19, 1, 1]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-07 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-05 361 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-04 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 55132 ms.
ITS solved all properties within timeout

BK_STOP 1679560545355

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is QuasiCertifProtocol-PT-18, 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 r299-tall-167873953600885"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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