fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r046-smll-165252115900187
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
657.235 88548.00 116338.00 580.60 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r046-smll-165252115900187.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DES-PT-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 83K May 10 09:33 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-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652526588991

Running Version 0
[2022-05-14 11:09:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 11:09:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:09:52] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2022-05-14 11:09:52] [INFO ] Transformed 274 places.
[2022-05-14 11:09:52] [INFO ] Transformed 231 transitions.
[2022-05-14 11:09:52] [INFO ] Found NUPN structural information;
[2022-05-14 11:09:52] [INFO ] Parsed PT model containing 274 places and 231 transitions in 245 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 217 rows 274 cols
[2022-05-14 11:09:52] [INFO ] Computed 59 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 212 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 16) seen :7
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
// Phase 1: matrix 217 rows 274 cols
[2022-05-14 11:09:53] [INFO ] Computed 59 place invariants in 14 ms
[2022-05-14 11:09:53] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2022-05-14 11:09:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2022-05-14 11:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:09:53] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-14 11:09:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:09:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-05-14 11:09:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 108 ms returned sat
[2022-05-14 11:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:09:55] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2022-05-14 11:09:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-14 11:09:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-14 11:09:55] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 45 ms.
[2022-05-14 11:09:55] [INFO ] Added : 79 causal constraints over 16 iterations in 902 ms. Result :sat
Minimization took 170 ms.
[2022-05-14 11:09:56] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-05-14 11:09:56] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2022-05-14 11:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:09:56] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-05-14 11:09:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:09:56] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-14 11:09:56] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 69 ms returned sat
[2022-05-14 11:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:09:57] [INFO ] [Nat]Absence check using state equation in 910 ms returned sat
[2022-05-14 11:09:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-14 11:09:57] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 35 ms.
[2022-05-14 11:09:58] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 12 ms to minimize.
[2022-05-14 11:09:59] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2022-05-14 11:09:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2022-05-14 11:09:59] [INFO ] Added : 100 causal constraints over 20 iterations in 1584 ms. Result :sat
Minimization took 650 ms.
[2022-05-14 11:09:59] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-05-14 11:09:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-14 11:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:00] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-05-14 11:10:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-05-14 11:10:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 145 ms returned sat
[2022-05-14 11:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:00] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-05-14 11:10:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-14 11:10:00] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 27 ms.
[2022-05-14 11:10:01] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2022-05-14 11:10:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2022-05-14 11:10:01] [INFO ] Added : 93 causal constraints over 20 iterations in 799 ms. Result :sat
Minimization took 114 ms.
[2022-05-14 11:10:01] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-05-14 11:10:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-14 11:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:02] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2022-05-14 11:10:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-14 11:10:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 120 ms returned sat
[2022-05-14 11:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:03] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2022-05-14 11:10:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-14 11:10:03] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 34 ms.
[2022-05-14 11:10:04] [INFO ] Added : 105 causal constraints over 21 iterations in 934 ms. Result :sat
Minimization took 456 ms.
[2022-05-14 11:10:04] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-05-14 11:10:04] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2022-05-14 11:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:05] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-14 11:10:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-05-14 11:10:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 179 ms returned sat
[2022-05-14 11:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:06] [INFO ] [Nat]Absence check using state equation in 1364 ms returned sat
[2022-05-14 11:10:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:10:06] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 20 ms.
[2022-05-14 11:10:07] [INFO ] Added : 112 causal constraints over 23 iterations in 1013 ms. Result :sat
Minimization took 204 ms.
[2022-05-14 11:10:08] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-05-14 11:10:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2022-05-14 11:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:08] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2022-05-14 11:10:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-05-14 11:10:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 222 ms returned sat
[2022-05-14 11:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:10] [INFO ] [Nat]Absence check using state equation in 1796 ms returned sat
[2022-05-14 11:10:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-14 11:10:10] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 31 ms.
[2022-05-14 11:10:11] [INFO ] Added : 89 causal constraints over 18 iterations in 941 ms. Result :sat
Minimization took 147 ms.
[2022-05-14 11:10:11] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-05-14 11:10:11] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-14 11:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:12] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-05-14 11:10:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2022-05-14 11:10:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 244 ms returned sat
[2022-05-14 11:10:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:13] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2022-05-14 11:10:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:10:13] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2022-05-14 11:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2022-05-14 11:10:13] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 32 ms.
[2022-05-14 11:10:15] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 2 ms to minimize.
[2022-05-14 11:10:16] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
[2022-05-14 11:10:16] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2022-05-14 11:10:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2022-05-14 11:10:16] [INFO ] Added : 107 causal constraints over 22 iterations in 3109 ms. Result :sat
Minimization took 375 ms.
[2022-05-14 11:10:16] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-05-14 11:10:16] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-14 11:10:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:17] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-14 11:10:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:17] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-05-14 11:10:17] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 237 ms returned sat
[2022-05-14 11:10:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:18] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2022-05-14 11:10:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:10:18] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 22 ms.
[2022-05-14 11:10:19] [INFO ] Added : 166 causal constraints over 34 iterations in 1303 ms. Result :sat
Minimization took 243 ms.
[2022-05-14 11:10:19] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-05-14 11:10:19] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-14 11:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:20] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-05-14 11:10:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-05-14 11:10:20] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 128 ms returned sat
[2022-05-14 11:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:21] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2022-05-14 11:10:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-14 11:10:21] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 15 ms.
[2022-05-14 11:10:22] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 3 ms to minimize.
[2022-05-14 11:10:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2022-05-14 11:10:22] [INFO ] Added : 161 causal constraints over 33 iterations in 1518 ms. Result :sat
Minimization took 307 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 191000 steps, including 4364 resets, run finished after 572 ms. (steps per millisecond=333 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 144000 steps, including 2777 resets, run finished after 404 ms. (steps per millisecond=356 ) properties (out of 9) seen :7 could not realise parikh vector
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 109800 steps, including 2587 resets, run finished after 272 ms. (steps per millisecond=403 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 62200 steps, including 1173 resets, run finished after 172 ms. (steps per millisecond=361 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 78500 steps, including 1701 resets, run finished after 323 ms. (steps per millisecond=243 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 95400 steps, including 1008 resets, run finished after 361 ms. (steps per millisecond=264 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 79600 steps, including 1655 resets, run finished after 288 ms. (steps per millisecond=276 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 145500 steps, including 2968 resets, run finished after 343 ms. (steps per millisecond=424 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 44900 steps, including 783 resets, run finished after 103 ms. (steps per millisecond=435 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 274 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 274/274 places, 217/217 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 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
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 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 271 transition count 213
Applied a total of 12 rules in 138 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:25] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 13712 resets, run finished after 3067 ms. (steps per millisecond=326 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2282 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2274 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties (out of 2) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:31] [INFO ] Computed 60 place invariants in 10 ms
[2022-05-14 11:10:31] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-14 11:10:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-14 11:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:31] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-05-14 11:10:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2022-05-14 11:10:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-14 11:10:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:31] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-05-14 11:10:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2022-05-14 11:10:31] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 1 ms to minimize.
[2022-05-14 11:10:31] [INFO ] Deduced a trap composed of 45 places in 98 ms of which 0 ms to minimize.
[2022-05-14 11:10:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2022-05-14 11:10:31] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 37 ms.
[2022-05-14 11:10:32] [INFO ] Added : 186 causal constraints over 38 iterations in 1072 ms. Result :sat
Minimization took 112 ms.
[2022-05-14 11:10:33] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-14 11:10:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-14 11:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:33] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2022-05-14 11:10:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2022-05-14 11:10:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 86 ms returned sat
[2022-05-14 11:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:33] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2022-05-14 11:10:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-14 11:10:34] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 1 ms to minimize.
[2022-05-14 11:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2022-05-14 11:10:34] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 26 ms.
[2022-05-14 11:10:35] [INFO ] Added : 193 causal constraints over 39 iterations in 1200 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 179000 steps, including 2744 resets, run finished after 680 ms. (steps per millisecond=263 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 189000 steps, including 3321 resets, run finished after 446 ms. (steps per millisecond=423 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 25 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 30 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:36] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:10:37] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:37] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:10:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:37] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2022-05-14 11:10:37] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:38] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-14 11:10:38] [INFO ] Dead Transitions using invariants and state equation in 344 ms returned []
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting property specific reduction for DES-PT-40a-UpperBounds-03
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:38] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 137 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:38] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:10:38] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-14 11:10:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-14 11:10:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:38] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-05-14 11:10:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-14 11:10:38] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-14 11:10:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:38] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-14 11:10:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2022-05-14 11:10:38] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 1 ms to minimize.
[2022-05-14 11:10:39] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 1 ms to minimize.
[2022-05-14 11:10:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2022-05-14 11:10:39] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 19 ms.
[2022-05-14 11:10:40] [INFO ] Added : 186 causal constraints over 38 iterations in 930 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 189000 steps, including 3316 resets, run finished after 610 ms. (steps per millisecond=309 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 21 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:40] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13673 resets, run finished after 2672 ms. (steps per millisecond=374 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2275 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:44] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:10:44] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-14 11:10:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-14 11:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:44] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2022-05-14 11:10:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-14 11:10:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-14 11:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:44] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2022-05-14 11:10:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:44] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2022-05-14 11:10:45] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 0 ms to minimize.
[2022-05-14 11:10:45] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 1 ms to minimize.
[2022-05-14 11:10:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2022-05-14 11:10:45] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 12 ms.
[2022-05-14 11:10:46] [INFO ] Added : 186 causal constraints over 38 iterations in 851 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 189000 steps, including 3301 resets, run finished after 637 ms. (steps per millisecond=296 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 18 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:46] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:10:47] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:47] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:10:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:47] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1136 ms to find 0 implicit places.
[2022-05-14 11:10:48] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:48] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:10:48] [INFO ] Dead Transitions using invariants and state equation in 356 ms returned []
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-03 in 10015 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-14
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:48] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 136 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:48] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:10:48] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-14 11:10:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-14 11:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:48] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-14 11:10:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-05-14 11:10:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 150 ms returned sat
[2022-05-14 11:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:49] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-14 11:10:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-14 11:10:49] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2022-05-14 11:10:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2022-05-14 11:10:49] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 19 ms.
[2022-05-14 11:10:50] [INFO ] Added : 193 causal constraints over 39 iterations in 1332 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 179000 steps, including 2722 resets, run finished after 608 ms. (steps per millisecond=294 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:51] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13604 resets, run finished after 2071 ms. (steps per millisecond=482 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2271 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:54] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:10:54] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-14 11:10:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-14 11:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:55] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2022-05-14 11:10:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:10:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-14 11:10:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 86 ms returned sat
[2022-05-14 11:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:10:55] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2022-05-14 11:10:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-14 11:10:55] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 0 ms to minimize.
[2022-05-14 11:10:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2022-05-14 11:10:55] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-14 11:10:57] [INFO ] Added : 193 causal constraints over 39 iterations in 1322 ms. Result :sat
Minimization took 243 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 179000 steps, including 2746 resets, run finished after 650 ms. (steps per millisecond=275 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 18 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:58] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:10:58] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:58] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:10:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-14 11:10:59] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
[2022-05-14 11:10:59] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-14 11:10:59] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:10:59] [INFO ] Dead Transitions using invariants and state equation in 313 ms returned []
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-14 in 11186 ms.
[2022-05-14 11:11:00] [INFO ] Flatten gal took : 164 ms
[2022-05-14 11:11:00] [INFO ] Applying decomposition
[2022-05-14 11:11:00] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6956407834968040144.txt, -o, /tmp/graph6956407834968040144.bin, -w, /tmp/graph6956407834968040144.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6956407834968040144.bin, -l, -1, -v, -w, /tmp/graph6956407834968040144.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 11:11:00] [INFO ] Decomposing Gal with order
[2022-05-14 11:11:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 11:11:00] [INFO ] Removed a total of 52 redundant transitions.
[2022-05-14 11:11:00] [INFO ] Flatten gal took : 80 ms
[2022-05-14 11:11:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 8 ms.
[2022-05-14 11:11:00] [INFO ] Time to serialize gal into /tmp/UpperBounds7400096202147303895.gal : 11 ms
[2022-05-14 11:11:00] [INFO ] Time to serialize properties into /tmp/UpperBounds416294545923584691.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7400096202147303895.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds416294545923584691.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7400096202147303895.gal -t CGAL -reachable-file /tmp/UpperBounds416294545923584691.prop --nowitness
Loading property file /tmp/UpperBounds416294545923584691.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,1.77337e+13,12.6692,223660,24570,4636,487568,13565,294,691426,386,84983,0
Total reachable state count : 17733739550780

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-03 :0 <= u13.p90 <= 1
FORMULA DES-PT-40a-UpperBounds-03 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-40a-UpperBounds-03,0,14.7483,224720,1,0,487568,75825,478,691426,502,383397,3994
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-14 :0 <= u48.p43 <= 1
FORMULA DES-PT-40a-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-40a-UpperBounds-14,0,15.5756,224720,1,0,487568,81957,519,691426,594,427337,6223

BK_STOP 1652526677539

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-40a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DES-PT-40a, 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 r046-smll-165252115900187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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