Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 15:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678248093831

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 04:01:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 04:01:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:01:35] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-08 04:01:35] [INFO ] Transformed 4763 places.
[2023-03-08 04:01:35] [INFO ] Transformed 2478 transitions.
[2023-03-08 04:01:35] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 15 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 04:01:35] [INFO ] Computed 6 place invariants in 158 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 949 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 961 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 935 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
[2023-03-08 04:01:36] [INFO ] Invariant cache hit.
[2023-03-08 04:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2023-03-08 04:01:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned unsat
[2023-03-08 04:01:37] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 04:01:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 04:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:38] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2023-03-08 04:01:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-08 04:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 04:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:39] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2023-03-08 04:01:39] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 04:01:40] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1173 ms returned sat
[2023-03-08 04:01:41] [INFO ] Deduced a trap composed of 28 places in 1529 ms of which 115 ms to minimize.
[2023-03-08 04:01:42] [INFO ] Deduced a trap composed of 50 places in 671 ms of which 3 ms to minimize.
[2023-03-08 04:01:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2936 ms
[2023-03-08 04:01:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 04:01:43] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 04:01:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 04:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:44] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-08 04:01:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:01:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 04:01:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2023-03-08 04:01:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:44] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-08 04:01:45] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1013 ms returned sat
[2023-03-08 04:01:46] [INFO ] Deduced a trap composed of 141 places in 574 ms of which 2 ms to minimize.
[2023-03-08 04:01:47] [INFO ] Deduced a trap composed of 158 places in 579 ms of which 1 ms to minimize.
[2023-03-08 04:01:47] [INFO ] Deduced a trap composed of 138 places in 609 ms of which 2 ms to minimize.
[2023-03-08 04:01:48] [INFO ] Deduced a trap composed of 83 places in 626 ms of which 1 ms to minimize.
[2023-03-08 04:01:49] [INFO ] Deduced a trap composed of 115 places in 623 ms of which 1 ms to minimize.
[2023-03-08 04:01:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 04:01:49] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 04:01:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 04:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:50] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2023-03-08 04:01:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:01:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 04:01:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 04:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:50] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2023-03-08 04:01:51] [INFO ] [Nat]Added 1588 Read/Feed constraints in 899 ms returned sat
[2023-03-08 04:01:52] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 575 ms.
[2023-03-08 04:01:52] [INFO ] Added : 9 causal constraints over 2 iterations in 1036 ms. Result :sat
Minimization took 954 ms.
[2023-03-08 04:01:54] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 04:01:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 04:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:54] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-03-08 04:01:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:01:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 04:01:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 04:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:55] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2023-03-08 04:01:56] [INFO ] [Nat]Added 1588 Read/Feed constraints in 661 ms returned sat
[2023-03-08 04:01:56] [INFO ] Deduced a trap composed of 194 places in 584 ms of which 2 ms to minimize.
[2023-03-08 04:01:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2023-03-08 04:01:57] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 577 ms.
[2023-03-08 04:01:57] [INFO ] Added : 5 causal constraints over 1 iterations in 859 ms. Result :sat
Minimization took 559 ms.
[2023-03-08 04:01:58] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 04:01:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 04:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:59] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2023-03-08 04:01:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:01:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 04:01:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 04:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:01:59] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-08 04:02:00] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1101 ms returned sat
[2023-03-08 04:02:01] [INFO ] Deduced a trap composed of 38 places in 664 ms of which 1 ms to minimize.
[2023-03-08 04:02:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1078 ms
[2023-03-08 04:02:02] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 430 ms.
[2023-03-08 04:02:03] [INFO ] Deduced a trap composed of 47 places in 661 ms of which 1 ms to minimize.
[2023-03-08 04:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 837 ms
[2023-03-08 04:02:04] [INFO ] Deduced a trap composed of 49 places in 697 ms of which 2 ms to minimize.
[2023-03-08 04:02:04] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 4, 4, 7, 4, 6] Max seen :[1, 0, 0, 0, 0, 0]
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 387 places :
Symmetric choice reduction at 1 with 387 rule applications. Total rules 605 place count 749 transition count 1221
Iterating global reduction 1 with 387 rules applied. Total rules applied 992 place count 749 transition count 1221
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1010 place count 749 transition count 1203
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1322 place count 437 transition count 891
Iterating global reduction 2 with 312 rules applied. Total rules applied 1634 place count 437 transition count 891
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1646 place count 437 transition count 879
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1883 place count 200 transition count 546
Iterating global reduction 3 with 237 rules applied. Total rules applied 2120 place count 200 transition count 546
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2329 place count 200 transition count 337
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2353 place count 176 transition count 298
Iterating global reduction 4 with 24 rules applied. Total rules applied 2377 place count 176 transition count 298
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2389 place count 176 transition count 286
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2404 place count 161 transition count 271
Iterating global reduction 5 with 15 rules applied. Total rules applied 2419 place count 161 transition count 271
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2423 place count 161 transition count 267
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2435 place count 149 transition count 255
Iterating global reduction 6 with 12 rules applied. Total rules applied 2447 place count 149 transition count 255
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2456 place count 149 transition count 246
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2459 place count 146 transition count 237
Iterating global reduction 7 with 3 rules applied. Total rules applied 2462 place count 146 transition count 237
Applied a total of 2462 rules in 220 ms. Remains 146 /1183 variables (removed 1037) and now considering 237/2478 (removed 2241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 146/1183 places, 237/2478 transitions.
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 04:02:05] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230544 resets, run finished after 1330 ms. (steps per millisecond=751 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95526 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95640 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95446 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95638 resets, run finished after 604 ms. (steps per millisecond=1655 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95740 resets, run finished after 613 ms. (steps per millisecond=1631 ) properties (out of 5) seen :0
[2023-03-08 04:02:09] [INFO ] Invariant cache hit.
[2023-03-08 04:02:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:09] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 04:02:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:09] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:02:09] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:09] [INFO ] [Nat]Added 98 Read/Feed constraints in 28 ms returned sat
[2023-03-08 04:02:09] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 14 ms.
[2023-03-08 04:02:09] [INFO ] Added : 20 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 55 ms.
[2023-03-08 04:02:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 04:02:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:10] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Nat]Added 98 Read/Feed constraints in 20 ms returned sat
[2023-03-08 04:02:10] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 16 ms.
[2023-03-08 04:02:10] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-08 04:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 04:02:10] [INFO ] Added : 17 causal constraints over 5 iterations in 214 ms. Result :sat
Minimization took 53 ms.
[2023-03-08 04:02:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 04:02:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:10] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Nat]Added 98 Read/Feed constraints in 20 ms returned sat
[2023-03-08 04:02:10] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 14 ms.
[2023-03-08 04:02:10] [INFO ] Added : 16 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 63 ms.
[2023-03-08 04:02:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 04:02:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:10] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:02:10] [INFO ] [Nat]Added 98 Read/Feed constraints in 14 ms returned sat
[2023-03-08 04:02:10] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 15 ms.
[2023-03-08 04:02:11] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-03-08 04:02:11] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-08 04:02:11] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-08 04:02:11] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-08 04:02:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 315 ms
[2023-03-08 04:02:11] [INFO ] Added : 19 causal constraints over 5 iterations in 467 ms. Result :sat
Minimization took 72 ms.
[2023-03-08 04:02:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:11] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 04:02:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:11] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 04:02:11] [INFO ] [Nat]Added 98 Read/Feed constraints in 25 ms returned sat
[2023-03-08 04:02:11] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-08 04:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-08 04:02:11] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 20 ms.
[2023-03-08 04:02:11] [INFO ] Added : 14 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 7, 4, 6] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Applied a total of 0 rules in 16 ms. Remains 146 /146 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 146/146 places, 237/237 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Applied a total of 0 rules in 8 ms. Remains 146 /146 variables (removed 0) and now considering 237/237 (removed 0) transitions.
[2023-03-08 04:02:12] [INFO ] Invariant cache hit.
[2023-03-08 04:02:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:02:12] [INFO ] Invariant cache hit.
[2023-03-08 04:02:12] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:12] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-08 04:02:12] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 04:02:12] [INFO ] Invariant cache hit.
[2023-03-08 04:02:12] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 146/146 places, 237/237 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05
[2023-03-08 04:02:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2249 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 991 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 04:02:12] [INFO ] Invariant cache hit.
[2023-03-08 04:02:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:13] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 04:02:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:13] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 04:02:13] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:13] [INFO ] [Nat]Added 98 Read/Feed constraints in 28 ms returned sat
[2023-03-08 04:02:13] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 21 ms.
[2023-03-08 04:02:13] [INFO ] Added : 20 causal constraints over 4 iterations in 100 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 138 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 138 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 135 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 135 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 135 transition count 215
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 132 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 132 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 130 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 130 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 127 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 127 transition count 180
Applied a total of 45 rules in 29 ms. Remains 127 /146 variables (removed 19) and now considering 180/237 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 127/146 places, 180/237 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 04:02:13] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230155 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95779 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
[2023-03-08 04:02:14] [INFO ] Invariant cache hit.
[2023-03-08 04:02:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 04:02:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:15] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 04:02:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 04:02:15] [INFO ] [Nat]Added 59 Read/Feed constraints in 20 ms returned sat
[2023-03-08 04:02:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-08 04:02:15] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2023-03-08 04:02:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-08 04:02:15] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-08 04:02:15] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-08 04:02:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 317 ms
[2023-03-08 04:02:15] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 10 ms.
[2023-03-08 04:02:15] [INFO ] Added : 14 causal constraints over 3 iterations in 55 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 04:02:15] [INFO ] Invariant cache hit.
[2023-03-08 04:02:15] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 04:02:15] [INFO ] Invariant cache hit.
[2023-03-08 04:02:15] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 04:02:15] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-08 04:02:15] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 04:02:15] [INFO ] Invariant cache hit.
[2023-03-08 04:02:15] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05 in 3051 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 04:02:15] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1055 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 04:02:15] [INFO ] Invariant cache hit.
[2023-03-08 04:02:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:16] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 04:02:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 04:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:16] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 04:02:16] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:16] [INFO ] [Nat]Added 98 Read/Feed constraints in 27 ms returned sat
[2023-03-08 04:02:16] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 04:02:16] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-08 04:02:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 04:02:16] [INFO ] Added : 17 causal constraints over 5 iterations in 185 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 138 transition count 223
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 138 transition count 222
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 135 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 135 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 135 transition count 216
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 132 transition count 206
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 132 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 130 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 130 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 42 place count 127 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 127 transition count 180
Applied a total of 45 rules in 21 ms. Remains 127 /146 variables (removed 19) and now considering 180/237 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 127/146 places, 180/237 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 04:02:16] [INFO ] Computed 2 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 229941 resets, run finished after 1012 ms. (steps per millisecond=988 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95808 resets, run finished after 503 ms. (steps per millisecond=1988 ) properties (out of 1) seen :0
[2023-03-08 04:02:18] [INFO ] Invariant cache hit.
[2023-03-08 04:02:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:18] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 04:02:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:18] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 04:02:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 04:02:18] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2023-03-08 04:02:18] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2023-03-08 04:02:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 04:02:18] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 16 ms.
[2023-03-08 04:02:18] [INFO ] Added : 13 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 04:02:18] [INFO ] Invariant cache hit.
[2023-03-08 04:02:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 04:02:18] [INFO ] Invariant cache hit.
[2023-03-08 04:02:18] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 04:02:18] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 04:02:18] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:02:18] [INFO ] Invariant cache hit.
[2023-03-08 04:02:18] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 556 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07 in 3009 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 04:02:18] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2345 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 04:02:18] [INFO ] Invariant cache hit.
[2023-03-08 04:02:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 04:02:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:19] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-08 04:02:19] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:19] [INFO ] [Nat]Added 98 Read/Feed constraints in 21 ms returned sat
[2023-03-08 04:02:19] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 16 ms.
[2023-03-08 04:02:19] [INFO ] Added : 16 causal constraints over 4 iterations in 104 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 138 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 134 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 134 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 134 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 131 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 131 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 129 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 129 transition count 203
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 126 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 126 transition count 179
Applied a total of 47 rules in 23 ms. Remains 126 /146 variables (removed 20) and now considering 179/237 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 126/146 places, 179/237 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-08 04:02:19] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229706 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96637 resets, run finished after 474 ms. (steps per millisecond=2109 ) properties (out of 1) seen :0
[2023-03-08 04:02:20] [INFO ] Invariant cache hit.
[2023-03-08 04:02:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:20] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 04:02:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:21] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 04:02:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 04:02:21] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2023-03-08 04:02:21] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 128 transitions) in 11 ms.
[2023-03-08 04:02:21] [INFO ] Added : 16 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-08 04:02:21] [INFO ] Invariant cache hit.
[2023-03-08 04:02:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 04:02:21] [INFO ] Invariant cache hit.
[2023-03-08 04:02:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 04:02:21] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 04:02:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:02:21] [INFO ] Invariant cache hit.
[2023-03-08 04:02:21] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 2683 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-13
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 04:02:21] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2277 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 984 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 04:02:21] [INFO ] Invariant cache hit.
[2023-03-08 04:02:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:21] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 04:02:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:21] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-08 04:02:21] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:21] [INFO ] [Nat]Added 98 Read/Feed constraints in 14 ms returned sat
[2023-03-08 04:02:21] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 04:02:22] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2023-03-08 04:02:22] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-08 04:02:22] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-08 04:02:22] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-08 04:02:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 310 ms
[2023-03-08 04:02:22] [INFO ] Added : 19 causal constraints over 5 iterations in 454 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 233
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 233
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 138 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 135 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 135 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 25 place count 135 transition count 218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 28 place count 132 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 131 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 39 place count 128 transition count 178
Iterating global reduction 3 with 3 rules applied. Total rules applied 42 place count 128 transition count 178
Applied a total of 42 rules in 16 ms. Remains 128 /146 variables (removed 18) and now considering 178/237 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 128/146 places, 178/237 transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 04:02:22] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229938 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95833 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :0
[2023-03-08 04:02:23] [INFO ] Invariant cache hit.
[2023-03-08 04:02:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:23] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-08 04:02:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:24] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-08 04:02:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 04:02:24] [INFO ] [Nat]Added 54 Read/Feed constraints in 13 ms returned sat
[2023-03-08 04:02:24] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 126 transitions) in 12 ms.
[2023-03-08 04:02:24] [INFO ] Added : 6 causal constraints over 2 iterations in 43 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-08 04:02:24] [INFO ] Invariant cache hit.
[2023-03-08 04:02:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 04:02:24] [INFO ] Invariant cache hit.
[2023-03-08 04:02:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 04:02:24] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-08 04:02:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:02:24] [INFO ] Invariant cache hit.
[2023-03-08 04:02:24] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 452 ms. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-13 in 2998 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 04:02:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 959 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 04:02:24] [INFO ] Invariant cache hit.
[2023-03-08 04:02:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:24] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 04:02:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:24] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-08 04:02:24] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 04:02:24] [INFO ] [Nat]Added 98 Read/Feed constraints in 29 ms returned sat
[2023-03-08 04:02:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-08 04:02:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 04:02:24] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 04:02:25] [INFO ] Added : 14 causal constraints over 3 iterations in 91 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 237/237 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 142 transition count 231
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 142 transition count 231
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 138 transition count 226
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 138 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 138 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 135 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 135 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 135 transition count 217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 29 place count 132 transition count 201
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 132 transition count 201
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 131 transition count 200
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 131 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 131 transition count 199
Applied a total of 35 rules in 15 ms. Remains 131 /146 variables (removed 15) and now considering 199/237 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 131/146 places, 199/237 transitions.
// Phase 1: matrix 199 rows 131 cols
[2023-03-08 04:02:25] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230363 resets, run finished after 1123 ms. (steps per millisecond=890 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96302 resets, run finished after 517 ms. (steps per millisecond=1934 ) properties (out of 1) seen :0
[2023-03-08 04:02:26] [INFO ] Invariant cache hit.
[2023-03-08 04:02:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 04:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:26] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 04:02:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:02:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 04:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:02:26] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 04:02:26] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 04:02:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 23 ms returned sat
[2023-03-08 04:02:26] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 12 ms.
[2023-03-08 04:02:27] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-08 04:02:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 04:02:27] [INFO ] Added : 15 causal constraints over 4 iterations in 160 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-08 04:02:27] [INFO ] Invariant cache hit.
[2023-03-08 04:02:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:02:27] [INFO ] Invariant cache hit.
[2023-03-08 04:02:27] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 04:02:27] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-08 04:02:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:02:27] [INFO ] Invariant cache hit.
[2023-03-08 04:02:27] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15 in 3043 ms.
[2023-03-08 04:02:27] [INFO ] Flatten gal took : 55 ms
[2023-03-08 04:02:27] [INFO ] Applying decomposition
[2023-03-08 04:02:27] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4952256775748531860.txt' '-o' '/tmp/graph4952256775748531860.bin' '-w' '/tmp/graph4952256775748531860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4952256775748531860.bin' '-l' '-1' '-v' '-w' '/tmp/graph4952256775748531860.weights' '-q' '0' '-e' '0.001'
[2023-03-08 04:02:27] [INFO ] Decomposing Gal with order
[2023-03-08 04:02:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 04:02:28] [INFO ] Removed a total of 187 redundant transitions.
[2023-03-08 04:02:28] [INFO ] Flatten gal took : 49 ms
[2023-03-08 04:02:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 158 labels/synchronizations in 10 ms.
[2023-03-08 04:02:28] [INFO ] Time to serialize gal into /tmp/UpperBounds3228960810173108072.gal : 5 ms
[2023-03-08 04:02:28] [INFO ] Time to serialize properties into /tmp/UpperBounds4554004736142992632.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3228960810173108072.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4554004736142992632.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4554004736142992632.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,35040,0.538882,25236,804,1530,15541,26811,561,47831,384,125324,0
Total reachable state count : 35040

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-05 :0 <= i4.u3.l2146 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-05,0,0.564552,25236,1,0,15541,26811,692,47831,451,125324,833
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-07 :0 <= i4.u3.l2894 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-07,0,0.565343,25236,1,0,15541,26811,707,47831,460,125324,882
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-10 :0 <= i4.u8.p34 <= 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.565673,25236,1,0,15541,26811,726,47831,474,125324,939
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-13 :0 <= i6.u18.l4106 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 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-13,0,0.566852,25236,1,0,15541,26811,754,47831,479,125324,1048
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-15 :0 <= i4.u13.p311 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 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-15,0,0.567433,25236,1,0,15541,26811,769,47831,479,125324,1082
Total runtime 53426 ms.

BK_STOP 1678248154336

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-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-5348"
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 r101-tall-167814475200293"
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 ;