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.r323-tall-165472293000343.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 SieveSingleMsgMbox-PT-d1m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472293000343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 936K
-rw-r--r-- 1 mcc users 5.9K Jun 7 17:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 17:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 7 17:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 6 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 15K Jun 7 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Jun 7 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 450K Jun 6 12:11 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 SieveSingleMsgMbox-PT-d1m36-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m36-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654794544474

Running Version 0
[2022-06-09 17:09:06] [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-06-09 17:09:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 17:09:06] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2022-06-09 17:09:06] [INFO ] Transformed 1295 places.
[2022-06-09 17:09:06] [INFO ] Transformed 749 transitions.
[2022-06-09 17:09:06] [INFO ] Parsed PT model containing 1295 places and 749 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 96 ms.
Deduced a syphon composed of 1036 places in 8 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:09:06] [INFO ] Computed 6 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 2197 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
// Phase 1: matrix 749 rows 259 cols
[2022-06-09 17:09:07] [INFO ] Computed 6 place invariants in 16 ms
[2022-06-09 17:09:07] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 17:09:07] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:07] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2022-06-09 17:09:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:09:07] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:07] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2022-06-09 17:09:07] [INFO ] State equation strengthened by 587 read => feed constraints.
[2022-06-09 17:09:08] [INFO ] [Nat]Added 587 Read/Feed constraints in 302 ms returned sat
[2022-06-09 17:09:08] [INFO ] Deduced a trap composed of 18 places in 138 ms of which 3 ms to minimize.
[2022-06-09 17:09:08] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 1 ms to minimize.
[2022-06-09 17:09:08] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2022-06-09 17:09:08] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2022-06-09 17:09:08] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2022-06-09 17:09:08] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 0 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 1 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 0 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 1 ms to minimize.
[2022-06-09 17:09:09] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 0 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 0 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 1 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Deduced a trap composed of 161 places in 80 ms of which 0 ms to minimize.
[2022-06-09 17:09:10] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2821 ms
[2022-06-09 17:09:11] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 109 ms.
[2022-06-09 17:09:11] [INFO ] Added : 64 causal constraints over 13 iterations in 862 ms. Result :sat
Minimization took 588 ms.
[2022-06-09 17:09:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:09:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2022-06-09 17:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:12] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-06-09 17:09:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 17:09:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:12] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2022-06-09 17:09:13] [INFO ] [Nat]Added 587 Read/Feed constraints in 497 ms returned sat
[2022-06-09 17:09:13] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2022-06-09 17:09:13] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 0 ms to minimize.
[2022-06-09 17:09:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 285 ms
[2022-06-09 17:09:13] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 82 ms.
[2022-06-09 17:09:14] [INFO ] Added : 65 causal constraints over 13 iterations in 610 ms. Result :sat
Minimization took 531 ms.
Current structural bounds on expressions (after SMT) : [10, 1] Max seen :[0, 0]
Incomplete Parikh walk after 127000 steps, including 23700 resets, run finished after 671 ms. (steps per millisecond=189 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 123800 steps, including 22322 resets, run finished after 620 ms. (steps per millisecond=199 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 241 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.9 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 242 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 243 place count 241 transition count 507
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 302 place count 182 transition count 232
Iterating global reduction 1 with 59 rules applied. Total rules applied 361 place count 182 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 367 place count 182 transition count 226
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 410 place count 139 transition count 183
Iterating global reduction 2 with 43 rules applied. Total rules applied 453 place count 139 transition count 183
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 468 place count 139 transition count 168
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 494 place count 113 transition count 141
Iterating global reduction 3 with 26 rules applied. Total rules applied 520 place count 113 transition count 141
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 535 place count 113 transition count 126
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 542 place count 106 transition count 117
Iterating global reduction 4 with 7 rules applied. Total rules applied 549 place count 106 transition count 117
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 556 place count 99 transition count 110
Iterating global reduction 4 with 7 rules applied. Total rules applied 563 place count 99 transition count 110
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 567 place count 95 transition count 105
Iterating global reduction 4 with 4 rules applied. Total rules applied 571 place count 95 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 573 place count 95 transition count 103
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 577 place count 91 transition count 99
Iterating global reduction 5 with 4 rules applied. Total rules applied 581 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 583 place count 89 transition count 97
Iterating global reduction 5 with 2 rules applied. Total rules applied 585 place count 89 transition count 97
Applied a total of 585 rules in 114 ms. Remains 89 /259 variables (removed 170) and now considering 97/749 (removed 652) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/259 places, 97/749 transitions.
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:09:16] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 224219 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 104206 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103410 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 2) seen :0
// Phase 1: matrix 97 rows 89 cols
[2022-06-09 17:09:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:09:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:09:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:09:17] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:17] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:09:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2022-06-09 17:09:17] [INFO ] [Nat]Added 37 Read/Feed constraints in 12 ms returned sat
[2022-06-09 17:09:17] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 6 ms.
[2022-06-09 17:09:17] [INFO ] Added : 23 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 25 ms.
[2022-06-09 17:09:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:09:17] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 17:09:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:09:18] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 17:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:18] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:09:18] [INFO ] [Nat]Added 37 Read/Feed constraints in 5 ms returned sat
[2022-06-09 17:09:18] [INFO ] Computed and/alt/rep : 25/55/25 causal constraints (skipped 71 transitions) in 6 ms.
[2022-06-09 17:09:18] [INFO ] Added : 20 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [10, 1] Max seen :[0, 0]
Incomplete Parikh walk after 15900 steps, including 2369 resets, run finished after 25 ms. (steps per millisecond=636 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17000 steps, including 2605 resets, run finished after 18 ms. (steps per millisecond=944 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 89/89 places, 97/97 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 96
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 87 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 87 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 87 transition count 94
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 86 transition count 92
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 86 transition count 92
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 85 transition count 91
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 85 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 84 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 84 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 83 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 82 transition count 88
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 81 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 80 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 79 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 79 transition count 84
Applied a total of 21 rules in 24 ms. Remains 79 /89 variables (removed 10) and now considering 84/97 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/89 places, 84/97 transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:18] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224189 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103510 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 1) seen :0
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:19] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-09 17:09:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 17:09:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:19] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 17:09:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 17:09:19] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
[2022-06-09 17:09:19] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 62 transitions) in 9 ms.
[2022-06-09 17:09:19] [INFO ] Added : 20 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [10] Max seen :[0]
Incomplete Parikh walk after 19700 steps, including 3344 resets, run finished after 18 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-06-09 17:09:19] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 17:09:19] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2022-06-09 17:09:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:19] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-04
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:19] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2253 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1048 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 17:09:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 17:09:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 17:09:19] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2022-06-09 17:09:19] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 62 transitions) in 13 ms.
[2022-06-09 17:09:19] [INFO ] Added : 20 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 19700 steps, including 3314 resets, run finished after 18 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:20] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224347 resets, run finished after 721 ms. (steps per millisecond=1386 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103306 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :0
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:21] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 17:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:09:21] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 17:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:21] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:09:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 17:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 17:09:21] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 17:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 17:09:21] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 17:09:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 17:09:21] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2022-06-09 17:09:21] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 62 transitions) in 6 ms.
[2022-06-09 17:09:21] [INFO ] Added : 20 causal constraints over 4 iterations in 46 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 19700 steps, including 3303 resets, run finished after 21 ms. (steps per millisecond=938 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Starting structural reductions, iteration 0 : 79/79 places, 84/84 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:21] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 17:09:21] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2022-06-09 17:09:21] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 79 cols
[2022-06-09 17:09:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-06-09 17:09:21] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/79 places, 84/84 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 in 1755 ms.
[2022-06-09 17:09:21] [INFO ] Flatten gal took : 55 ms
[2022-06-09 17:09:21] [INFO ] Applying decomposition
[2022-06-09 17:09:21] [INFO ] Flatten gal took : 14 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/graph17324208550418197608.txt, -o, /tmp/graph17324208550418197608.bin, -w, /tmp/graph17324208550418197608.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/graph17324208550418197608.bin, -l, -1, -v, -w, /tmp/graph17324208550418197608.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 17:09:22] [INFO ] Decomposing Gal with order
[2022-06-09 17:09:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 17:09:22] [INFO ] Removed a total of 80 redundant transitions.
[2022-06-09 17:09:22] [INFO ] Flatten gal took : 35 ms
[2022-06-09 17:09:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 14 ms.
[2022-06-09 17:09:22] [INFO ] Time to serialize gal into /tmp/UpperBounds13242312651387472602.gal : 9 ms
[2022-06-09 17:09:22] [INFO ] Time to serialize properties into /tmp/UpperBounds16058705773937514446.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/UpperBounds13242312651387472602.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16058705773937514446.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/UpperBounds13242312651387472602.gal -t CGAL -reachable-file /tmp/UpperBounds16058705773937514446.prop --nowitness
Loading property file /tmp/UpperBounds16058705773937514446.prop.
Detected timeout of ITS tools.
[2022-06-09 17:29:27] [INFO ] Flatten gal took : 17 ms
[2022-06-09 17:29:27] [INFO ] Time to serialize gal into /tmp/UpperBounds16773465183662837421.gal : 2 ms
[2022-06-09 17:29:27] [INFO ] Time to serialize properties into /tmp/UpperBounds11784062100295649867.prop : 0 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/UpperBounds16773465183662837421.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11784062100295649867.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds16773465183662837421.gal -t CGAL -reachable-file /tmp/UpperBounds11784062100295649867.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds11784062100295649867.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,1.20491e+13,60.8233,967172,2,26864,5,4.86641e+06,6,0,402,4.1315e+06,0
Total reachable state count : 12049075913425

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 :0 <= l921 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m36-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m36-UpperBounds-04,0,60.8282,967172,1,0,7,4.86641e+06,9,1,488,4.1315e+06,4

BK_STOP 1654795830889

--------------------
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="SieveSingleMsgMbox-PT-d1m36"
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 SieveSingleMsgMbox-PT-d1m36, 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 r323-tall-165472293000343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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