Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208500426.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DES-PT-20a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500426
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K May 18 16:42 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-20a-UpperBounds-00
FORMULA_NAME DES-PT-20a-UpperBounds-01
FORMULA_NAME DES-PT-20a-UpperBounds-02
FORMULA_NAME DES-PT-20a-UpperBounds-03
FORMULA_NAME DES-PT-20a-UpperBounds-04
FORMULA_NAME DES-PT-20a-UpperBounds-05
FORMULA_NAME DES-PT-20a-UpperBounds-06
FORMULA_NAME DES-PT-20a-UpperBounds-07
FORMULA_NAME DES-PT-20a-UpperBounds-08
FORMULA_NAME DES-PT-20a-UpperBounds-09
FORMULA_NAME DES-PT-20a-UpperBounds-10
FORMULA_NAME DES-PT-20a-UpperBounds-11
FORMULA_NAME DES-PT-20a-UpperBounds-12
FORMULA_NAME DES-PT-20a-UpperBounds-13
FORMULA_NAME DES-PT-20a-UpperBounds-14
FORMULA_NAME DES-PT-20a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716334471994

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 23:34:33] [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]
[2024-05-21 23:34:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:34:33] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-21 23:34:33] [INFO ] Transformed 195 places.
[2024-05-21 23:34:33] [INFO ] Transformed 152 transitions.
[2024-05-21 23:34:33] [INFO ] Found NUPN structural information;
[2024-05-21 23:34:33] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 138 rows 195 cols
[2024-05-21 23:34:33] [INFO ] Computed 59 invariants in 24 ms
Incomplete random walk after 10000 steps, including 217 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 16) seen :13
FORMULA DES-PT-20a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
[2024-05-21 23:34:33] [INFO ] Invariant cache hit.
[2024-05-21 23:34:34] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-21 23:34:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 23:34:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:34] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-21 23:34:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-21 23:34:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 65 ms returned sat
[2024-05-21 23:34:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:34] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-21 23:34:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:34:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-21 23:34:34] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:34:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-21 23:34:34] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 18 ms.
[2024-05-21 23:34:35] [INFO ] Added : 112 causal constraints over 23 iterations in 526 ms. Result :sat
Minimization took 68 ms.
[2024-05-21 23:34:35] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 23:34:35] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 23:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 23:34:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 23:34:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2024-05-21 23:34:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:35] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-21 23:34:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 97 ms returned sat
[2024-05-21 23:34:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-21 23:34:35] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 11 ms.
[2024-05-21 23:34:36] [INFO ] Added : 94 causal constraints over 19 iterations in 314 ms. Result :sat
Minimization took 56 ms.
[2024-05-21 23:34:36] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 23:34:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:36] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 23:34:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 23:34:36] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:36] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-21 23:34:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-21 23:34:36] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 10 ms.
[2024-05-21 23:34:36] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-21 23:34:36] [INFO ] Added : 83 causal constraints over 17 iterations in 361 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 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 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
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 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 68 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 192/195 places, 134/138 transitions.
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 23:34:37] [INFO ] Computed 60 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13623 resets, run finished after 1838 ms. (steps per millisecond=544 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2265 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2243 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2312 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 3) seen :0
[2024-05-21 23:34:41] [INFO ] Invariant cache hit.
[2024-05-21 23:34:41] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 23:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 23:34:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 72 ms returned sat
[2024-05-21 23:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:42] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 23:34:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2024-05-21 23:34:42] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 23:34:42] [INFO ] Added : 62 causal constraints over 13 iterations in 153 ms. Result :sat
Minimization took 34 ms.
[2024-05-21 23:34:42] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:42] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 23:34:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 70 ms returned sat
[2024-05-21 23:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:42] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-21 23:34:42] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:34:42] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 13 ms.
[2024-05-21 23:34:42] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:34:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-21 23:34:43] [INFO ] Added : 104 causal constraints over 21 iterations in 311 ms. Result :sat
Minimization took 48 ms.
[2024-05-21 23:34:43] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 23:34:43] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 23:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:43] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 23:34:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-21 23:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:43] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-21 23:34:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2024-05-21 23:34:43] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:34:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 235 ms
[2024-05-21 23:34:43] [INFO ] Added : 80 causal constraints over 16 iterations in 418 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 7 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 23:34:44] [INFO ] Invariant cache hit.
[2024-05-21 23:34:44] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:34:44] [INFO ] Invariant cache hit.
[2024-05-21 23:34:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:44] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-21 23:34:44] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:34:44] [INFO ] Invariant cache hit.
[2024-05-21 23:34:44] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 192/192 places, 134/134 transitions.
Starting property specific reduction for DES-PT-20a-UpperBounds-02
[2024-05-21 23:34:44] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 133 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 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2024-05-21 23:34:44] [INFO ] Invariant cache hit.
[2024-05-21 23:34:44] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:44] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 23:34:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 70 ms returned sat
[2024-05-21 23:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:45] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 23:34:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2024-05-21 23:34:45] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 9 ms.
[2024-05-21 23:34:45] [INFO ] Added : 62 causal constraints over 13 iterations in 149 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
[2024-05-21 23:34:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13586 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2276 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 1) seen :0
[2024-05-21 23:34:47] [INFO ] Invariant cache hit.
[2024-05-21 23:34:48] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2024-05-21 23:34:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 23:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:48] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 23:34:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 72 ms returned sat
[2024-05-21 23:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:48] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2024-05-21 23:34:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:34:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2024-05-21 23:34:48] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-21 23:34:48] [INFO ] Added : 62 causal constraints over 13 iterations in 150 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 23:34:48] [INFO ] Invariant cache hit.
[2024-05-21 23:34:48] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:34:48] [INFO ] Invariant cache hit.
[2024-05-21 23:34:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:49] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-21 23:34:49] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:34:49] [INFO ] Invariant cache hit.
[2024-05-21 23:34:49] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 192/192 places, 134/134 transitions.
Ending property specific reduction for DES-PT-20a-UpperBounds-02 in 4411 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-13
[2024-05-21 23:34:49] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2024-05-21 23:34:49] [INFO ] Invariant cache hit.
[2024-05-21 23:34:49] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:49] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:49] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 23:34:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 70 ms returned sat
[2024-05-21 23:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:49] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-05-21 23:34:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:34:49] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 14 ms.
[2024-05-21 23:34:49] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:34:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-21 23:34:49] [INFO ] Added : 104 causal constraints over 21 iterations in 318 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
[2024-05-21 23:34:49] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13718 resets, run finished after 1721 ms. (steps per millisecond=581 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2302 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 1) seen :0
[2024-05-21 23:34:52] [INFO ] Invariant cache hit.
[2024-05-21 23:34:52] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-21 23:34:52] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:52] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 23:34:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:52] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 69 ms returned sat
[2024-05-21 23:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:52] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2024-05-21 23:34:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:34:52] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 8 ms.
[2024-05-21 23:34:53] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-21 23:34:53] [INFO ] Added : 104 causal constraints over 21 iterations in 292 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 23:34:53] [INFO ] Invariant cache hit.
[2024-05-21 23:34:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:34:53] [INFO ] Invariant cache hit.
[2024-05-21 23:34:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:53] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-21 23:34:53] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 23:34:53] [INFO ] Invariant cache hit.
[2024-05-21 23:34:53] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 415 ms. Remains : 192/192 places, 134/134 transitions.
Ending property specific reduction for DES-PT-20a-UpperBounds-13 in 4728 ms.
Starting property specific reduction for DES-PT-20a-UpperBounds-15
[2024-05-21 23:34:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 18 ms. (steps per millisecond=555 ) 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
[2024-05-21 23:34:53] [INFO ] Invariant cache hit.
[2024-05-21 23:34:53] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:53] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 23:34:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2024-05-21 23:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:54] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-21 23:34:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2024-05-21 23:34:54] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:34:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 212 ms
[2024-05-21 23:34:54] [INFO ] Added : 80 causal constraints over 16 iterations in 392 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 192/192 places, 134/134 transitions.
[2024-05-21 23:34:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13535 resets, run finished after 1732 ms. (steps per millisecond=577 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2269 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 1) seen :0
[2024-05-21 23:34:57] [INFO ] Invariant cache hit.
[2024-05-21 23:34:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 23:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:57] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 23:34:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:34:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:34:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2024-05-21 23:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 23:34:57] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-21 23:34:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:34:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2024-05-21 23:34:57] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 23:34:57] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:34:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 274 ms
[2024-05-21 23:34:58] [INFO ] Added : 80 causal constraints over 16 iterations in 466 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 23:34:58] [INFO ] Invariant cache hit.
[2024-05-21 23:34:58] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:34:58] [INFO ] Invariant cache hit.
[2024-05-21 23:34:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:34:58] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-21 23:34:58] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:34:58] [INFO ] Invariant cache hit.
[2024-05-21 23:34:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 192/192 places, 134/134 transitions.
[2024-05-21 23:34:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13703 resets, run finished after 1769 ms. (steps per millisecond=565 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2291 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 1) seen :0
[2024-05-21 23:35:01] [INFO ] Invariant cache hit.
[2024-05-21 23:35:01] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:35:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 23:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 23:35:01] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA DES-PT-20a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DES-PT-20a-UpperBounds-15 in 7608 ms.
[2024-05-21 23:35:01] [INFO ] Flatten gal took : 53 ms
[2024-05-21 23:35:01] [INFO ] Applying decomposition
[2024-05-21 23:35:01] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9729477329496388616.txt' '-o' '/tmp/graph9729477329496388616.bin' '-w' '/tmp/graph9729477329496388616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9729477329496388616.bin' '-l' '-1' '-v' '-w' '/tmp/graph9729477329496388616.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:35:01] [INFO ] Decomposing Gal with order
[2024-05-21 23:35:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:35:01] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-21 23:35:01] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:35:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-21 23:35:01] [INFO ] Time to serialize gal into /tmp/UpperBounds9567896519159295024.gal : 7 ms
[2024-05-21 23:35:01] [INFO ] Time to serialize properties into /tmp/UpperBounds257501228468898120.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9567896519159295024.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds257501228468898120.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds257501228468898120.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,3.96119e+12,11.4061,268424,13239,1832,509895,6067,244,1.21863e+06,217,29528,0
Total reachable state count : 3961190091904

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20a-UpperBounds-02 :0 <= i1.u13.p49 <= 1
FORMULA DES-PT-20a-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-20a-UpperBounds-02,0,14.6442,269344,1,0,509895,19883,423,2.02004e+06,277,60346,7278
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20a-UpperBounds-13 :0 <= u47.p27 <= 1
FORMULA DES-PT-20a-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-20a-UpperBounds-13,0,16.5625,274884,1,0,509895,41069,470,2.86798e+06,320,145981,11934
Total runtime 45050 ms.

BK_STOP 1716334519395

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-20a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-20a, 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 r109-tall-171624208500426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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