fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r127-tall-167814504300023
Last Updated
May 14, 2023

About the Execution of 2022-gold for DBSingleClientW-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
437.415 10995.00 18396.00 125.00 0 0 0 0 0 1 1 0 0 2 0 0 1 0 1 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504300023.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DBSingleClientW-PT-d0m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 26 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 119K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174470725

Running Version 202205111006
[2023-03-07 07:34:31] [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]
[2023-03-07 07:34:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:34:32] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-07 07:34:32] [INFO ] Transformed 553 places.
[2023-03-07 07:34:32] [INFO ] Transformed 150 transitions.
[2023-03-07 07:34:32] [INFO ] Parsed PT model containing 553 places and 150 transitions in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-07 07:34:32] [INFO ] Computed 6 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2258 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :3
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 978 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
// Phase 1: matrix 150 rows 109 cols
[2023-03-07 07:34:32] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-07 07:34:32] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:32] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-07 07:34:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:32] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-07 07:34:32] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-07 07:34:32] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2023-03-07 07:34:32] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 21 ms.
[2023-03-07 07:34:32] [INFO ] Added : 2 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 20 ms.
[2023-03-07 07:34:32] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-07 07:34:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2023-03-07 07:34:33] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 3 ms to minimize.
[2023-03-07 07:34:33] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2023-03-07 07:34:33] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-07 07:34:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 205 ms
[2023-03-07 07:34:33] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 21 ms.
[2023-03-07 07:34:33] [INFO ] Added : 4 causal constraints over 1 iterations in 55 ms. Result :sat
Minimization took 21 ms.
[2023-03-07 07:34:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:33] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-07 07:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Added 74 Read/Feed constraints in 19 ms returned sat
[2023-03-07 07:34:33] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 31 ms.
[2023-03-07 07:34:33] [INFO ] Added : 1 causal constraints over 1 iterations in 68 ms. Result :sat
Minimization took 23 ms.
[2023-03-07 07:34:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:33] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-07 07:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:33] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-07 07:34:33] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2023-03-07 07:34:33] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 24 ms.
[2023-03-07 07:34:33] [INFO ] Added : 6 causal constraints over 2 iterations in 64 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [52, 229, 4, 4] Max seen :[1, 0, 2, 0]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 97
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 73 place count 67 transition count 84
Iterating global reduction 2 with 11 rules applied. Total rules applied 84 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 64 transition count 76
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 63 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 62 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 62 transition count 71
Applied a total of 99 rules in 57 ms. Remains 62 /109 variables (removed 47) and now considering 71/150 (removed 79) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/109 places, 71/150 transitions.
// Phase 1: matrix 71 rows 62 cols
[2023-03-07 07:34:34] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229244 resets, run finished after 696 ms. (steps per millisecond=1436 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 1000000 steps, including 101284 resets, run finished after 418 ms. (steps per millisecond=2392 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 1000000 steps, including 102090 resets, run finished after 455 ms. (steps per millisecond=2197 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 99954 resets, run finished after 310 ms. (steps per millisecond=3225 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101562 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 4) seen :4
// Phase 1: matrix 71 rows 62 cols
[2023-03-07 07:34:36] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-07 07:34:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:36] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-07 07:34:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-07 07:34:36] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2023-03-07 07:34:36] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
[2023-03-07 07:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-07 07:34:36] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 50 transitions) in 7 ms.
[2023-03-07 07:34:36] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 13 ms.
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:36] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-07 07:34:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-07 07:34:36] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 50 transitions) in 6 ms.
[2023-03-07 07:34:36] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:36] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
Current structural bounds on expressions (after SMT) : [52, 1, 4, 1] Max seen :[1, 1, 2, 1]
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 62/62 places, 71/71 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 65
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 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 12 place count 57 transition count 63
Applied a total of 12 rules in 17 ms. Remains 57 /62 variables (removed 5) and now considering 63/71 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/62 places, 63/71 transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:36] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229119 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 102170 resets, run finished after 302 ms. (steps per millisecond=3311 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101582 resets, run finished after 285 ms. (steps per millisecond=3508 ) properties (out of 2) seen :2
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:37] [INFO ] Computed 2 place invariants in 12 ms
[2023-03-07 07:34:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:37] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-07 07:34:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:37] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:37] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:37] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:37] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2023-03-07 07:34:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-07 07:34:38] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-07 07:34:38] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 8 ms.
[2023-03-07 07:34:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-07 07:34:38] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-07 07:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-07 07:34:38] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 7 ms.
[2023-03-07 07:34:38] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [52, 4] Max seen :[1, 2]
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 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 in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:34:38] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:34:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-07 07:34:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:38] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:34:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-05
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1054 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :1
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:34:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-07 07:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:38] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-07 07:34:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:38] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:38] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2023-03-07 07:34:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-07 07:34:38] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 10 ms.
[2023-03-07 07:34:38] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 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.
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229410 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 102281 resets, run finished after 287 ms. (steps per millisecond=3484 ) properties (out of 1) seen :1
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-07 07:34:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:39] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:39] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:39] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2023-03-07 07:34:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-07 07:34:39] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 5 ms.
[2023-03-07 07:34:39] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 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 in SAFETY mode, 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
[2023-03-07 07:34:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:34:39] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:39] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-07 07:34:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:39] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-07 07:34:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:39] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-05 in 1479 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-09
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:39] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 1058 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:39] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:39] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-07 07:34:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-07 07:34:39] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:39] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:34:40] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2023-03-07 07:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-07 07:34:40] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2023-03-07 07:34:40] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 5 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.
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:40] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229156 resets, run finished after 574 ms. (steps per millisecond=1742 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101247 resets, run finished after 302 ms. (steps per millisecond=3311 ) properties (out of 1) seen :2
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:40] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:34:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:40] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-07 07:34:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:34:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:34:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-07 07:34:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:41] [INFO ] [Nat]Added 19 Read/Feed constraints in 3 ms returned sat
[2023-03-07 07:34:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2023-03-07 07:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-07 07:34:41] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 4 ms.
[2023-03-07 07:34:41] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 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 in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:41] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:41] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-07 07:34:41] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-07 07:34:41] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2023-03-07 07:34:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2023-03-07 07:34:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:34:41] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m04-UpperBounds-09 in 1397 ms.
[2023-03-07 07:34:41] [INFO ] Flatten gal took : 29 ms
[2023-03-07 07:34:41] [INFO ] Applying decomposition
[2023-03-07 07:34:41] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11259614682799432081.txt' '-o' '/tmp/graph11259614682799432081.bin' '-w' '/tmp/graph11259614682799432081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11259614682799432081.bin' '-l' '-1' '-v' '-w' '/tmp/graph11259614682799432081.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:34:41] [INFO ] Decomposing Gal with order
[2023-03-07 07:34:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:34:41] [INFO ] Removed a total of 58 redundant transitions.
[2023-03-07 07:34:41] [INFO ] Flatten gal took : 37 ms
[2023-03-07 07:34:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2023-03-07 07:34:41] [INFO ] Time to serialize gal into /tmp/UpperBounds5863934315392579499.gal : 3 ms
[2023-03-07 07:34:41] [INFO ] Time to serialize properties into /tmp/UpperBounds6855618691936199946.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5863934315392579499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6855618691936199946.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds6855618691936199946.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,3434,0.045674,5384,278,139,2924,746,211,5097,61,3222,0
Total reachable state count : 3434

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d0m04-UpperBounds-05 :0 <= i0.u2.l154 <= 1
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m04-UpperBounds-05,0,0.048652,5384,1,0,2924,746,280,5097,75,3222,308
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DBSingleClientW-PT-d0m04-UpperBounds-09 :0 <= u10.l339 <= 2
FORMULA DBSingleClientW-PT-d0m04-UpperBounds-09 2 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-d0m04-UpperBounds-09,0,0.049247,5384,1,0,2924,746,299,5097,83,3222,393
Total runtime 9692 ms.

BK_STOP 1678174481720

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-d0m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DBSingleClientW-PT-d0m04, 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 r127-tall-167814504300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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