Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292700103.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DBSingleClientW-PT-d2m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292700103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 6 12:11 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-d2m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745920164

Running Version 0
[2022-06-09 03:38:41] [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]
[2022-06-09 03:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:38:42] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2022-06-09 03:38:42] [INFO ] Transformed 4763 places.
[2022-06-09 03:38:42] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:38:42] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 283 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:38:42] [INFO ] Computed 6 place invariants in 201 ms
Incomplete random walk after 10000 steps, including 2305 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 959 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 900 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :1
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:38:43] [INFO ] Computed 6 place invariants in 102 ms
[2022-06-09 03:38:43] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2022-06-09 03:38:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:38:43] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2022-06-09 03:38:44] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:38:46] [INFO ] [Real]Added 1588 Read/Feed constraints in 2166 ms returned sat
[2022-06-09 03:38:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:38:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:38:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:38:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:38:47] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2022-06-09 03:38:52] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4036 ms returned sat
[2022-06-09 03:38:52] [INFO ] Deduced a trap composed of 50 places in 688 ms of which 5 ms to minimize.
[2022-06-09 03:38:52] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 03:38:52] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:38:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:38:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:38:53] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2022-06-09 03:38:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:38:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2022-06-09 03:38:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:38:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:38:54] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2022-06-09 03:38:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:38:58] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4269 ms returned unknown
[2022-06-09 03:38:58] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:38:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 03:38:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:38:59] [INFO ] [Real]Absence check using state equation in 702 ms returned sat
[2022-06-09 03:38:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:38:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:38:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:00] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2022-06-09 03:39:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3909 ms returned sat
[2022-06-09 03:39:05] [INFO ] Deduced a trap composed of 33 places in 758 ms of which 3 ms to minimize.
[2022-06-09 03:39:05] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[1, 0, 0]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions, 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.14 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 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1891 place count 190 transition count 526
Iterating global reduction 3 with 240 rules applied. Total rules applied 2131 place count 190 transition count 526
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2343 place count 190 transition count 314
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2367 place count 166 transition count 275
Iterating global reduction 4 with 24 rules applied. Total rules applied 2391 place count 166 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2397 place count 166 transition count 269
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2413 place count 150 transition count 253
Iterating global reduction 5 with 16 rules applied. Total rules applied 2429 place count 150 transition count 253
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 150 transition count 249
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2446 place count 137 transition count 236
Iterating global reduction 6 with 13 rules applied. Total rules applied 2459 place count 137 transition count 236
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2469 place count 137 transition count 226
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2473 place count 133 transition count 210
Iterating global reduction 7 with 4 rules applied. Total rules applied 2477 place count 133 transition count 210
Applied a total of 2477 rules in 286 ms. Remains 133 /1183 variables (removed 1050) and now considering 210/2478 (removed 2268) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/1183 places, 210/2478 transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:05] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229858 resets, run finished after 1466 ms. (steps per millisecond=682 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96602 resets, run finished after 659 ms. (steps per millisecond=1517 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 95581 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95872 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 3) seen :1
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:08] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:39:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:09] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:39:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:09] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:39:09] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:09] [INFO ] [Nat]Added 82 Read/Feed constraints in 32 ms returned sat
[2022-06-09 03:39:09] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 2 ms to minimize.
[2022-06-09 03:39:09] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:39:09] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2022-06-09 03:39:09] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:39:09] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:39:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:39:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 448 ms
[2022-06-09 03:39:09] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 25 ms.
[2022-06-09 03:39:09] [INFO ] Added : 45 causal constraints over 9 iterations in 277 ms. Result :sat
Minimization took 119 ms.
[2022-06-09 03:39:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:10] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:39:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:10] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:39:10] [INFO ] [Nat]Added 82 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:39:10] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2022-06-09 03:39:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:39:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2022-06-09 03:39:10] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 28 ms.
[2022-06-09 03:39:10] [INFO ] Added : 45 causal constraints over 9 iterations in 210 ms. Result :sat
Minimization took 75 ms.
[2022-06-09 03:39:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:10] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:39:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:10] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:39:10] [INFO ] [Nat]Added 82 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:39:10] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2022-06-09 03:39:11] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2022-06-09 03:39:11] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:39:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 235 ms
[2022-06-09 03:39:11] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 38 ms.
[2022-06-09 03:39:11] [INFO ] Added : 45 causal constraints over 9 iterations in 199 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[5, 0, 0]
Incomplete Parikh walk after 32900 steps, including 6485 resets, run finished after 75 ms. (steps per millisecond=438 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 60500 steps, including 11529 resets, run finished after 113 ms. (steps per millisecond=535 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 64200 steps, including 13643 resets, run finished after 111 ms. (steps per millisecond=578 ) properties (out of 3) seen :1 could not realise parikh vector
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 15 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:11] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:11] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:11] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:11] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:12] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2022-06-09 03:39:12] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:12] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:39:12] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229873 resets, run finished after 1420 ms. (steps per millisecond=704 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96775 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95682 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95381 resets, run finished after 634 ms. (steps per millisecond=1577 ) properties (out of 3) seen :2
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:15] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:15] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:39:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:15] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:39:15] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:15] [INFO ] [Nat]Added 82 Read/Feed constraints in 33 ms returned sat
[2022-06-09 03:39:15] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-06-09 03:39:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:39:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2022-06-09 03:39:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:39:16] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2022-06-09 03:39:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:39:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 382 ms
[2022-06-09 03:39:16] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 17 ms.
[2022-06-09 03:39:16] [INFO ] Added : 45 causal constraints over 9 iterations in 227 ms. Result :sat
Minimization took 107 ms.
[2022-06-09 03:39:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:16] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:39:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:16] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:39:16] [INFO ] [Nat]Added 82 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:39:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:39:16] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:39:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2022-06-09 03:39:16] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 17 ms.
[2022-06-09 03:39:17] [INFO ] Added : 45 causal constraints over 9 iterations in 214 ms. Result :sat
Minimization took 73 ms.
[2022-06-09 03:39:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:39:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:17] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:39:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:17] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:39:17] [INFO ] [Nat]Added 82 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:39:17] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2022-06-09 03:39:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:39:17] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:39:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 180 ms
[2022-06-09 03:39:17] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 25 ms.
[2022-06-09 03:39:17] [INFO ] Added : 45 causal constraints over 9 iterations in 184 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[5, 0, 0]
Incomplete Parikh walk after 32900 steps, including 6521 resets, run finished after 53 ms. (steps per millisecond=620 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 60500 steps, including 11501 resets, run finished after 99 ms. (steps per millisecond=611 ) properties (out of 3) seen :3 could not realise parikh vector
Incomplete Parikh walk after 64200 steps, including 13634 resets, run finished after 110 ms. (steps per millisecond=583 ) properties (out of 3) seen :2 could not realise parikh vector
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:17] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:18] [INFO ] Implicit Places using invariants in 154 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:18] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:18] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2022-06-09 03:39:18] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:18] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-00
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:18] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2328 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:18] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:39:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:39:18] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:18] [INFO ] [Real]Added 82 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:39:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:39:18] [INFO ] [Nat]Added 82 Read/Feed constraints in 30 ms returned sat
[2022-06-09 03:39:18] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-06-09 03:39:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-06-09 03:39:18] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 15 ms.
[2022-06-09 03:39:19] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:39:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2022-06-09 03:39:19] [INFO ] Added : 45 causal constraints over 9 iterations in 299 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 66300 steps, including 13665 resets, run finished after 106 ms. (steps per millisecond=625 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 131 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 129 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 129 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 128 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 128 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 127 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 127 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 126 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 123 transition count 168
Applied a total of 24 rules in 20 ms. Remains 123 /133 variables (removed 10) and now considering 168/210 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/133 places, 168/210 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:19] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229801 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 96839 resets, run finished after 488 ms. (steps per millisecond=2049 ) properties (out of 1) seen :4
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:21] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:39:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:21] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-06-09 03:39:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:39:21] [INFO ] [Real]Added 49 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:39:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:39:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:21] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:39:21] [INFO ] [Nat]Added 49 Read/Feed constraints in 19 ms returned sat
[2022-06-09 03:39:21] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:39:21] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:39:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-06-09 03:39:21] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2022-06-09 03:39:21] [INFO ] Added : 43 causal constraints over 9 iterations in 125 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 39000 steps, including 8204 resets, run finished after 53 ms. (steps per millisecond=735 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:21] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:21] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:39:22] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2022-06-09 03:39:22] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:22] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:22] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:22] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229943 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 97064 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 1) seen :4
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:23] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 03:39:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:23] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:39:23] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:39:23] [INFO ] [Real]Added 49 Read/Feed constraints in 14 ms returned sat
[2022-06-09 03:39:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:23] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 03:39:23] [INFO ] [Nat]Added 49 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:39:24] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:39:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2022-06-09 03:39:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2022-06-09 03:39:24] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2022-06-09 03:39:24] [INFO ] Added : 43 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 39000 steps, including 8124 resets, run finished after 53 ms. (steps per millisecond=735 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:24] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:39:24] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:24] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:39:24] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2022-06-09 03:39:24] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:39:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:24] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-00 in 6129 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-02
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:24] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:39:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2022-06-09 03:39:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:24] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:39:24] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:24] [INFO ] [Nat]Added 82 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:39:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-06-09 03:39:25] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2022-06-09 03:39:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2022-06-09 03:39:25] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 12 ms.
[2022-06-09 03:39:25] [INFO ] Added : 45 causal constraints over 9 iterations in 173 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 60500 steps, including 11398 resets, run finished after 100 ms. (steps per millisecond=605 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 131 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 128 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 125 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 125 transition count 179
Applied a total of 19 rules in 17 ms. Remains 125 /133 variables (removed 8) and now considering 179/210 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/133 places, 179/210 transitions.
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 03:39:25] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229848 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95466 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 03:39:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:27] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:39:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:27] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:39:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:39:27] [INFO ] [Nat]Added 58 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:39:27] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:39:27] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:39:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 6 ms to minimize.
[2022-06-09 03:39:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2022-06-09 03:39:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 253 ms
[2022-06-09 03:39:27] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 129 transitions) in 10 ms.
[2022-06-09 03:39:27] [INFO ] Added : 43 causal constraints over 9 iterations in 163 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 37300 steps, including 6949 resets, run finished after 61 ms. (steps per millisecond=611 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2022-06-09 03:39:27] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:39:27] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 03:39:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:39:28] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2022-06-09 03:39:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 03:39:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-02 in 3558 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-08
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:28] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 03:39:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:28] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-06-09 03:39:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:28] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:39:28] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 03:39:28] [INFO ] [Nat]Added 82 Read/Feed constraints in 22 ms returned sat
[2022-06-09 03:39:28] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-06-09 03:39:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2022-06-09 03:39:28] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-06-09 03:39:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 214 ms
[2022-06-09 03:39:28] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 19 ms.
[2022-06-09 03:39:28] [INFO ] Added : 45 causal constraints over 9 iterations in 176 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 32900 steps, including 6494 resets, run finished after 53 ms. (steps per millisecond=620 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 133/133 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 208
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 132 transition count 207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 199
Applied a total of 5 rules in 9 ms. Remains 131 /133 variables (removed 2) and now considering 199/210 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/133 places, 199/210 transitions.
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:39:29] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230368 resets, run finished after 1267 ms. (steps per millisecond=789 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95388 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 1) seen :0
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:39:30] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:39:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:39:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:31] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:39:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:39:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:39:31] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:39:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 03:39:31] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:39:31] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2022-06-09 03:39:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-06-09 03:39:31] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 14 ms.
[2022-06-09 03:39:31] [INFO ] Added : 45 causal constraints over 9 iterations in 167 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 23700 steps, including 4345 resets, run finished after 37 ms. (steps per millisecond=640 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:39:31] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:39:31] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:39:31] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:39:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 03:39:31] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2022-06-09 03:39:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 03:39:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:39:32] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-08 in 3731 ms.
[2022-06-09 03:39:32] [INFO ] Flatten gal took : 90 ms
[2022-06-09 03:39:32] [INFO ] Applying decomposition
[2022-06-09 03:39:32] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5313738918962316900.txt, -o, /tmp/graph5313738918962316900.bin, -w, /tmp/graph5313738918962316900.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5313738918962316900.bin, -l, -1, -v, -w, /tmp/graph5313738918962316900.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:39:32] [INFO ] Decomposing Gal with order
[2022-06-09 03:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:39:32] [INFO ] Removed a total of 181 redundant transitions.
[2022-06-09 03:39:32] [INFO ] Flatten gal took : 101 ms
[2022-06-09 03:39:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 23 ms.
[2022-06-09 03:39:32] [INFO ] Time to serialize gal into /tmp/UpperBounds7657832392767101726.gal : 12 ms
[2022-06-09 03:39:32] [INFO ] Time to serialize properties into /tmp/UpperBounds13688884112749281441.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7657832392767101726.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13688884112749281441.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7657832392767101726.gal -t CGAL -reachable-file /tmp/UpperBounds13688884112749281441.prop --nowitness
Loading property file /tmp/UpperBounds13688884112749281441.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,6.56357e+07,100.26,1717976,3733,6095,485910,919686,540,9.7623e+06,335,1.49192e+07,0
Total reachable state count : 65635684

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-00 :0 <= i1.i0.u6.l3656 <= 6
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 6 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-d2m08-UpperBounds-00,0,101.356,1717976,1,0,485910,919686,648,9.7623e+06,396,1.49192e+07,2087
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-02 :0 <= i5.u0.l1666 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-02 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-d2m08-UpperBounds-02,0,101.389,1717976,1,0,485910,919686,673,9.7623e+06,470,1.49192e+07,3054
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-08 :0 <= i6.u13.p316 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 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-d2m08-UpperBounds-08,0,101.512,1717976,1,0,485910,919686,694,9.7623e+06,475,1.49192e+07,3473

BK_STOP 1654746075441

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-d2m08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d2m08, 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 r323-tall-165472292700103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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