Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is DBSingleClientW-PT-d1m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 8.4K Mar 6 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 6 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 432K Mar 3 18:30 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

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

=== Now, execution of the tool begins

BK_START 1779525329823

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 08:35:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 08:35:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:35:32] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2026-05-23 08:35:32] [INFO ] Transformed 1440 places.
[2026-05-23 08:35:32] [INFO ] Transformed 672 transitions.
[2026-05-23 08:35:32] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 1093 places in 8 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2026-05-23 08:35:32] [INFO ] Computed 6 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[2, 6, 4, 4, 4]
RANDOM walk for 10000 steps (2309 resets) in 187 ms. (53 steps per ms)
BEST_FIRST walk for 50003 steps (4741 resets) in 511 ms. (97 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[2, 6, 4, 4, 4]
[2026-05-23 08:35:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:33] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2026-05-23 08:35:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2026-05-23 08:35:33] [INFO ] [Real]Absence check using state equation in 332 ms returned sat
[2026-05-23 08:35:34] [INFO ] State equation strengthened by 418 read => feed constraints.
[2026-05-23 08:35:34] [INFO ] [Real]Added 418 Read/Feed constraints in 171 ms returned sat
[2026-05-23 08:35:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:35:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2026-05-23 08:35:34] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2026-05-23 08:35:34] [INFO ] [Nat]Added 418 Read/Feed constraints in 110 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:35] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:36] [INFO ] Deduced a trap composed of 27 places in 590 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:36] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:37] [INFO ] Deduced a trap composed of 33 places in 505 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:37] [INFO ] Deduced a trap composed of 27 places in 419 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:38] [INFO ] Deduced a trap composed of 27 places in 279 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:38] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:38] [INFO ] Deduced a trap composed of 33 places in 281 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:39] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 13 ms to minimize.
[2026-05-23 08:35:39] [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 0
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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:39] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2026-05-23 08:35:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2026-05-23 08:35:39] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2026-05-23 08:35:40] [INFO ] [Real]Added 418 Read/Feed constraints in 188 ms returned sat
[2026-05-23 08:35:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:35:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2026-05-23 08:35:40] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2026-05-23 08:35:40] [INFO ] [Nat]Added 418 Read/Feed constraints in 145 ms returned sat
[2026-05-23 08:35:41] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 287 ms.
[2026-05-23 08:35:41] [INFO ] Added : 6 causal constraints over 2 iterations in 544 ms. Result :sat
Minimization took 563 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:42] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2026-05-23 08:35:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:42] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:35:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2026-05-23 08:35:42] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2026-05-23 08:35:42] [INFO ] [Real]Added 418 Read/Feed constraints in 215 ms returned sat
[2026-05-23 08:35:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:35:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2026-05-23 08:35:43] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2026-05-23 08:35:43] [INFO ] [Nat]Added 418 Read/Feed constraints in 275 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:43] [INFO ] Deduced a trap composed of 83 places in 433 ms of which 64 ms to minimize.
[2026-05-23 08:35:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 541 ms
[2026-05-23 08:35:44] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 142 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:44] [INFO ] Deduced a trap composed of 23 places in 400 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:45] [INFO ] Deduced a trap composed of 23 places in 421 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:46] [INFO ] Deduced a trap composed of 29 places in 470 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:46] [INFO ] Deduced a trap composed of 29 places in 517 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:47] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:47] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 42 ms to minimize.
[2026-05-23 08:35:47] [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:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1131)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:47] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2026-05-23 08:35:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2026-05-23 08:35:48] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2026-05-23 08:35:48] [INFO ] [Real]Added 418 Read/Feed constraints in 115 ms returned sat
[2026-05-23 08:35:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:35:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2026-05-23 08:35:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2026-05-23 08:35:48] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2026-05-23 08:35:48] [INFO ] [Nat]Added 418 Read/Feed constraints in 176 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:49] [INFO ] Deduced a trap composed of 83 places in 518 ms of which 94 ms to minimize.
[2026-05-23 08:35:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 597 ms
[2026-05-23 08:35:49] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 154 ms.
[2026-05-23 08:35:50] [INFO ] Added : 7 causal constraints over 2 iterations in 420 ms. Result :sat
Minimization took 549 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0, 0] Max Struct:[2, 6, 1, 4, 4]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0] Max Struct:[2, 6, 4, 4]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.6 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 358 place count 156 transition count 250
Iterating global reduction 2 with 73 rules applied. Total rules applied 431 place count 156 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 437 place count 156 transition count 244
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 479 place count 114 transition count 178
Iterating global reduction 3 with 42 rules applied. Total rules applied 521 place count 114 transition count 178
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 545 place count 114 transition count 154
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 555 place count 104 transition count 137
Iterating global reduction 4 with 10 rules applied. Total rules applied 565 place count 104 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 567 place count 104 transition count 135
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 574 place count 97 transition count 128
Iterating global reduction 5 with 7 rules applied. Total rules applied 581 place count 97 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 583 place count 97 transition count 126
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 589 place count 91 transition count 120
Iterating global reduction 6 with 6 rules applied. Total rules applied 595 place count 91 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 598 place count 91 transition count 117
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 599 place count 90 transition count 111
Iterating global reduction 7 with 1 rules applied. Total rules applied 600 place count 90 transition count 111
Applied a total of 600 rules in 203 ms. Remains 90 /347 variables (removed 257) and now considering 111/672 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 90/347 places, 111/672 transitions.
// Phase 1: matrix 111 rows 90 cols
[2026-05-23 08:35:50] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0] Max Struct:[2, 6, 4, 4]
RANDOM walk for 1000000 steps (230070 resets) in 1682 ms. (594 steps per ms)
BEST_FIRST walk for 4000001 steps (395171 resets) in 2559 ms. (1562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0] Max Struct:[2, 6, 4, 4]
[2026-05-23 08:35:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-23 08:35:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-23 08:35:55] [INFO ] [Real]Added 33 Read/Feed constraints in 8 ms returned sat
[2026-05-23 08:35:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:55] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:55] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:35:55] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 8 ms to minimize.
[2026-05-23 08:35:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 263 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Real]Added 33 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:35:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2026-05-23 08:35:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 8 ms returned sat
[2026-05-23 08:35:55] [INFO ] Computed and/alt/rep : 32/70/32 causal constraints (skipped 78 transitions) in 8 ms.
[2026-05-23 08:35:55] [INFO ] Added : 12 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 49 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 08:35:56] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2026-05-23 08:35:56] [INFO ] [Real]Added 33 Read/Feed constraints in 12 ms returned sat
[2026-05-23 08:35:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:35:56] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2026-05-23 08:35:56] [INFO ] [Nat]Added 33 Read/Feed constraints in 14 ms returned sat
[2026-05-23 08:35:56] [INFO ] Computed and/alt/rep : 32/70/32 causal constraints (skipped 78 transitions) in 12 ms.
[2026-05-23 08:35:56] [INFO ] Added : 11 causal constraints over 3 iterations in 97 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0] Max Struct:[1, 1, 4, 4]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[4, 4]
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 111/111 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 88 transition count 109
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 88 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 86 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 86 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 86 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 85 transition count 103
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 85 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 84 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 84 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 83 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 83 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 82 transition count 99
Applied a total of 17 rules in 34 ms. Remains 82 /90 variables (removed 8) and now considering 99/111 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 82/90 places, 99/111 transitions.
// Phase 1: matrix 99 rows 82 cols
[2026-05-23 08:35:56] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (229805 resets) in 1155 ms. (865 steps per ms)
BEST_FIRST walk for 2000001 steps (198134 resets) in 1137 ms. (1757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1] Max Struct:[4, 4]
[2026-05-23 08:35:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:35:58] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2026-05-23 08:35:58] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 08:35:58] [INFO ] [Real]Added 29 Read/Feed constraints in 15 ms returned sat
[2026-05-23 08:35:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:35:59] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-23 08:35:59] [INFO ] [Nat]Added 29 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:35:59] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 10 ms.
[2026-05-23 08:35:59] [INFO ] Added : 7 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 68 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:35:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:35:59] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1] Max Struct:[4, 1]
FORMULA DBSingleClientW-PT-d1m04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 99/99 transitions.
[2026-05-23 08:35:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (229946 resets) in 1185 ms. (843 steps per ms)
BEST_FIRST walk for 1000001 steps (98766 resets) in 577 ms. (1730 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2026-05-23 08:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:36:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:36:01] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2026-05-23 08:36:01] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 08:36:01] [INFO ] [Real]Added 29 Read/Feed constraints in 8 ms returned sat
[2026-05-23 08:36:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:36:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:36:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2026-05-23 08:36:01] [INFO ] [Nat]Added 29 Read/Feed constraints in 13 ms returned sat
[2026-05-23 08:36:01] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 11 ms.
[2026-05-23 08:36:01] [INFO ] Added : 7 causal constraints over 2 iterations in 62 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 11 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2026-05-23 08:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:36:01] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-23 08:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:36:01] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 08:36:02] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:36:02] [INFO ] Redundant transitions in 4 ms returned []
Running 98 sub problems to find dead transitions.
[2026-05-23 08:36:02] [INFO ] Invariant cache hit.
[2026-05-23 08:36:02] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:36:06] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 114 constraints, problems are : Problem set: 0 solved, 98 unsolved in 7229 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/181 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 29/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 98/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 212 constraints, problems are : Problem set: 0 solved, 98 unsolved in 13344 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20841ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 20855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21523 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9193 resets) in 1062 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3892 resets) in 360 ms. (110 steps per ms) remains 2/2 properties
[2026-05-23 08:36:23] [INFO ] Flatten gal took : 103 ms
[2026-05-23 08:36:23] [INFO ] Flatten gal took : 84 ms
BEST_FIRST walk for 40001 steps (3995 resets) in 396 ms. (100 steps per ms) remains 2/2 properties
[2026-05-23 08:36:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17527504840886096771.gal : 26 ms
[2026-05-23 08:36:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3060270531452655177.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17527504840886096771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3060270531452655177.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3060270531452655177.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
Probably explored full state space saw : 8794 states, properties seen :1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 114
Probabilistic random walk after 20601 steps, saw 8794 distinct states, run finished after 169 ms. (steps per millisecond=121 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 373
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :373 after 624
Explored full state space saw : 8825 states, properties seen :0
Exhaustive walk after 20654 steps, saw 8825 distinct states, run finished after 53 ms. (steps per millisecond=389 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Starting property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
[2026-05-23 08:36:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2303 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (1001 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2026-05-23 08:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:36:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:36:24] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2026-05-23 08:36:24] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 08:36:24] [INFO ] [Real]Added 29 Read/Feed constraints in 10 ms returned sat
[2026-05-23 08:36:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 08:36:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 08:36:24] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2026-05-23 08:36:24] [INFO ] [Nat]Added 29 Read/Feed constraints in 11 ms returned sat
[2026-05-23 08:36:24] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 11 ms.
[2026-05-23 08:36:24] [INFO ] Added : 7 causal constraints over 2 iterations in 58 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 82/82 places, 99/99 transitions.
[2026-05-23 08:36:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (229925 resets) in 1245 ms. (802 steps per ms)
BEST_FIRST walk for 1000001 steps (98813 resets) in 579 ms. (1724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2026-05-23 08:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:36:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:36:26] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2026-05-23 08:36:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 08:36:26] [INFO ] [Real]Added 29 Read/Feed constraints in 10 ms returned sat
[2026-05-23 08:36:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 08:36:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 08:36:26] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2026-05-23 08:36:26] [INFO ] [Nat]Added 29 Read/Feed constraints in 9 ms returned sat
[2026-05-23 08:36:26] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 9 ms.
[2026-05-23 08:36:26] [INFO ] Added : 7 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2026-05-23 08:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:36:26] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 08:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 08:36:26] [INFO ] State equation strengthened by 29 read => feed constraints.
[2026-05-23 08:36:27] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 08:36:27] [INFO ] Redundant transitions in 4 ms returned []
Running 98 sub problems to find dead transitions.
[2026-05-23 08:36:27] [INFO ] Invariant cache hit.
[2026-05-23 08:36:27] [INFO ] State equation strengthened by 29 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 08:36:29] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 114 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6441 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 1/82 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 99/181 variables, 82/85 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 29/114 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 98/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/181 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 212 constraints, problems are : Problem set: 0 solved, 98 unsolved in 15643 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22242ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 22245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22762 ms. Remains : 82/82 places, 99/99 transitions.
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 25 ms
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 27 ms
RANDOM walk for 40000 steps (9136 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2026-05-23 08:36:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4969505395627919440.gal : 10 ms
[2026-05-23 08:36:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10574088993588564156.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4969505395627919440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10574088993588564156.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3968 resets) in 60 ms. (655 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40001 steps (3969 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10574088993588564156.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 114
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :114 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 373
Probably explored full state space saw : 8794 states, properties seen :1
Probabilistic random walk after 20601 steps, saw 8794 distinct states, run finished after 60 ms. (steps per millisecond=343 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :373 after 624
Explored full state space saw : 8825 states, properties seen :0
Exhaustive walk after 20654 steps, saw 8825 distinct states, run finished after 28 ms. (steps per millisecond=737 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for DBSingleClientW-PT-d1m04-UpperBounds-14 in 25627 ms.
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:36:49] [INFO ] Applying decomposition
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15753310244330301537.txt' '-o' '/tmp/graph15753310244330301537.bin' '-w' '/tmp/graph15753310244330301537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15753310244330301537.bin' '-l' '-1' '-v' '-w' '/tmp/graph15753310244330301537.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:36:49] [INFO ] Decomposing Gal with order
[2026-05-23 08:36:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:36:49] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-23 08:36:49] [INFO ] Flatten gal took : 78 ms
[2026-05-23 08:36:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 16 ms.
[2026-05-23 08:36:49] [INFO ] Time to serialize gal into /tmp/UpperBounds13796892034169404926.gal : 8 ms
[2026-05-23 08:36:49] [INFO ] Time to serialize properties into /tmp/UpperBounds4718342905231444993.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13796892034169404926.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4718342905231444993.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds4718342905231444993.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,8825,0.102817,7232,444,198,5020,818,335,9993,102,3333,0
Total reachable state count : 8825

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m04-UpperBounds-14 :0 <= i5.i0.u7.l621 <= 1
FORMULA DBSingleClientW-PT-d1m04-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-d1m04-UpperBounds-14,0,0.11098,7232,1,0,5020,818,430,9993,120,3333,525
Total runtime 78158 ms.

BK_STOP 1779525410046

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is DBSingleClientW-PT-d1m04, 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 r095-smll-177946996300018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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