About the Execution of Smart+red for DBSingleClientW-PT-d2m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 958.976 | 122356.00 | 144127.00 | 626.60 | 0 0 1 8 0 0 1 0 0 0 1 0 1 0 1 0 | normal |
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.r107-tall-167814484100341.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 smartxred
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 r107-tall-167814484100341
=====================================================================
--------------------
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 1678363931033
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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 12:12:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 12:12:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:12:12] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2023-03-09 12:12:12] [INFO ] Transformed 4763 places.
[2023-03-09 12:12:12] [INFO ] Transformed 2478 transitions.
[2023-03-09 12:12:12] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 17 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-09 12:12:13] [INFO ] Computed 6 place invariants in 162 ms
Incomplete random walk after 10000 steps, including 2317 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 929 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 974 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :2
[2023-03-09 12:12:13] [INFO ] Invariant cache hit.
[2023-03-09 12:12:14] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-09 12:12:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-09 12:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:14] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2023-03-09 12:12:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2023-03-09 12:12:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2023-03-09 12:12:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:15] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2023-03-09 12:12:15] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-09 12:12:16] [INFO ] [Nat]Added 1588 Read/Feed constraints in 815 ms returned sat
[2023-03-09 12:12:17] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 649 ms.
[2023-03-09 12:12:18] [INFO ] Deduced a trap composed of 31 places in 633 ms of which 23 ms to minimize.
[2023-03-09 12:12:19] [INFO ] Deduced a trap composed of 72 places in 633 ms of which 1 ms to minimize.
[2023-03-09 12:12:20] [INFO ] Deduced a trap composed of 49 places in 690 ms of which 2 ms to minimize.
[2023-03-09 12:12:20] [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-09 12:12:20] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-09 12:12:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 12:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:21] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-09 12:12:22] [INFO ] [Real]Added 1588 Read/Feed constraints in 869 ms returned sat
[2023-03-09 12:12:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-09 12:12:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2023-03-09 12:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:22] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2023-03-09 12:12:23] [INFO ] [Nat]Added 1588 Read/Feed constraints in 644 ms returned sat
[2023-03-09 12:12:24] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 550 ms.
[2023-03-09 12:12:24] [INFO ] Added : 1 causal constraints over 1 iterations in 800 ms. Result :sat
Minimization took 586 ms.
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-09 12:12:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-09 12:12:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-09 12:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:26] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2023-03-09 12:12:27] [INFO ] [Nat]Added 1588 Read/Feed constraints in 926 ms returned sat
[2023-03-09 12:12:28] [INFO ] Deduced a trap composed of 235 places in 576 ms of which 2 ms to minimize.
[2023-03-09 12:12:28] [INFO ] Deduced a trap composed of 235 places in 603 ms of which 1 ms to minimize.
[2023-03-09 12:12:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1457 ms
[2023-03-09 12:12:29] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 425 ms.
[2023-03-09 12:12:31] [INFO ] Deduced a trap composed of 49 places in 644 ms of which 1 ms to minimize.
[2023-03-09 12:12:31] [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-09 12:12:31] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned unsat
[2023-03-09 12:12:31] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 12:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:32] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-09 12:12:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 12:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:33] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-09 12:12:34] [INFO ] [Nat]Added 1588 Read/Feed constraints in 906 ms returned sat
[2023-03-09 12:12:34] [INFO ] Deduced a trap composed of 217 places in 604 ms of which 2 ms to minimize.
[2023-03-09 12:12:35] [INFO ] Deduced a trap composed of 189 places in 605 ms of which 3 ms to minimize.
[2023-03-09 12:12:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1438 ms
[2023-03-09 12:12:35] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 401 ms.
[2023-03-09 12:12:36] [INFO ] Added : 10 causal constraints over 3 iterations in 942 ms. Result :sat
Minimization took 708 ms.
[2023-03-09 12:12:37] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 12:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:38] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2023-03-09 12:12:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-09 12:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:39] [INFO ] [Nat]Absence check using state equation in 794 ms returned sat
[2023-03-09 12:12:39] [INFO ] [Nat]Added 1588 Read/Feed constraints in 845 ms returned sat
[2023-03-09 12:12:40] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 392 ms.
[2023-03-09 12:12:40] [INFO ] Added : 4 causal constraints over 1 iterations in 688 ms. Result :sat
Minimization took 478 ms.
Current structural bounds on expressions (after SMT) : [7, 10, 10, 1, 3255, 7] Max seen :[0, 2, 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.7 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 223 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 223 ms. Remains : 136/1183 places, 212/2478 transitions.
// Phase 1: matrix 212 rows 136 cols
[2023-03-09 12:12:41] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229584 resets, run finished after 1399 ms. (steps per millisecond=714 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000000 steps, including 95798 resets, run finished after 639 ms. (steps per millisecond=1564 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96383 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 95716 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95331 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95519 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 5) seen :3
[2023-03-09 12:12:46] [INFO ] Invariant cache hit.
[2023-03-09 12:12:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:46] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 12:12:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:46] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:12:46] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-09 12:12:46] [INFO ] [Nat]Added 85 Read/Feed constraints in 48 ms returned sat
[2023-03-09 12:12:46] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 17 ms.
[2023-03-09 12:12:46] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2023-03-09 12:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 12:12:46] [INFO ] Added : 17 causal constraints over 4 iterations in 201 ms. Result :sat
Minimization took 39 ms.
[2023-03-09 12:12:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:46] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Real]Added 85 Read/Feed constraints in 15 ms returned sat
[2023-03-09 12:12:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:46] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Nat]Added 85 Read/Feed constraints in 13 ms returned sat
[2023-03-09 12:12:46] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 11 ms.
[2023-03-09 12:12:46] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 22 ms.
[2023-03-09 12:12:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:47] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 12:12:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:47] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-09 12:12:47] [INFO ] [Nat]Added 85 Read/Feed constraints in 18 ms returned sat
[2023-03-09 12:12:47] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 14 ms.
[2023-03-09 12:12:47] [INFO ] Added : 14 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 45 ms.
[2023-03-09 12:12:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:47] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:47] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:47] [INFO ] [Nat]Added 85 Read/Feed constraints in 17 ms returned sat
[2023-03-09 12:12:47] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 159 transitions) in 20 ms.
[2023-03-09 12:12:47] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-09 12:12:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-03-09 12:12:47] [INFO ] Added : 10 causal constraints over 3 iterations in 171 ms. Result :sat
Minimization took 32 ms.
[2023-03-09 12:12:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:47] [INFO ] [Real]Absence check using state equation in 24 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 20 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 20 ms. Remains : 133/136 places, 207/212 transitions.
// Phase 1: matrix 207 rows 133 cols
[2023-03-09 12:12:47] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230338 resets, run finished after 1479 ms. (steps per millisecond=676 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95490 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96552 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95392 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95751 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 4) seen :2
[2023-03-09 12:12:51] [INFO ] Invariant cache hit.
[2023-03-09 12:12:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:51] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 12:12:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:12:52] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 12:12:52] [INFO ] [Nat]Added 82 Read/Feed constraints in 26 ms returned sat
[2023-03-09 12:12:52] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 14 ms.
[2023-03-09 12:12:52] [INFO ] Added : 13 causal constraints over 3 iterations in 83 ms. Result :sat
Minimization took 42 ms.
[2023-03-09 12:12:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Real]Added 82 Read/Feed constraints in 10 ms returned sat
[2023-03-09 12:12:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Nat]Added 82 Read/Feed constraints in 9 ms returned sat
[2023-03-09 12:12:52] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 13 ms.
[2023-03-09 12:12:52] [INFO ] Added : 1 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 30 ms.
[2023-03-09 12:12:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Nat]Added 82 Read/Feed constraints in 20 ms returned sat
[2023-03-09 12:12:52] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 15 ms.
[2023-03-09 12:12:52] [INFO ] Added : 11 causal constraints over 3 iterations in 69 ms. Result :sat
Minimization took 36 ms.
[2023-03-09 12:12:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:52] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-09 12:12:52] [INFO ] [Nat]Added 82 Read/Feed constraints in 17 ms returned sat
[2023-03-09 12:12:52] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 14 ms.
[2023-03-09 12:12:53] [INFO ] Added : 13 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 35 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 6 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 6 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 6 ms. Remains 133 /133 variables (removed 0) and now considering 207/207 (removed 0) transitions.
[2023-03-09 12:12:53] [INFO ] Invariant cache hit.
[2023-03-09 12:12:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-09 12:12:53] [INFO ] Invariant cache hit.
[2023-03-09 12:12:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 12:12:53] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-09 12:12:53] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 12:12:53] [INFO ] Invariant cache hit.
[2023-03-09 12:12:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 469 ms. Remains : 133/133 places, 207/207 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-02
[2023-03-09 12:12:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 12:12:53] [INFO ] Invariant cache hit.
[2023-03-09 12:12:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:12:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:53] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 12:12:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 12:12:53] [INFO ] [Nat]Added 82 Read/Feed constraints in 19 ms returned sat
[2023-03-09 12:12:53] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 15 ms.
[2023-03-09 12:12:53] [INFO ] Added : 13 causal constraints over 3 iterations in 68 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 23 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 23 ms. Remains : 128/133 places, 193/207 transitions.
// Phase 1: matrix 193 rows 128 cols
[2023-03-09 12:12:54] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229876 resets, run finished after 1252 ms. (steps per millisecond=798 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95677 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 1) seen :0
[2023-03-09 12:12:55] [INFO ] Invariant cache hit.
[2023-03-09 12:12:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:55] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-09 12:12:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-09 12:12:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-09 12:12:56] [INFO ] [Nat]Added 72 Read/Feed constraints in 15 ms returned sat
[2023-03-09 12:12:56] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 13 ms.
[2023-03-09 12:12:56] [INFO ] Added : 15 causal constraints over 3 iterations in 63 ms. Result :sat
Minimization took 42 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 4 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 6 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-09 12:12:56] [INFO ] Invariant cache hit.
[2023-03-09 12:12:56] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 12:12:56] [INFO ] Invariant cache hit.
[2023-03-09 12:12:56] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-09 12:12:56] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-09 12:12:56] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 12:12:56] [INFO ] Invariant cache hit.
[2023-03-09 12:12:56] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 128/128 places, 193/193 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-02 in 2967 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03
// Phase 1: matrix 207 rows 133 cols
[2023-03-09 12:12:56] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 993 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
[2023-03-09 12:12:56] [INFO ] Invariant cache hit.
[2023-03-09 12:12:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:56] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:56] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 12:12:56] [INFO ] [Real]Added 82 Read/Feed constraints in 14 ms returned sat
[2023-03-09 12:12:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:12:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:56] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:12:56] [INFO ] [Nat]Added 82 Read/Feed constraints in 9 ms returned sat
[2023-03-09 12:12:56] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 13 ms.
[2023-03-09 12:12:56] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 21 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 16 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-09 12:12:56] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230140 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96163 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 1) seen :3
[2023-03-09 12:12:58] [INFO ] Invariant cache hit.
[2023-03-09 12:12:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:58] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-09 12:12:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-09 12:12:58] [INFO ] [Real]Added 49 Read/Feed constraints in 9 ms returned sat
[2023-03-09 12:12:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:58] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:12:58] [INFO ] [Nat]Added 49 Read/Feed constraints in 5 ms returned sat
[2023-03-09 12:12:58] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 8 ms.
[2023-03-09 12:12:58] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
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 6 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 8 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 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-09 12:12:58] [INFO ] Invariant cache hit.
[2023-03-09 12:12:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-09 12:12:58] [INFO ] Invariant cache hit.
[2023-03-09 12:12:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-09 12:12:59] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-09 12:12:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 12:12:59] [INFO ] Invariant cache hit.
[2023-03-09 12:12:59] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 123/123 places, 168/168 transitions.
[2023-03-09 12:12:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229536 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 96601 resets, run finished after 519 ms. (steps per millisecond=1926 ) properties (out of 1) seen :4
[2023-03-09 12:13:00] [INFO ] Invariant cache hit.
[2023-03-09 12:13:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:00] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 12:13:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-09 12:13:00] [INFO ] [Real]Added 49 Read/Feed constraints in 9 ms returned sat
[2023-03-09 12:13:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:01] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Nat]Added 49 Read/Feed constraints in 5 ms returned sat
[2023-03-09 12:13:01] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2023-03-09 12:13:01] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 18 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 12 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 13 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-09 12:13:01] [INFO ] Invariant cache hit.
[2023-03-09 12:13:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-09 12:13:01] [INFO ] Invariant cache hit.
[2023-03-09 12:13:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-09 12:13:01] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-09 12:13:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:13:01] [INFO ] Invariant cache hit.
[2023-03-09 12:13:01] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 123/123 places, 168/168 transitions.
[2023-03-09 12:13:01] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 230204 resets, run finished after 1076 ms. (steps per millisecond=929 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 96867 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 1) seen :4
[2023-03-09 12:13:03] [INFO ] Invariant cache hit.
[2023-03-09 12:13:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-09 12:13:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-09 12:13:03] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2023-03-09 12:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:03] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-09 12:13:03] [INFO ] [Nat]Added 49 Read/Feed constraints in 11 ms returned sat
[2023-03-09 12:13:03] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2023-03-09 12:13:03] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 25 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 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-09 12:13:03] [INFO ] Invariant cache hit.
[2023-03-09 12:13:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 12:13:03] [INFO ] Invariant cache hit.
[2023-03-09 12:13:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-09 12:13:03] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-09 12:13:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:13:03] [INFO ] Invariant cache hit.
[2023-03-09 12:13:03] [INFO ] Dead Transitions using invariants and state equation in 65 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 7173 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-06
// Phase 1: matrix 207 rows 133 cols
[2023-03-09 12:13:03] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2348 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 12:13:03] [INFO ] Invariant cache hit.
[2023-03-09 12:13:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:03] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-09 12:13:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 12:13:03] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 12:13:03] [INFO ] [Nat]Added 82 Read/Feed constraints in 20 ms returned sat
[2023-03-09 12:13:03] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 12 ms.
[2023-03-09 12:13:04] [INFO ] Added : 11 causal constraints over 3 iterations in 59 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 10 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 10 ms. Remains : 127/133 places, 180/207 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-09 12:13:04] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229864 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95229 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
[2023-03-09 12:13:05] [INFO ] Invariant cache hit.
[2023-03-09 12:13:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:05] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-09 12:13:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:05] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-09 12:13:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 12:13:05] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2023-03-09 12:13:05] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 13 ms.
[2023-03-09 12:13:06] [INFO ] Added : 17 causal constraints over 5 iterations in 83 ms. Result :sat
Minimization took 34 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 3 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 3 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 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-09 12:13:06] [INFO ] Invariant cache hit.
[2023-03-09 12:13:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 12:13:06] [INFO ] Invariant cache hit.
[2023-03-09 12:13:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 12:13:06] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-09 12:13:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:13:06] [INFO ] Invariant cache hit.
[2023-03-09 12:13:06] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-06 in 2783 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-12
// Phase 1: matrix 207 rows 133 cols
[2023-03-09 12:13:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 970 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 12:13:06] [INFO ] Invariant cache hit.
[2023-03-09 12:13:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:06] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:13:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-09 12:13:06] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-09 12:13:06] [INFO ] [Nat]Added 82 Read/Feed constraints in 15 ms returned sat
[2023-03-09 12:13:06] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 155 transitions) in 15 ms.
[2023-03-09 12:13:06] [INFO ] Added : 13 causal constraints over 3 iterations in 70 ms. Result :sat
Minimization took 36 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 12 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 12 ms. Remains : 125/133 places, 177/207 transitions.
// Phase 1: matrix 177 rows 125 cols
[2023-03-09 12:13:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230002 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95458 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 1) seen :0
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:08] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-09 12:13:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:08] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-09 12:13:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 12:13:08] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2023-03-09 12:13:08] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 11 ms.
[2023-03-09 12:13:08] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 30 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 4 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 4 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 12:13:09] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-09 12:13:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 12:13:09] [INFO ] Invariant cache hit.
[2023-03-09 12:13:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 125/125 places, 177/177 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-12 in 2677 ms.
[2023-03-09 12:13:09] [INFO ] Flatten gal took : 53 ms
[2023-03-09 12:13:09] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 12:13:09] [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 56930 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DBSingleClientW (PT), instance d2m10
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart
PNML FILE: model.pnml
Petri model created: 133 places, 207 transitions, 816 arcs.
Final Score: 3270.028
Took : 13 seconds
Bounds file is: UpperBounds.xml
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-03 8 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
BK_STOP 1678364053389
--------------------
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
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="smartxred"
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 smartxred"
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 r107-tall-167814484100341"
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 '
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 ;