Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208400371.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r109-tall-171624208400371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 12:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-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 1716329906936

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 22:18:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:18:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:18:28] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-05-21 22:18:28] [INFO ] Transformed 4763 places.
[2024-05-21 22:18:28] [INFO ] Transformed 2478 transitions.
[2024-05-21 22:18:28] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 255 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-d2m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 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-06 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-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 22:18:28] [INFO ] Computed 6 invariants in 137 ms
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 896 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :1
[2024-05-21 22:18:29] [INFO ] Invariant cache hit.
[2024-05-21 22:18:29] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-21 22:18:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 22:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:30] [INFO ] [Real]Absence check using state equation in 668 ms returned sat
[2024-05-21 22:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 21 ms returned sat
[2024-05-21 22:18:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 22:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:31] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-21 22:18:31] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 22:18:32] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1078 ms returned sat
[2024-05-21 22:18:33] [INFO ] Deduced a trap composed of 245 places in 619 ms of which 6 ms to minimize.
[2024-05-21 22:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 807 ms
[2024-05-21 22:18:34] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 626 ms.
[2024-05-21 22:18:34] [INFO ] Added : 12 causal constraints over 3 iterations in 1306 ms. Result :sat
Minimization took 673 ms.
[2024-05-21 22:18:35] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 22:18:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 22:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:36] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-21 22:18:37] [INFO ] [Real]Added 1588 Read/Feed constraints in 830 ms returned sat
[2024-05-21 22:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 22:18:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 22:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:37] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2024-05-21 22:18:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 591 ms returned sat
[2024-05-21 22:18:39] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 560 ms.
[2024-05-21 22:18:39] [INFO ] Added : 1 causal constraints over 1 iterations in 811 ms. Result :sat
Minimization took 574 ms.
[2024-05-21 22:18:40] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 22:18:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 22:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:40] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2024-05-21 22:18:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 22:18:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 22:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:41] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2024-05-21 22:18:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1098 ms returned sat
[2024-05-21 22:18:43] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 382 ms.
[2024-05-21 22:18:44] [INFO ] Deduced a trap composed of 69 places in 663 ms of which 2 ms to minimize.
[2024-05-21 22:18:45] [INFO ] Deduced a trap composed of 68 places in 648 ms of which 3 ms to minimize.
[2024-05-21 22:18:46] [INFO ] Deduced a trap composed of 103 places in 639 ms of which 2 ms to minimize.
[2024-05-21 22:18:46] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
Current structural bounds on expressions (after SMT) : [3255, 10, 3255] Max seen :[0, 1, 0]
Support contains 3 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 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 609 place count 745 transition count 1200
Iterating global reduction 1 with 391 rules applied. Total rules applied 1000 place count 745 transition count 1200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1009 place count 745 transition count 1191
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1325 place count 429 transition count 875
Iterating global reduction 2 with 316 rules applied. Total rules applied 1641 place count 429 transition count 875
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1653 place count 429 transition count 863
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1893 place count 189 transition count 522
Iterating global reduction 3 with 240 rules applied. Total rules applied 2133 place count 189 transition count 522
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2344 place count 189 transition count 311
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2369 place count 164 transition count 271
Iterating global reduction 4 with 25 rules applied. Total rules applied 2394 place count 164 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2400 place count 164 transition count 265
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2417 place count 147 transition count 248
Iterating global reduction 5 with 17 rules applied. Total rules applied 2434 place count 147 transition count 248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2438 place count 147 transition count 244
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2452 place count 133 transition count 230
Iterating global reduction 6 with 14 rules applied. Total rules applied 2466 place count 133 transition count 230
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2479 place count 133 transition count 217
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2485 place count 127 transition count 188
Iterating global reduction 7 with 6 rules applied. Total rules applied 2491 place count 127 transition count 188
Applied a total of 2491 rules in 242 ms. Remains 127 /1183 variables (removed 1056) and now considering 188/2478 (removed 2290) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 127/1183 places, 188/2478 transitions.
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 22:18:46] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230303 resets, run finished after 1266 ms. (steps per millisecond=789 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 96161 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96473 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95251 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 3) seen :2
[2024-05-21 22:18:49] [INFO ] Invariant cache hit.
[2024-05-21 22:18:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:49] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:18:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:49] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:18:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:18:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2024-05-21 22:18:49] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 15 ms.
[2024-05-21 22:18:49] [INFO ] Added : 10 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 38 ms.
[2024-05-21 22:18:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:50] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:50] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2024-05-21 22:18:50] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 13 ms.
[2024-05-21 22:18:50] [INFO ] Added : 1 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 22 ms.
[2024-05-21 22:18:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:50] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:18:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:18:50] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2024-05-21 22:18:50] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 15 ms.
[2024-05-21 22:18:50] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 22:18:50] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:18:50] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-21 22:18:50] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-21 22:18:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 277 ms
[2024-05-21 22:18:50] [INFO ] Added : 24 causal constraints over 6 iterations in 394 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [3255, 10, 3255] Max seen :[0, 4, 0]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 22:18:50] [INFO ] Invariant cache hit.
[2024-05-21 22:18:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 22:18:51] [INFO ] Invariant cache hit.
[2024-05-21 22:18:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:18:51] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2024-05-21 22:18:51] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 22:18:51] [INFO ] Invariant cache hit.
[2024-05-21 22:18:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 127/127 places, 188/188 transitions.
[2024-05-21 22:18:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229879 resets, run finished after 1228 ms. (steps per millisecond=814 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95682 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96852 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95562 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 3) seen :2
[2024-05-21 22:18:54] [INFO ] Invariant cache hit.
[2024-05-21 22:18:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:54] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-21 22:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:54] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 22:18:54] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:18:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2024-05-21 22:18:54] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 14 ms.
[2024-05-21 22:18:54] [INFO ] Added : 10 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 32 ms.
[2024-05-21 22:18:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:54] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Real]Added 66 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:54] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2024-05-21 22:18:54] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 10 ms.
[2024-05-21 22:18:54] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 22 ms.
[2024-05-21 22:18:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:54] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 22:18:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:54] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:18:54] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2024-05-21 22:18:54] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-21 22:18:55] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:18:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-21 22:18:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:18:55] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 22:18:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 264 ms
[2024-05-21 22:18:55] [INFO ] Added : 24 causal constraints over 6 iterations in 378 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [3255, 10, 3255] Max seen :[0, 4, 0]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-21 22:18:55] [INFO ] Invariant cache hit.
[2024-05-21 22:18:55] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:18:55] [INFO ] Invariant cache hit.
[2024-05-21 22:18:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:18:55] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-21 22:18:55] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-21 22:18:55] [INFO ] Invariant cache hit.
[2024-05-21 22:18:55] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 127/127 places, 188/188 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-01
[2024-05-21 22:18:56] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 20 ms. (steps per millisecond=500 ) 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
[2024-05-21 22:18:56] [INFO ] Invariant cache hit.
[2024-05-21 22:18:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:56] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:18:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:18:56] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:18:56] [INFO ] [Nat]Added 66 Read/Feed constraints in 14 ms returned sat
[2024-05-21 22:18:56] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 15 ms.
[2024-05-21 22:18:56] [INFO ] Added : 10 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 32 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, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 187
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 178
Applied a total of 5 rules in 12 ms. Remains 125 /127 variables (removed 2) and now considering 178/188 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 125/127 places, 178/188 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 22:18:56] [INFO ] Computed 2 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 229768 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95502 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
[2024-05-21 22:18:58] [INFO ] Invariant cache hit.
[2024-05-21 22:18:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:58] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:18:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:58] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 22:18:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 22:18:58] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2024-05-21 22:18:58] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 13 ms.
[2024-05-21 22:18:58] [INFO ] Added : 26 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 32 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, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:18:58] [INFO ] Invariant cache hit.
[2024-05-21 22:18:58] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 22:18:58] [INFO ] Invariant cache hit.
[2024-05-21 22:18:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 22:18:58] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-21 22:18:58] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 22:18:58] [INFO ] Invariant cache hit.
[2024-05-21 22:18:58] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 125/125 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-01 in 3050 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 22:18:58] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 953 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :2
[2024-05-21 22:18:58] [INFO ] Invariant cache hit.
[2024-05-21 22:18:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:59] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:18:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:18:59] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2024-05-21 22:18:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:18:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:18:59] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 22:18:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:18:59] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 12 ms.
[2024-05-21 22:18:59] [INFO ] Added : 1 causal constraints over 1 iterations in 35 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 188/188 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 125 transition count 185
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 125 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 125 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 123 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 123 transition count 168
Applied a total of 10 rules in 12 ms. Remains 123 /127 variables (removed 4) and now considering 168/188 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/127 places, 168/188 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 22:18:59] [INFO ] Computed 2 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229649 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96899 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 1) seen :4
[2024-05-21 22:19:00] [INFO ] Invariant cache hit.
[2024-05-21 22:19:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:00] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 22:19:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 22:19:00] [INFO ] [Real]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-21 22:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:19:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:00] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 22:19:00] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 22:19:01] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-21 22:19:01] [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 :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 22:19:01] [INFO ] Invariant cache hit.
[2024-05-21 22:19:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 22:19:01] [INFO ] Invariant cache hit.
[2024-05-21 22:19:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 22:19:01] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-21 22:19:01] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 22:19:01] [INFO ] Invariant cache hit.
[2024-05-21 22:19:01] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 368 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 22:19:01] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229875 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96403 resets, run finished after 498 ms. (steps per millisecond=2008 ) properties (out of 1) seen :4
[2024-05-21 22:19:03] [INFO ] Invariant cache hit.
[2024-05-21 22:19:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 22:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:03] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 22:19:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 22:19:03] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2024-05-21 22:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:19:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:03] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 22:19:03] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 22:19:03] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 11 ms.
[2024-05-21 22:19:03] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 19 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 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 6 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 8 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 22:19:03] [INFO ] Invariant cache hit.
[2024-05-21 22:19:03] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 22:19:03] [INFO ] Invariant cache hit.
[2024-05-21 22:19:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 22:19:03] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-21 22:19:03] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 22:19:03] [INFO ] Invariant cache hit.
[2024-05-21 22:19:03] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-03 in 4668 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07
// Phase 1: matrix 188 rows 127 cols
[2024-05-21 22:19:03] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 979 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-21 22:19:03] [INFO ] Invariant cache hit.
[2024-05-21 22:19:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 22:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:03] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 22:19:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:19:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:03] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 22:19:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-21 22:19:03] [INFO ] [Nat]Added 66 Read/Feed constraints in 22 ms returned sat
[2024-05-21 22:19:03] [INFO ] Computed and/alt/rep : 49/121/49 causal constraints (skipped 138 transitions) in 13 ms.
[2024-05-21 22:19:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-21 22:19:04] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-21 22:19:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-21 22:19:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 22:19:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 280 ms
[2024-05-21 22:19:04] [INFO ] Added : 24 causal constraints over 6 iterations in 389 ms. Result :sat
Minimization took 47 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, 188/188 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 126 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 125 transition count 178
Applied a total of 5 rules in 9 ms. Remains 125 /127 variables (removed 2) and now considering 178/188 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 125/127 places, 178/188 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 22:19:04] [INFO ] Computed 2 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229665 resets, run finished after 1146 ms. (steps per millisecond=872 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96282 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :0
[2024-05-21 22:19:05] [INFO ] Invariant cache hit.
[2024-05-21 22:19:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:06] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 22:19:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:19:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 22:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 22:19:06] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 22:19:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:19:06] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2024-05-21 22:19:06] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 13 ms.
[2024-05-21 22:19:06] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 22:19:06] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-21 22:19:06] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 22:19:06] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-21 22:19:06] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-21 22:19:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 310 ms
[2024-05-21 22:19:06] [INFO ] Added : 23 causal constraints over 5 iterations in 407 ms. Result :sat
Minimization took 43 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, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 22:19:06] [INFO ] Invariant cache hit.
[2024-05-21 22:19:06] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 22:19:06] [INFO ] Invariant cache hit.
[2024-05-21 22:19:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 22:19:06] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-21 22:19:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 22:19:06] [INFO ] Invariant cache hit.
[2024-05-21 22:19:07] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 125/125 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07 in 3389 ms.
[2024-05-21 22:19:07] [INFO ] Flatten gal took : 61 ms
[2024-05-21 22:19:07] [INFO ] Applying decomposition
[2024-05-21 22:19:07] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13375923942391187501.txt' '-o' '/tmp/graph13375923942391187501.bin' '-w' '/tmp/graph13375923942391187501.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13375923942391187501.bin' '-l' '-1' '-v' '-w' '/tmp/graph13375923942391187501.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:19:07] [INFO ] Decomposing Gal with order
[2024-05-21 22:19:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:19:07] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-21 22:19:07] [INFO ] Flatten gal took : 53 ms
[2024-05-21 22:19:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 14 ms.
[2024-05-21 22:19:07] [INFO ] Time to serialize gal into /tmp/UpperBounds5411508975908236830.gal : 9 ms
[2024-05-21 22:19:07] [INFO ] Time to serialize properties into /tmp/UpperBounds3819114262915229587.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5411508975908236830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3819114262915229587.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds3819114262915229587.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.63576e+08,14.3334,291724,5146,3143,273687,74223,483,1.23053e+06,286,1.60834e+06,0
Total reachable state count : 963575600

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-01 :0 <= i6.u12.l1772 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m10-UpperBounds-01,0,16.4496,291724,1,0,273687,74223,596,1.23053e+06,345,1.60834e+06,1141
Min sum of variable value : 0
Maximum sum along a path : 8
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-03 :0 <= i2.u6.l3696 <= 8
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-03 8 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m10-UpperBounds-03,0,16.5273,291724,1,0,273687,74223,626,1.23053e+06,361,1.60834e+06,1351
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-07 :0 <= i6.u8.l1710 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m10-UpperBounds-07,0,16.5354,291724,1,0,273687,74223,645,1.23053e+06,380,1.60834e+06,1428
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 55781 ms.

BK_STOP 1716329964951

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
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 r109-tall-171624208400371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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