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.r101-tall-167814475400477.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 itstools
Input is DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678276631903

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 11:57:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 11:57:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:57:13] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 11:57:13] [INFO ] Transformed 314 places.
[2023-03-08 11:57:13] [INFO ] Transformed 271 transitions.
[2023-03-08 11:57:13] [INFO ] Found NUPN structural information;
[2023-03-08 11:57:13] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-08 11:57:13] [INFO ] Computed 59 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 227 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :7
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
[2023-03-08 11:57:13] [INFO ] Invariant cache hit.
[2023-03-08 11:57:14] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2023-03-08 11:57:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 11:57:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:14] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2023-03-08 11:57:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 11:57:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 11:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:15] [INFO ] [Nat]Absence check using state equation in 1485 ms returned sat
[2023-03-08 11:57:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 11:57:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 191 ms returned sat
[2023-03-08 11:57:16] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-08 11:57:17] [INFO ] Added : 171 causal constraints over 35 iterations in 1173 ms. Result :sat
Minimization took 232 ms.
[2023-03-08 11:57:17] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:17] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2023-03-08 11:57:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 76 ms returned sat
[2023-03-08 11:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:18] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-08 11:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 712 ms returned sat
[2023-03-08 11:57:19] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 11:57:20] [INFO ] Added : 191 causal constraints over 39 iterations in 1244 ms. Result :sat
Minimization took 181 ms.
[2023-03-08 11:57:20] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:21] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-08 11:57:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 11:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:22] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2023-03-08 11:57:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-08 11:57:22] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-08 11:57:22] [INFO ] Added : 85 causal constraints over 17 iterations in 575 ms. Result :sat
Minimization took 369 ms.
[2023-03-08 11:57:23] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 11:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:23] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-08 11:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 11:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:24] [INFO ] [Nat]Absence check using state equation in 982 ms returned sat
[2023-03-08 11:57:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 356 ms returned sat
[2023-03-08 11:57:24] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 11:57:25] [INFO ] Added : 119 causal constraints over 24 iterations in 631 ms. Result :sat
Minimization took 197 ms.
[2023-03-08 11:57:25] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:25] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-08 11:57:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:25] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 143 ms returned sat
[2023-03-08 11:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:27] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2023-03-08 11:57:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-08 11:57:27] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-08 11:57:28] [INFO ] Added : 130 causal constraints over 26 iterations in 1334 ms. Result :sat
Minimization took 161 ms.
[2023-03-08 11:57:28] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:28] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-08 11:57:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 11:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:29] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2023-03-08 11:57:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2023-03-08 11:57:29] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2023-03-08 11:57:30] [INFO ] Added : 134 causal constraints over 27 iterations in 888 ms. Result :sat
Minimization took 195 ms.
[2023-03-08 11:57:31] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 11:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:31] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-03-08 11:57:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 11:57:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:32] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2023-03-08 11:57:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2023-03-08 11:57:32] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-08 11:57:33] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 7 ms to minimize.
[2023-03-08 11:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-08 11:57:33] [INFO ] Added : 102 causal constraints over 21 iterations in 837 ms. Result :sat
Minimization took 1127 ms.
[2023-03-08 11:57:34] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-08 11:57:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 11:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:34] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-08 11:57:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 112 ms returned sat
[2023-03-08 11:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:34] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2023-03-08 11:57:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 108 ms returned sat
[2023-03-08 11:57:35] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-08 11:57:36] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2023-03-08 11:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 11:57:36] [INFO ] Added : 73 causal constraints over 15 iterations in 1243 ms. Result :sat
Minimization took 190 ms.
[2023-03-08 11:57:36] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:36] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-08 11:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-08 11:57:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 189 ms returned sat
[2023-03-08 11:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:38] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2023-03-08 11:57:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2023-03-08 11:57:38] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 11:57:39] [INFO ] Added : 144 causal constraints over 29 iterations in 898 ms. Result :sat
Minimization took 146 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 100 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 11:57:41] [INFO ] Computed 60 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 13670 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2289 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2296 resets, run finished after 813 ms. (steps per millisecond=1230 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2277 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2291 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2246 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2296 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2300 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 7) seen :0
[2023-03-08 11:57:49] [INFO ] Invariant cache hit.
[2023-03-08 11:57:49] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 11:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:49] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-08 11:57:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2023-03-08 11:57:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-08 11:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:50] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-08 11:57:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:57:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-08 11:57:50] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 11:57:50] [INFO ] Added : 198 causal constraints over 40 iterations in 769 ms. Result :sat
Minimization took 124 ms.
[2023-03-08 11:57:51] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 11:57:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:51] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 11:57:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 11:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:51] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-08 11:57:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 11:57:51] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-08 11:57:51] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-08 11:57:51] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2023-03-08 11:57:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-03-08 11:57:51] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 11:57:52] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2023-03-08 11:57:52] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 0 ms to minimize.
[2023-03-08 11:57:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 167 ms
[2023-03-08 11:57:52] [INFO ] Added : 238 causal constraints over 48 iterations in 1106 ms. Result :sat
Minimization took 78 ms.
[2023-03-08 11:57:52] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:52] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:53] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-08 11:57:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2023-03-08 11:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:53] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-08 11:57:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 11:57:53] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 11:57:53] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-08 11:57:53] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2023-03-08 11:57:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-08 11:57:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 196 ms
[2023-03-08 11:57:53] [INFO ] Added : 75 causal constraints over 17 iterations in 551 ms. Result :sat
Minimization took 44 ms.
[2023-03-08 11:57:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 11:57:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:54] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-08 11:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-08 11:57:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 66 ms returned sat
[2023-03-08 11:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:54] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-08 11:57:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2023-03-08 11:57:54] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2023-03-08 11:57:54] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2023-03-08 11:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-08 11:57:54] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 11:57:55] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 0 ms to minimize.
[2023-03-08 11:57:55] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2023-03-08 11:57:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2023-03-08 11:57:55] [INFO ] Added : 149 causal constraints over 30 iterations in 728 ms. Result :sat
Minimization took 88 ms.
[2023-03-08 11:57:55] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 11:57:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:55] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 11:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2023-03-08 11:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:55] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-08 11:57:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 11:57:55] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 11:57:56] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2023-03-08 11:57:56] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-08 11:57:56] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2023-03-08 11:57:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 253 ms
[2023-03-08 11:57:56] [INFO ] Added : 74 causal constraints over 15 iterations in 551 ms. Result :sat
Minimization took 87 ms.
[2023-03-08 11:57:56] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:56] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 11:57:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 11:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:56] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-08 11:57:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 11:57:56] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 11:57:57] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2023-03-08 11:57:57] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2023-03-08 11:57:57] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 4 ms to minimize.
[2023-03-08 11:57:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2023-03-08 11:57:57] [INFO ] Added : 87 causal constraints over 19 iterations in 548 ms. Result :sat
Minimization took 54 ms.
[2023-03-08 11:57:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 11:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:57] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-08 11:57:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:57:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:57:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 11:57:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:57:58] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-08 11:57:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 11:57:58] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2023-03-08 11:57:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-08 11:57:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-08 11:57:58] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 11:57:59] [INFO ] Added : 188 causal constraints over 38 iterations in 723 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-08 11:58:01] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13647 resets, run finished after 1836 ms. (steps per millisecond=544 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2316 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2260 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 2) seen :0
[2023-03-08 11:58:04] [INFO ] Invariant cache hit.
[2023-03-08 11:58:04] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 11:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:04] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-08 11:58:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:58:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-08 11:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:05] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-08 11:58:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2023-03-08 11:58:05] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 11:58:05] [INFO ] Added : 198 causal constraints over 40 iterations in 768 ms. Result :sat
Minimization took 122 ms.
[2023-03-08 11:58:06] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:06] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:58:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:06] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-08 11:58:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:58:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 11:58:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:06] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-08 11:58:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2023-03-08 11:58:06] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-08 11:58:06] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-08 11:58:06] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-03-08 11:58:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2023-03-08 11:58:06] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 11:58:07] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2023-03-08 11:58:07] [INFO ] Deduced a trap composed of 55 places in 48 ms of which 0 ms to minimize.
[2023-03-08 11:58:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 156 ms
[2023-03-08 11:58:07] [INFO ] Added : 238 causal constraints over 48 iterations in 1082 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 11:58:08] [INFO ] Invariant cache hit.
[2023-03-08 11:58:08] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 11:58:08] [INFO ] Invariant cache hit.
[2023-03-08 11:58:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:09] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2023-03-08 11:58:09] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-08 11:58:09] [INFO ] Invariant cache hit.
[2023-03-08 11:58:09] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 813 ms. Remains : 311/311 places, 253/253 transitions.
Starting property specific reduction for DES-PT-50a-UpperBounds-00
[2023-03-08 11:58:09] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 11:58:09] [INFO ] Invariant cache hit.
[2023-03-08 11:58:09] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:58:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:09] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-08 11:58:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:58:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 11:58:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:09] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-08 11:58:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-08 11:58:10] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 11:58:10] [INFO ] Added : 198 causal constraints over 40 iterations in 749 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-08 11:58:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13647 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2274 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 1) seen :0
[2023-03-08 11:58:13] [INFO ] Invariant cache hit.
[2023-03-08 11:58:13] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 11:58:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 11:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:14] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-08 11:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:58:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 11:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:14] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-08 11:58:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-08 11:58:14] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 11:58:15] [INFO ] Added : 198 causal constraints over 40 iterations in 756 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 11:58:15] [INFO ] Invariant cache hit.
[2023-03-08 11:58:15] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 11:58:15] [INFO ] Invariant cache hit.
[2023-03-08 11:58:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:16] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-08 11:58:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 11:58:16] [INFO ] Invariant cache hit.
[2023-03-08 11:58:16] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-00 in 6945 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-02
[2023-03-08 11:58:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 11:58:16] [INFO ] Invariant cache hit.
[2023-03-08 11:58:16] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 11:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:16] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 11:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:58:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 11:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:16] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-08 11:58:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 11:58:16] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2023-03-08 11:58:17] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-03-08 11:58:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-03-08 11:58:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 230 ms
[2023-03-08 11:58:17] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 11:58:18] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 0 ms to minimize.
[2023-03-08 11:58:18] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2023-03-08 11:58:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-08 11:58:18] [INFO ] Added : 238 causal constraints over 48 iterations in 1068 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-08 11:58:18] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13758 resets, run finished after 1770 ms. (steps per millisecond=564 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2295 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 1) seen :0
[2023-03-08 11:58:21] [INFO ] Invariant cache hit.
[2023-03-08 11:58:21] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 11:58:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:21] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 11:58:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:58:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 11:58:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 11:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:58:21] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-08 11:58:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-08 11:58:21] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-03-08 11:58:21] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-08 11:58:21] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-03-08 11:58:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2023-03-08 11:58:21] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-08 11:58:22] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2023-03-08 11:58:22] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2023-03-08 11:58:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2023-03-08 11:58:22] [INFO ] Added : 238 causal constraints over 48 iterations in 1065 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 11:58:23] [INFO ] Invariant cache hit.
[2023-03-08 11:58:23] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-08 11:58:23] [INFO ] Invariant cache hit.
[2023-03-08 11:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 11:58:24] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2023-03-08 11:58:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:58:24] [INFO ] Invariant cache hit.
[2023-03-08 11:58:24] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-02 in 7882 ms.
[2023-03-08 11:58:24] [INFO ] Flatten gal took : 56 ms
[2023-03-08 11:58:24] [INFO ] Applying decomposition
[2023-03-08 11:58:24] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7818678385465389225.txt' '-o' '/tmp/graph7818678385465389225.bin' '-w' '/tmp/graph7818678385465389225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7818678385465389225.bin' '-l' '-1' '-v' '-w' '/tmp/graph7818678385465389225.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:58:24] [INFO ] Decomposing Gal with order
[2023-03-08 11:58:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:58:24] [INFO ] Removed a total of 23 redundant transitions.
[2023-03-08 11:58:24] [INFO ] Flatten gal took : 51 ms
[2023-03-08 11:58:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2023-03-08 11:58:24] [INFO ] Time to serialize gal into /tmp/UpperBounds3291989336720151379.gal : 6 ms
[2023-03-08 11:58:24] [INFO ] Time to serialize properties into /tmp/UpperBounds55535096407015319.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3291989336720151379.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds55535096407015319.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...281
Loading property file /tmp/UpperBounds55535096407015319.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.83192e+13,35.8971,622672,24979,9195,1.34192e+06,26460,250,1.82921e+06,455,205903,0
Total reachable state count : 28319158339780

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50a-UpperBounds-00 :0 <= u47.p60 <= 1
FORMULA DES-PT-50a-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-UpperBounds-00,0,44.4343,623368,1,0,1.34192e+06,174688,425,3.18522e+06,609,634624,11622
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50a-UpperBounds-02 :0 <= u14.p3 <= 1
FORMULA DES-PT-50a-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50a-UpperBounds-02,0,49.1298,625964,1,0,1.34192e+06,261901,456,3.78004e+06,706,922718,20683
Total runtime 120758 ms.

BK_STOP 1678276754942

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-50a, 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 r101-tall-167814475400477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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