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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:23 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.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:25 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-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678274551988

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-d2m06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 11:22:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 11:22:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:22:33] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-08 11:22:33] [INFO ] Transformed 4763 places.
[2023-03-08 11:22:33] [INFO ] Transformed 2478 transitions.
[2023-03-08 11:22:33] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 261 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 11:22:33] [INFO ] Computed 6 place invariants in 152 ms
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 890 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 915 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 966 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
[2023-03-08 11:22:34] [INFO ] Invariant cache hit.
[2023-03-08 11:22:34] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2023-03-08 11:22:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 11:22:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:35] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2023-03-08 11:22:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:22:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-08 11:22:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2023-03-08 11:22:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:36] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2023-03-08 11:22:36] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 11:22:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1669 ms returned sat
[2023-03-08 11:22:39] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 658 ms.
[2023-03-08 11:22:39] [INFO ] Added : 12 causal constraints over 3 iterations in 1327 ms. Result :sat
Minimization took 655 ms.
[2023-03-08 11:22:40] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:22:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 11:22:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:41] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2023-03-08 11:22:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:22:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:22:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 11:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:42] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2023-03-08 11:22:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 708 ms returned sat
[2023-03-08 11:22:43] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 397 ms.
[2023-03-08 11:22:43] [INFO ] Added : 6 causal constraints over 2 iterations in 777 ms. Result :sat
Minimization took 1804 ms.
[2023-03-08 11:22:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:22:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 11:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:46] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2023-03-08 11:22:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:22:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 11:22:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 11:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:47] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2023-03-08 11:22:49] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1567 ms returned sat
[2023-03-08 11:22:49] [INFO ] Deduced a trap composed of 121 places in 646 ms of which 5 ms to minimize.
[2023-03-08 11:22:50] [INFO ] Deduced a trap composed of 128 places in 611 ms of which 2 ms to minimize.
[2023-03-08 11:22:51] [INFO ] Deduced a trap composed of 119 places in 606 ms of which 2 ms to minimize.
[2023-03-08 11:22:51] [INFO ] Deduced a trap composed of 129 places in 592 ms of which 3 ms to minimize.
[2023-03-08 11:22:51] [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.verifyPossible(DeadlockTester.java:916)
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 11:22:51] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:22:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 11:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:52] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-08 11:22:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:22:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 11:22:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 11:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:53] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-08 11:22:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1501 ms returned sat
[2023-03-08 11:22:55] [INFO ] Deduced a trap composed of 32 places in 671 ms of which 2 ms to minimize.
[2023-03-08 11:22:56] [INFO ] Deduced a trap composed of 48 places in 649 ms of which 2 ms to minimize.
[2023-03-08 11:22:57] [INFO ] Deduced a trap composed of 422 places in 575 ms of which 2 ms to minimize.
[2023-03-08 11:22:57] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2692 ms
[2023-03-08 11:22:57] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:22:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 11:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:58] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2023-03-08 11:22:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:22:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:22:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2023-03-08 11:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:22:59] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2023-03-08 11:23:00] [INFO ] [Nat]Added 1588 Read/Feed constraints in 866 ms returned sat
[2023-03-08 11:23:00] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 402 ms.
[2023-03-08 11:23:02] [INFO ] Deduced a trap composed of 32 places in 661 ms of which 3 ms to minimize.
[2023-03-08 11:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 909 ms
[2023-03-08 11:23:02] [INFO ] Added : 15 causal constraints over 4 iterations in 2495 ms. Result :sat
Minimization took 827 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 2343] Max seen :[0, 0, 0, 0, 0]
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 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.8 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 1137 transition count 2264
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 603 place count 749 transition count 1205
Iterating global reduction 1 with 388 rules applied. Total rules applied 991 place count 749 transition count 1205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1000 place count 749 transition count 1196
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1312 place count 437 transition count 884
Iterating global reduction 2 with 312 rules applied. Total rules applied 1624 place count 437 transition count 884
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1636 place count 437 transition count 872
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1874 place count 199 transition count 540
Iterating global reduction 3 with 238 rules applied. Total rules applied 2112 place count 199 transition count 540
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2323 place count 199 transition count 329
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2346 place count 176 transition count 291
Iterating global reduction 4 with 23 rules applied. Total rules applied 2369 place count 176 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2375 place count 176 transition count 285
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2390 place count 161 transition count 270
Iterating global reduction 5 with 15 rules applied. Total rules applied 2405 place count 161 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2408 place count 161 transition count 267
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2421 place count 148 transition count 254
Iterating global reduction 6 with 13 rules applied. Total rules applied 2434 place count 148 transition count 254
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2444 place count 148 transition count 244
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2448 place count 144 transition count 228
Iterating global reduction 7 with 4 rules applied. Total rules applied 2452 place count 144 transition count 228
Applied a total of 2452 rules in 241 ms. Remains 144 /1183 variables (removed 1039) and now considering 228/2478 (removed 2250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 144/1183 places, 228/2478 transitions.
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 11:23:03] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229659 resets, run finished after 1412 ms. (steps per millisecond=708 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95667 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95071 resets, run finished after 607 ms. (steps per millisecond=1647 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95502 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95702 resets, run finished after 656 ms. (steps per millisecond=1524 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95352 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties (out of 5) seen :0
[2023-03-08 11:23:08] [INFO ] Invariant cache hit.
[2023-03-08 11:23:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 11:23:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:08] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-08 11:23:08] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:08] [INFO ] [Nat]Added 89 Read/Feed constraints in 38 ms returned sat
[2023-03-08 11:23:08] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-08 11:23:08] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2023-03-08 11:23:08] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-08 11:23:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-08 11:23:09] [INFO ] Added : 21 causal constraints over 5 iterations in 338 ms. Result :sat
Minimization took 58 ms.
[2023-03-08 11:23:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:09] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-08 11:23:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:09] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-08 11:23:09] [INFO ] [Nat]Added 89 Read/Feed constraints in 14 ms returned sat
[2023-03-08 11:23:09] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 11:23:09] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2023-03-08 11:23:09] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-08 11:23:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-08 11:23:09] [INFO ] Added : 11 causal constraints over 3 iterations in 293 ms. Result :sat
Minimization took 63 ms.
[2023-03-08 11:23:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:09] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 11:23:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:09] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-08 11:23:09] [INFO ] [Nat]Added 89 Read/Feed constraints in 32 ms returned sat
[2023-03-08 11:23:09] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 11:23:10] [INFO ] Added : 14 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 42 ms.
[2023-03-08 11:23:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:10] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 11:23:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:10] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 11:23:10] [INFO ] [Nat]Added 89 Read/Feed constraints in 19 ms returned sat
[2023-03-08 11:23:10] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 11:23:10] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2023-03-08 11:23:10] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2023-03-08 11:23:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-08 11:23:10] [INFO ] Added : 21 causal constraints over 6 iterations in 291 ms. Result :sat
Minimization took 51 ms.
[2023-03-08 11:23:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 11:23:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:10] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 11:23:10] [INFO ] [Nat]Added 89 Read/Feed constraints in 17 ms returned sat
[2023-03-08 11:23:10] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-08 11:23:11] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2023-03-08 11:23:11] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2023-03-08 11:23:11] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-08 11:23:11] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-08 11:23:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2023-03-08 11:23:11] [INFO ] Added : 26 causal constraints over 6 iterations in 533 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 2343] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Applied a total of 0 rules in 15 ms. Remains 144 /144 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 144/144 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Applied a total of 0 rules in 7 ms. Remains 144 /144 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2023-03-08 11:23:11] [INFO ] Invariant cache hit.
[2023-03-08 11:23:11] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-08 11:23:11] [INFO ] Invariant cache hit.
[2023-03-08 11:23:11] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:12] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-08 11:23:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 11:23:12] [INFO ] Invariant cache hit.
[2023-03-08 11:23:12] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 144/144 places, 228/228 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00
[2023-03-08 11:23:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2309 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 965 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 11:23:12] [INFO ] Invariant cache hit.
[2023-03-08 11:23:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:12] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 11:23:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:12] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-08 11:23:12] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:12] [INFO ] [Nat]Added 89 Read/Feed constraints in 39 ms returned sat
[2023-03-08 11:23:12] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 11:23:12] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 0 ms to minimize.
[2023-03-08 11:23:12] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2023-03-08 11:23:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-03-08 11:23:13] [INFO ] Added : 21 causal constraints over 5 iterations in 346 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 134 transition count 209
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 134 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 134 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 132 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 132 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 130 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 130 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 129 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 129 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 36 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 39 place count 126 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 42 place count 126 transition count 179
Applied a total of 42 rules in 39 ms. Remains 126 /144 variables (removed 18) and now considering 179/228 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 126/144 places, 179/228 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-08 11:23:13] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229868 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95638 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :0
[2023-03-08 11:23:14] [INFO ] Invariant cache hit.
[2023-03-08 11:23:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:14] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:23:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:15] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:23:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 11:23:15] [INFO ] [Nat]Added 58 Read/Feed constraints in 15 ms returned sat
[2023-03-08 11:23:15] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 12 ms.
[2023-03-08 11:23:15] [INFO ] Added : 17 causal constraints over 5 iterations in 96 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
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 6 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 6 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 6 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-08 11:23:15] [INFO ] Invariant cache hit.
[2023-03-08 11:23:15] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 11:23:15] [INFO ] Invariant cache hit.
[2023-03-08 11:23:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 11:23:15] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-08 11:23:15] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 11:23:15] [INFO ] Invariant cache hit.
[2023-03-08 11:23:15] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00 in 3294 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 11:23:15] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 11:23:15] [INFO ] Invariant cache hit.
[2023-03-08 11:23:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:15] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 11:23:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:15] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 11:23:15] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:15] [INFO ] [Nat]Added 89 Read/Feed constraints in 14 ms returned sat
[2023-03-08 11:23:15] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-08 11:23:16] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-08 11:23:16] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-08 11:23:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2023-03-08 11:23:16] [INFO ] Added : 11 causal constraints over 3 iterations in 279 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 135 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 133 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 132 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 131 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 128 transition count 178
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 128 transition count 178
Applied a total of 38 rules in 33 ms. Remains 128 /144 variables (removed 16) and now considering 178/228 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 128/144 places, 178/228 transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 11:23:16] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229385 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95703 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 1) seen :0
[2023-03-08 11:23:17] [INFO ] Invariant cache hit.
[2023-03-08 11:23:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:17] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 11:23:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:18] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:23:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 11:23:18] [INFO ] [Nat]Added 51 Read/Feed constraints in 9 ms returned sat
[2023-03-08 11:23:18] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 11 ms.
[2023-03-08 11:23:18] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-08 11:23:18] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-08 11:23:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2023-03-08 11:23:18] [INFO ] Added : 21 causal constraints over 5 iterations in 267 ms. Result :sat
Minimization took 68 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, 178/178 transitions.
Applied a total of 0 rules in 10 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 11:23:18] [INFO ] Invariant cache hit.
[2023-03-08 11:23:18] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 11:23:18] [INFO ] Invariant cache hit.
[2023-03-08 11:23:18] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 11:23:18] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-08 11:23:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:23:18] [INFO ] Invariant cache hit.
[2023-03-08 11:23:18] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 422 ms. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 3203 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-09
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 11:23:18] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2346 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 959 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 11:23:18] [INFO ] Invariant cache hit.
[2023-03-08 11:23:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:19] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-08 11:23:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 11:23:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:19] [INFO ] [Nat]Added 89 Read/Feed constraints in 27 ms returned sat
[2023-03-08 11:23:19] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-08 11:23:19] [INFO ] Added : 14 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 133 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 133 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 131 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 131 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 130 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 130 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 130 transition count 201
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 37 place count 127 transition count 181
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 127 transition count 181
Applied a total of 40 rules in 32 ms. Remains 127 /144 variables (removed 17) and now considering 181/228 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 127/144 places, 181/228 transitions.
// Phase 1: matrix 181 rows 127 cols
[2023-03-08 11:23:19] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230414 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95810 resets, run finished after 527 ms. (steps per millisecond=1897 ) properties (out of 1) seen :0
[2023-03-08 11:23:21] [INFO ] Invariant cache hit.
[2023-03-08 11:23:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:21] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:23:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:23:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 11:23:21] [INFO ] [Nat]Added 59 Read/Feed constraints in 21 ms returned sat
[2023-03-08 11:23:21] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 130 transitions) in 12 ms.
[2023-03-08 11:23:21] [INFO ] Added : 15 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 54 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, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-08 11:23:21] [INFO ] Invariant cache hit.
[2023-03-08 11:23:21] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 11:23:21] [INFO ] Invariant cache hit.
[2023-03-08 11:23:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 11:23:21] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-08 11:23:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:23:21] [INFO ] Invariant cache hit.
[2023-03-08 11:23:21] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 127/127 places, 181/181 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-09 in 2963 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-11
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 11:23:21] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2296 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 940 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 11:23:21] [INFO ] Invariant cache hit.
[2023-03-08 11:23:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:21] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 11:23:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:22] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 11:23:22] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:22] [INFO ] [Nat]Added 89 Read/Feed constraints in 21 ms returned sat
[2023-03-08 11:23:22] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 17 ms.
[2023-03-08 11:23:22] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2023-03-08 11:23:22] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2023-03-08 11:23:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-08 11:23:22] [INFO ] Added : 21 causal constraints over 6 iterations in 298 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 135 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 133 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 132 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 132 transition count 200
Applied a total of 28 rules in 19 ms. Remains 132 /144 variables (removed 12) and now considering 200/228 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 132/144 places, 200/228 transitions.
// Phase 1: matrix 200 rows 132 cols
[2023-03-08 11:23:22] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 229881 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 95930 resets, run finished after 554 ms. (steps per millisecond=1805 ) properties (out of 1) seen :0
[2023-03-08 11:23:24] [INFO ] Invariant cache hit.
[2023-03-08 11:23:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:24] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 11:23:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:24] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 11:23:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 11:23:24] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2023-03-08 11:23:24] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 148 transitions) in 12 ms.
[2023-03-08 11:23:24] [INFO ] Added : 26 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 132/132 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-08 11:23:24] [INFO ] Invariant cache hit.
[2023-03-08 11:23:24] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 11:23:24] [INFO ] Invariant cache hit.
[2023-03-08 11:23:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 11:23:25] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-08 11:23:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:23:25] [INFO ] Invariant cache hit.
[2023-03-08 11:23:25] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 132/132 places, 200/200 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-11 in 3397 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-13
// Phase 1: matrix 228 rows 144 cols
[2023-03-08 11:23:25] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 11:23:25] [INFO ] Invariant cache hit.
[2023-03-08 11:23:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:25] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-08 11:23:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:25] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-08 11:23:25] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-08 11:23:25] [INFO ] [Nat]Added 89 Read/Feed constraints in 17 ms returned sat
[2023-03-08 11:23:25] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 11:23:25] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2023-03-08 11:23:25] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2023-03-08 11:23:25] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-08 11:23:25] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-08 11:23:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 328 ms
[2023-03-08 11:23:26] [INFO ] Added : 26 causal constraints over 6 iterations in 485 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 140 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 140 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 136 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 136 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 136 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 133 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 133 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 133 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 130 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 130 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 128 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 128 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 127 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 127 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 126 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 126 transition count 185
Applied a total of 42 rules in 18 ms. Remains 126 /144 variables (removed 18) and now considering 185/228 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/144 places, 185/228 transitions.
// Phase 1: matrix 185 rows 126 cols
[2023-03-08 11:23:26] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229852 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95222 resets, run finished after 531 ms. (steps per millisecond=1883 ) properties (out of 1) seen :0
[2023-03-08 11:23:27] [INFO ] Invariant cache hit.
[2023-03-08 11:23:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:23:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:27] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:23:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:23:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:23:27] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 11:23:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 11:23:27] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-08 11:23:28] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 135 transitions) in 14 ms.
[2023-03-08 11:23:28] [INFO ] Added : 16 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 126/126 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 11:23:28] [INFO ] Invariant cache hit.
[2023-03-08 11:23:28] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 11:23:28] [INFO ] Invariant cache hit.
[2023-03-08 11:23:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-08 11:23:28] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-08 11:23:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:23:28] [INFO ] Invariant cache hit.
[2023-03-08 11:23:28] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 126/126 places, 185/185 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-13 in 3356 ms.
[2023-03-08 11:23:28] [INFO ] Flatten gal took : 88 ms
[2023-03-08 11:23:28] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-08 11:23:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 228 transitions and 900 arcs took 2 ms.
Total runtime 55536 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/779/ub_0_ --maxsum=/tmp/779/ub_1_ --maxsum=/tmp/779/ub_2_ --maxsum=/tmp/779/ub_3_ --maxsum=/tmp/779/ub_4_
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678274686327

