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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.1K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Jun 7 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Jun 7 17:16 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-d2m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654746205967

Running Version 0
[2022-06-09 03:43:27] [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:43:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:43:27] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2022-06-09 03:43:27] [INFO ] Transformed 4763 places.
[2022-06-09 03:43:27] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:43:28] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 286 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 19 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:43:28] [INFO ] Computed 6 place invariants in 182 ms
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 7) seen :1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 953 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:43:29] [INFO ] Computed 6 place invariants in 127 ms
[2022-06-09 03:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2022-06-09 03:43:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2022-06-09 03:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:30] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2022-06-09 03:43:30] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:43:32] [INFO ] [Real]Added 1588 Read/Feed constraints in 2079 ms returned sat
[2022-06-09 03:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:43:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:43:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:33] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2022-06-09 03:43:37] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4238 ms returned sat
[2022-06-09 03:43:38] [INFO ] Deduced a trap composed of 49 places in 739 ms of which 6 ms to minimize.
[2022-06-09 03:43:38] [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: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)
[2022-06-09 03:43:38] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2022-06-09 03:43:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:39] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2022-06-09 03:43:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:43:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:43:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:40] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2022-06-09 03:43:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:43:44] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4187 ms returned unknown
[2022-06-09 03:43:44] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2022-06-09 03:43:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 03:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:45] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2022-06-09 03:43:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:43:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:43:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:43:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:46] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2022-06-09 03:43:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:43:50] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4263 ms returned unknown
[2022-06-09 03:43:50] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:43:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:51] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2022-06-09 03:43:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:43:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:43:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2022-06-09 03:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:51] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2022-06-09 03:43:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:43:56] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4213 ms returned unknown
[2022-06-09 03:43:56] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:43:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2022-06-09 03:43:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:57] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2022-06-09 03:43:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:43:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:43:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:43:57] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2022-06-09 03:44:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4027 ms returned sat
[2022-06-09 03:44:02] [INFO ] Deduced a trap composed of 33 places in 669 ms of which 2 ms to minimize.
[2022-06-09 03:44:02] [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 4
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)
[2022-06-09 03:44:02] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:44:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2022-06-09 03:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:03] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2022-06-09 03:44:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:44:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 25 ms returned sat
[2022-06-09 03:44:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:04] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2022-06-09 03:44:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:44:08] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4255 ms returned unknown
Current structural bounds on expressions (after SMT) : [5, 7, 10, 3255, 7, 7] Max seen :[1, 0, 0, 0, 0, 0]
Support contains 6 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.11 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 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1320 place count 433 transition count 879
Iterating global reduction 2 with 313 rules applied. Total rules applied 1633 place count 433 transition count 879
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1645 place count 433 transition count 867
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1882 place count 196 transition count 536
Iterating global reduction 3 with 237 rules applied. Total rules applied 2119 place count 196 transition count 536
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 3 with 208 rules applied. Total rules applied 2327 place count 196 transition count 328
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2350 place count 173 transition count 290
Iterating global reduction 4 with 23 rules applied. Total rules applied 2373 place count 173 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2379 place count 173 transition count 284
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2393 place count 159 transition count 270
Iterating global reduction 5 with 14 rules applied. Total rules applied 2407 place count 159 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2410 place count 159 transition count 267
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2422 place count 147 transition count 255
Iterating global reduction 6 with 12 rules applied. Total rules applied 2434 place count 147 transition count 255
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 2442 place count 147 transition count 247
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2446 place count 143 transition count 230
Iterating global reduction 7 with 4 rules applied. Total rules applied 2450 place count 143 transition count 230
Applied a total of 2450 rules in 274 ms. Remains 143 /1183 variables (removed 1040) and now considering 230/2478 (removed 2248) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/1183 places, 230/2478 transitions.
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:08] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229628 resets, run finished after 1533 ms. (steps per millisecond=652 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95636 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95398 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 94972 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95013 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95494 resets, run finished after 683 ms. (steps per millisecond=1464 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95577 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 6) seen :1
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:14] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:44:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:14] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-06-09 03:44:14] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:14] [INFO ] [Real]Added 88 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:44:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:14] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:44:14] [INFO ] [Nat]Added 88 Read/Feed constraints in 43 ms returned sat
[2022-06-09 03:44:14] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2022-06-09 03:44:14] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:44:14] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2022-06-09 03:44:14] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2022-06-09 03:44:15] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2022-06-09 03:44:15] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 5 ms to minimize.
[2022-06-09 03:44:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:44:15] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:44:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 604 ms
[2022-06-09 03:44:15] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 28 ms.
[2022-06-09 03:44:15] [INFO ] Added : 45 causal constraints over 9 iterations in 268 ms. Result :sat
Minimization took 136 ms.
[2022-06-09 03:44:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:15] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:15] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:44:15] [INFO ] [Nat]Added 88 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:44:15] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-06-09 03:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-06-09 03:44:15] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 24 ms.
[2022-06-09 03:44:16] [INFO ] Added : 47 causal constraints over 10 iterations in 260 ms. Result :sat
Minimization took 94 ms.
[2022-06-09 03:44:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:16] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:44:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:16] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:44:16] [INFO ] [Nat]Added 88 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:44:16] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-06-09 03:44:16] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:44:16] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:44:16] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:44:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:44:16] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:44:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 376 ms
[2022-06-09 03:44:16] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 28 ms.
[2022-06-09 03:44:17] [INFO ] Added : 49 causal constraints over 10 iterations in 253 ms. Result :sat
Minimization took 226 ms.
[2022-06-09 03:44:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:17] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:17] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2022-06-09 03:44:17] [INFO ] [Nat]Added 88 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:44:17] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:44:17] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-06-09 03:44:17] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:44:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:44:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 272 ms
[2022-06-09 03:44:17] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 31 ms.
[2022-06-09 03:44:17] [INFO ] Added : 48 causal constraints over 10 iterations in 221 ms. Result :sat
Minimization took 84 ms.
[2022-06-09 03:44:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:44:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:44:18] [INFO ] [Nat]Added 88 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:44:18] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2022-06-09 03:44:18] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:44:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2022-06-09 03:44:18] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 14 ms.
[2022-06-09 03:44:18] [INFO ] Added : 45 causal constraints over 9 iterations in 196 ms. Result :sat
Minimization took 115 ms.
[2022-06-09 03:44:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:18] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:44:18] [INFO ] [Nat]Added 88 Read/Feed constraints in 26 ms returned sat
[2022-06-09 03:44:18] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2022-06-09 03:44:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2022-06-09 03:44:19] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 16 ms.
[2022-06-09 03:44:19] [INFO ] Added : 45 causal constraints over 9 iterations in 201 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [5, 7, 10, 3255, 7, 7] Max seen :[2, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 28200 steps, including 5289 resets, run finished after 75 ms. (steps per millisecond=376 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26900 steps, including 5249 resets, run finished after 52 ms. (steps per millisecond=517 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 22900 steps, including 4135 resets, run finished after 44 ms. (steps per millisecond=520 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 30400 steps, including 5938 resets, run finished after 57 ms. (steps per millisecond=533 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 30700 steps, including 5535 resets, run finished after 59 ms. (steps per millisecond=520 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 21300 steps, including 3664 resets, run finished after 39 ms. (steps per millisecond=546 ) properties (out of 6) seen :1 could not realise parikh vector
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Applied a total of 0 rules in 21 ms. Remains 143 /143 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 230/230 transitions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:19] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:19] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:20] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2022-06-09 03:44:20] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:20] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 230/230 transitions.
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:20] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229139 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 94667 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95237 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95246 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95583 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95044 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95086 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties (out of 6) seen :1
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:26] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:26] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:26] [INFO ] [Real]Added 88 Read/Feed constraints in 23 ms returned sat
[2022-06-09 03:44:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:26] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:44:26] [INFO ] [Nat]Added 88 Read/Feed constraints in 30 ms returned sat
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 0 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2022-06-09 03:44:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 550 ms
[2022-06-09 03:44:26] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 15 ms.
[2022-06-09 03:44:27] [INFO ] Added : 45 causal constraints over 9 iterations in 217 ms. Result :sat
Minimization took 132 ms.
[2022-06-09 03:44:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:27] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-06-09 03:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:27] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:44:27] [INFO ] [Nat]Added 88 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:44:27] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2022-06-09 03:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-06-09 03:44:27] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 13 ms.
[2022-06-09 03:44:27] [INFO ] Added : 47 causal constraints over 10 iterations in 204 ms. Result :sat
Minimization took 83 ms.
[2022-06-09 03:44:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:27] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-06-09 03:44:27] [INFO ] [Nat]Added 88 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:44:28] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-06-09 03:44:28] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 5 ms to minimize.
[2022-06-09 03:44:28] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:44:28] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:44:28] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2022-06-09 03:44:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2022-06-09 03:44:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 417 ms
[2022-06-09 03:44:28] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 13 ms.
[2022-06-09 03:44:28] [INFO ] Added : 49 causal constraints over 10 iterations in 198 ms. Result :sat
Minimization took 220 ms.
[2022-06-09 03:44:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-09 03:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:28] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:28] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:44:28] [INFO ] [Nat]Added 88 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:44:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2022-06-09 03:44:29] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2022-06-09 03:44:29] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2022-06-09 03:44:29] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2022-06-09 03:44:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 298 ms
[2022-06-09 03:44:29] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 12 ms.
[2022-06-09 03:44:29] [INFO ] Added : 48 causal constraints over 10 iterations in 185 ms. Result :sat
Minimization took 77 ms.
[2022-06-09 03:44:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:29] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:44:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:29] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:44:29] [INFO ] [Nat]Added 88 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:44:29] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-06-09 03:44:29] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:44:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2022-06-09 03:44:29] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 14 ms.
[2022-06-09 03:44:30] [INFO ] Added : 45 causal constraints over 9 iterations in 188 ms. Result :sat
Minimization took 103 ms.
[2022-06-09 03:44:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:44:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:30] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:44:30] [INFO ] [Nat]Added 88 Read/Feed constraints in 32 ms returned sat
[2022-06-09 03:44:30] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:44:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2022-06-09 03:44:30] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 15 ms.
[2022-06-09 03:44:30] [INFO ] Added : 45 causal constraints over 9 iterations in 183 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [5, 7, 10, 3255, 7, 7] Max seen :[2, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 28200 steps, including 5292 resets, run finished after 51 ms. (steps per millisecond=552 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 26900 steps, including 5242 resets, run finished after 47 ms. (steps per millisecond=572 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 22900 steps, including 4098 resets, run finished after 41 ms. (steps per millisecond=558 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 30400 steps, including 5905 resets, run finished after 53 ms. (steps per millisecond=573 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 30700 steps, including 5538 resets, run finished after 58 ms. (steps per millisecond=529 ) properties (out of 6) seen :1 could not realise parikh vector
Incomplete Parikh walk after 21300 steps, including 3640 resets, run finished after 38 ms. (steps per millisecond=560 ) properties (out of 6) seen :1 could not realise parikh vector
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Applied a total of 0 rules in 8 ms. Remains 143 /143 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 230/230 transitions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:31] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:44:31] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:31] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:31] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2022-06-09 03:44:31] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:31] [INFO ] Dead Transitions using invariants and state equation in 96 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 230/230 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-00
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:31] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2329 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:31] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-06-09 03:44:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:31] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:44:31] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:31] [INFO ] [Nat]Added 88 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:44:31] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-06-09 03:44:31] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:44:32] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:44:32] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:44:32] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2022-06-09 03:44:32] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2022-06-09 03:44:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 348 ms
[2022-06-09 03:44:32] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 13 ms.
[2022-06-09 03:44:32] [INFO ] Added : 45 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 23200 steps, including 4314 resets, run finished after 40 ms. (steps per millisecond=580 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 226
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 139 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 136 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 136 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 136 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 133 transition count 203
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 133 transition count 203
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 131 transition count 201
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 131 transition count 201
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 129 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 129 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 36 place count 129 transition count 195
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 126 transition count 175
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 126 transition count 175
Applied a total of 42 rules in 23 ms. Remains 126 /143 variables (removed 17) and now considering 175/230 (removed 55) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/143 places, 175/230 transitions.
// Phase 1: matrix 175 rows 126 cols
[2022-06-09 03:44:32] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229804 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95506 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties (out of 1) seen :1
// Phase 1: matrix 175 rows 126 cols
[2022-06-09 03:44:34] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:44:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:34] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:34] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:44:34] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 03:44:34] [INFO ] [Nat]Added 51 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:44:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:44:34] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:44:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2022-06-09 03:44:34] [INFO ] Computed and/alt/rep : 50/125/50 causal constraints (skipped 124 transitions) in 9 ms.
[2022-06-09 03:44:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:44:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-09 03:44:34] [INFO ] Added : 43 causal constraints over 9 iterations in 218 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 38700 steps, including 7439 resets, run finished after 55 ms. (steps per millisecond=703 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 175/175 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 175/175 (removed 0) transitions.
// Phase 1: matrix 175 rows 126 cols
[2022-06-09 03:44:34] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:44:34] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 175 rows 126 cols
[2022-06-09 03:44:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:35] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 03:44:35] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2022-06-09 03:44:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 175 rows 126 cols
[2022-06-09 03:44:35] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:44:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 175/175 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-00 in 3716 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:35] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2280 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 928 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:35] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:35] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:35] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:35] [INFO ] [Nat]Added 88 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:44:35] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2022-06-09 03:44:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-06-09 03:44:35] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 14 ms.
[2022-06-09 03:44:35] [INFO ] Added : 47 causal constraints over 10 iterations in 211 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 30700 steps, including 5455 resets, run finished after 59 ms. (steps per millisecond=520 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 139 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 136 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 136 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 133 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 133 transition count 208
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 133 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 131 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 131 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 129 transition count 202
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 129 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 129 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 41 place count 126 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 44 place count 126 transition count 178
Applied a total of 44 rules in 24 ms. Remains 126 /143 variables (removed 17) and now considering 178/230 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/143 places, 178/230 transitions.
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:44:36] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230053 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95561 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 1) seen :0
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:44:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:37] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:44:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:37] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:44:37] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:44:37] [INFO ] [Nat]Added 57 Read/Feed constraints in 19 ms returned sat
[2022-06-09 03:44:37] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 127 transitions) in 10 ms.
[2022-06-09 03:44:38] [INFO ] Added : 44 causal constraints over 9 iterations in 144 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 29400 steps, including 5254 resets, run finished after 42 ms. (steps per millisecond=700 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 178/178 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:44:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:38] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:44:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:38] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:44:38] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2022-06-09 03:44:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:44:38] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:38] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03 in 3239 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-09
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2280 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:38] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:44:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:38] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:44:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:38] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:44:38] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:38] [INFO ] [Nat]Added 88 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:44:38] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 8 ms to minimize.
[2022-06-09 03:44:38] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:44:38] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:44:38] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:44:39] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:44:39] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:44:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 340 ms
[2022-06-09 03:44:39] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 13 ms.
[2022-06-09 03:44:39] [INFO ] Added : 49 causal constraints over 10 iterations in 207 ms. Result :sat
Minimization took 217 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 30400 steps, including 5898 resets, run finished after 53 ms. (steps per millisecond=573 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 139 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 136 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 136 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 136 transition count 214
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 133 transition count 205
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 133 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 132 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 131 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 37 place count 128 transition count 178
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 128 transition count 178
Applied a total of 40 rules in 20 ms. Remains 128 /143 variables (removed 15) and now considering 178/230 (removed 52) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/143 places, 178/230 transitions.
// Phase 1: matrix 178 rows 128 cols
[2022-06-09 03:44:39] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229710 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95256 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
// Phase 1: matrix 178 rows 128 cols
[2022-06-09 03:44:41] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:44:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:41] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:44:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:41] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:44:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 03:44:41] [INFO ] [Nat]Added 51 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:44:41] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 15 ms.
[2022-06-09 03:44:41] [INFO ] Added : 45 causal constraints over 9 iterations in 142 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 128 cols
[2022-06-09 03:44:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:41] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 178 rows 128 cols
[2022-06-09 03:44:41] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 03:44:41] [INFO ] State equation strengthened by 51 read => feed constraints.
[2022-06-09 03:44:42] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2022-06-09 03:44:42] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 178 rows 128 cols
[2022-06-09 03:44:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:42] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-09 in 3639 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-12
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:42] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:42] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:44:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:42] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:42] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:42] [INFO ] [Nat]Added 88 Read/Feed constraints in 26 ms returned sat
[2022-06-09 03:44:42] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2022-06-09 03:44:42] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-06-09 03:44:42] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2022-06-09 03:44:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:44:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 235 ms
[2022-06-09 03:44:42] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 13 ms.
[2022-06-09 03:44:42] [INFO ] Added : 48 causal constraints over 10 iterations in 198 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 22900 steps, including 4030 resets, run finished after 41 ms. (steps per millisecond=558 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 225
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 139 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 135 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 135 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 135 transition count 216
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 22 place count 131 transition count 202
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 131 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 131 transition count 200
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 129 transition count 198
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 129 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 127 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 127 transition count 196
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 127 transition count 192
Applied a total of 40 rules in 17 ms. Remains 127 /143 variables (removed 16) and now considering 192/230 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/143 places, 192/230 transitions.
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:44:43] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229831 resets, run finished after 1244 ms. (steps per millisecond=803 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95926 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties (out of 1) seen :0
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:44:44] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:44:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:44] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:44:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:44] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:44:44] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-09 03:44:44] [INFO ] [Nat]Added 72 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:44:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:44:45] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:44:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2022-06-09 03:44:45] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 142 transitions) in 11 ms.
[2022-06-09 03:44:45] [INFO ] Added : 43 causal constraints over 9 iterations in 146 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 54000 steps, including 10192 resets, run finished after 84 ms. (steps per millisecond=642 ) 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, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 192/192 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:44:45] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:44:45] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:44:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-09 03:44:45] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2022-06-09 03:44:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:44:45] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:45] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 192/192 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-12 in 3653 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-13
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:45] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2240 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 963 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:45] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:44:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:45] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:46] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-06-09 03:44:46] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:46] [INFO ] [Nat]Added 88 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:44:46] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:44:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:44:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-06-09 03:44:46] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 16 ms.
[2022-06-09 03:44:46] [INFO ] Added : 45 causal constraints over 9 iterations in 188 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 26900 steps, including 5213 resets, run finished after 47 ms. (steps per millisecond=572 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 139 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 139 transition count 225
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 139 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 136 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 136 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 136 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 133 transition count 204
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 133 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 132 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 132 transition count 201
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 131 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 131 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 131 transition count 199
Applied a total of 32 rules in 17 ms. Remains 131 /143 variables (removed 12) and now considering 199/230 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/143 places, 199/230 transitions.
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:44:46] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229789 resets, run finished after 1317 ms. (steps per millisecond=759 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95632 resets, run finished after 611 ms. (steps per millisecond=1636 ) properties (out of 1) seen :0
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:44:48] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:44:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:48] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:44:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:48] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:44:48] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 03:44:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 19 ms returned sat
[2022-06-09 03:44:48] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-09 03:44:48] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 14 ms.
[2022-06-09 03:44:48] [INFO ] Added : 45 causal constraints over 9 iterations in 174 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 29600 steps, including 5480 resets, run finished after 46 ms. (steps per millisecond=643 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:44:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:49] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:44:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 03:44:49] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2022-06-09 03:44:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:44:49] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:44:49] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-13 in 3689 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-15
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:49] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 972 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 230 rows 143 cols
[2022-06-09 03:44:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:49] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:44:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:49] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-06-09 03:44:49] [INFO ] State equation strengthened by 88 read => feed constraints.
[2022-06-09 03:44:49] [INFO ] [Nat]Added 88 Read/Feed constraints in 32 ms returned sat
[2022-06-09 03:44:49] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:44:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-06-09 03:44:49] [INFO ] Computed and/alt/rep : 55/148/55 causal constraints (skipped 174 transitions) in 15 ms.
[2022-06-09 03:44:50] [INFO ] Added : 45 causal constraints over 9 iterations in 204 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 28200 steps, including 5311 resets, run finished after 50 ms. (steps per millisecond=564 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 230/230 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 224
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 138 transition count 220
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 134 transition count 213
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 134 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 134 transition count 212
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 130 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 130 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 33 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 35 place count 128 transition count 194
Iterating global reduction 3 with 2 rules applied. Total rules applied 37 place count 128 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 126 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 126 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 45 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 48 place count 123 transition count 168
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 123 transition count 168
Applied a total of 51 rules in 17 ms. Remains 123 /143 variables (removed 20) and now considering 168/230 (removed 62) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/143 places, 168/230 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:44:50] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229492 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95048 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 1) seen :0
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:44:51] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:44:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:44:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:51] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:44:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:44:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:44:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:44:51] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:44:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:44:51] [INFO ] [Nat]Added 49 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:44:52] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2022-06-09 03:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-09 03:44:52] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 11 ms.
[2022-06-09 03:44:52] [INFO ] Added : 43 causal constraints over 9 iterations in 133 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 33000 steps, including 6346 resets, run finished after 48 ms. (steps per millisecond=687 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:44:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:52] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:44:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:44:52] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:44:52] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-06-09 03:44:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:44:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:44:52] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-15 in 3108 ms.
[2022-06-09 03:44:52] [INFO ] Flatten gal took : 70 ms
[2022-06-09 03:44:52] [INFO ] Applying decomposition
[2022-06-09 03:44:52] [INFO ] Flatten gal took : 29 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/graph17334996164818334009.txt, -o, /tmp/graph17334996164818334009.bin, -w, /tmp/graph17334996164818334009.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/graph17334996164818334009.bin, -l, -1, -v, -w, /tmp/graph17334996164818334009.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:44:53] [INFO ] Decomposing Gal with order
[2022-06-09 03:44:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:44:53] [INFO ] Removed a total of 261 redundant transitions.
[2022-06-09 03:44:53] [INFO ] Flatten gal took : 62 ms
[2022-06-09 03:44:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 203 labels/synchronizations in 14 ms.
[2022-06-09 03:44:53] [INFO ] Time to serialize gal into /tmp/UpperBounds16038702163230417491.gal : 9 ms
[2022-06-09 03:44:53] [INFO ] Time to serialize properties into /tmp/UpperBounds6052160043476049056.prop : 14 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/UpperBounds16038702163230417491.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6052160043476049056.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/UpperBounds16038702163230417491.gal -t CGAL -reachable-file /tmp/UpperBounds6052160043476049056.prop --nowitness
Loading property file /tmp/UpperBounds6052160043476049056.prop.
Detected timeout of ITS tools.
[2022-06-09 04:05:21] [INFO ] Flatten gal took : 17 ms
[2022-06-09 04:05:21] [INFO ] Time to serialize gal into /tmp/UpperBounds2049646652384226060.gal : 11 ms
[2022-06-09 04:05:21] [INFO ] Time to serialize properties into /tmp/UpperBounds7994231930108276140.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2049646652384226060.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7994231930108276140.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2049646652384226060.gal -t CGAL -reachable-file /tmp/UpperBounds7994231930108276140.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds7994231930108276140.prop.
Detected timeout of ITS tools.
[2022-06-09 04:25:51] [INFO ] Flatten gal took : 197 ms
[2022-06-09 04:25:52] [INFO ] Input system was already deterministic with 230 transitions.
[2022-06-09 04:25:52] [INFO ] Transformed 143 places.
[2022-06-09 04:25:52] [INFO ] Transformed 230 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 04:25:52] [INFO ] Time to serialize gal into /tmp/UpperBounds7455929002928053657.gal : 6 ms
[2022-06-09 04:25:52] [INFO ] Time to serialize properties into /tmp/UpperBounds7769493926514365644.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7455929002928053657.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7769493926514365644.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7455929002928053657.gal -t CGAL -reachable-file /tmp/UpperBounds7769493926514365644.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7769493926514365644.prop.

BK_TIME_CONFINEMENT_REACHED

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

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