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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Jun 7 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 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 119K 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 DBSingleClientW-PT-d0m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745009199

Running Version 0
[2022-06-09 03:23:30] [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 03:23:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:23:30] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2022-06-09 03:23:30] [INFO ] Transformed 553 places.
[2022-06-09 03:23:30] [INFO ] Transformed 150 transitions.
[2022-06-09 03:23:30] [INFO ] Parsed PT model containing 553 places and 150 transitions in 97 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:23:30] [INFO ] Computed 6 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 1021 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 03:23:31] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-09 03:23:31] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:23:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2022-06-09 03:23:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:23:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:31] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2022-06-09 03:23:31] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 03:23:31] [INFO ] [Real]Added 74 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:23:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 03:23:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 03:23:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:31] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:23:31] [INFO ] [Nat]Added 74 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 3 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:23:31] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 431 ms
[2022-06-09 03:23:31] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 23 ms.
[2022-06-09 03:23:32] [INFO ] Added : 34 causal constraints over 7 iterations in 129 ms. Result :sat
Minimization took 65 ms.
[2022-06-09 03:23:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:32] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Real]Added 74 Read/Feed constraints in 13 ms returned sat
[2022-06-09 03:23:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:32] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Nat]Added 74 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:23:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:23:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-06-09 03:23:32] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 27 ms.
[2022-06-09 03:23:32] [INFO ] Added : 37 causal constraints over 8 iterations in 133 ms. Result :sat
Minimization took 61 ms.
[2022-06-09 03:23:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 03:23:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 57, 1] Max seen :[1, 1, 1, 1]
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 25000 steps, including 5920 resets, run finished after 55 ms. (steps per millisecond=454 ) properties (out of 2) seen :2 could not realise parikh vector
Incomplete Parikh walk after 24300 steps, including 4630 resets, run finished after 42 ms. (steps per millisecond=578 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 61 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 59 transition count 69
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 59 transition count 67
Applied a total of 104 rules in 42 ms. Remains 59 /109 variables (removed 50) and now considering 67/150 (removed 83) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/109 places, 67/150 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:32] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229024 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 101517 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101273 resets, run finished after 342 ms. (steps per millisecond=2923 ) properties (out of 2) seen :4
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 03:23:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:34] [INFO ] [Real]Added 20 Read/Feed constraints in 5 ms returned sat
[2022-06-09 03:23:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:23:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:34] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2022-06-09 03:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-06-09 03:23:34] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:34] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 18 ms.
[2022-06-09 03:23:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:34] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 03:23:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:34] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 03:23:34] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:34] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2022-06-09 03:23:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-09 03:23:34] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:34] [INFO ] Added : 18 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [4, 57] Max seen :[2, 2]
Incomplete Parikh walk after 11800 steps, including 1872 resets, run finished after 15 ms. (steps per millisecond=786 ) properties (out of 2) seen :3 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 998 resets, run finished after 11 ms. (steps per millisecond=772 ) properties (out of 2) seen :6 could not realise parikh vector
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:34] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-06-09 03:23:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:34] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:34] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229227 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 102097 resets, run finished after 330 ms. (steps per millisecond=3030 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 101071 resets, run finished after 327 ms. (steps per millisecond=3058 ) properties (out of 2) seen :4
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:36] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 03:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:23:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:23:36] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:23:36] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2022-06-09 03:23:36] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2022-06-09 03:23:36] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 1 ms to minimize.
[2022-06-09 03:23:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 103 ms
[2022-06-09 03:23:36] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:36] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 16 ms.
[2022-06-09 03:23:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 03:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:23:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:23:36] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2022-06-09 03:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-06-09 03:23:36] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:36] [INFO ] Added : 19 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [4, 57] Max seen :[3, 3]
Incomplete Parikh walk after 11900 steps, including 1874 resets, run finished after 14 ms. (steps per millisecond=850 ) properties (out of 2) seen :3 could not realise parikh vector
Incomplete Parikh walk after 12300 steps, including 2113 resets, run finished after 18 ms. (steps per millisecond=683 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:36] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:36] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-06-09 03:23:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-03
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:36] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 1051 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:23:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:36] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 03:23:36] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:36] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:36] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 5 ms.
[2022-06-09 03:23:36] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2022-06-09 03:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-06-09 03:23:36] [INFO ] Added : 17 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 12200 steps, including 1940 resets, run finished after 14 ms. (steps per millisecond=871 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:36] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 228921 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 100966 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :2
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 03:23:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:37] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:37] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:37] [INFO ] [Nat]Added 20 Read/Feed constraints in 5 ms returned sat
[2022-06-09 03:23:37] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:23:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-06-09 03:23:37] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 8 ms.
[2022-06-09 03:23:37] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 8500 steps, including 1005 resets, run finished after 15 ms. (steps per millisecond=566 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:37] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:38] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-06-09 03:23:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:38] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 228776 resets, run finished after 647 ms. (steps per millisecond=1545 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101449 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 1) seen :2
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 03:23:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:39] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 4 ms returned sat
[2022-06-09 03:23:39] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2022-06-09 03:23:39] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2022-06-09 03:23:39] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 1 ms to minimize.
[2022-06-09 03:23:39] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2022-06-09 03:23:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 127 ms
[2022-06-09 03:23:39] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 6 ms.
[2022-06-09 03:23:39] [INFO ] Added : 19 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Incomplete Parikh walk after 12300 steps, including 2162 resets, run finished after 17 ms. (steps per millisecond=723 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:39] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:23:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2022-06-09 03:23:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 67/67 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-03 in 2981 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-05
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2262 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1038 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:39] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 03:23:39] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-09 03:23:39] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:39] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 47 transitions) in 5 ms.
[2022-06-09 03:23:39] [INFO ] Added : 18 causal constraints over 4 iterations in 27 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 12100 steps, including 2029 resets, run finished after 14 ms. (steps per millisecond=864 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 67/67 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 57 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 57 transition count 63
Applied a total of 6 rules in 7 ms. Remains 57 /59 variables (removed 2) and now considering 63/67 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/59 places, 63/67 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:23:39] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 228943 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 101620 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 1) seen :2
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:23:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:23:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 03:23:40] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:23:40] [INFO ] [Real]Added 19 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:23:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:40] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 03:23:40] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2022-06-09 03:23:40] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2022-06-09 03:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-06-09 03:23:40] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 4 ms.
[2022-06-09 03:23:40] [INFO ] Added : 18 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 11800 steps, including 1906 resets, run finished after 16 ms. (steps per millisecond=737 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:23:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:40] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:23:40] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:23:40] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 03:23:40] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-06-09 03:23:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 03:23:40] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:23:40] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-05 in 1398 ms.
[2022-06-09 03:23:41] [INFO ] Flatten gal took : 30 ms
[2022-06-09 03:23:41] [INFO ] Applying decomposition
[2022-06-09 03:23:41] [INFO ] Flatten gal took : 9 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/graph14005286936894388311.txt, -o, /tmp/graph14005286936894388311.bin, -w, /tmp/graph14005286936894388311.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/graph14005286936894388311.bin, -l, -1, -v, -w, /tmp/graph14005286936894388311.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:23:41] [INFO ] Decomposing Gal with order
[2022-06-09 03:23:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:23:41] [INFO ] Removed a total of 62 redundant transitions.
[2022-06-09 03:23:41] [INFO ] Flatten gal took : 31 ms
[2022-06-09 03:23:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 5 ms.
[2022-06-09 03:23:41] [INFO ] Time to serialize gal into /tmp/UpperBounds6139178302937081466.gal : 3 ms
[2022-06-09 03:23:41] [INFO ] Time to serialize properties into /tmp/UpperBounds14461818879926074789.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/UpperBounds6139178302937081466.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14461818879926074789.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/UpperBounds6139178302937081466.gal -t CGAL -reachable-file /tmp/UpperBounds14461818879926074789.prop --nowitness
Loading property file /tmp/UpperBounds14461818879926074789.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.23476e+07,2.63074,68596,1853,553,98734,4995,228,255182,65,40994,0
Total reachable state count : 12347645

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m09-UpperBounds-03 :0 <= i1.u13.l342 <= 4
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-03 4 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
DBSingleClientW-PT-d0m09-UpperBounds-03,0,2.81607,68596,1,0,98734,4995,305,255182,82,40994,845
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m09-UpperBounds-05 :0 <= u11.l153 <= 4
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-05 4 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
DBSingleClientW-PT-d0m09-UpperBounds-05,0,2.92002,68596,1,0,98734,5719,328,255182,96,41544,1210

BK_STOP 1654745025256

--------------------
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="DBSingleClientW-PT-d0m09"
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 DBSingleClientW-PT-d0m09, 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-165472292600064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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