--------------------
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-d2m06-UpperBounds-00
ub formula formula --maxsum=/tmp/779/ub_0_
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-04
ub formula formula --maxsum=/tmp/779/ub_1_
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-09
ub formula formula --maxsum=/tmp/779/ub_2_
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-11
ub formula formula --maxsum=/tmp/779/ub_3_
ub formula name DBSingleClientW-PT-d2m06-UpperBounds-13
ub formula formula --maxsum=/tmp/779/ub_4_
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 144 places, 228 transitions and 900 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m06 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: 228->216 groups
pnml2lts-sym: Regrouping took 0.050 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 144; there are 216 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: 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: Exploration took 1320903 group checks and 0 next state calls
pnml2lts-sym: reachability took 25.370 real 91.280 user 10.050 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.040 user 0.000 sys
pnml2lts-sym: state space has 3804854 states, 55253 nodes
pnml2lts-sym: Maximum sum of /tmp/779/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/779/ub_1_ is: 3
pnml2lts-sym: Maximum sum of /tmp/779/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/779/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/779/ub_4_ is: 1
pnml2lts-sym: group_next: 2730 nodes total
pnml2lts-sym: group_explored: 3503 nodes, 3538 short vectors total
pnml2lts-sym: max token count: 6

Sequence of Actions to be Executed by the VM

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

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

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

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