Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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-d2m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717190417862

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:20:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:20:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:20:19] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2024-05-31 21:20:19] [INFO ] Transformed 4763 places.
[2024-05-31 21:20:19] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:20:19] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 3580 places in 27 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:20:19] [INFO ] Computed 6 invariants in 156 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
RANDOM walk for 10000 steps (2295 resets) in 367 ms. (27 steps per ms)
BEST_FIRST walk for 90006 steps (8492 resets) in 630 ms. (142 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
[2024-05-31 21:20:20] [INFO ] Invariant cache hit.
[2024-05-31 21:20:21] [INFO ] [Real]Absence check using 2 positive place invariants in 36 ms returned sat
[2024-05-31 21:20:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-31 21:20:22] [INFO ] [Real]Absence check using state equation in 716 ms returned sat
[2024-05-31 21:20:22] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-31 21:20:23] [INFO ] [Real]Added 1588 Read/Feed constraints in 726 ms returned sat
[2024-05-31 21:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:20:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:20:24] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2024-05-31 21:20:25] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1023 ms returned sat
[2024-05-31 21:20:26] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 702 ms.
[2024-05-31 21:20:27] [INFO ] Deduced a trap composed of 33 places in 892 ms of which 132 ms to minimize.
[2024-05-31 21:20:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1106 ms
[2024-05-31 21:20:28] [INFO ] Added : 10 causal constraints over 3 iterations in 2625 ms. Result :sat
Minimization took 302 ms.
[2024-05-31 21:20:28] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:20:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:29] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2024-05-31 21:20:30] [INFO ] [Real]Added 1588 Read/Feed constraints in 759 ms returned sat
[2024-05-31 21:20:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:20:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-31 21:20:31] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2024-05-31 21:20:32] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 21:20:32] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1451 ms returned sat
[2024-05-31 21:20:33] [INFO ] Deduced a trap composed of 73 places in 803 ms of which 9 ms to minimize.
[2024-05-31 21:20:34] [INFO ] Deduced a trap composed of 75 places in 810 ms of which 10 ms to minimize.
[2024-05-31 21:20:35] [INFO ] Deduced a trap composed of 56 places in 773 ms of which 9 ms to minimize.
[2024-05-31 21:20:35] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:20:35] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:20:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:36] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2024-05-31 21:20:36] [INFO ] [Real]Added 1588 Read/Feed constraints in 752 ms returned sat
[2024-05-31 21:20:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:20:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:20:37] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2024-05-31 21:20:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 927 ms returned sat
[2024-05-31 21:20:39] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 634 ms.
[2024-05-31 21:20:40] [INFO ] Added : 9 causal constraints over 2 iterations in 1143 ms. Result :sat
Minimization took 655 ms.
[2024-05-31 21:20:40] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-31 21:20:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:20:41] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2024-05-31 21:20:42] [INFO ] [Real]Added 1588 Read/Feed constraints in 742 ms returned sat
[2024-05-31 21:20:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:20:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:43] [INFO ] [Nat]Absence check using state equation in 781 ms returned sat
[2024-05-31 21:20:44] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1039 ms returned sat
[2024-05-31 21:20:45] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 457 ms.
[2024-05-31 21:20:46] [INFO ] Deduced a trap composed of 33 places in 828 ms of which 7 ms to minimize.
[2024-05-31 21:20:47] [INFO ] Deduced a trap composed of 100 places in 764 ms of which 8 ms to minimize.
[2024-05-31 21:20:47] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2073 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-31 21:20:47] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:20:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:48] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-05-31 21:20:49] [INFO ] [Real]Added 1588 Read/Feed constraints in 793 ms returned sat
[2024-05-31 21:20:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-31 21:20:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:50] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-05-31 21:20:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 21:20:52] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1673 ms returned unknown
[2024-05-31 21:20:52] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:20:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:52] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2024-05-31 21:20:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:20:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:53] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2024-05-31 21:20:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 883 ms returned sat
[2024-05-31 21:20:55] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 392 ms.
[2024-05-31 21:20:55] [INFO ] Added : 2 causal constraints over 1 iterations in 656 ms. Result :sat
Minimization took 656 ms.
[2024-05-31 21:20:56] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:20:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:20:56] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2024-05-31 21:20:57] [INFO ] [Real]Added 1588 Read/Feed constraints in 770 ms returned sat
[2024-05-31 21:20:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:20:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:20:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2024-05-31 21:20:58] [INFO ] [Nat]Absence check using state equation in 702 ms returned sat
[2024-05-31 21:20:59] [INFO ] [Nat]Added 1588 Read/Feed constraints in 945 ms returned sat
[2024-05-31 21:21:00] [INFO ] Deduced a trap composed of 33 places in 764 ms of which 7 ms to minimize.
[2024-05-31 21:21:01] [INFO ] Deduced a trap composed of 48 places in 820 ms of which 8 ms to minimize.
[2024-05-31 21:21:02] [INFO ] Deduced a trap composed of 28 places in 809 ms of which 8 ms to minimize.
[2024-05-31 21:21:03] [INFO ] Deduced a trap composed of 76 places in 826 ms of which 8 ms to minimize.
[2024-05-31 21:21:03] [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 6
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:21:03] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:21:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2024-05-31 21:21:04] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2024-05-31 21:21:05] [INFO ] [Real]Added 1588 Read/Feed constraints in 774 ms returned sat
[2024-05-31 21:21:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:21:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:21:06] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2024-05-31 21:21:07] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1118 ms returned sat
[2024-05-31 21:21:08] [INFO ] Deduced a trap composed of 170 places in 751 ms of which 8 ms to minimize.
[2024-05-31 21:21:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 935 ms
[2024-05-31 21:21:08] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 400 ms.
[2024-05-31 21:21:10] [INFO ] Deduced a trap composed of 32 places in 793 ms of which 8 ms to minimize.
[2024-05-31 21:21:11] [INFO ] Deduced a trap composed of 75 places in 816 ms of which 8 ms to minimize.
[2024-05-31 21:21:11] [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 7
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:21:11] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:11] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:21:11] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2024-05-31 21:21:12] [INFO ] [Real]Added 1588 Read/Feed constraints in 913 ms returned sat
[2024-05-31 21:21:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:21:12] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-31 21:21:13] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-05-31 21:21:14] [INFO ] [Nat]Added 1588 Read/Feed constraints in 941 ms returned sat
[2024-05-31 21:21:15] [INFO ] Deduced a trap composed of 50 places in 815 ms of which 8 ms to minimize.
[2024-05-31 21:21:16] [INFO ] Deduced a trap composed of 157 places in 531 ms of which 8 ms to minimize.
[2024-05-31 21:21:16] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 2022 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Support contains 9 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, 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.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) 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 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1220
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1220
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1012 place count 748 transition count 1202
Discarding 311 places :
Symmetric choice reduction at 2 with 311 rule applications. Total rules 1323 place count 437 transition count 891
Iterating global reduction 2 with 311 rules applied. Total rules applied 1634 place count 437 transition count 891
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1645 place count 437 transition count 880
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 1879 place count 203 transition count 550
Iterating global reduction 3 with 234 rules applied. Total rules applied 2113 place count 203 transition count 550
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 3 with 207 rules applied. Total rules applied 2320 place count 203 transition count 343
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 2342 place count 181 transition count 306
Iterating global reduction 4 with 22 rules applied. Total rules applied 2364 place count 181 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2374 place count 181 transition count 296
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2388 place count 167 transition count 282
Iterating global reduction 5 with 14 rules applied. Total rules applied 2402 place count 167 transition count 282
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2406 place count 167 transition count 278
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2417 place count 156 transition count 267
Iterating global reduction 6 with 11 rules applied. Total rules applied 2428 place count 156 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2433 place count 156 transition count 262
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2435 place count 154 transition count 258
Iterating global reduction 7 with 2 rules applied. Total rules applied 2437 place count 154 transition count 258
Applied a total of 2437 rules in 256 ms. Remains 154 /1183 variables (removed 1029) and now considering 258/2478 (removed 2220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 154/1183 places, 258/2478 transitions.
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:21:17] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
RANDOM walk for 1000000 steps (230025 resets) in 2965 ms. (337 steps per ms)
BEST_FIRST walk for 9000006 steps (859786 resets) in 11643 ms. (772 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
[2024-05-31 21:21:31] [INFO ] Invariant cache hit.
[2024-05-31 21:21:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-31 21:21:31] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-31 21:21:31] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:21:31] [INFO ] [Real]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:31] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-31 21:21:31] [INFO ] [Nat]Added 111 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:21:31] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-31 21:21:32] [INFO ] Added : 9 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 210 ms.
[2024-05-31 21:21:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:32] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 21:21:32] [INFO ] [Real]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:21:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:32] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-31 21:21:32] [INFO ] [Nat]Added 111 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:21:32] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-31 21:21:32] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-31 21:21:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-31 21:21:32] [INFO ] Added : 13 causal constraints over 3 iterations in 203 ms. Result :sat
Minimization took 196 ms.
[2024-05-31 21:21:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:21:33] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 16 ms.
[2024-05-31 21:21:33] [INFO ] Added : 11 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 185 ms.
[2024-05-31 21:21:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:21:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-31 21:21:33] [INFO ] [Nat]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:21:33] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 21 ms.
[2024-05-31 21:21:33] [INFO ] Added : 10 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 185 ms.
[2024-05-31 21:21:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Real]Added 111 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:21:34] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-31 21:21:34] [INFO ] Added : 15 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 194 ms.
[2024-05-31 21:21:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Real]Added 111 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-31 21:21:34] [INFO ] [Nat]Added 111 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:21:34] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-31 21:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-31 21:21:34] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 17 ms.
[2024-05-31 21:21:34] [INFO ] Added : 2 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 164 ms.
[2024-05-31 21:21:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:21:35] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-31 21:21:35] [INFO ] Added : 15 causal constraints over 4 iterations in 103 ms. Result :sat
Minimization took 188 ms.
[2024-05-31 21:21:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Real]Added 111 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:21:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 21:21:35] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:21:36] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-31 21:21:36] [INFO ] Added : 11 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 185 ms.
[2024-05-31 21:21:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:36] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 21:21:36] [INFO ] [Real]Added 111 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:36] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-31 21:21:36] [INFO ] [Nat]Added 111 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:21:36] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 20 ms.
[2024-05-31 21:21:36] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:21:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2024-05-31 21:21:36] [INFO ] Added : 13 causal constraints over 3 iterations in 237 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 2, 5, 5, 7]
Support contains 9 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 15 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 154/154 places, 258/258 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-31 21:21:37] [INFO ] Invariant cache hit.
[2024-05-31 21:21:37] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 21:21:37] [INFO ] Invariant cache hit.
[2024-05-31 21:21:38] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:21:38] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-31 21:21:38] [INFO ] Redundant transitions in 10 ms returned []
Running 257 sub problems to find dead transitions.
[2024-05-31 21:21:38] [INFO ] Invariant cache hit.
[2024-05-31 21:21:38] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (OVERLAPS) 258/412 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 111/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-31 21:21:47] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/412 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 268 constraints, problems are : Problem set: 0 solved, 257 unsolved in 18227 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 154/154 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 1/154 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/412 variables, 154/157 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 111/268 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 257/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 257 unsolved
No progress, stopping.
After SMT solving in domain Int declared 412/412 variables, and 525 constraints, problems are : Problem set: 0 solved, 257 unsolved in 21769 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 154/154 constraints, ReadFeed: 111/111 constraints, PredecessorRefiner: 257/257 constraints, Known Traps: 1/1 constraints]
After SMT, in 40583ms problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 40600ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41172 ms. Remains : 154/154 places, 258/258 transitions.
RANDOM walk for 40000 steps (9155 resets) in 1646 ms. (24 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (393 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (384 resets) in 46 ms. (85 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (353 resets) in 63 ms. (62 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (394 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (392 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (395 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (378 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (341 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (394 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (366 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (395 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (348 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (380 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (397 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (384 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (423 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (377 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (366 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 464305 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :10 out of 18
Probabilistic random walk after 464305 steps, saw 187164 distinct states, run finished after 3004 ms. (steps per millisecond=154 ) properties seen :10
[2024-05-31 21:22:22] [INFO ] Invariant cache hit.
[2024-05-31 21:22:22] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 102/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 170/280 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
After SMT solving in domain Real declared 405/412 variables, and 152 constraints, problems are : Problem set: 8 solved, 0 unsolved in 201 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 150/154 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 210ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 2 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1944, 1944, 7, 5, 7, 5, 5, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1944]
[2024-05-31 21:22:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 10000 steps (2266 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10001 steps (975 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-31 21:22:23] [INFO ] Invariant cache hit.
[2024-05-31 21:22:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-31 21:22:23] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:22:23] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:22:23] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 14 ms.
[2024-05-31 21:22:23] [INFO ] Added : 9 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 53 place count 130 transition count 198
Iterating global reduction 3 with 5 rules applied. Total rules applied 58 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 128 transition count 196
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 65 place count 127 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 66 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 69 place count 127 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 125 transition count 177
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 125 transition count 177
Applied a total of 73 rules in 44 ms. Remains 125 /154 variables (removed 29) and now considering 177/258 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 125/154 places, 177/258 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-31 21:22:23] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 1000000 steps (229877 resets) in 2305 ms. (433 steps per ms)
BEST_FIRST walk for 1000001 steps (95516 resets) in 1044 ms. (956 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-31 21:22:27] [INFO ] Invariant cache hit.
[2024-05-31 21:22:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:22:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:22:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:22:27] [INFO ] [Real]Added 57 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:22:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:27] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:22:27] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:22:27] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 20 ms.
[2024-05-31 21:22:27] [INFO ] Added : 16 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-31 21:22:27] [INFO ] Invariant cache hit.
[2024-05-31 21:22:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 21:22:27] [INFO ] Invariant cache hit.
[2024-05-31 21:22:27] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:22:27] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-31 21:22:27] [INFO ] Redundant transitions in 4 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-31 21:22:27] [INFO ] Invariant cache hit.
[2024-05-31 21:22:27] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4578 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10818 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 15642ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 15645ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16024 ms. Remains : 125/125 places, 177/177 transitions.
RANDOM walk for 40000 steps (9237 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3924 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3814 resets) in 88 ms. (449 steps per ms) remains 2/2 properties
Probably explored full state space saw : 190433 states, properties seen :1
Probabilistic random walk after 461337 steps, saw 190433 distinct states, run finished after 925 ms. (steps per millisecond=498 ) properties seen :1
Explored full state space saw : 190906 states, properties seen :0
Exhaustive walk after 462250 steps, saw 190906 distinct states, run finished after 786 ms. (steps per millisecond=588 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1944]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-02 in 22392 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1944]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:22:45] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 10000 steps (2260 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10001 steps (893 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-31 21:22:45] [INFO ] Invariant cache hit.
[2024-05-31 21:22:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:22:45] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-31 21:22:45] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:22:45] [INFO ] [Real]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:22:45] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 21:22:45] [INFO ] [Nat]Added 111 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:22:45] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 21 ms.
[2024-05-31 21:22:45] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-31 21:22:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2024-05-31 21:22:46] [INFO ] Added : 13 causal constraints over 3 iterations in 212 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 139 transition count 235
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 139 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 139 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 135 transition count 225
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 135 transition count 225
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 48 place count 135 transition count 220
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 52 place count 131 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 56 place count 131 transition count 206
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 204
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 70 place count 125 transition count 178
Iterating global reduction 5 with 3 rules applied. Total rules applied 73 place count 125 transition count 178
Applied a total of 73 rules in 22 ms. Remains 125 /154 variables (removed 29) and now considering 178/258 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 125/154 places, 178/258 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-31 21:22:46] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1944]
RANDOM walk for 1000000 steps (229993 resets) in 2321 ms. (430 steps per ms)
BEST_FIRST walk for 1000001 steps (95585 resets) in 1025 ms. (974 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1944]
[2024-05-31 21:22:49] [INFO ] Invariant cache hit.
[2024-05-31 21:22:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:22:49] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:22:49] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:22:49] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:22:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:22:49] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:22:49] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:22:49] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 14 ms.
[2024-05-31 21:22:50] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-31 21:22:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:22:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-31 21:22:50] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:22:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 360 ms
[2024-05-31 21:22:50] [INFO ] Added : 22 causal constraints over 5 iterations in 465 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1944]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1944]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-31 21:22:50] [INFO ] Invariant cache hit.
[2024-05-31 21:22:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:22:50] [INFO ] Invariant cache hit.
[2024-05-31 21:22:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:22:50] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-05-31 21:22:50] [INFO ] Redundant transitions in 1 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-31 21:22:50] [INFO ] Invariant cache hit.
[2024-05-31 21:22:50] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4646 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9975 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14836ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15183 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9273 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3723 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3812 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Probably explored full state space saw : 193672 states, properties seen :1
Probabilistic random walk after 473596 steps, saw 193672 distinct states, run finished after 857 ms. (steps per millisecond=552 ) properties seen :1
Explored full state space saw : 194154 states, properties seen :0
Exhaustive walk after 474514 steps, saw 194154 distinct states, run finished after 723 ms. (steps per millisecond=656 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1944]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-04 in 21921 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:23:07] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2301 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (918 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:23:07] [INFO ] Invariant cache hit.
[2024-05-31 21:23:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:07] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-31 21:23:07] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:23:07] [INFO ] [Real]Added 111 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:07] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 21:23:07] [INFO ] [Nat]Added 111 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:23:07] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 18 ms.
[2024-05-31 21:23:07] [INFO ] Added : 11 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 51 place count 131 transition count 199
Iterating global reduction 3 with 5 rules applied. Total rules applied 56 place count 131 transition count 199
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 58 place count 129 transition count 197
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 129 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 129 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 128 transition count 194
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 128 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 128 transition count 191
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 69 place count 126 transition count 176
Iterating global reduction 5 with 2 rules applied. Total rules applied 71 place count 126 transition count 176
Applied a total of 71 rules in 22 ms. Remains 126 /154 variables (removed 28) and now considering 176/258 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 126/154 places, 176/258 transitions.
// Phase 1: matrix 176 rows 126 cols
[2024-05-31 21:23:08] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230030 resets) in 2246 ms. (445 steps per ms)
BEST_FIRST walk for 1000001 steps (95713 resets) in 999 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:23:11] [INFO ] Invariant cache hit.
[2024-05-31 21:23:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:11] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:23:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-31 21:23:11] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:23:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:11] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-31 21:23:11] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:23:11] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 125 transitions) in 13 ms.
[2024-05-31 21:23:11] [INFO ] Added : 16 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 126/126 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-05-31 21:23:11] [INFO ] Invariant cache hit.
[2024-05-31 21:23:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:23:11] [INFO ] Invariant cache hit.
[2024-05-31 21:23:11] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-31 21:23:12] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-31 21:23:12] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-31 21:23:12] [INFO ] Invariant cache hit.
[2024-05-31 21:23:12] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 175 unsolved in 4420 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 175/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10358 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 14980ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 14981ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15339 ms. Remains : 126/126 places, 176/176 transitions.
RANDOM walk for 40000 steps (9165 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3805 resets) in 72 ms. (547 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3818 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
Probably explored full state space saw : 189798 states, properties seen :1
Probabilistic random walk after 458920 steps, saw 189798 distinct states, run finished after 887 ms. (steps per millisecond=517 ) properties seen :1
Explored full state space saw : 190198 states, properties seen :0
Exhaustive walk after 459670 steps, saw 190198 distinct states, run finished after 712 ms. (steps per millisecond=645 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 21433 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:23:28] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2253 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (960 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 21:23:28] [INFO ] Invariant cache hit.
[2024-05-31 21:23:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:28] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 21:23:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:23:28] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:23:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:29] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-31 21:23:29] [INFO ] [Nat]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:23:29] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 19 ms.
[2024-05-31 21:23:29] [INFO ] Added : 10 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 192 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 249
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 245
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 238
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 236
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 137 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 133 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 133 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 132 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 132 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 131 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 131 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 60 place count 131 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 128 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 128 transition count 179
Applied a total of 66 rules in 24 ms. Remains 128 /154 variables (removed 26) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 128/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 128 cols
[2024-05-31 21:23:29] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229766 resets) in 2371 ms. (421 steps per ms)
BEST_FIRST walk for 1000001 steps (95493 resets) in 1043 ms. (957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 21:23:32] [INFO ] Invariant cache hit.
[2024-05-31 21:23:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:32] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:23:32] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-31 21:23:32] [INFO ] [Real]Added 54 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:23:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:33] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:23:33] [INFO ] [Nat]Added 54 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:23:33] [INFO ] Computed and/alt/rep : 51/127/51 causal constraints (skipped 127 transitions) in 13 ms.
[2024-05-31 21:23:33] [INFO ] Added : 6 causal constraints over 2 iterations in 44 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 128/128 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:23:33] [INFO ] Invariant cache hit.
[2024-05-31 21:23:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-31 21:23:33] [INFO ] Invariant cache hit.
[2024-05-31 21:23:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-31 21:23:33] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-31 21:23:33] [INFO ] Redundant transitions in 0 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:23:33] [INFO ] Invariant cache hit.
[2024-05-31 21:23:33] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/307 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 184 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4652 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/307 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 178/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 362 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10385 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15283ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15647 ms. Remains : 128/128 places, 179/179 transitions.
RANDOM walk for 40000 steps (9226 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3784 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3815 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Probably explored full state space saw : 242402 states, properties seen :1
Probabilistic random walk after 594682 steps, saw 242402 distinct states, run finished after 1038 ms. (steps per millisecond=572 ) properties seen :1
Explored full state space saw : 242724 states, properties seen :0
Exhaustive walk after 595398 steps, saw 242724 distinct states, run finished after 911 ms. (steps per millisecond=653 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-09 in 22182 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:23:50] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2301 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (867 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:23:51] [INFO ] Invariant cache hit.
[2024-05-31 21:23:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-31 21:23:51] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:23:51] [INFO ] [Real]Added 111 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Nat]Added 111 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:23:51] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 20 ms.
[2024-05-31 21:23:51] [INFO ] Added : 15 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 188 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 140 transition count 234
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 136 transition count 226
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 136 transition count 226
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 136 transition count 221
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 132 transition count 207
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 132 transition count 207
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 56 place count 130 transition count 205
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 130 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 129 transition count 202
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 65 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 68 place count 126 transition count 179
Iterating global reduction 5 with 3 rules applied. Total rules applied 71 place count 126 transition count 179
Applied a total of 71 rules in 17 ms. Remains 126 /154 variables (removed 28) and now considering 179/258 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/154 places, 179/258 transitions.
// Phase 1: matrix 179 rows 126 cols
[2024-05-31 21:23:51] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229688 resets) in 2264 ms. (441 steps per ms)
BEST_FIRST walk for 1000000 steps (95826 resets) in 1011 ms. (988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:23:55] [INFO ] Invariant cache hit.
[2024-05-31 21:23:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:23:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:23:55] [INFO ] [Real]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:23:55] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 13 ms.
[2024-05-31 21:23:55] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-31 21:23:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-05-31 21:23:55] [INFO ] Added : 16 causal constraints over 4 iterations in 171 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:23:55] [INFO ] Invariant cache hit.
[2024-05-31 21:23:55] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 21:23:55] [INFO ] Invariant cache hit.
[2024-05-31 21:23:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:23:55] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-31 21:23:55] [INFO ] Redundant transitions in 1 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:23:56] [INFO ] Invariant cache hit.
[2024-05-31 21:23:56] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/305 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 186 constraints, problems are : Problem set: 0 solved, 178 unsolved in 6310 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/305 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 178/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/305 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12989 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 19539ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 19542ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19923 ms. Remains : 126/126 places, 179/179 transitions.
RANDOM walk for 40000 steps (9171 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3890 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3810 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Probably explored full state space saw : 194472 states, properties seen :1
Probabilistic random walk after 474516 steps, saw 194472 distinct states, run finished after 849 ms. (steps per millisecond=558 ) properties seen :1
Explored full state space saw : 194970 states, properties seen :0
Exhaustive walk after 475450 steps, saw 194970 distinct states, run finished after 738 ms. (steps per millisecond=644 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-10 in 26211 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:24:17] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2277 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 steps (957 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 21:24:17] [INFO ] Invariant cache hit.
[2024-05-31 21:24:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:24:17] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-31 21:24:17] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:24:17] [INFO ] [Real]Added 111 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:24:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:24:17] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-31 21:24:17] [INFO ] [Nat]Added 111 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:24:17] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 23 ms.
[2024-05-31 21:24:17] [INFO ] Added : 15 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 204 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 141 transition count 236
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 141 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 141 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 138 transition count 230
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 138 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 138 transition count 225
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 134 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 133 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 133 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 133 transition count 201
Applied a total of 55 rules in 16 ms. Remains 133 /154 variables (removed 21) and now considering 201/258 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 133/154 places, 201/258 transitions.
// Phase 1: matrix 201 rows 133 cols
[2024-05-31 21:24:17] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (230027 resets) in 2454 ms. (407 steps per ms)
BEST_FIRST walk for 1000001 steps (95743 resets) in 1082 ms. (923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 21:24:21] [INFO ] Invariant cache hit.
[2024-05-31 21:24:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:24:21] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-31 21:24:21] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:24:21] [INFO ] [Real]Added 74 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:24:21] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:24:21] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:24:21] [INFO ] Computed and/alt/rep : 52/123/52 causal constraints (skipped 148 transitions) in 14 ms.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-31 21:24:21] [INFO ] Added : 12 causal constraints over 4 iterations in 170 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 133/133 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 201/201 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-05-31 21:24:22] [INFO ] Invariant cache hit.
[2024-05-31 21:24:22] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-31 21:24:22] [INFO ] Invariant cache hit.
[2024-05-31 21:24:22] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:24:22] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2024-05-31 21:24:22] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-31 21:24:22] [INFO ] Invariant cache hit.
[2024-05-31 21:24:22] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/334 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 209 constraints, problems are : Problem set: 0 solved, 200 unsolved in 5411 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/334 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 200/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (OVERLAPS) 0/334 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 409 constraints, problems are : Problem set: 0 solved, 200 unsolved in 13876 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints]
After SMT, in 19567ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 19569ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20074 ms. Remains : 133/133 places, 201/201 transitions.
RANDOM walk for 40000 steps (9246 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3657 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3840 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Probably explored full state space saw : 222751 states, properties seen :1
Probabilistic random walk after 556807 steps, saw 222751 distinct states, run finished after 1124 ms. (steps per millisecond=495 ) properties seen :1
Explored full state space saw : 224184 states, properties seen :0
Exhaustive walk after 559488 steps, saw 224184 distinct states, run finished after 906 ms. (steps per millisecond=617 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-13 in 27066 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:24:44] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2247 resets) in 34 ms. (285 steps per ms)
BEST_FIRST walk for 10000 steps (949 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 21:24:44] [INFO ] Invariant cache hit.
[2024-05-31 21:24:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-31 21:24:44] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:24:44] [INFO ] [Real]Added 111 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Nat]Added 111 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:24:44] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 20 ms.
[2024-05-31 21:24:44] [INFO ] Added : 11 causal constraints over 3 iterations in 93 ms. Result :sat
Minimization took 205 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 146 transition count 242
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 140 transition count 235
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 140 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 34 place count 140 transition count 233
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 137 transition count 226
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 137 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 137 transition count 224
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 135 transition count 222
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 135 transition count 222
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 133 transition count 220
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 133 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 133 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 132 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 132 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 57 place count 132 transition count 214
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 60 place count 129 transition count 194
Iterating global reduction 5 with 3 rules applied. Total rules applied 63 place count 129 transition count 194
Applied a total of 63 rules in 24 ms. Remains 129 /154 variables (removed 25) and now considering 194/258 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 129/154 places, 194/258 transitions.
// Phase 1: matrix 194 rows 129 cols
[2024-05-31 21:24:45] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229878 resets) in 2443 ms. (409 steps per ms)
BEST_FIRST walk for 1000001 steps (95321 resets) in 1090 ms. (916 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2024-05-31 21:24:48] [INFO ] Invariant cache hit.
[2024-05-31 21:24:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:24:48] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:24:48] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 21:24:48] [INFO ] [Real]Added 73 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:24:48] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:24:48] [INFO ] [Nat]Added 73 Read/Feed constraints in 16 ms returned sat
[2024-05-31 21:24:48] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 143 transitions) in 14 ms.
[2024-05-31 21:24:48] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 1 ms to minimize.
[2024-05-31 21:24:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-31 21:24:48] [INFO ] Added : 10 causal constraints over 2 iterations in 172 ms. Result :sat
Minimization took 98 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 129/129 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-31 21:24:49] [INFO ] Invariant cache hit.
[2024-05-31 21:24:49] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-31 21:24:49] [INFO ] Invariant cache hit.
[2024-05-31 21:24:49] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 21:24:49] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-05-31 21:24:49] [INFO ] Redundant transitions in 1 ms returned []
Running 193 sub problems to find dead transitions.
[2024-05-31 21:24:49] [INFO ] Invariant cache hit.
[2024-05-31 21:24:49] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 204 constraints, problems are : Problem set: 0 solved, 193 unsolved in 5293 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 194/323 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 193/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 397 constraints, problems are : Problem set: 0 solved, 193 unsolved in 13264 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 129/129 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints]
After SMT, in 18825ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 18829ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19316 ms. Remains : 129/129 places, 194/194 transitions.
RANDOM walk for 40000 steps (9200 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3809 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3847 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
Probably explored full state space saw : 205416 states, properties seen :1
Probabilistic random walk after 510014 steps, saw 205416 distinct states, run finished after 934 ms. (steps per millisecond=546 ) properties seen :1
Explored full state space saw : 207012 states, properties seen :0
Exhaustive walk after 512925 steps, saw 207012 distinct states, run finished after 804 ms. (steps per millisecond=637 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14 in 25945 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 258 rows 154 cols
[2024-05-31 21:25:10] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2305 resets) in 30 ms. (322 steps per ms)
BEST_FIRST walk for 10001 steps (939 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:25:10] [INFO ] Invariant cache hit.
[2024-05-31 21:25:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:10] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-31 21:25:10] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-31 21:25:10] [INFO ] [Real]Added 111 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:25:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:10] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-31 21:25:10] [INFO ] [Nat]Added 111 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:25:10] [INFO ] Computed and/alt/rep : 58/161/58 causal constraints (skipped 199 transitions) in 21 ms.
[2024-05-31 21:25:10] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-31 21:25:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2024-05-31 21:25:10] [INFO ] Added : 13 causal constraints over 3 iterations in 233 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 258/258 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 146 transition count 246
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 146 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 146 transition count 243
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 140 transition count 237
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 140 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 140 transition count 235
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 36 place count 137 transition count 228
Iterating global reduction 2 with 3 rules applied. Total rules applied 39 place count 137 transition count 228
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 137 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 48 place count 132 transition count 202
Iterating global reduction 3 with 5 rules applied. Total rules applied 53 place count 132 transition count 202
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 130 transition count 200
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 130 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 130 transition count 198
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 129 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 129 transition count 197
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 64 place count 129 transition count 194
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 67 place count 126 transition count 174
Iterating global reduction 5 with 3 rules applied. Total rules applied 70 place count 126 transition count 174
Applied a total of 70 rules in 26 ms. Remains 126 /154 variables (removed 28) and now considering 174/258 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 126/154 places, 174/258 transitions.
// Phase 1: matrix 174 rows 126 cols
[2024-05-31 21:25:11] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230295 resets) in 2305 ms. (433 steps per ms)
BEST_FIRST walk for 1000000 steps (95437 resets) in 1012 ms. (987 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:25:14] [INFO ] Invariant cache hit.
[2024-05-31 21:25:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:25:14] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:25:14] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 21:25:14] [INFO ] [Real]Added 51 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:25:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:25:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:25:14] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:25:14] [INFO ] [Nat]Added 51 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:25:14] [INFO ] Computed and/alt/rep : 50/124/50 causal constraints (skipped 123 transitions) in 11 ms.
[2024-05-31 21:25:14] [INFO ] Added : 10 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2024-05-31 21:25:14] [INFO ] Invariant cache hit.
[2024-05-31 21:25:15] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-31 21:25:15] [INFO ] Invariant cache hit.
[2024-05-31 21:25:15] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-31 21:25:15] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2024-05-31 21:25:15] [INFO ] Redundant transitions in 0 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-31 21:25:15] [INFO ] Invariant cache hit.
[2024-05-31 21:25:15] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 173 unsolved in 4626 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 173/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 352 constraints, problems are : Problem set: 0 solved, 173 unsolved in 12493 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 17345ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 17347ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17754 ms. Remains : 126/126 places, 174/174 transitions.
RANDOM walk for 40000 steps (9243 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3737 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3875 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
Probably explored full state space saw : 195530 states, properties seen :1
Probabilistic random walk after 472686 steps, saw 195530 distinct states, run finished after 800 ms. (steps per millisecond=590 ) properties seen :1
Explored full state space saw : 195814 states, properties seen :0
Exhaustive walk after 473234 steps, saw 195814 distinct states, run finished after 701 ms. (steps per millisecond=675 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15 in 24015 ms.
[2024-05-31 21:25:34] [INFO ] Flatten gal took : 51 ms
[2024-05-31 21:25:34] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:25:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 258 transitions and 1018 arcs took 5 ms.
Total runtime 315334 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-02
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-04
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-05
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-09
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-10
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-13
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-14
Could not compute solution for formula : DBSingleClientW-PT-d2m05-UpperBounds-15

BK_STOP 1717190734823

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-02
ub formula formula --maxsum=/tmp/1000/ub_0_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-04
ub formula formula --maxsum=/tmp/1000/ub_1_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-05
ub formula formula --maxsum=/tmp/1000/ub_2_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-09
ub formula formula --maxsum=/tmp/1000/ub_3_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-10
ub formula formula --maxsum=/tmp/1000/ub_4_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-13
ub formula formula --maxsum=/tmp/1000/ub_5_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-14
ub formula formula --maxsum=/tmp/1000/ub_6_
ub formula name DBSingleClientW-PT-d2m05-UpperBounds-15
ub formula formula --maxsum=/tmp/1000/ub_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-d2m05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d2m05, 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 r480-tall-171624189500557"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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