Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.2K Feb 26 15:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 15:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 15:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678282592009

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-d2m10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 13:36:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 13:36:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 13:36:33] [INFO ] Load time of PNML (sax parser for PT used): 229 ms
[2023-03-08 13:36:33] [INFO ] Transformed 4763 places.
[2023-03-08 13:36:33] [INFO ] Transformed 2478 transitions.
[2023-03-08 13:36:33] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 13:36:34] [INFO ] Computed 6 place invariants in 152 ms
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :6
Incomplete Best-First random walk after 10001 steps, including 924 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 1030 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :1
[2023-03-08 13:36:34] [INFO ] Invariant cache hit.
[2023-03-08 13:36:35] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-08 13:36:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 13:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:35] [INFO ] [Real]Absence check using state equation in 675 ms returned sat
[2023-03-08 13:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:36:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2023-03-08 13:36:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 13:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:36] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2023-03-08 13:36:36] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 13:36:37] [INFO ] [Nat]Added 1588 Read/Feed constraints in 807 ms returned sat
[2023-03-08 13:36:38] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 694 ms.
[2023-03-08 13:36:39] [INFO ] Deduced a trap composed of 31 places in 636 ms of which 5 ms to minimize.
[2023-03-08 13:36:40] [INFO ] Deduced a trap composed of 72 places in 690 ms of which 6 ms to minimize.
[2023-03-08 13:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1818 ms
[2023-03-08 13:36:41] [INFO ] Deduced a trap composed of 49 places in 693 ms of which 2 ms to minimize.
[2023-03-08 13:36:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 13:36:41] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 13:36:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 13:36:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:42] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2023-03-08 13:36:43] [INFO ] [Real]Added 1588 Read/Feed constraints in 965 ms returned sat
[2023-03-08 13:36:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:36:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 13:36:43] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 13:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:44] [INFO ] [Nat]Absence check using state equation in 592 ms returned sat
[2023-03-08 13:36:44] [INFO ] [Nat]Added 1588 Read/Feed constraints in 640 ms returned sat
[2023-03-08 13:36:45] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 626 ms.
[2023-03-08 13:36:45] [INFO ] Added : 1 causal constraints over 1 iterations in 889 ms. Result :sat
Minimization took 587 ms.
[2023-03-08 13:36:46] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 13:36:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-08 13:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:47] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2023-03-08 13:36:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:36:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 13:36:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2023-03-08 13:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:48] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-08 13:36:49] [INFO ] [Nat]Added 1588 Read/Feed constraints in 966 ms returned sat
[2023-03-08 13:36:49] [INFO ] Deduced a trap composed of 235 places in 634 ms of which 3 ms to minimize.
[2023-03-08 13:36:50] [INFO ] Deduced a trap composed of 235 places in 645 ms of which 2 ms to minimize.
[2023-03-08 13:36:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1554 ms
[2023-03-08 13:36:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 448 ms.
[2023-03-08 13:36:53] [INFO ] Deduced a trap composed of 49 places in 698 ms of which 1 ms to minimize.
[2023-03-08 13:36:53] [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 2
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 13:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 13:36:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned unsat
[2023-03-08 13:36:53] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 13:36:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 13:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:53] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-08 13:36:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:36:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 13:36:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 13:36:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:54] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-08 13:36:55] [INFO ] [Nat]Added 1588 Read/Feed constraints in 932 ms returned sat
[2023-03-08 13:36:56] [INFO ] Deduced a trap composed of 217 places in 612 ms of which 1 ms to minimize.
[2023-03-08 13:36:57] [INFO ] Deduced a trap composed of 189 places in 612 ms of which 1 ms to minimize.
[2023-03-08 13:36:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1446 ms
[2023-03-08 13:36:57] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 451 ms.
[2023-03-08 13:36:58] [INFO ] Added : 10 causal constraints over 3 iterations in 1012 ms. Result :sat
Minimization took 735 ms.
[2023-03-08 13:36:59] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 13:36:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2023-03-08 13:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:36:59] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2023-03-08 13:36:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 13:37:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-08 13:37:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:00] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2023-03-08 13:37:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 851 ms returned sat
[2023-03-08 13:37:02] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 417 ms.
[2023-03-08 13:37:02] [INFO ] Added : 4 causal constraints over 1 iterations in 707 ms. Result :sat
Minimization took 470 ms.
Current structural bounds on expressions (after SMT) : [7, 10, 10, 1, 3255, 7] Max seen :[0, 5, 0, 1, 0, 0]
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 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 removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1321 place count 432 transition count 878
Iterating global reduction 2 with 314 rules applied. Total rules applied 1635 place count 432 transition count 878
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1647 place count 432 transition count 866
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1886 place count 193 transition count 526
Iterating global reduction 3 with 239 rules applied. Total rules applied 2125 place count 193 transition count 526
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2335 place count 193 transition count 316
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2359 place count 169 transition count 278
Iterating global reduction 4 with 24 rules applied. Total rules applied 2383 place count 169 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2389 place count 169 transition count 272
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2405 place count 153 transition count 256
Iterating global reduction 5 with 16 rules applied. Total rules applied 2421 place count 153 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2425 place count 153 transition count 252
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2438 place count 140 transition count 239
Iterating global reduction 6 with 13 rules applied. Total rules applied 2451 place count 140 transition count 239
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2461 place count 140 transition count 229
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2465 place count 136 transition count 212
Iterating global reduction 7 with 4 rules applied. Total rules applied 2469 place count 136 transition count 212
Applied a total of 2469 rules in 257 ms. Remains 136 /1183 variables (removed 1047) and now considering 212/2478 (removed 2266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 136/1183 places, 212/2478 transitions.
// Phase 1: matrix 212 rows 136 cols
[2023-03-08 13:37:03] [INFO ] Computed 2 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 229859 resets, run finished after 1430 ms. (steps per millisecond=699 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95378 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96482 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95641 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95874 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95855 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 5) seen :2
[2023-03-08 13:37:08] [INFO ] Invariant cache hit.
[2023-03-08 13:37:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:08] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 13:37:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:08] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 13:37:08] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-08 13:37:08] [INFO ] [Nat]Added 85 Read/Feed constraints in 24 ms returned sat
[2023-03-08 13:37:08] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 19 ms.
[2023-03-08 13:37:08] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2023-03-08 13:37:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 13:37:08] [INFO ] Added : 17 causal constraints over 4 iterations in 194 ms. Result :sat
Minimization took 40 ms.
[2023-03-08 13:37:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Real]Added 85 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:37:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:08] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Nat]Added 85 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:37:08] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 14 ms.
[2023-03-08 13:37:08] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 25 ms.
[2023-03-08 13:37:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:08] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 13:37:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:09] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:09] [INFO ] [Nat]Added 85 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:37:09] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 16 ms.
[2023-03-08 13:37:09] [INFO ] Added : 14 causal constraints over 3 iterations in 85 ms. Result :sat
Minimization took 46 ms.
[2023-03-08 13:37:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:09] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 13:37:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:09] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-08 13:37:09] [INFO ] [Nat]Added 85 Read/Feed constraints in 19 ms returned sat
[2023-03-08 13:37:09] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 17 ms.
[2023-03-08 13:37:09] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-08 13:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 13:37:09] [INFO ] Added : 10 causal constraints over 3 iterations in 155 ms. Result :sat
Minimization took 37 ms.
[2023-03-08 13:37:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:09] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 10, 10, 3255, 1] Max seen :[0, 5, 0, 0, 1]
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 212/212 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 134 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 134 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 134 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 133 transition count 207
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 133 transition count 207
Applied a total of 7 rules in 28 ms. Remains 133 /136 variables (removed 3) and now considering 207/212 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 133/136 places, 207/212 transitions.
// Phase 1: matrix 207 rows 133 cols
[2023-03-08 13:37:09] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229902 resets, run finished after 1363 ms. (steps per millisecond=733 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95656 resets, run finished after 615 ms. (steps per millisecond=1626 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96569 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95769 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95398 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 4) seen :2
[2023-03-08 13:37:13] [INFO ] Invariant cache hit.
[2023-03-08 13:37:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:13] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 13:37:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:13] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 13:37:13] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 13:37:13] [INFO ] [Nat]Added 82 Read/Feed constraints in 29 ms returned sat
[2023-03-08 13:37:13] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 13 ms.
[2023-03-08 13:37:13] [INFO ] Added : 13 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 41 ms.
[2023-03-08 13:37:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:14] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Real]Added 82 Read/Feed constraints in 10 ms returned sat
[2023-03-08 13:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Nat]Added 82 Read/Feed constraints in 9 ms returned sat
[2023-03-08 13:37:14] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 12 ms.
[2023-03-08 13:37:14] [INFO ] Added : 1 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 23 ms.
[2023-03-08 13:37:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Nat]Added 82 Read/Feed constraints in 20 ms returned sat
[2023-03-08 13:37:14] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 16 ms.
[2023-03-08 13:37:14] [INFO ] Added : 11 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 38 ms.
[2023-03-08 13:37:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:14] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 13:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:14] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 13:37:14] [INFO ] [Nat]Added 82 Read/Feed constraints in 15 ms returned sat
[2023-03-08 13:37:14] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 15 ms.
[2023-03-08 13:37:14] [INFO ] Added : 13 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [7, 10, 10, 3255] Max seen :[0, 5, 0, 0]
Support contains 4 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 207/207 transitions.
Applied a total of 0 rules in 15 ms. Remains 133 /133 variables (removed 0) and now considering 207/207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 133/133 places, 207/207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 207/207 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-08 13:37:14] [INFO ] Invariant cache hit.
[2023-03-08 13:37:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 13:37:15] [INFO ] Invariant cache hit.
[2023-03-08 13:37:15] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 13:37:15] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-08 13:37:15] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-08 13:37:15] [INFO ] Invariant cache hit.
[2023-03-08 13:37:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 550 ms. Remains : 133/133 places, 207/207 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-02
[2023-03-08 13:37:15] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1014 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 13:37:15] [INFO ] Invariant cache hit.
[2023-03-08 13:37:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:15] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 13:37:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:15] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 13:37:15] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 13:37:15] [INFO ] [Nat]Added 82 Read/Feed constraints in 20 ms returned sat
[2023-03-08 13:37:15] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 13 ms.
[2023-03-08 13:37:15] [INFO ] Added : 13 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 207/207 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 129 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 129 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 128 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 128 transition count 193
Applied a total of 12 rules in 18 ms. Remains 128 /133 variables (removed 5) and now considering 193/207 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 128/133 places, 193/207 transitions.
// Phase 1: matrix 193 rows 128 cols
[2023-03-08 13:37:15] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 230168 resets, run finished after 1245 ms. (steps per millisecond=803 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95490 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 1) seen :0
[2023-03-08 13:37:17] [INFO ] Invariant cache hit.
[2023-03-08 13:37:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:17] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 13:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:17] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 13:37:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 13:37:17] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2023-03-08 13:37:17] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 14 ms.
[2023-03-08 13:37:17] [INFO ] Added : 15 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 128/128 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2023-03-08 13:37:18] [INFO ] Invariant cache hit.
[2023-03-08 13:37:18] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 13:37:18] [INFO ] Invariant cache hit.
[2023-03-08 13:37:18] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-08 13:37:18] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-08 13:37:18] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 13:37:18] [INFO ] Invariant cache hit.
[2023-03-08 13:37:18] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 433 ms. Remains : 128/128 places, 193/193 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-02 in 2981 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03
// Phase 1: matrix 207 rows 133 cols
[2023-03-08 13:37:18] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 1006 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-08 13:37:18] [INFO ] Invariant cache hit.
[2023-03-08 13:37:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:18] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-08 13:37:18] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 13:37:18] [INFO ] [Real]Added 82 Read/Feed constraints in 10 ms returned sat
[2023-03-08 13:37:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:18] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 13:37:18] [INFO ] [Nat]Added 82 Read/Feed constraints in 9 ms returned sat
[2023-03-08 13:37:18] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 13 ms.
[2023-03-08 13:37:18] [INFO ] Added : 1 causal constraints over 1 iterations in 34 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 207/207 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 130 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 130 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 130 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 128 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 128 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 128 transition count 198
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 124 transition count 176
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 124 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 124 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 123 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 123 transition count 168
Applied a total of 25 rules in 15 ms. Remains 123 /133 variables (removed 10) and now considering 168/207 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 123/133 places, 168/207 transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-08 13:37:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229927 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 95901 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 1) seen :4
[2023-03-08 13:37:20] [INFO ] Invariant cache hit.
[2023-03-08 13:37:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:20] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-08 13:37:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 13:37:20] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2023-03-08 13:37:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:20] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 13:37:20] [INFO ] [Nat]Added 49 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:37:20] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 12 ms.
[2023-03-08 13:37:20] [INFO ] Added : 1 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-08 13:37:20] [INFO ] Invariant cache hit.
[2023-03-08 13:37:20] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 13:37:20] [INFO ] Invariant cache hit.
[2023-03-08 13:37:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 13:37:20] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 13:37:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:37:20] [INFO ] Invariant cache hit.
[2023-03-08 13:37:20] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 123/123 places, 168/168 transitions.
[2023-03-08 13:37:20] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229937 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 96406 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :4
[2023-03-08 13:37:22] [INFO ] Invariant cache hit.
[2023-03-08 13:37:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:22] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-08 13:37:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 13:37:22] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2023-03-08 13:37:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:22] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2023-03-08 13:37:22] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2023-03-08 13:37:22] [INFO ] Added : 1 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-08 13:37:22] [INFO ] Invariant cache hit.
[2023-03-08 13:37:22] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 13:37:22] [INFO ] Invariant cache hit.
[2023-03-08 13:37:22] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 13:37:23] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-08 13:37:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:37:23] [INFO ] Invariant cache hit.
[2023-03-08 13:37:23] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03 in 4777 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-06
// Phase 1: matrix 207 rows 133 cols
[2023-03-08 13:37:23] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 953 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 13:37:23] [INFO ] Invariant cache hit.
[2023-03-08 13:37:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:23] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 13:37:23] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 13:37:23] [INFO ] [Nat]Added 82 Read/Feed constraints in 20 ms returned sat
[2023-03-08 13:37:23] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 13 ms.
[2023-03-08 13:37:23] [INFO ] Added : 11 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 207/207 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 127 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 127 transition count 180
Applied a total of 16 rules in 12 ms. Remains 127 /133 variables (removed 6) and now considering 180/207 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/133 places, 180/207 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 13:37:23] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229835 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 94934 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 1) seen :0
[2023-03-08 13:37:25] [INFO ] Invariant cache hit.
[2023-03-08 13:37:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 13:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:25] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:25] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 13:37:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 13:37:25] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2023-03-08 13:37:25] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 13 ms.
[2023-03-08 13:37:25] [INFO ] Added : 17 causal constraints over 5 iterations in 92 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 13:37:25] [INFO ] Invariant cache hit.
[2023-03-08 13:37:25] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 13:37:25] [INFO ] Invariant cache hit.
[2023-03-08 13:37:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 13:37:25] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 13:37:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:37:25] [INFO ] Invariant cache hit.
[2023-03-08 13:37:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-06 in 2854 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-12
// Phase 1: matrix 207 rows 133 cols
[2023-03-08 13:37:26] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 979 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 13:37:26] [INFO ] Invariant cache hit.
[2023-03-08 13:37:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 13:37:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 13:37:26] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 13:37:26] [INFO ] [Nat]Added 82 Read/Feed constraints in 15 ms returned sat
[2023-03-08 13:37:26] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 15 ms.
[2023-03-08 13:37:26] [INFO ] Added : 13 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 207/207 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 205
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 205
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 129 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 129 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 129 transition count 200
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 126 transition count 185
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 126 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 125 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 125 transition count 177
Applied a total of 20 rules in 13 ms. Remains 125 /133 variables (removed 8) and now considering 177/207 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 125/133 places, 177/207 transitions.
// Phase 1: matrix 177 rows 125 cols
[2023-03-08 13:37:26] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 230150 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95927 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 1) seen :0
[2023-03-08 13:37:28] [INFO ] Invariant cache hit.
[2023-03-08 13:37:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:28] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 13:37:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 13:37:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 13:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 13:37:28] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 13:37:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:37:28] [INFO ] [Nat]Added 57 Read/Feed constraints in 13 ms returned sat
[2023-03-08 13:37:28] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 13 ms.
[2023-03-08 13:37:28] [INFO ] Added : 13 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
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 3 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 4 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 3 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2023-03-08 13:37:28] [INFO ] Invariant cache hit.
[2023-03-08 13:37:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 13:37:28] [INFO ] Invariant cache hit.
[2023-03-08 13:37:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 13:37:28] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-08 13:37:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:37:28] [INFO ] Invariant cache hit.
[2023-03-08 13:37:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 125/125 places, 177/177 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-12 in 2644 ms.
[2023-03-08 13:37:28] [INFO ] Flatten gal took : 45 ms
[2023-03-08 13:37:28] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 13:37:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 133 places, 207 transitions and 816 arcs took 2 ms.
Total runtime 55391 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/735/ub_0_ --maxsum=/tmp/735/ub_1_ --maxsum=/tmp/735/ub_2_ --maxsum=/tmp/735/ub_3_
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-03 8 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678282862055

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DBSingleClientW-PT-d2m10-UpperBounds-02
ub formula formula --maxsum=/tmp/735/ub_0_
ub formula name DBSingleClientW-PT-d2m10-UpperBounds-03
ub formula formula --maxsum=/tmp/735/ub_1_
ub formula name DBSingleClientW-PT-d2m10-UpperBounds-06
ub formula formula --maxsum=/tmp/735/ub_2_
ub formula name DBSingleClientW-PT-d2m10-UpperBounds-12
ub formula formula --maxsum=/tmp/735/ub_3_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 133 places, 207 transitions and 816 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m10 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 207->195 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 133; there are 195 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 21229573 group checks and 0 next state calls
pnml2lts-sym: reachability took 211.480 real 844.160 user 0.820 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.030 real 0.130 user 0.000 sys
pnml2lts-sym: state space has 1063541695 states, 173817 nodes
pnml2lts-sym: Maximum sum of /tmp/735/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/735/ub_1_ is: 8
pnml2lts-sym: Maximum sum of /tmp/735/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/735/ub_3_ is: 1
pnml2lts-sym: group_next: 3759 nodes total
pnml2lts-sym: group_explored: 4816 nodes, 6045 short vectors total
pnml2lts-sym: max token count: 10

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-5348"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d2m10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481100341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m10.tgz
mv DBSingleClientW-PT-d2m10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;