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.r103-tall-167814478100293.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 lolaxred
Input is DBSingleClientW-PT-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478100293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 15:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:30 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-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678244716753

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:05:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 03:05:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:05:18] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-08 03:05:18] [INFO ] Transformed 4763 places.
[2023-03-08 03:05:18] [INFO ] Transformed 2478 transitions.
[2023-03-08 03:05:18] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 257 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-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 03:05:18] [INFO ] Computed 6 place invariants in 143 ms
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 908 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 956 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 896 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
[2023-03-08 03:05:19] [INFO ] Invariant cache hit.
[2023-03-08 03:05:19] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2023-03-08 03:05:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-08 03:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:20] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2023-03-08 03:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-08 03:05:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-08 03:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:21] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-08 03:05:21] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 03:05:22] [INFO ] [Nat]Added 1588 Read/Feed constraints in 670 ms returned sat
[2023-03-08 03:05:22] [INFO ] Deduced a trap composed of 186 places in 619 ms of which 9 ms to minimize.
[2023-03-08 03:05:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 810 ms
[2023-03-08 03:05:23] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 624 ms.
[2023-03-08 03:05:24] [INFO ] Added : 4 causal constraints over 1 iterations in 1103 ms. Result :sat
Minimization took 705 ms.
[2023-03-08 03:05:25] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-08 03:05:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 03:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:25] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2023-03-08 03:05:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:05:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-08 03:05:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:26] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2023-03-08 03:05:27] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1282 ms returned sat
[2023-03-08 03:05:28] [INFO ] Deduced a trap composed of 28 places in 612 ms of which 1 ms to minimize.
[2023-03-08 03:05:29] [INFO ] Deduced a trap composed of 50 places in 642 ms of which 2 ms to minimize.
[2023-03-08 03:05:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1978 ms
[2023-03-08 03:05:30] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 575 ms.
[2023-03-08 03:05:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 03:05:30] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2023-03-08 03:05:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:05:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:31] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2023-03-08 03:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:05:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 03:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:32] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-08 03:05:33] [INFO ] [Nat]Added 1588 Read/Feed constraints in 984 ms returned sat
[2023-03-08 03:05:34] [INFO ] Deduced a trap composed of 141 places in 560 ms of which 2 ms to minimize.
[2023-03-08 03:05:34] [INFO ] Deduced a trap composed of 158 places in 608 ms of which 1 ms to minimize.
[2023-03-08 03:05:35] [INFO ] Deduced a trap composed of 138 places in 571 ms of which 2 ms to minimize.
[2023-03-08 03:05:36] [INFO ] Deduced a trap composed of 83 places in 623 ms of which 1 ms to minimize.
[2023-03-08 03:05:36] [INFO ] Deduced a trap composed of 115 places in 579 ms of which 1 ms to minimize.
[2023-03-08 03:05:36] [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 03:05:36] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:05:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 03:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:37] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2023-03-08 03:05:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:05:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 03:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:38] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2023-03-08 03:05:39] [INFO ] [Nat]Added 1588 Read/Feed constraints in 923 ms returned sat
[2023-03-08 03:05:39] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 382 ms.
[2023-03-08 03:05:40] [INFO ] Added : 9 causal constraints over 2 iterations in 804 ms. Result :sat
Minimization took 960 ms.
[2023-03-08 03:05:41] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 03:05:41] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 03:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:41] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2023-03-08 03:05:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 03:05:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 03:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:42] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2023-03-08 03:05:43] [INFO ] [Nat]Added 1588 Read/Feed constraints in 668 ms returned sat
[2023-03-08 03:05:43] [INFO ] Deduced a trap composed of 194 places in 577 ms of which 1 ms to minimize.
[2023-03-08 03:05:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 715 ms
[2023-03-08 03:05:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 411 ms.
[2023-03-08 03:05:44] [INFO ] Added : 5 causal constraints over 1 iterations in 695 ms. Result :sat
Minimization took 543 ms.
[2023-03-08 03:05:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:05:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:46] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2023-03-08 03:05:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:05:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-08 03:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:46] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2023-03-08 03:05:48] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1097 ms returned sat
[2023-03-08 03:05:48] [INFO ] Deduced a trap composed of 38 places in 623 ms of which 2 ms to minimize.
[2023-03-08 03:05:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1010 ms
[2023-03-08 03:05:49] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 465 ms.
[2023-03-08 03:05:50] [INFO ] Deduced a trap composed of 47 places in 659 ms of which 1 ms to minimize.
[2023-03-08 03:05:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 822 ms
[2023-03-08 03:05:51] [INFO ] Added : 17 causal constraints over 4 iterations in 2161 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1597, 4, 4, 7, 4, 6] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 387 places :
Symmetric choice reduction at 1 with 387 rule applications. Total rules 605 place count 749 transition count 1221
Iterating global reduction 1 with 387 rules applied. Total rules applied 992 place count 749 transition count 1221
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1010 place count 749 transition count 1203
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1322 place count 437 transition count 891
Iterating global reduction 2 with 312 rules applied. Total rules applied 1634 place count 437 transition count 891
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1646 place count 437 transition count 879
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1883 place count 200 transition count 546
Iterating global reduction 3 with 237 rules applied. Total rules applied 2120 place count 200 transition count 546
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2329 place count 200 transition count 337
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2353 place count 176 transition count 298
Iterating global reduction 4 with 24 rules applied. Total rules applied 2377 place count 176 transition count 298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2389 place count 176 transition count 286
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2404 place count 161 transition count 271
Iterating global reduction 5 with 15 rules applied. Total rules applied 2419 place count 161 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2423 place count 161 transition count 267
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2434 place count 150 transition count 256
Iterating global reduction 6 with 11 rules applied. Total rules applied 2445 place count 150 transition count 256
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2454 place count 150 transition count 247
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2456 place count 148 transition count 240
Iterating global reduction 7 with 2 rules applied. Total rules applied 2458 place count 148 transition count 240
Applied a total of 2458 rules in 271 ms. Remains 148 /1183 variables (removed 1035) and now considering 240/2478 (removed 2238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 148/1183 places, 240/2478 transitions.
// Phase 1: matrix 240 rows 148 cols
[2023-03-08 03:05:51] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229738 resets, run finished after 1588 ms. (steps per millisecond=629 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 96012 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95601 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95633 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95971 resets, run finished after 721 ms. (steps per millisecond=1386 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95597 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95200 resets, run finished after 708 ms. (steps per millisecond=1412 ) properties (out of 6) seen :1
[2023-03-08 03:05:57] [INFO ] Invariant cache hit.
[2023-03-08 03:05:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:57] [INFO ] [Real]Absence check using state equation in 33 ms returned unsat
[2023-03-08 03:05:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:57] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 03:05:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:57] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-08 03:05:57] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 03:05:57] [INFO ] [Nat]Added 100 Read/Feed constraints in 38 ms returned sat
[2023-03-08 03:05:58] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 16 ms.
[2023-03-08 03:05:58] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-08 03:05:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 03:05:58] [INFO ] Added : 19 causal constraints over 4 iterations in 215 ms. Result :sat
Minimization took 56 ms.
[2023-03-08 03:05:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:58] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:05:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 21 ms returned sat
[2023-03-08 03:05:58] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 14 ms.
[2023-03-08 03:05:58] [INFO ] Added : 11 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 58 ms.
[2023-03-08 03:05:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:58] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 03:05:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:58] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 24 ms returned sat
[2023-03-08 03:05:58] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 15 ms.
[2023-03-08 03:05:58] [INFO ] Added : 10 causal constraints over 2 iterations in 66 ms. Result :sat
Minimization took 41 ms.
[2023-03-08 03:05:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:58] [INFO ] [Real]Absence check using state equation in 39 ms returned unsat
[2023-03-08 03:05:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:59] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:05:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:05:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:05:59] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:05:59] [INFO ] [Nat]Added 100 Read/Feed constraints in 25 ms returned sat
[2023-03-08 03:05:59] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 18 ms.
[2023-03-08 03:05:59] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-08 03:05:59] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-08 03:05:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-08 03:05:59] [INFO ] Added : 18 causal constraints over 5 iterations in 283 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1, 4, 4, 7, 1, 6] Max seen :[1, 0, 0, 0, 1, 0]
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 240/240 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 146 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 144 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 144 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 143 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 143 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 143 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 142 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 141 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 141 transition count 228
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 141 transition count 227
Applied a total of 16 rules in 30 ms. Remains 141 /148 variables (removed 7) and now considering 227/240 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 141/148 places, 227/240 transitions.
// Phase 1: matrix 227 rows 141 cols
[2023-03-08 03:05:59] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229863 resets, run finished after 1499 ms. (steps per millisecond=667 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95909 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96114 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95651 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95992 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 4) seen :0
[2023-03-08 03:06:04] [INFO ] Invariant cache hit.
[2023-03-08 03:06:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:04] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:06:04] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-08 03:06:04] [INFO ] [Nat]Added 93 Read/Feed constraints in 28 ms returned sat
[2023-03-08 03:06:04] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 03:06:04] [INFO ] Added : 18 causal constraints over 4 iterations in 101 ms. Result :sat
Minimization took 46 ms.
[2023-03-08 03:06:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:04] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Nat]Added 93 Read/Feed constraints in 15 ms returned sat
[2023-03-08 03:06:04] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 03:06:04] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-08 03:06:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 03:06:04] [INFO ] Added : 30 causal constraints over 7 iterations in 234 ms. Result :sat
Minimization took 51 ms.
[2023-03-08 03:06:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:04] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:05] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 03:06:05] [INFO ] [Nat]Added 93 Read/Feed constraints in 17 ms returned sat
[2023-03-08 03:06:05] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 03:06:05] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-08 03:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-08 03:06:05] [INFO ] Added : 18 causal constraints over 4 iterations in 203 ms. Result :sat
Minimization took 46 ms.
[2023-03-08 03:06:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:05] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 03:06:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:05] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 03:06:05] [INFO ] [Nat]Added 93 Read/Feed constraints in 22 ms returned sat
[2023-03-08 03:06:05] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 03:06:05] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2023-03-08 03:06:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 03:06:05] [INFO ] Added : 11 causal constraints over 3 iterations in 166 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 7, 6] Max seen :[0, 0, 0, 0]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 141/141 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 03:06:05] [INFO ] Invariant cache hit.
[2023-03-08 03:06:06] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 03:06:06] [INFO ] Invariant cache hit.
[2023-03-08 03:06:06] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-08 03:06:06] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-08 03:06:06] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 03:06:06] [INFO ] Invariant cache hit.
[2023-03-08 03:06:06] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 141/141 places, 227/227 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05
[2023-03-08 03:06:06] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2301 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 1014 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 03:06:06] [INFO ] Invariant cache hit.
[2023-03-08 03:06:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-08 03:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-08 03:06:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:06] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:06:06] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-08 03:06:06] [INFO ] [Nat]Added 93 Read/Feed constraints in 28 ms returned sat
[2023-03-08 03:06:06] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-08 03:06:06] [INFO ] Added : 18 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 135 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 133 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 133 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 133 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 131 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 130 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 30 place count 127 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 127 transition count 180
Applied a total of 33 rules in 23 ms. Remains 127 /141 variables (removed 14) and now considering 180/227 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 127/141 places, 180/227 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 03:06:06] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229896 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96175 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 1) seen :0
[2023-03-08 03:06:08] [INFO ] Invariant cache hit.
[2023-03-08 03:06:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:08] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-08 03:06:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:08] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:06:08] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 03:06:08] [INFO ] [Nat]Added 59 Read/Feed constraints in 21 ms returned sat
[2023-03-08 03:06:08] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-08 03:06:08] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-08 03:06:09] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-08 03:06:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2023-03-08 03:06:09] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-08 03:06:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 294 ms
[2023-03-08 03:06:09] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 10 ms.
[2023-03-08 03:06:09] [INFO ] Added : 14 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 41 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 5 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 03:06:09] [INFO ] Invariant cache hit.
[2023-03-08 03:06:09] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 03:06:09] [INFO ] Invariant cache hit.
[2023-03-08 03:06:09] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 03:06:09] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-08 03:06:09] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 03:06:09] [INFO ] Invariant cache hit.
[2023-03-08 03:06:09] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05 in 3238 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07
// Phase 1: matrix 227 rows 141 cols
[2023-03-08 03:06:09] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-08 03:06:09] [INFO ] Invariant cache hit.
[2023-03-08 03:06:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:09] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 03:06:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:09] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-08 03:06:09] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-08 03:06:09] [INFO ] [Nat]Added 93 Read/Feed constraints in 14 ms returned sat
[2023-03-08 03:06:09] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 19 ms.
[2023-03-08 03:06:10] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-08 03:06:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 03:06:10] [INFO ] Added : 30 causal constraints over 7 iterations in 221 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 135 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 133 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 133 transition count 214
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 133 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 131 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 130 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 30 place count 127 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 127 transition count 180
Applied a total of 33 rules in 19 ms. Remains 127 /141 variables (removed 14) and now considering 180/227 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 127/141 places, 180/227 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 03:06:10] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230562 resets, run finished after 1203 ms. (steps per millisecond=831 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96047 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 1) seen :0
[2023-03-08 03:06:12] [INFO ] Invariant cache hit.
[2023-03-08 03:06:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:12] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:06:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:12] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:06:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 03:06:12] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2023-03-08 03:06:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-08 03:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 03:06:12] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2023-03-08 03:06:12] [INFO ] Added : 13 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 39 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 12 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 12 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-08 03:06:12] [INFO ] Invariant cache hit.
[2023-03-08 03:06:12] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 03:06:12] [INFO ] Invariant cache hit.
[2023-03-08 03:06:12] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 03:06:12] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-08 03:06:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:12] [INFO ] Invariant cache hit.
[2023-03-08 03:06:12] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07 in 3096 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
// Phase 1: matrix 227 rows 141 cols
[2023-03-08 03:06:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2290 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 978 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 03:06:12] [INFO ] Invariant cache hit.
[2023-03-08 03:06:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 03:06:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:12] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 03:06:12] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-08 03:06:12] [INFO ] [Nat]Added 93 Read/Feed constraints in 17 ms returned sat
[2023-03-08 03:06:13] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 18 ms.
[2023-03-08 03:06:13] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-03-08 03:06:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-03-08 03:06:13] [INFO ] Added : 18 causal constraints over 4 iterations in 197 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 218
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 132 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 132 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 132 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 130 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 129 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 126 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 126 transition count 179
Applied a total of 35 rules in 22 ms. Remains 126 /141 variables (removed 15) and now considering 179/227 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 126/141 places, 179/227 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-08 03:06:13] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 230046 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95942 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
[2023-03-08 03:06:15] [INFO ] Invariant cache hit.
[2023-03-08 03:06:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:06:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:15] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:06:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 03:06:15] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2023-03-08 03:06:15] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 128 transitions) in 11 ms.
[2023-03-08 03:06:15] [INFO ] Added : 16 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 39 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 4 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-08 03:06:15] [INFO ] Invariant cache hit.
[2023-03-08 03:06:15] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-08 03:06:15] [INFO ] Invariant cache hit.
[2023-03-08 03:06:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 03:06:15] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 03:06:15] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:15] [INFO ] Invariant cache hit.
[2023-03-08 03:06:15] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 418 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 2987 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15
// Phase 1: matrix 227 rows 141 cols
[2023-03-08 03:06:15] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2336 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 986 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 03:06:15] [INFO ] Invariant cache hit.
[2023-03-08 03:06:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:15] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:06:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:15] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-08 03:06:15] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-08 03:06:15] [INFO ] [Nat]Added 93 Read/Feed constraints in 21 ms returned sat
[2023-03-08 03:06:16] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-08 03:06:16] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-08 03:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 03:06:16] [INFO ] Added : 11 causal constraints over 3 iterations in 160 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 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 13 place count 135 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 133 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 133 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 133 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 131 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 131 transition count 199
Applied a total of 23 rules in 11 ms. Remains 131 /141 variables (removed 10) and now considering 199/227 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 131/141 places, 199/227 transitions.
// Phase 1: matrix 199 rows 131 cols
[2023-03-08 03:06:16] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229958 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95964 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 1) seen :0
[2023-03-08 03:06:18] [INFO ] Invariant cache hit.
[2023-03-08 03:06:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:18] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:06:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:06:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:06:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 03:06:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 03:06:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 23 ms returned sat
[2023-03-08 03:06:18] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 13 ms.
[2023-03-08 03:06:18] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-08 03:06:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 03:06:18] [INFO ] Added : 15 causal constraints over 4 iterations in 169 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-08 03:06:18] [INFO ] Invariant cache hit.
[2023-03-08 03:06:18] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 03:06:18] [INFO ] Invariant cache hit.
[2023-03-08 03:06:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 03:06:19] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2023-03-08 03:06:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:06:19] [INFO ] Invariant cache hit.
[2023-03-08 03:06:19] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15 in 3329 ms.
[2023-03-08 03:06:19] [INFO ] Flatten gal took : 47 ms
[2023-03-08 03:06:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 03:06:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 141 places, 227 transitions and 895 arcs took 2 ms.
Total runtime 61156 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d2m04
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678244780339

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 14 (type EXCL) for 0 DBSingleClientW-PT-d2m04-UpperBounds-05
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 DBSingleClientW-PT-d2m04-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 DBSingleClientW-PT-d2m04-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type FNDP) for 3 DBSingleClientW-PT-d2m04-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 14 (type EXCL) for DBSingleClientW-PT-d2m04-UpperBounds-05
lola: markings : 572
lola: fired transitions : 589
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for DBSingleClientW-PT-d2m04-UpperBounds-05 (obsolete)
lola: CANCELED task # 13 (type EQUN) for DBSingleClientW-PT-d2m04-UpperBounds-05 (obsolete)
lola: LAUNCH task # 23 (type EXCL) for 9 DBSingleClientW-PT-d2m04-UpperBounds-15
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 6 DBSingleClientW-PT-d2m04-UpperBounds-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 6 DBSingleClientW-PT-d2m04-UpperBounds-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 23 (type EXCL) for DBSingleClientW-PT-d2m04-UpperBounds-15
lola: markings : 5092
lola: fired transitions : 5709
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 20 (type EXCL) for 6 DBSingleClientW-PT-d2m04-UpperBounds-10
lola: time limit : 1800 sec
lola: memory limit: 32 pages
sara: try reading problem file /home/mcc/execution/374/UpperBounds-13.sara.
sara: try reading problem file /home/mcc/execution/374/UpperBounds-19.sara.
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 20 (type EXCL) for DBSingleClientW-PT-d2m04-UpperBounds-10
lola: markings : 353
lola: fired transitions : 364
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for DBSingleClientW-PT-d2m04-UpperBounds-10 (obsolete)
lola: CANCELED task # 19 (type EQUN) for DBSingleClientW-PT-d2m04-UpperBounds-10 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 3 DBSingleClientW-PT-d2m04-UpperBounds-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type EQUN) for 3 DBSingleClientW-PT-d2m04-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: Structural Bound: 1

sara: try reading problem file /home/mcc/execution/374/UpperBounds-16.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 19 (type EQUN) for DBSingleClientW-PT-d2m04-UpperBounds-10
lola: time used : 0.000000
lola: REPORT NUM
lola: FINISHED task # 17 (type EXCL) for DBSingleClientW-PT-d2m04-UpperBounds-07
lola: markings : 7730
lola: fired transitions : 9820
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type FNDP) for DBSingleClientW-PT-d2m04-UpperBounds-07 (obsolete)
lola: CANCELED task # 16 (type EQUN) for DBSingleClientW-PT-d2m04-UpperBounds-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m04-UpperBounds-05: BOUND 1 state space
DBSingleClientW-PT-d2m04-UpperBounds-07: BOUND 1 state space
DBSingleClientW-PT-d2m04-UpperBounds-10: BOUND 1 state space
DBSingleClientW-PT-d2m04-UpperBounds-15: BOUND 1 state space


Time elapsed: 0 secs. Pages in use: 1

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-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DBSingleClientW-PT-d2m04, 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 r103-tall-167814478100293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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