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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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 1.6M 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-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745739933

Running Version 0
[2022-06-09 03:35:41] [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:35:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:35:41] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-06-09 03:35:41] [INFO ] Transformed 4763 places.
[2022-06-09 03:35:41] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:35:41] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 18 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:35:42] [INFO ] Computed 6 place invariants in 160 ms
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 930 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 908 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 919 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:35:42] [INFO ] Computed 6 place invariants in 87 ms
[2022-06-09 03:35:43] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2022-06-09 03:35:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2022-06-09 03:35:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:43] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2022-06-09 03:35:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:35:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2022-06-09 03:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:45] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2022-06-09 03:35:45] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:35:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:35:49] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3659 ms returned unknown
[2022-06-09 03:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2022-06-09 03:35:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:49] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2022-06-09 03:35:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:35:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:50] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2022-06-09 03:35:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:35:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4362 ms returned unknown
[2022-06-09 03:35:55] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:35:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 03:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:55] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2022-06-09 03:35:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:35:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 03:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:56] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2022-06-09 03:36:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:36:00] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4253 ms returned unknown
[2022-06-09 03:36:01] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2022-06-09 03:36:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:01] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2022-06-09 03:36:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:36:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2022-06-09 03:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:02] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2022-06-09 03:36:06] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3747 ms returned sat
[2022-06-09 03:36:07] [INFO ] Deduced a trap composed of 32 places in 651 ms of which 3 ms to minimize.
[2022-06-09 03:36:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [6, 6, 6, 2343] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.14 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1318 place count 434 transition count 880
Iterating global reduction 2 with 313 rules applied. Total rules applied 1631 place count 434 transition count 880
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1643 place count 434 transition count 868
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1881 place count 196 transition count 529
Iterating global reduction 3 with 238 rules applied. Total rules applied 2119 place count 196 transition count 529
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 3 with 207 rules applied. Total rules applied 2326 place count 196 transition count 322
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2351 place count 171 transition count 282
Iterating global reduction 4 with 25 rules applied. Total rules applied 2376 place count 171 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2382 place count 171 transition count 276
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2398 place count 155 transition count 260
Iterating global reduction 5 with 16 rules applied. Total rules applied 2414 place count 155 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2418 place count 155 transition count 256
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2431 place count 142 transition count 243
Iterating global reduction 6 with 13 rules applied. Total rules applied 2444 place count 142 transition count 243
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2456 place count 142 transition count 231
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2460 place count 138 transition count 215
Iterating global reduction 7 with 4 rules applied. Total rules applied 2464 place count 138 transition count 215
Applied a total of 2464 rules in 257 ms. Remains 138 /1183 variables (removed 1045) and now considering 215/2478 (removed 2263) transitions.
Finished structural reductions, in 1 iterations. Remains : 138/1183 places, 215/2478 transitions.
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 03:36:07] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229502 resets, run finished after 1482 ms. (steps per millisecond=674 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95223 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95203 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95928 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95281 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 4) seen :1
// Phase 1: matrix 215 rows 138 cols
[2022-06-09 03:36:11] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:36:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:11] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:36:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-09 03:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:11] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-06-09 03:36:11] [INFO ] State equation strengthened by 86 read => feed constraints.
[2022-06-09 03:36:11] [INFO ] [Nat]Added 86 Read/Feed constraints in 44 ms returned sat
[2022-06-09 03:36:11] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2022-06-09 03:36:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-06-09 03:36:11] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:36:11] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2022-06-09 03:36:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 300 ms
[2022-06-09 03:36:12] [INFO ] Computed and/alt/rep : 53/129/53 causal constraints (skipped 161 transitions) in 25 ms.
[2022-06-09 03:36:12] [INFO ] Added : 46 causal constraints over 10 iterations in 249 ms. Result :sat
Minimization took 77 ms.
[2022-06-09 03:36:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:12] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2022-06-09 03:36:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:12] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-06-09 03:36:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-09 03:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:12] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:36:12] [INFO ] [Nat]Added 86 Read/Feed constraints in 32 ms returned sat
[2022-06-09 03:36:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:36:12] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-06-09 03:36:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2022-06-09 03:36:12] [INFO ] Computed and/alt/rep : 53/129/53 causal constraints (skipped 161 transitions) in 24 ms.
[2022-06-09 03:36:12] [INFO ] Added : 46 causal constraints over 10 iterations in 221 ms. Result :sat
Minimization took 65 ms.
[2022-06-09 03:36:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:13] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:36:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:13] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:36:13] [INFO ] [Nat]Added 86 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:36:13] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2022-06-09 03:36:13] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:36:13] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:36:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:36:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 255 ms
[2022-06-09 03:36:13] [INFO ] Computed and/alt/rep : 53/129/53 causal constraints (skipped 161 transitions) in 25 ms.
[2022-06-09 03:36:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2022-06-09 03:36:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-06-09 03:36:13] [INFO ] Added : 46 causal constraints over 10 iterations in 301 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [6, 1, 6, 2343] Max seen :[0, 1, 0, 0]
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 50000 steps, including 10241 resets, run finished after 102 ms. (steps per millisecond=490 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30200 steps, including 5442 resets, run finished after 54 ms. (steps per millisecond=559 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 28800 steps, including 5390 resets, run finished after 51 ms. (steps per millisecond=564 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 138/138 places, 215/215 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 137 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 137 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 136 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 136 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 136 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 135 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 135 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 134 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 134 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 134 transition count 208
Applied a total of 10 rules in 35 ms. Remains 134 /138 variables (removed 4) and now considering 208/215 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 134/138 places, 208/215 transitions.
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:14] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230477 resets, run finished after 1316 ms. (steps per millisecond=759 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95759 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95586 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95593 resets, run finished after 660 ms. (steps per millisecond=1515 ) properties (out of 3) seen :0
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:17] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:36:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:17] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:36:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:17] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-06-09 03:36:17] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-09 03:36:17] [INFO ] [Nat]Added 84 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:36:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2022-06-09 03:36:17] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-06-09 03:36:17] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:36:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2022-06-09 03:36:17] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 156 transitions) in 16 ms.
[2022-06-09 03:36:17] [INFO ] Added : 45 causal constraints over 9 iterations in 187 ms. Result :sat
Minimization took 70 ms.
[2022-06-09 03:36:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:36:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:18] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:36:18] [INFO ] [Nat]Added 84 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:36:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:36:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2022-06-09 03:36:18] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 156 transitions) in 21 ms.
[2022-06-09 03:36:18] [INFO ] Added : 45 causal constraints over 9 iterations in 207 ms. Result :sat
Minimization took 83 ms.
[2022-06-09 03:36:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:36:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:36:18] [INFO ] [Nat]Added 84 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:36:18] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:36:18] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:36:18] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:36:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2022-06-09 03:36:18] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 156 transitions) in 16 ms.
[2022-06-09 03:36:19] [INFO ] Added : 45 causal constraints over 9 iterations in 188 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 2343] Max seen :[0, 0, 0]
Incomplete Parikh walk after 63200 steps, including 13037 resets, run finished after 110 ms. (steps per millisecond=574 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65400 steps, including 12970 resets, run finished after 110 ms. (steps per millisecond=594 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65400 steps, including 12974 resets, run finished after 111 ms. (steps per millisecond=589 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 208/208 transitions.
Starting structural reductions, iteration 0 : 134/134 places, 208/208 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 208/208 (removed 0) transitions.
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:19] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:36:19] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:19] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:36:19] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-09 03:36:20] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2022-06-09 03:36:20] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:20] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:36:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 208/208 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:20] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2352 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 967 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:20] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:36:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:20] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:36:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:20] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:36:20] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-09 03:36:20] [INFO ] [Nat]Added 84 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:36:20] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2022-06-09 03:36:20] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:36:20] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:36:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 177 ms
[2022-06-09 03:36:20] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 156 transitions) in 13 ms.
[2022-06-09 03:36:20] [INFO ] Added : 45 causal constraints over 9 iterations in 174 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 65400 steps, including 12925 resets, run finished after 104 ms. (steps per millisecond=628 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 134/134 places, 208/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 132 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 131 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 127 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 127 transition count 180
Applied a total of 18 rules in 20 ms. Remains 127 /134 variables (removed 7) and now considering 180/208 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/134 places, 180/208 transitions.
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:36:20] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229821 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95196 resets, run finished after 513 ms. (steps per millisecond=1949 ) properties (out of 1) seen :0
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:36:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:36:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:22] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:36:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:22] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:36:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-09 03:36:22] [INFO ] [Nat]Added 59 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:36:22] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2022-06-09 03:36:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-06-09 03:36:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:36:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2022-06-09 03:36:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2022-06-09 03:36:22] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 12 ms.
[2022-06-09 03:36:23] [INFO ] Added : 44 causal constraints over 9 iterations in 149 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 22800 steps, including 4097 resets, run finished after 33 ms. (steps per millisecond=690 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:36:23] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:36:23] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:36:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:36:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-09 03:36:23] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2022-06-09 03:36:23] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:36:23] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:36:23] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00 in 3532 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-10
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:23] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:36:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:23] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:36:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:23] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:36:23] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-09 03:36:23] [INFO ] [Nat]Added 84 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:36:23] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:36:24] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:36:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2022-06-09 03:36:24] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 156 transitions) in 12 ms.
[2022-06-09 03:36:24] [INFO ] Added : 45 causal constraints over 9 iterations in 183 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 65400 steps, including 12966 resets, run finished after 110 ms. (steps per millisecond=594 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 134/134 places, 208/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 132 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 131 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 130 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 130 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 129 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 129 transition count 194
Applied a total of 12 rules in 22 ms. Remains 129 /134 variables (removed 5) and now considering 194/208 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/134 places, 194/208 transitions.
// Phase 1: matrix 194 rows 129 cols
[2022-06-09 03:36:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230249 resets, run finished after 1277 ms. (steps per millisecond=783 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95327 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 1) seen :0
// Phase 1: matrix 194 rows 129 cols
[2022-06-09 03:36:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:36:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:26] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:36:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:26] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:36:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 03:36:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:36:26] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:36:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-09 03:36:26] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 143 transitions) in 14 ms.
[2022-06-09 03:36:26] [INFO ] Added : 44 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 23000 steps, including 4118 resets, run finished after 40 ms. (steps per millisecond=575 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 194/194 transitions.
Starting structural reductions, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 129 cols
[2022-06-09 03:36:26] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:36:26] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 194 rows 129 cols
[2022-06-09 03:36:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:36:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 03:36:27] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2022-06-09 03:36:27] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 194 rows 129 cols
[2022-06-09 03:36:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:36:27] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 194/194 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-10 in 3502 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:27] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 208 rows 134 cols
[2022-06-09 03:36:27] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:36:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:27] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:36:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 8 ms returned sat
[2022-06-09 03:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:27] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:36:27] [INFO ] State equation strengthened by 84 read => feed constraints.
[2022-06-09 03:36:27] [INFO ] [Nat]Added 84 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:36:27] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2022-06-09 03:36:27] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 10 ms to minimize.
[2022-06-09 03:36:27] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:36:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2022-06-09 03:36:27] [INFO ] Computed and/alt/rep : 51/121/51 causal constraints (skipped 156 transitions) in 14 ms.
[2022-06-09 03:36:27] [INFO ] Added : 45 causal constraints over 9 iterations in 184 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 63200 steps, including 13030 resets, run finished after 107 ms. (steps per millisecond=590 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 134 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 134/134 places, 208/208 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 132 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 206
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 130 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 130 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 128 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 128 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 125 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 125 transition count 178
Applied a total of 22 rules in 14 ms. Remains 125 /134 variables (removed 9) and now considering 178/208 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/134 places, 178/208 transitions.
// Phase 1: matrix 178 rows 125 cols
[2022-06-09 03:36:27] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230005 resets, run finished after 1173 ms. (steps per millisecond=852 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96176 resets, run finished after 513 ms. (steps per millisecond=1949 ) properties (out of 1) seen :0
// Phase 1: matrix 178 rows 125 cols
[2022-06-09 03:36:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:36:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:29] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-06-09 03:36:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:36:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:36:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:36:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:36:29] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2022-06-09 03:36:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:36:29] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 5 ms to minimize.
[2022-06-09 03:36:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2022-06-09 03:36:29] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 13 ms.
[2022-06-09 03:36:30] [INFO ] Added : 43 causal constraints over 9 iterations in 143 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 37500 steps, including 7011 resets, run finished after 60 ms. (steps per millisecond=625 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 125 cols
[2022-06-09 03:36:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:36:30] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 178 rows 125 cols
[2022-06-09 03:36:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:36:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:36:30] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2022-06-09 03:36:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 178 rows 125 cols
[2022-06-09 03:36:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:36:30] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14 in 3388 ms.
[2022-06-09 03:36:30] [INFO ] Flatten gal took : 51 ms
[2022-06-09 03:36:30] [INFO ] Applying decomposition
[2022-06-09 03:36:30] [INFO ] Flatten gal took : 21 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/graph15737654682672318557.txt, -o, /tmp/graph15737654682672318557.bin, -w, /tmp/graph15737654682672318557.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/graph15737654682672318557.bin, -l, -1, -v, -w, /tmp/graph15737654682672318557.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:36:30] [INFO ] Decomposing Gal with order
[2022-06-09 03:36:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:36:31] [INFO ] Removed a total of 217 redundant transitions.
[2022-06-09 03:36:31] [INFO ] Flatten gal took : 68 ms
[2022-06-09 03:36:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 153 labels/synchronizations in 16 ms.
[2022-06-09 03:36:31] [INFO ] Time to serialize gal into /tmp/UpperBounds15049022225638238558.gal : 6 ms
[2022-06-09 03:36:31] [INFO ] Time to serialize properties into /tmp/UpperBounds11757153945725070680.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/UpperBounds15049022225638238558.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11757153945725070680.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/UpperBounds15049022225638238558.gal -t CGAL -reachable-file /tmp/UpperBounds11757153945725070680.prop --nowitness
Loading property file /tmp/UpperBounds11757153945725070680.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,2.02614e+06,7.78924,186344,2326,2244,125937,106469,518,897737,273,1.27053e+06,0
Total reachable state count : 2026135

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-00 :0 <= i5.u8.l2691 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 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-d2m06-UpperBounds-00,0,7.97156,186344,1,0,125937,106469,628,897737,313,1.27053e+06,1463
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-10 :0 <= i0.u1.l2232 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 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-d2m06-UpperBounds-10,0,7.97924,186344,1,0,125937,106469,650,897737,328,1.27053e+06,1523
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-14 :0 <= i5.u11.l1793 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-14,0,7.98358,186344,1,0,125937,106469,668,897737,335,1.27053e+06,1615
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1654745800067

--------------------
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-d2m06"
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-d2m06, 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-165472292600097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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