fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r127-tall-167814504300038
Last Updated
May 14, 2023

About the Execution of 2022-gold for DBSingleClientW-PT-d2m05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
639.168 35485.00 56567.00 113.50 1 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504300038.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 gold2022
Input is DBSingleClientW-PT-d2m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K 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-d2m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174557570

Running Version 202205111006
[2023-03-07 07:35:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-07 07:35:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:35:59] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2023-03-07 07:35:59] [INFO ] Transformed 4763 places.
[2023-03-07 07:35:59] [INFO ] Transformed 2478 transitions.
[2023-03-07 07:35:59] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 359 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-07 07:35:59] [INFO ] Computed 6 place invariants in 158 ms
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 921 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 874 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-07 07:36:00] [INFO ] Computed 6 place invariants in 115 ms
[2023-03-07 07:36:00] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2023-03-07 07:36:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-07 07:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:01] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2023-03-07 07:36:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-07 07:36:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-07 07:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:02] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2023-03-07 07:36:02] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-07 07:36:03] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1048 ms returned sat
[2023-03-07 07:36:04] [INFO ] Deduced a trap composed of 75 places in 683 ms of which 22 ms to minimize.
[2023-03-07 07:36:04] [INFO ] Deduced a trap composed of 56 places in 645 ms of which 2 ms to minimize.
[2023-03-07 07:36:05] [INFO ] Deduced a trap composed of 194 places in 619 ms of which 4 ms to minimize.
[2023-03-07 07:36:06] [INFO ] Deduced a trap composed of 239 places in 583 ms of which 3 ms to minimize.
[2023-03-07 07:36:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-07 07:36:06] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-07 07:36:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-07 07:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:07] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2023-03-07 07:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-07 07:36:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2023-03-07 07:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:08] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2023-03-07 07:36:09] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1030 ms returned sat
[2023-03-07 07:36:09] [INFO ] Deduced a trap composed of 76 places in 611 ms of which 1 ms to minimize.
[2023-03-07 07:36:10] [INFO ] Deduced a trap composed of 56 places in 618 ms of which 1 ms to minimize.
[2023-03-07 07:36:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1558 ms
[2023-03-07 07:36:11] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 732 ms.
[2023-03-07 07:36:12] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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-07 07:36:12] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-07 07:36:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-07 07:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:13] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2023-03-07 07:36:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-07 07:36:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-07 07:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:13] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-07 07:36:14] [INFO ] [Nat]Added 1588 Read/Feed constraints in 974 ms returned sat
[2023-03-07 07:36:15] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 653 ms.
[2023-03-07 07:36:16] [INFO ] Added : 10 causal constraints over 3 iterations in 1365 ms. Result :sat
Minimization took 966 ms.
Current structural bounds on expressions (after SMT) : [1944, 1944, 7] Max seen :[0, 0, 0]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.13 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 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1324 place count 430 transition count 876
Iterating global reduction 2 with 315 rules applied. Total rules applied 1639 place count 430 transition count 876
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1651 place count 430 transition count 864
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1890 place count 191 transition count 524
Iterating global reduction 3 with 239 rules applied. Total rules applied 2129 place count 191 transition count 524
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2339 place count 191 transition count 314
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2364 place count 166 transition count 274
Iterating global reduction 4 with 25 rules applied. Total rules applied 2389 place count 166 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2395 place count 166 transition count 268
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2412 place count 149 transition count 251
Iterating global reduction 5 with 17 rules applied. Total rules applied 2429 place count 149 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2433 place count 149 transition count 247
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2447 place count 135 transition count 233
Iterating global reduction 6 with 14 rules applied. Total rules applied 2461 place count 135 transition count 233
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2474 place count 135 transition count 220
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2480 place count 129 transition count 191
Iterating global reduction 7 with 6 rules applied. Total rules applied 2486 place count 129 transition count 191
Applied a total of 2486 rules in 234 ms. Remains 129 /1183 variables (removed 1054) and now considering 191/2478 (removed 2287) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/1183 places, 191/2478 transitions.
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:17] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230092 resets, run finished after 1229 ms. (steps per millisecond=813 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95926 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95439 resets, run finished after 547 ms. (steps per millisecond=1828 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95544 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:20] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-07 07:36:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:20] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-07 07:36:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:20] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-07 07:36:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-07 07:36:20] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2023-03-07 07:36:20] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 13 ms.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2023-03-07 07:36:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 397 ms
[2023-03-07 07:36:21] [INFO ] Added : 20 causal constraints over 5 iterations in 522 ms. Result :sat
Minimization took 40 ms.
[2023-03-07 07:36:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:21] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-07 07:36:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:21] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-07 07:36:21] [INFO ] [Nat]Added 67 Read/Feed constraints in 22 ms returned sat
[2023-03-07 07:36:21] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 11 ms.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-07 07:36:21] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-07 07:36:22] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2023-03-07 07:36:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 312 ms
[2023-03-07 07:36:22] [INFO ] Added : 19 causal constraints over 5 iterations in 412 ms. Result :sat
Minimization took 37 ms.
[2023-03-07 07:36:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:22] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-07 07:36:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:22] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-07 07:36:22] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2023-03-07 07:36:22] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 11 ms.
[2023-03-07 07:36:22] [INFO ] Added : 11 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1944, 1944, 7] Max seen :[0, 0, 0]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 191/191 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 191/191 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 191/191 transitions.
Applied a total of 0 rules in 10 ms. Remains 129 /129 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:22] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:36:22] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-07 07:36:22] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-07 07:36:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:22] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-07 07:36:23] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 191/191 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-00
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:23] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2298 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 920 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:23] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:23] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-07 07:36:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:23] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-07 07:36:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-07 07:36:23] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-07 07:36:23] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 17 ms.
[2023-03-07 07:36:23] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-07 07:36:23] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-07 07:36:23] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-07 07:36:23] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-07 07:36:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 289 ms
[2023-03-07 07:36:23] [INFO ] Added : 20 causal constraints over 5 iterations in 403 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 191/191 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 127 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 126 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 125 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 125 transition count 178
Applied a total of 10 rules in 21 ms. Remains 125 /129 variables (removed 4) and now considering 178/191 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/129 places, 178/191 transitions.
// Phase 1: matrix 178 rows 125 cols
[2023-03-07 07:36:23] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229656 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95137 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :0
// Phase 1: matrix 178 rows 125 cols
[2023-03-07 07:36:25] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-07 07:36:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:25] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-07 07:36:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:25] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-07 07:36:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-07 07:36:25] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2023-03-07 07:36:25] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-07 07:36:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-07 07:36:25] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 9 ms.
[2023-03-07 07:36:25] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-07 07:36:25] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2023-03-07 07:36:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-07 07:36:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2023-03-07 07:36:25] [INFO ] Added : 16 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 34 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 SAFETY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 125 cols
[2023-03-07 07:36:26] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-07 07:36:26] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 178 rows 125 cols
[2023-03-07 07:36:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:36:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-07 07:36:26] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-07 07:36:26] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 178 rows 125 cols
[2023-03-07 07:36:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:26] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-00 in 3431 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2350 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 942 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:26] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:26] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-07 07:36:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:26] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-07 07:36:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-07 07:36:26] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2023-03-07 07:36:26] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 12 ms.
[2023-03-07 07:36:26] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-07 07:36:26] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2023-03-07 07:36:26] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-07 07:36:27] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-07 07:36:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 301 ms
[2023-03-07 07:36:27] [INFO ] Added : 19 causal constraints over 5 iterations in 397 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 191/191 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 189
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 127 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 126 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 126 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 126 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 125 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 125 transition count 179
Applied a total of 10 rules in 14 ms. Remains 125 /129 variables (removed 4) and now considering 179/191 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/129 places, 179/191 transitions.
// Phase 1: matrix 179 rows 125 cols
[2023-03-07 07:36:27] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229713 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96418 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 125 cols
[2023-03-07 07:36:28] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-07 07:36:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-07 07:36:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:28] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-07 07:36:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-07 07:36:28] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2023-03-07 07:36:28] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 129 transitions) in 11 ms.
[2023-03-07 07:36:29] [INFO ] Added : 23 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 37 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 SAFETY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 179/179 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 125 cols
[2023-03-07 07:36:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:36:29] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2023-03-07 07:36:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-07 07:36:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-07 07:36:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2023-03-07 07:36:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 3047 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-11
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:29] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 951 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 191 rows 129 cols
[2023-03-07 07:36:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-07 07:36:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-07 07:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-07 07:36:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-07 07:36:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-07 07:36:29] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2023-03-07 07:36:29] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 11 ms.
[2023-03-07 07:36:29] [INFO ] Added : 11 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 129/129 places, 191/191 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 188
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 127 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 126 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 126 transition count 178
Applied a total of 8 rules in 15 ms. Remains 126 /129 variables (removed 3) and now considering 178/191 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/129 places, 178/191 transitions.
// Phase 1: matrix 178 rows 126 cols
[2023-03-07 07:36:29] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230292 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95267 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 1) seen :0
// Phase 1: matrix 178 rows 126 cols
[2023-03-07 07:36:31] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-07 07:36:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:31] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-07 07:36:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:36:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-07 07:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:36:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-07 07:36:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-07 07:36:31] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2023-03-07 07:36:31] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 127 transitions) in 12 ms.
[2023-03-07 07:36:31] [INFO ] Added : 11 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 27 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 SAFETY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 178/178 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 126 cols
[2023-03-07 07:36:31] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-07 07:36:31] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 178 rows 126 cols
[2023-03-07 07:36:31] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-07 07:36:32] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-07 07:36:32] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 178 rows 126 cols
[2023-03-07 07:36:32] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-07 07:36:32] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-11 in 2595 ms.
[2023-03-07 07:36:32] [INFO ] Flatten gal took : 50 ms
[2023-03-07 07:36:32] [INFO ] Applying decomposition
[2023-03-07 07:36:32] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3815455057207185805.txt' '-o' '/tmp/graph3815455057207185805.bin' '-w' '/tmp/graph3815455057207185805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3815455057207185805.bin' '-l' '-1' '-v' '-w' '/tmp/graph3815455057207185805.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:36:32] [INFO ] Decomposing Gal with order
[2023-03-07 07:36:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:36:32] [INFO ] Removed a total of 201 redundant transitions.
[2023-03-07 07:36:32] [INFO ] Flatten gal took : 55 ms
[2023-03-07 07:36:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 11 ms.
[2023-03-07 07:36:32] [INFO ] Time to serialize gal into /tmp/UpperBounds8921520692518665939.gal : 9 ms
[2023-03-07 07:36:32] [INFO ] Time to serialize properties into /tmp/UpperBounds7199818571648647377.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8921520692518665939.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7199818571648647377.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds7199818571648647377.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,202732,0.343028,16456,927,874,14626,8357,518,45421,259,39144,0
Total reachable state count : 202732

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-00 :0 <= i3.u11.l1782 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 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-d2m05-UpperBounds-00,0,0.367089,16456,1,0,14626,8357,633,45421,300,39144,727
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-05 :0 <= i3.u1.l1804 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-05 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-d2m05-UpperBounds-05,0,0.367467,16456,1,0,14626,8357,654,45421,307,39144,805
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-11 :0 <= i1.u9.p92 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 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-d2m05-UpperBounds-11,0,0.368173,16456,1,0,14626,8357,677,45421,323,39144,950
Total runtime 34199 ms.

BK_STOP 1678174593055

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-d2m05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is DBSingleClientW-PT-d2m05, 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 r127-tall-167814504300038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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