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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 992K
-rw-r--r-- 1 mcc users 30K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 235K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 01:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 262K Feb 26 01:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K 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 149K 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-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 1679559503901

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-10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 08:18:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 08:18:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 08:18:25] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-23 08:18:25] [INFO ] Transformed 550 places.
[2023-03-23 08:18:25] [INFO ] Transformed 176 transitions.
[2023-03-23 08:18:25] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 176 rows 550 cols
[2023-03-23 08:18:25] [INFO ] Computed 375 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 690 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :31
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :25
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :24
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :24
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :24
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :23
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :25
[2023-03-23 08:18:25] [INFO ] Invariant cache hit.
[2023-03-23 08:18:26] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-23 08:18:26] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 59 ms returned sat
[2023-03-23 08:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:26] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-23 08:18:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-23 08:18:26] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 49 ms returned sat
[2023-03-23 08:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:26] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-23 08:18:26] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2023-03-23 08:18:27] [INFO ] Added : 52 causal constraints over 11 iterations in 281 ms. Result :sat
Minimization took 98 ms.
[2023-03-23 08:18:27] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-23 08:18:27] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2023-03-23 08:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:27] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-23 08:18:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:27] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 45 ms returned sat
[2023-03-23 08:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:27] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-23 08:18:27] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2023-03-23 08:18:27] [INFO ] Added : 36 causal constraints over 8 iterations in 172 ms. Result :sat
Minimization took 42 ms.
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-03-23 08:18:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 45 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:28] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-23 08:18:28] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2023-03-23 08:18:28] [INFO ] Added : 11 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 35 ms.
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned unsat
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 44 ms returned sat
[2023-03-23 08:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:28] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-23 08:18:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:29] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-23 08:18:29] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2023-03-23 08:18:29] [INFO ] Added : 13 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 49 ms.
[2023-03-23 08:18:29] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:29] [INFO ] [Real]Absence check using state equation in 103 ms returned unsat
[2023-03-23 08:18:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 45 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:29] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-23 08:18:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2023-03-23 08:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:30] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-23 08:18:30] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 14 ms.
[2023-03-23 08:18:30] [INFO ] Added : 52 causal constraints over 11 iterations in 221 ms. Result :sat
Minimization took 39 ms.
[2023-03-23 08:18:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:30] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 42 ms returned sat
[2023-03-23 08:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:30] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-23 08:18:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 08:18:30] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2023-03-23 08:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:30] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-23 08:18:30] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2023-03-23 08:18:30] [INFO ] Added : 27 causal constraints over 6 iterations in 134 ms. Result :sat
Minimization took 36 ms.
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 51 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using state equation in 101 ms returned unsat
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 59 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:31] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-23 08:18:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 52 ms returned sat
[2023-03-23 08:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:31] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-23 08:18:31] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 13 ms.
[2023-03-23 08:18:31] [INFO ] Added : 31 causal constraints over 7 iterations in 151 ms. Result :sat
Minimization took 37 ms.
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using state equation in 92 ms returned unsat
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2023-03-23 08:18:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 08:18:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:32] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-23 08:18:32] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 18 ms.
[2023-03-23 08:18:32] [INFO ] Added : 11 causal constraints over 3 iterations in 87 ms. Result :sat
Minimization took 35 ms.
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2023-03-23 08:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:32] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
Current structural bounds on expressions (after SMT) : [121, 121, 1, 11, -1, 11, 11, -1, 1, 1, 11, 1, 1, 1] Max seen :[0, 0, 0, 11, 0, 11, 0, 0, 1, 1, 0, 1, 0, 1]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-11 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-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 35 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 380 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.2 ms
Discarding 170 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 358 transition count 105
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 81 place count 358 transition count 83
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 1 with 65 rules applied. Total rules applied 146 place count 315 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 146 place count 315 transition count 82
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 1 with 3 rules applied. Total rules applied 149 place count 313 transition count 82
Applied a total of 149 rules in 59 ms. Remains 313 /550 variables (removed 237) and now considering 82/176 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 313/550 places, 82/176 transitions.
Successfully produced net in file /tmp/petri1000_2390114280587511391.dot
Successfully produced net in file /tmp/petri1001_9905282886106581036.dot
Successfully produced net in file /tmp/petri1002_6128751781024105276.dot
Successfully produced net in file /tmp/petri1003_14402876210366822953.dot
Successfully produced net in file /tmp/petri1004_15009287131700437908.dot
Successfully produced net in file /tmp/petri1005_6525064785182456921.dot
Successfully produced net in file /tmp/petri1006_14898325577236207710.dot
Successfully produced net in file /tmp/petri1007_529707765349956012.dot
Successfully produced net in file /tmp/petri1008_7124731444101572692.dot
Successfully produced net in file /tmp/petri1009_370396164378648755.dot
Successfully produced net in file /tmp/petri1010_3701562800750736645.dot
Drop transitions removed 11 transitions
Dominated transitions for bounds rules discarded 11 transitions
// Phase 1: matrix 71 rows 313 cols
[2023-03-23 08:18:33] [INFO ] Computed 242 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 21662 resets, run finished after 3509 ms. (steps per millisecond=284 ) properties (out of 6) seen :29
Incomplete Best-First random walk after 1000001 steps, including 2995 resets, run finished after 1523 ms. (steps per millisecond=656 ) properties (out of 6) seen :29
Incomplete Best-First random walk after 1000001 steps, including 1560 resets, run finished after 1736 ms. (steps per millisecond=576 ) properties (out of 6) seen :26
Incomplete Best-First random walk after 1000001 steps, including 3020 resets, run finished after 1533 ms. (steps per millisecond=652 ) properties (out of 6) seen :29
Incomplete Best-First random walk after 1000001 steps, including 3013 resets, run finished after 1337 ms. (steps per millisecond=747 ) properties (out of 6) seen :29
Incomplete Best-First random walk after 1000001 steps, including 3166 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 6) seen :28
Incomplete Best-First random walk after 1000001 steps, including 2576 resets, run finished after 1390 ms. (steps per millisecond=719 ) properties (out of 6) seen :29
[2023-03-23 08:18:45] [INFO ] Invariant cache hit.
[2023-03-23 08:18:45] [INFO ] [Real]Absence check using 0 positive and 242 generalized place invariants in 32 ms returned sat
[2023-03-23 08:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:45] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2023-03-23 08:18:45] [INFO ] [Real]Absence check using 0 positive and 242 generalized place invariants in 40 ms returned sat
[2023-03-23 08:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:45] [INFO ] [Real]Absence check using state equation in 61 ms returned unsat
[2023-03-23 08:18:45] [INFO ] [Real]Absence check using 0 positive and 242 generalized place invariants in 36 ms returned sat
[2023-03-23 08:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:45] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2023-03-23 08:18:46] [INFO ] [Real]Absence check using 0 positive and 242 generalized place invariants in 34 ms returned sat
[2023-03-23 08:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:46] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
[2023-03-23 08:18:46] [INFO ] [Real]Absence check using 0 positive and 242 generalized place invariants in 34 ms returned sat
[2023-03-23 08:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:46] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2023-03-23 08:18:46] [INFO ] [Real]Absence check using 0 positive and 242 generalized place invariants in 34 ms returned sat
[2023-03-23 08:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 08:18:46] [INFO ] [Real]Absence check using state equation in 90 ms returned unsat
Current structural bounds on expressions (after SMT) : [11, 11, 11, 1, 1, 1] Max seen :[11, 11, 11, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-12 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-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21065 ms.
ITS solved all properties within timeout

BK_STOP 1679559527199

--------------------
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-10"
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-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 r299-tall-167873953600877"
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 ;