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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 17K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 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-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654782353799

Running Version 202205111006
[2022-06-09 13:45:54] [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 13:45:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:45:55] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2022-06-09 13:45:55] [INFO ] Transformed 4763 places.
[2022-06-09 13:45:55] [INFO ] Transformed 2478 transitions.
[2022-06-09 13:45:55] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 370 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 13:45:55] [INFO ] Computed 6 place invariants in 167 ms
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 982 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 955 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 13:45:56] [INFO ] Computed 6 place invariants in 98 ms
[2022-06-09 13:45:56] [INFO ] [Real]Absence check using 2 positive place invariants in 19 ms returned sat
[2022-06-09 13:45:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 13:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:45:57] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2022-06-09 13:45:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:45:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 13:45:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2022-06-09 13:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:45:58] [INFO ] [Nat]Absence check using state equation in 656 ms returned sat
[2022-06-09 13:45:58] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 13:45:59] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1068 ms returned sat
[2022-06-09 13:46:00] [INFO ] Deduced a trap composed of 49 places in 654 ms of which 8 ms to minimize.
[2022-06-09 13:46:00] [INFO ] Deduced a trap composed of 47 places in 672 ms of which 2 ms to minimize.
[2022-06-09 13:46:01] [INFO ] Deduced a trap composed of 48 places in 621 ms of which 2 ms to minimize.
[2022-06-09 13:46:02] [INFO ] Deduced a trap composed of 95 places in 613 ms of which 2 ms to minimize.
[2022-06-09 13:46:02] [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)
[2022-06-09 13:46:02] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 13:46:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2022-06-09 13:46:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:03] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2022-06-09 13:46:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-06-09 13:46:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 13:46:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:03] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2022-06-09 13:46:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 830 ms returned sat
[2022-06-09 13:46:05] [INFO ] Deduced a trap composed of 137 places in 568 ms of which 1 ms to minimize.
[2022-06-09 13:46:06] [INFO ] Deduced a trap composed of 118 places in 596 ms of which 1 ms to minimize.
[2022-06-09 13:46:06] [INFO ] Deduced a trap composed of 29 places in 633 ms of which 1 ms to minimize.
[2022-06-09 13:46:07] [INFO ] Deduced a trap composed of 136 places in 557 ms of which 1 ms to minimize.
[2022-06-09 13:46:08] [INFO ] Deduced a trap composed of 150 places in 575 ms of which 1 ms to minimize.
[2022-06-09 13:46:08] [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.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)
[2022-06-09 13:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-06-09 13:46:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 13:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:09] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2022-06-09 13:46:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-06-09 13:46:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 13:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:10] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2022-06-09 13:46:11] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1538 ms returned sat
[2022-06-09 13:46:12] [INFO ] Deduced a trap composed of 50 places in 624 ms of which 1 ms to minimize.
[2022-06-09 13:46:13] [INFO ] Deduced a trap composed of 50 places in 616 ms of which 1 ms to minimize.
[2022-06-09 13:46:14] [INFO ] Deduced a trap composed of 539 places in 474 ms of which 1 ms to minimize.
[2022-06-09 13:46:14] [INFO ] Deduced a trap composed of 185 places in 556 ms of which 1 ms to minimize.
[2022-06-09 13:46:14] [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: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)
Current structural bounds on expressions (after SMT) : [4, 4, 4] 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.9 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 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1316 place count 435 transition count 881
Iterating global reduction 2 with 313 rules applied. Total rules applied 1629 place count 435 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1641 place count 435 transition count 869
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1880 place count 196 transition count 528
Iterating global reduction 3 with 239 rules applied. Total rules applied 2119 place count 196 transition count 528
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2329 place count 196 transition count 318
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2354 place count 171 transition count 278
Iterating global reduction 4 with 25 rules applied. Total rules applied 2379 place count 171 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2385 place count 171 transition count 272
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2402 place count 154 transition count 255
Iterating global reduction 5 with 17 rules applied. Total rules applied 2419 place count 154 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2423 place count 154 transition count 251
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2437 place count 140 transition count 237
Iterating global reduction 6 with 14 rules applied. Total rules applied 2451 place count 140 transition count 237
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2464 place count 140 transition count 224
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2469 place count 135 transition count 200
Iterating global reduction 7 with 5 rules applied. Total rules applied 2474 place count 135 transition count 200
Applied a total of 2474 rules in 233 ms. Remains 135 /1183 variables (removed 1048) and now considering 200/2478 (removed 2278) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/1183 places, 200/2478 transitions.
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:15] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230335 resets, run finished after 1411 ms. (steps per millisecond=708 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96059 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95553 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96229 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 3) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:18] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 13:46:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:18] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 13:46:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:46:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2022-06-09 13:46:18] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 21 ms.
[2022-06-09 13:46:18] [INFO ] Added : 31 causal constraints over 7 iterations in 142 ms. Result :sat
Minimization took 45 ms.
[2022-06-09 13:46:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:18] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 13:46:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:18] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 13:46:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2022-06-09 13:46:19] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 21 ms.
[2022-06-09 13:46:19] [INFO ] Added : 14 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 36 ms.
[2022-06-09 13:46:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:19] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 13:46:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:19] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 13:46:19] [INFO ] [Nat]Added 75 Read/Feed constraints in 32 ms returned sat
[2022-06-09 13:46:19] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 34 ms.
[2022-06-09 13:46:19] [INFO ] Added : 14 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4] Max seen :[0, 0, 0]
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 200/200 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 200/200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 200/200 transitions.
Applied a total of 0 rules in 9 ms. Remains 135 /135 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:46:19] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:46:19] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-06-09 13:46:19] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:19] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 200/200 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:20] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 985 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:20] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:46:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 13:46:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:20] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 13:46:20] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:46:20] [INFO ] [Nat]Added 75 Read/Feed constraints in 21 ms returned sat
[2022-06-09 13:46:20] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 18 ms.
[2022-06-09 13:46:20] [INFO ] Added : 31 causal constraints over 7 iterations in 148 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 177
Applied a total of 18 rules in 19 ms. Remains 127 /135 variables (removed 8) and now considering 177/200 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/135 places, 177/200 transitions.
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 13:46:20] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230002 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96123 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 1) seen :0
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 13:46:22] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 13:46:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:22] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 13:46:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:22] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-06-09 13:46:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-09 13:46:22] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2022-06-09 13:46:22] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 126 transitions) in 13 ms.
[2022-06-09 13:46:22] [INFO ] Added : 20 causal constraints over 5 iterations in 95 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 177/177 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 13:46:22] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:46:22] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 13:46:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:46:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-09 13:46:22] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2022-06-09 13:46:22] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 13:46:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:46:22] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 177/177 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00 in 2935 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-03
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:22] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2278 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 978 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:46:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:23] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 13:46:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:23] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 13:46:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:46:23] [INFO ] [Nat]Added 75 Read/Feed constraints in 26 ms returned sat
[2022-06-09 13:46:23] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 16 ms.
[2022-06-09 13:46:23] [INFO ] Added : 14 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 179
Applied a total of 18 rules in 14 ms. Remains 127 /135 variables (removed 8) and now considering 179/200 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/135 places, 179/200 transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 13:46:23] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230089 resets, run finished after 1187 ms. (steps per millisecond=842 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95952 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 13:46:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:46:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:25] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 13:46:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:25] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-06-09 13:46:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 13:46:25] [INFO ] [Nat]Added 58 Read/Feed constraints in 8 ms returned sat
[2022-06-09 13:46:25] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 12 ms.
[2022-06-09 13:46:25] [INFO ] Added : 17 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 13:46:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:25] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 13:46:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:46:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 13:46:25] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2022-06-09 13:46:25] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 13:46:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:25] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-03 in 2822 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:25] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 13:46:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 13:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:25] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 13:46:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:25] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 13:46:25] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 13:46:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 32 ms returned sat
[2022-06-09 13:46:26] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 13 ms.
[2022-06-09 13:46:26] [INFO ] Added : 14 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 135/135 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 180
Applied a total of 18 rules in 21 ms. Remains 127 /135 variables (removed 8) and now considering 180/200 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/135 places, 180/200 transitions.
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 13:46:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230241 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95977 resets, run finished after 575 ms. (steps per millisecond=1739 ) properties (out of 1) seen :0
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 13:46:27] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:46:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:28] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 13:46:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 13:46:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 13:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 13:46:28] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 13:46:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-09 13:46:28] [INFO ] [Nat]Added 59 Read/Feed constraints in 21 ms returned sat
[2022-06-09 13:46:28] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2022-06-09 13:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-09 13:46:28] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 10 ms.
[2022-06-09 13:46:28] [INFO ] Added : 18 causal constraints over 4 iterations in 84 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 13:46:28] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:46:28] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 13:46:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 13:46:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-09 13:46:28] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2022-06-09 13:46:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 13:46:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 13:46:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 2985 ms.
[2022-06-09 13:46:28] [INFO ] Flatten gal took : 47 ms
[2022-06-09 13:46:28] [INFO ] Applying decomposition
[2022-06-09 13:46:29] [INFO ] Flatten gal took : 17 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/graph2493210773683094828.txt' '-o' '/tmp/graph2493210773683094828.bin' '-w' '/tmp/graph2493210773683094828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2493210773683094828.bin' '-l' '-1' '-v' '-w' '/tmp/graph2493210773683094828.weights' '-q' '0' '-e' '0.001'
[2022-06-09 13:46:29] [INFO ] Decomposing Gal with order
[2022-06-09 13:46:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 13:46:29] [INFO ] Removed a total of 215 redundant transitions.
[2022-06-09 13:46:29] [INFO ] Flatten gal took : 60 ms
[2022-06-09 13:46:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 9 ms.
[2022-06-09 13:46:29] [INFO ] Time to serialize gal into /tmp/UpperBounds12936184014745345831.gal : 5 ms
[2022-06-09 13:46:29] [INFO ] Time to serialize properties into /tmp/UpperBounds7138696076352558110.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/UpperBounds12936184014745345831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7138696076352558110.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...275
Loading property file /tmp/UpperBounds7138696076352558110.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,27476,0.283602,15492,628,583,14134,5724,523,46105,223,29738,0
Total reachable state count : 27476

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-00 :0 <= i4.u5.l2185 <= 1
FORMULA DBSingleClientW-PT-d2m04-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-d2m04-UpperBounds-00,0,0.294544,15492,1,0,14134,5724,644,46105,256,29738,870
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-03 :0 <= i4.u5.l2579 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 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-d2m04-UpperBounds-03,0,0.296275,15492,1,0,14134,5724,666,46105,277,29738,1161
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-10 :0 <= i5.u13.l2580 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 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-d2m04-UpperBounds-10,0,0.297548,15492,1,0,14134,5724,702,46105,282,29738,1456
Total runtime 34626 ms.

BK_STOP 1654782389592

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d2m04, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472282000245"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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