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

About the Execution of Marcie+red for DBSingleClientW-PT-d2m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.128 69814.00 91456.00 571.20 0 0 0 1 0 1 0 1 0 0 1 0 0 1 0 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482500293.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 marciexred
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 r106-tall-167814482500293
=====================================================================

--------------------
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 1678359811017

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 11:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 11:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:03:32] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2023-03-09 11:03:32] [INFO ] Transformed 4763 places.
[2023-03-09 11:03:32] [INFO ] Transformed 2478 transitions.
[2023-03-09 11:03:32] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 345 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-09 11:03:33] [INFO ] Computed 6 place invariants in 158 ms
Incomplete random walk after 10000 steps, including 2339 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 994 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 971 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 875 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 997 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
[2023-03-09 11:03:33] [INFO ] Invariant cache hit.
[2023-03-09 11:03:33] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-09 11:03:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-09 11:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:34] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2023-03-09 11:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:03:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 19 ms returned sat
[2023-03-09 11:03:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-09 11:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:35] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2023-03-09 11:03:35] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-09 11:03:36] [INFO ] [Nat]Added 1588 Read/Feed constraints in 668 ms returned sat
[2023-03-09 11:03:37] [INFO ] Deduced a trap composed of 186 places in 645 ms of which 5 ms to minimize.
[2023-03-09 11:03:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 825 ms
[2023-03-09 11:03:37] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 611 ms.
[2023-03-09 11:03:38] [INFO ] Added : 4 causal constraints over 1 iterations in 1127 ms. Result :sat
Minimization took 702 ms.
[2023-03-09 11:03:39] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 11:03:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-09 11:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:39] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2023-03-09 11:03:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:03:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 11:03:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-09 11:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:40] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2023-03-09 11:03:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1265 ms returned sat
[2023-03-09 11:03:42] [INFO ] Deduced a trap composed of 28 places in 665 ms of which 2 ms to minimize.
[2023-03-09 11:03:43] [INFO ] Deduced a trap composed of 50 places in 634 ms of which 2 ms to minimize.
[2023-03-09 11:03:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2035 ms
[2023-03-09 11:03:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 570 ms.
[2023-03-09 11:03:45] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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-09 11:03:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 11:03:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 11:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:45] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-09 11:03:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:03:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-09 11:03:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-09 11:03:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:46] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2023-03-09 11:03:47] [INFO ] [Nat]Added 1588 Read/Feed constraints in 992 ms returned sat
[2023-03-09 11:03:48] [INFO ] Deduced a trap composed of 141 places in 583 ms of which 3 ms to minimize.
[2023-03-09 11:03:48] [INFO ] Deduced a trap composed of 158 places in 632 ms of which 2 ms to minimize.
[2023-03-09 11:03:49] [INFO ] Deduced a trap composed of 138 places in 619 ms of which 2 ms to minimize.
[2023-03-09 11:03:50] [INFO ] Deduced a trap composed of 83 places in 640 ms of which 1 ms to minimize.
[2023-03-09 11:03:51] [INFO ] Deduced a trap composed of 115 places in 616 ms of which 1 ms to minimize.
[2023-03-09 11:03:51] [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-09 11:03:51] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 11:03:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 11:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:51] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-03-09 11:03:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:03:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 11:03:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-09 11:03:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:52] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-09 11:03:53] [INFO ] [Nat]Added 1588 Read/Feed constraints in 912 ms returned sat
[2023-03-09 11:03:54] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 358 ms.
[2023-03-09 11:03:54] [INFO ] Added : 9 causal constraints over 2 iterations in 771 ms. Result :sat
Minimization took 953 ms.
[2023-03-09 11:03:55] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 11:03:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-09 11:03:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:56] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2023-03-09 11:03:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:03:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-09 11:03:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2023-03-09 11:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:03:57] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-09 11:03:57] [INFO ] [Nat]Added 1588 Read/Feed constraints in 682 ms returned sat
[2023-03-09 11:03:58] [INFO ] Deduced a trap composed of 194 places in 583 ms of which 1 ms to minimize.
[2023-03-09 11:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 722 ms
[2023-03-09 11:03:58] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 450 ms.
[2023-03-09 11:03:59] [INFO ] Added : 5 causal constraints over 1 iterations in 736 ms. Result :sat
Minimization took 548 ms.
[2023-03-09 11:03:59] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-09 11:04:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 11:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:00] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2023-03-09 11:04:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-09 11:04:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-09 11:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:01] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2023-03-09 11:04:02] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1111 ms returned sat
[2023-03-09 11:04:03] [INFO ] Deduced a trap composed of 38 places in 660 ms of which 1 ms to minimize.
[2023-03-09 11:04:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1061 ms
[2023-03-09 11:04:04] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 401 ms.
[2023-03-09 11:04:05] [INFO ] Deduced a trap composed of 47 places in 685 ms of which 3 ms to minimize.
[2023-03-09 11:04:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 852 ms
[2023-03-09 11:04:06] [INFO ] Deduced a trap composed of 49 places in 647 ms of which 1 ms to minimize.
[2023-03-09 11:04:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [1597, 4, 4, 7, 4, 6] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 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 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2434 place count 150 transition count 256
Iterating global reduction 6 with 11 rules applied. Total rules applied 2445 place count 150 transition count 256
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 2454 place count 150 transition count 247
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2456 place count 148 transition count 240
Iterating global reduction 7 with 2 rules applied. Total rules applied 2458 place count 148 transition count 240
Applied a total of 2458 rules in 251 ms. Remains 148 /1183 variables (removed 1035) and now considering 240/2478 (removed 2238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 148/1183 places, 240/2478 transitions.
// Phase 1: matrix 240 rows 148 cols
[2023-03-09 11:04:06] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229851 resets, run finished after 1611 ms. (steps per millisecond=620 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95786 resets, run finished after 733 ms. (steps per millisecond=1364 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95866 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 96107 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95593 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 96065 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95680 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 6) seen :1
[2023-03-09 11:04:12] [INFO ] Invariant cache hit.
[2023-03-09 11:04:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:12] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
[2023-03-09 11:04:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:12] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-09 11:04:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:12] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-09 11:04:12] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-09 11:04:12] [INFO ] [Nat]Added 100 Read/Feed constraints in 40 ms returned sat
[2023-03-09 11:04:12] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 18 ms.
[2023-03-09 11:04:13] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2023-03-09 11:04:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 11:04:13] [INFO ] Added : 19 causal constraints over 4 iterations in 244 ms. Result :sat
Minimization took 55 ms.
[2023-03-09 11:04:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:13] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-09 11:04:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:13] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Nat]Added 100 Read/Feed constraints in 20 ms returned sat
[2023-03-09 11:04:13] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 15 ms.
[2023-03-09 11:04:13] [INFO ] Added : 11 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 56 ms.
[2023-03-09 11:04:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:13] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 11:04:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:13] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Nat]Added 100 Read/Feed constraints in 20 ms returned sat
[2023-03-09 11:04:13] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 17 ms.
[2023-03-09 11:04:13] [INFO ] Added : 10 causal constraints over 2 iterations in 68 ms. Result :sat
Minimization took 44 ms.
[2023-03-09 11:04:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:13] [INFO ] [Real]Absence check using state equation in 49 ms returned unsat
[2023-03-09 11:04:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:14] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 11:04:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:14] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-09 11:04:14] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2023-03-09 11:04:14] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 18 ms.
[2023-03-09 11:04:14] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-09 11:04:14] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:04:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-03-09 11:04:14] [INFO ] Added : 18 causal constraints over 5 iterations in 298 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [1, 4, 4, 7, 1, 6] Max seen :[1, 0, 0, 0, 1, 0]
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 240/240 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 146 transition count 236
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 236
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 144 transition count 233
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 144 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 143 transition count 231
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 143 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 143 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 142 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 142 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 141 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 141 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 141 transition count 227
Applied a total of 16 rules in 27 ms. Remains 141 /148 variables (removed 7) and now considering 227/240 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 141/148 places, 227/240 transitions.
// Phase 1: matrix 227 rows 141 cols
[2023-03-09 11:04:14] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 230165 resets, run finished after 1395 ms. (steps per millisecond=716 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95297 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95609 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95816 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95843 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 4) seen :0
[2023-03-09 11:04:18] [INFO ] Invariant cache hit.
[2023-03-09 11:04:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:18] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 11:04:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:18] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 11:04:18] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-09 11:04:18] [INFO ] [Nat]Added 93 Read/Feed constraints in 58 ms returned sat
[2023-03-09 11:04:18] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 22 ms.
[2023-03-09 11:04:19] [INFO ] Added : 18 causal constraints over 4 iterations in 116 ms. Result :sat
Minimization took 45 ms.
[2023-03-09 11:04:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 11:04:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:19] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-09 11:04:19] [INFO ] [Nat]Added 93 Read/Feed constraints in 16 ms returned sat
[2023-03-09 11:04:19] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 17 ms.
[2023-03-09 11:04:19] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-09 11:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 11:04:19] [INFO ] Added : 30 causal constraints over 7 iterations in 228 ms. Result :sat
Minimization took 52 ms.
[2023-03-09 11:04:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:19] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 11:04:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:19] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-09 11:04:19] [INFO ] [Nat]Added 93 Read/Feed constraints in 18 ms returned sat
[2023-03-09 11:04:19] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 17 ms.
[2023-03-09 11:04:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-09 11:04:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-03-09 11:04:20] [INFO ] Added : 18 causal constraints over 4 iterations in 202 ms. Result :sat
Minimization took 45 ms.
[2023-03-09 11:04:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:20] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 11:04:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:20] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 11:04:20] [INFO ] [Nat]Added 93 Read/Feed constraints in 23 ms returned sat
[2023-03-09 11:04:20] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-09 11:04:20] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2023-03-09 11:04:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 11:04:20] [INFO ] Added : 11 causal constraints over 3 iterations in 192 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 7, 6] Max seen :[0, 0, 0, 0]
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 141/141 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Applied a total of 0 rules in 7 ms. Remains 141 /141 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-09 11:04:20] [INFO ] Invariant cache hit.
[2023-03-09 11:04:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-09 11:04:20] [INFO ] Invariant cache hit.
[2023-03-09 11:04:20] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-09 11:04:21] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-09 11:04:21] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 11:04:21] [INFO ] Invariant cache hit.
[2023-03-09 11:04:21] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 141/141 places, 227/227 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05
[2023-03-09 11:04:21] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2298 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 932 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 11:04:21] [INFO ] Invariant cache hit.
[2023-03-09 11:04:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:21] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 11:04:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:21] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 11:04:21] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-09 11:04:21] [INFO ] [Nat]Added 93 Read/Feed constraints in 37 ms returned sat
[2023-03-09 11:04:21] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-09 11:04:21] [INFO ] Added : 18 causal constraints over 4 iterations in 95 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 135 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 133 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 133 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 133 transition count 212
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 131 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 130 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 30 place count 127 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 127 transition count 180
Applied a total of 33 rules in 36 ms. Remains 127 /141 variables (removed 14) and now considering 180/227 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 127/141 places, 180/227 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-09 11:04:21] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230005 resets, run finished after 1177 ms. (steps per millisecond=849 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96279 resets, run finished after 560 ms. (steps per millisecond=1785 ) properties (out of 1) seen :0
[2023-03-09 11:04:23] [INFO ] Invariant cache hit.
[2023-03-09 11:04:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:23] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 11:04:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:23] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 11:04:23] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 11:04:23] [INFO ] [Nat]Added 59 Read/Feed constraints in 22 ms returned sat
[2023-03-09 11:04:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-09 11:04:23] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2023-03-09 11:04:23] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2023-03-09 11:04:23] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-09 11:04:23] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-09 11:04:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 294 ms
[2023-03-09 11:04:23] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 12 ms.
[2023-03-09 11:04:23] [INFO ] Added : 14 causal constraints over 3 iterations in 61 ms. Result :sat
Minimization took 44 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 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-09 11:04:24] [INFO ] Invariant cache hit.
[2023-03-09 11:04:24] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 11:04:24] [INFO ] Invariant cache hit.
[2023-03-09 11:04:24] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 11:04:24] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-09 11:04:24] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 11:04:24] [INFO ] Invariant cache hit.
[2023-03-09 11:04:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05 in 3235 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07
// Phase 1: matrix 227 rows 141 cols
[2023-03-09 11:04:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2309 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 956 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 11:04:24] [INFO ] Invariant cache hit.
[2023-03-09 11:04:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:24] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 11:04:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:24] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-09 11:04:24] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-09 11:04:24] [INFO ] [Nat]Added 93 Read/Feed constraints in 16 ms returned sat
[2023-03-09 11:04:24] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-09 11:04:24] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-09 11:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-09 11:04:24] [INFO ] Added : 30 causal constraints over 7 iterations in 227 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 217
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 135 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 133 transition count 214
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 133 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 133 transition count 213
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 131 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 130 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 30 place count 127 transition count 180
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 127 transition count 180
Applied a total of 33 rules in 19 ms. Remains 127 /141 variables (removed 14) and now considering 180/227 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 127/141 places, 180/227 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-09 11:04:25] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229927 resets, run finished after 1175 ms. (steps per millisecond=851 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95705 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 1) seen :0
[2023-03-09 11:04:26] [INFO ] Invariant cache hit.
[2023-03-09 11:04:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-09 11:04:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:26] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-09 11:04:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 11:04:26] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2023-03-09 11:04:26] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-09 11:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-09 11:04:27] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 13 ms.
[2023-03-09 11:04:27] [INFO ] Added : 13 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 35 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 14 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 14 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 7 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-09 11:04:27] [INFO ] Invariant cache hit.
[2023-03-09 11:04:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-09 11:04:27] [INFO ] Invariant cache hit.
[2023-03-09 11:04:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 11:04:27] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-09 11:04:27] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 11:04:27] [INFO ] Invariant cache hit.
[2023-03-09 11:04:27] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07 in 3112 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
// Phase 1: matrix 227 rows 141 cols
[2023-03-09 11:04:27] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2258 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 984 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 11:04:27] [INFO ] Invariant cache hit.
[2023-03-09 11:04:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:27] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-09 11:04:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:27] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-09 11:04:27] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-09 11:04:27] [INFO ] [Nat]Added 93 Read/Feed constraints in 21 ms returned sat
[2023-03-09 11:04:27] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-09 11:04:27] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-09 11:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-09 11:04:27] [INFO ] Added : 18 causal constraints over 4 iterations in 196 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 218
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 218
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 132 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 132 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 132 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 130 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 129 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 126 transition count 179
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 126 transition count 179
Applied a total of 35 rules in 16 ms. Remains 126 /141 variables (removed 15) and now considering 179/227 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 126/141 places, 179/227 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-09 11:04:28] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230085 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95981 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :0
[2023-03-09 11:04:29] [INFO ] Invariant cache hit.
[2023-03-09 11:04:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:29] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-09 11:04:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:29] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-09 11:04:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 11:04:29] [INFO ] [Nat]Added 57 Read/Feed constraints in 10 ms returned sat
[2023-03-09 11:04:29] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 128 transitions) in 12 ms.
[2023-03-09 11:04:29] [INFO ] Added : 16 causal constraints over 4 iterations in 64 ms. Result :sat
Minimization took 36 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 4 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 4 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 4 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-09 11:04:30] [INFO ] Invariant cache hit.
[2023-03-09 11:04:30] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 11:04:30] [INFO ] Invariant cache hit.
[2023-03-09 11:04:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 11:04:30] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-09 11:04:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 11:04:30] [INFO ] Invariant cache hit.
[2023-03-09 11:04:30] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 2887 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15
// Phase 1: matrix 227 rows 141 cols
[2023-03-09 11:04:30] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2276 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 1000 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 11:04:30] [INFO ] Invariant cache hit.
[2023-03-09 11:04:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:30] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-09 11:04:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:30] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 11:04:30] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-09 11:04:30] [INFO ] [Nat]Added 93 Read/Feed constraints in 22 ms returned sat
[2023-03-09 11:04:30] [INFO ] Computed and/alt/rep : 54/132/54 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-09 11:04:30] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-09 11:04:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-09 11:04:30] [INFO ] Added : 11 causal constraints over 3 iterations in 167 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 227/227 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 138 transition count 224
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 138 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 135 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 135 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 135 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 133 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 133 transition count 216
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 133 transition count 214
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 131 transition count 199
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 131 transition count 199
Applied a total of 23 rules in 12 ms. Remains 131 /141 variables (removed 10) and now considering 199/227 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 131/141 places, 199/227 transitions.
// Phase 1: matrix 199 rows 131 cols
[2023-03-09 11:04:30] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229836 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95366 resets, run finished after 597 ms. (steps per millisecond=1675 ) properties (out of 1) seen :0
[2023-03-09 11:04:32] [INFO ] Invariant cache hit.
[2023-03-09 11:04:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 11:04:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:32] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 11:04:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 11:04:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 11:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 11:04:32] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 11:04:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 11:04:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 25 ms returned sat
[2023-03-09 11:04:33] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 15 ms.
[2023-03-09 11:04:33] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 0 ms to minimize.
[2023-03-09 11:04:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-09 11:04:33] [INFO ] Added : 15 causal constraints over 4 iterations in 162 ms. Result :sat
Minimization took 49 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 4 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 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-09 11:04:33] [INFO ] Invariant cache hit.
[2023-03-09 11:04:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-09 11:04:33] [INFO ] Invariant cache hit.
[2023-03-09 11:04:33] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-09 11:04:33] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2023-03-09 11:04:33] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 11:04:33] [INFO ] Invariant cache hit.
[2023-03-09 11:04:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15 in 3312 ms.
[2023-03-09 11:04:33] [INFO ] Flatten gal took : 44 ms
[2023-03-09 11:04:33] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 11:04:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 141 places, 227 transitions and 895 arcs took 2 ms.
Total runtime 61525 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DBSingleClientW_PT_d2m04
(NrP: 141 NrTr: 227 NrArc: 895)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 2.802sec


RS generation: 0m 1.273sec


-> reachability set: #nodes 4029 (4.0e+03) #states 30,161 (4)



starting MCC model checker
--------------------------

checking: place_bound(p79)
normalized: place_bound(p79)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p100)
normalized: place_bound(p100)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p6)
normalized: place_bound(p6)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p28)
normalized: place_bound(p28)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 135534 (1.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1940241 6836814 8777055
used/not used/entry size/cache size: 6599576 60509288 16 1024MB
basic ops cache: hits/miss/sum: 188 10404 10592
used/not used/entry size/cache size: 30789 16746427 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 903 4029 4932
used/not used/entry size/cache size: 4028 8384580 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66978688
1 125069
2 4877
3 224
4 2
5 1
6 0
7 0
8 1
9 2
>= 10 0

Total processing time: 0m 5.762sec


BK_STOP 1678359880831

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

4054
iterations count:110994 (488), effective:1686 (7)

initing FirstDep: 0m 0.000sec

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="marciexred"
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 marciexred"
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 r106-tall-167814482500293"
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 ;