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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 70K 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-30a-UpperBounds-00
FORMULA_NAME DES-PT-30a-UpperBounds-01
FORMULA_NAME DES-PT-30a-UpperBounds-02
FORMULA_NAME DES-PT-30a-UpperBounds-03
FORMULA_NAME DES-PT-30a-UpperBounds-04
FORMULA_NAME DES-PT-30a-UpperBounds-05
FORMULA_NAME DES-PT-30a-UpperBounds-06
FORMULA_NAME DES-PT-30a-UpperBounds-07
FORMULA_NAME DES-PT-30a-UpperBounds-08
FORMULA_NAME DES-PT-30a-UpperBounds-09
FORMULA_NAME DES-PT-30a-UpperBounds-10
FORMULA_NAME DES-PT-30a-UpperBounds-11
FORMULA_NAME DES-PT-30a-UpperBounds-12
FORMULA_NAME DES-PT-30a-UpperBounds-13
FORMULA_NAME DES-PT-30a-UpperBounds-14
FORMULA_NAME DES-PT-30a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678270467735

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-30a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 10:14:29] [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 10:14:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:14:29] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-08 10:14:29] [INFO ] Transformed 234 places.
[2023-03-08 10:14:29] [INFO ] Transformed 191 transitions.
[2023-03-08 10:14:29] [INFO ] Found NUPN structural information;
[2023-03-08 10:14:29] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 177 rows 234 cols
[2023-03-08 10:14:29] [INFO ] Computed 59 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 230 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :11
FORMULA DES-PT-30a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
[2023-03-08 10:14:29] [INFO ] Invariant cache hit.
[2023-03-08 10:14:29] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2023-03-08 10:14:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 10:14:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:29] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-08 10:14:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 10:14:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 10:14:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:30] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-03-08 10:14:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 10:14:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2023-03-08 10:14:30] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 5 ms to minimize.
[2023-03-08 10:14:30] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2023-03-08 10:14:30] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-08 10:14:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2023-03-08 10:14:30] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-08 10:14:31] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-08 10:14:31] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2023-03-08 10:14:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-08 10:14:31] [INFO ] Added : 158 causal constraints over 32 iterations in 910 ms. Result :sat
Minimization took 86 ms.
[2023-03-08 10:14:31] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2023-03-08 10:14:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:14:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:32] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-08 10:14:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:32] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 10:14:32] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 69 ms returned sat
[2023-03-08 10:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:32] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-08 10:14:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:14:32] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-08 10:14:32] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-03-08 10:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 10:14:32] [INFO ] Added : 67 causal constraints over 14 iterations in 376 ms. Result :sat
Minimization took 122 ms.
[2023-03-08 10:14:32] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 10:14:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 10:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 10:14:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-08 10:14:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-08 10:14:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:33] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2023-03-08 10:14:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2023-03-08 10:14:33] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 12 ms.
[2023-03-08 10:14:33] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-08 10:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-08 10:14:33] [INFO ] Added : 98 causal constraints over 21 iterations in 518 ms. Result :sat
Minimization took 129 ms.
[2023-03-08 10:14:34] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 10:14:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:34] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-08 10:14:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 10:14:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 70 ms returned sat
[2023-03-08 10:14:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:34] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-08 10:14:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:14:34] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-08 10:14:34] [INFO ] Added : 84 causal constraints over 18 iterations in 408 ms. Result :sat
Minimization took 65 ms.
[2023-03-08 10:14:35] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 10:14:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:14:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:35] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-08 10:14:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-08 10:14:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2023-03-08 10:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:35] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2023-03-08 10:14:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:14:35] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-08 10:14:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-08 10:14:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-08 10:14:35] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 10:14:36] [INFO ] Added : 117 causal constraints over 24 iterations in 498 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 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 234 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 233 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 233 transition count 174
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 233 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 232 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 231 transition count 173
Applied a total of 12 rules in 70 ms. Remains 231 /234 variables (removed 3) and now considering 173/177 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 231/234 places, 173/177 transitions.
// Phase 1: matrix 173 rows 231 cols
[2023-03-08 10:14:37] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13607 resets, run finished after 1958 ms. (steps per millisecond=510 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2255 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2249 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2315 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2264 resets, run finished after 877 ms. (steps per millisecond=1140 ) properties (out of 5) seen :0
[2023-03-08 10:14:43] [INFO ] Invariant cache hit.
[2023-03-08 10:14:43] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 10:14:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:43] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 10:14:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 10:14:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 10:14:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:43] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-08 10:14:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 10:14:43] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-08 10:14:44] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2023-03-08 10:14:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 10:14:44] [INFO ] Added : 149 causal constraints over 31 iterations in 533 ms. Result :sat
Minimization took 57 ms.
[2023-03-08 10:14:44] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:44] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-08 10:14:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 103 ms returned sat
[2023-03-08 10:14:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:44] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-08 10:14:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 10:14:44] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 10:14:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2023-03-08 10:14:45] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-08 10:14:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2023-03-08 10:14:45] [INFO ] Added : 60 causal constraints over 13 iterations in 355 ms. Result :sat
Minimization took 72 ms.
[2023-03-08 10:14:45] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 10:14:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:45] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 10:14:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2023-03-08 10:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:45] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-08 10:14:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:14:45] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-08 10:14:45] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-08 10:14:45] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2023-03-08 10:14:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 234 ms
[2023-03-08 10:14:45] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 10:14:46] [INFO ] Added : 108 causal constraints over 22 iterations in 330 ms. Result :sat
Minimization took 47 ms.
[2023-03-08 10:14:46] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:46] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 10:14:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:46] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-08 10:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:46] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-08 10:14:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 10:14:46] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-08 10:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 10:14:46] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 10:14:46] [INFO ] Added : 74 causal constraints over 15 iterations in 226 ms. Result :sat
Minimization took 43 ms.
[2023-03-08 10:14:47] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:47] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-08 10:14:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 10:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:47] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-08 10:14:47] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 10:14:47] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 10:14:47] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-08 10:14:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 10:14:47] [INFO ] Added : 111 causal constraints over 23 iterations in 447 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA DES-PT-30a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 10:14:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13769 resets, run finished after 1810 ms. (steps per millisecond=552 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2252 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2267 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2258 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 4) seen :0
[2023-03-08 10:14:54] [INFO ] Invariant cache hit.
[2023-03-08 10:14:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 10:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:54] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 10:14:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 10:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:54] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-08 10:14:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-08 10:14:54] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 10:14:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2023-03-08 10:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 10:14:55] [INFO ] Added : 149 causal constraints over 31 iterations in 515 ms. Result :sat
Minimization took 58 ms.
[2023-03-08 10:14:55] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 10:14:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:55] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 10:14:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 10:14:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:55] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 10:14:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:14:55] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-08 10:14:55] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-08 10:14:55] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-08 10:14:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 199 ms
[2023-03-08 10:14:55] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 10:14:56] [INFO ] Added : 108 causal constraints over 22 iterations in 325 ms. Result :sat
Minimization took 46 ms.
[2023-03-08 10:14:56] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:56] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-08 10:14:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:56] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-08 10:14:56] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-08 10:14:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 10:14:56] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-08 10:14:56] [INFO ] Added : 74 causal constraints over 15 iterations in 229 ms. Result :sat
Minimization took 44 ms.
[2023-03-08 10:14:56] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:14:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:56] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2023-03-08 10:14:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:14:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 10:14:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:57] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-08 10:14:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 10:14:57] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 10:14:57] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-08 10:14:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-08 10:14:57] [INFO ] Added : 111 causal constraints over 23 iterations in 441 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 10:14:58] [INFO ] Invariant cache hit.
[2023-03-08 10:14:58] [INFO ] Implicit Places using invariants in 136 ms returned []
[2023-03-08 10:14:58] [INFO ] Invariant cache hit.
[2023-03-08 10:14:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:59] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-08 10:14:59] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 10:14:59] [INFO ] Invariant cache hit.
[2023-03-08 10:14:59] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 564 ms. Remains : 231/231 places, 173/173 transitions.
Starting property specific reduction for DES-PT-30a-UpperBounds-00
[2023-03-08 10:14:59] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 134 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 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-08 10:14:59] [INFO ] Invariant cache hit.
[2023-03-08 10:14:59] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:59] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-08 10:14:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:14:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:14:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 67 ms returned sat
[2023-03-08 10:14:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:14:59] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-08 10:14:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:14:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:14:59] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 10:15:00] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2023-03-08 10:15:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-08 10:15:00] [INFO ] Added : 149 causal constraints over 31 iterations in 508 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 19 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 10:15:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13665 resets, run finished after 1883 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2312 resets, run finished after 940 ms. (steps per millisecond=1063 ) properties (out of 1) seen :0
[2023-03-08 10:15:03] [INFO ] Invariant cache hit.
[2023-03-08 10:15:03] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:15:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 10:15:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:03] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 10:15:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 10:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:03] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-08 10:15:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:15:03] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 10:15:04] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2023-03-08 10:15:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 10:15:04] [INFO ] Added : 149 causal constraints over 31 iterations in 535 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 11 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 10:15:04] [INFO ] Invariant cache hit.
[2023-03-08 10:15:04] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 10:15:04] [INFO ] Invariant cache hit.
[2023-03-08 10:15:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:05] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-08 10:15:05] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 10:15:05] [INFO ] Invariant cache hit.
[2023-03-08 10:15:05] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 613 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-00 in 5993 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-06
[2023-03-08 10:15:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 10:15:05] [INFO ] Invariant cache hit.
[2023-03-08 10:15:05] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:05] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-08 10:15:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 10:15:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:05] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-08 10:15:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-08 10:15:05] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-08 10:15:05] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2023-03-08 10:15:05] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2023-03-08 10:15:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 229 ms
[2023-03-08 10:15:05] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 7 ms.
[2023-03-08 10:15:06] [INFO ] Added : 108 causal constraints over 22 iterations in 326 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 9 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 10:15:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13598 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2243 resets, run finished after 885 ms. (steps per millisecond=1129 ) properties (out of 1) seen :0
[2023-03-08 10:15:09] [INFO ] Invariant cache hit.
[2023-03-08 10:15:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:09] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-08 10:15:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2023-03-08 10:15:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:09] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-08 10:15:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-08 10:15:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-08 10:15:09] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-03-08 10:15:09] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2023-03-08 10:15:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2023-03-08 10:15:09] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 10:15:10] [INFO ] Added : 108 causal constraints over 22 iterations in 623 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 10:15:10] [INFO ] Invariant cache hit.
[2023-03-08 10:15:10] [INFO ] Implicit Places using invariants in 181 ms returned []
[2023-03-08 10:15:10] [INFO ] Invariant cache hit.
[2023-03-08 10:15:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:11] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2023-03-08 10:15:11] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 10:15:11] [INFO ] Invariant cache hit.
[2023-03-08 10:15:11] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 634 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-06 in 6148 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-13
[2023-03-08 10:15:11] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 10:15:11] [INFO ] Invariant cache hit.
[2023-03-08 10:15:11] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:15:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:15:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:11] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-08 10:15:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 10:15:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:11] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-08 10:15:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 10:15:11] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2023-03-08 10:15:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 10:15:11] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-08 10:15:11] [INFO ] Added : 74 causal constraints over 15 iterations in 230 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 17 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 10:15:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13674 resets, run finished after 1801 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2294 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 1) seen :0
[2023-03-08 10:15:14] [INFO ] Invariant cache hit.
[2023-03-08 10:15:14] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:15:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:15] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-08 10:15:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 10:15:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2023-03-08 10:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:15] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-08 10:15:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-08 10:15:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2023-03-08 10:15:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 10:15:15] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 9 ms.
[2023-03-08 10:15:15] [INFO ] Added : 74 causal constraints over 15 iterations in 237 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 10:15:15] [INFO ] Invariant cache hit.
[2023-03-08 10:15:16] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-08 10:15:16] [INFO ] Invariant cache hit.
[2023-03-08 10:15:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:16] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-08 10:15:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:15:16] [INFO ] Invariant cache hit.
[2023-03-08 10:15:16] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 530 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-13 in 5094 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-14
[2023-03-08 10:15: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 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 10:15:16] [INFO ] Invariant cache hit.
[2023-03-08 10:15:16] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 10:15:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:16] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-08 10:15:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:15:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 10:15:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:16] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-08 10:15:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 10:15:16] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-08 10:15:17] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2023-03-08 10:15:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-08 10:15:17] [INFO ] Added : 111 causal constraints over 23 iterations in 430 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-08 10:15:17] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13622 resets, run finished after 1791 ms. (steps per millisecond=558 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2254 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 1) seen :0
[2023-03-08 10:15:20] [INFO ] Invariant cache hit.
[2023-03-08 10:15:20] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 10:15:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 10:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:20] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-08 10:15:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:15:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 10:15:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 10:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:15:20] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-08 10:15:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-08 10:15:20] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-08 10:15:21] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
[2023-03-08 10:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-08 10:15:21] [INFO ] Added : 111 causal constraints over 23 iterations in 450 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-08 10:15:21] [INFO ] Invariant cache hit.
[2023-03-08 10:15:21] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 10:15:21] [INFO ] Invariant cache hit.
[2023-03-08 10:15:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 10:15:21] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2023-03-08 10:15:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 10:15:21] [INFO ] Invariant cache hit.
[2023-03-08 10:15:21] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 600 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-14 in 5584 ms.
[2023-03-08 10:15:22] [INFO ] Flatten gal took : 58 ms
[2023-03-08 10:15:22] [INFO ] Applying decomposition
[2023-03-08 10:15:22] [INFO ] Flatten gal took : 22 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/graph9288618331457479818.txt' '-o' '/tmp/graph9288618331457479818.bin' '-w' '/tmp/graph9288618331457479818.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9288618331457479818.bin' '-l' '-1' '-v' '-w' '/tmp/graph9288618331457479818.weights' '-q' '0' '-e' '0.001'
[2023-03-08 10:15:22] [INFO ] Decomposing Gal with order
[2023-03-08 10:15:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 10:15:22] [INFO ] Removed a total of 23 redundant transitions.
[2023-03-08 10:15:22] [INFO ] Flatten gal took : 59 ms
[2023-03-08 10:15:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2023-03-08 10:15:22] [INFO ] Time to serialize gal into /tmp/UpperBounds5706079530816645665.gal : 19 ms
[2023-03-08 10:15:22] [INFO ] Time to serialize properties into /tmp/UpperBounds10325264299496438671.prop : 2 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/UpperBounds5706079530816645665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10325264299496438671.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 ...284
Loading property file /tmp/UpperBounds10325264299496438671.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,9.61442e+12,2.36233,74204,6197,3633,166449,9602,248,191231,295,51844,0
Total reachable state count : 9614416128980

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30a-UpperBounds-00 :0 <= i1.u2.p96 <= 1
FORMULA DES-PT-30a-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-30a-UpperBounds-00,0,3.07112,74988,1,0,166449,40501,424,238872,395,125824,2610
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30a-UpperBounds-06 :0 <= u14.p15 <= 1
FORMULA DES-PT-30a-UpperBounds-06 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-30a-UpperBounds-06,0,3.50266,75516,1,0,166449,71359,468,305530,438,219466,5168
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30a-UpperBounds-13 :0 <= u14.p23 <= 1
FORMULA DES-PT-30a-UpperBounds-13 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-30a-UpperBounds-13,0,3.78351,84492,1,0,166449,82368,497,352668,453,252932,5304
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30a-UpperBounds-14 :0 <= u47.p42 <= 1
FORMULA DES-PT-30a-UpperBounds-14 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-30a-UpperBounds-14,0,4.37343,110892,1,0,173899,112628,526,453314,504,330306,6581
Total runtime 57820 ms.

BK_STOP 1678270527954

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-30a"
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-30a, 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-167814475400445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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