About the Execution of LTSMin+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 |
| 1564.144 | 75096.00 | 108202.00 | 558.30 | 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.r105-tall-167814481000293.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 ltsminxred
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 r105-tall-167814481000293
=====================================================================
--------------------
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 1678272156836
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 10:42:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 10:42:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:42:38] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2023-03-08 10:42:38] [INFO ] Transformed 4763 places.
[2023-03-08 10:42:38] [INFO ] Transformed 2478 transitions.
[2023-03-08 10:42:38] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 19 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 10:42:39] [INFO ] Computed 6 place invariants in 171 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 932 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 931 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 922 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 891 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
[2023-03-08 10:42:39] [INFO ] Invariant cache hit.
[2023-03-08 10:42:40] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2023-03-08 10:42:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 25 ms returned sat
[2023-03-08 10:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:41] [INFO ] [Real]Absence check using state equation in 806 ms returned sat
[2023-03-08 10:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:42:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 10:42:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 10:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:41] [INFO ] [Nat]Absence check using state equation in 615 ms returned sat
[2023-03-08 10:42:42] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 10:42:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 733 ms returned sat
[2023-03-08 10:42:43] [INFO ] Deduced a trap composed of 186 places in 641 ms of which 8 ms to minimize.
[2023-03-08 10:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 836 ms
[2023-03-08 10:42:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 683 ms.
[2023-03-08 10:42:44] [INFO ] Added : 4 causal constraints over 1 iterations in 1270 ms. Result :sat
Minimization took 741 ms.
[2023-03-08 10:42:45] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 10:42:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 10:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:46] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2023-03-08 10:42:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:42:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-08 10:42:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 17 ms returned sat
[2023-03-08 10:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:47] [INFO ] [Nat]Absence check using state equation in 694 ms returned sat
[2023-03-08 10:42:48] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1364 ms returned sat
[2023-03-08 10:42:49] [INFO ] Deduced a trap composed of 28 places in 720 ms of which 2 ms to minimize.
[2023-03-08 10:42:50] [INFO ] Deduced a trap composed of 50 places in 723 ms of which 2 ms to minimize.
[2023-03-08 10:42:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2202 ms
[2023-03-08 10:42:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 597 ms.
[2023-03-08 10:42:51] [INFO ] Added : 0 causal constraints over 0 iterations in 600 ms. Result :unknown
[2023-03-08 10:42:51] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 10:42:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 10:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:52] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2023-03-08 10:42:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:42:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 10:42:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 10:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:53] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2023-03-08 10:42:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1099 ms returned sat
[2023-03-08 10:42:55] [INFO ] Deduced a trap composed of 141 places in 666 ms of which 3 ms to minimize.
[2023-03-08 10:42:56] [INFO ] Deduced a trap composed of 158 places in 677 ms of which 2 ms to minimize.
[2023-03-08 10:42:56] [INFO ] Deduced a trap composed of 138 places in 643 ms of which 1 ms to minimize.
[2023-03-08 10:42:57] [INFO ] Deduced a trap composed of 83 places in 676 ms of which 1 ms to minimize.
[2023-03-08 10:42:58] [INFO ] Deduced a trap composed of 49 places in 672 ms of which 2 ms to minimize.
[2023-03-08 10:42:58] [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 10:42:58] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 10:42:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 10:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:42:59] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2023-03-08 10:42:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:42:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 10:42:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 10:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:00] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2023-03-08 10:43:00] [INFO ] [Nat]Added 1588 Read/Feed constraints in 872 ms returned sat
[2023-03-08 10:43:01] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 441 ms.
[2023-03-08 10:43:01] [INFO ] Added : 9 causal constraints over 2 iterations in 913 ms. Result :sat
Minimization took 1017 ms.
[2023-03-08 10:43:03] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 10:43:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 10:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:03] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2023-03-08 10:43:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 10:43:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-08 10:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:04] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2023-03-08 10:43:05] [INFO ] [Nat]Added 1588 Read/Feed constraints in 700 ms returned sat
[2023-03-08 10:43:06] [INFO ] Deduced a trap composed of 194 places in 597 ms of which 1 ms to minimize.
[2023-03-08 10:43:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 748 ms
[2023-03-08 10:43:06] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 525 ms.
[2023-03-08 10:43:06] [INFO ] Added : 5 causal constraints over 1 iterations in 823 ms. Result :sat
Minimization took 584 ms.
[2023-03-08 10:43:07] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-08 10:43:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 10:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:08] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2023-03-08 10:43:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 10:43:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 10:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:09] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2023-03-08 10:43:10] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1224 ms returned sat
[2023-03-08 10:43:11] [INFO ] Deduced a trap composed of 38 places in 788 ms of which 2 ms to minimize.
[2023-03-08 10:43:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1238 ms
[2023-03-08 10:43:12] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 400 ms.
[2023-03-08 10:43:13] [INFO ] Deduced a trap composed of 47 places in 698 ms of which 1 ms to minimize.
[2023-03-08 10:43:13] [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 236 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 237 ms. Remains : 148/1183 places, 240/2478 transitions.
// Phase 1: matrix 240 rows 148 cols
[2023-03-08 10:43:14] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230116 resets, run finished after 1534 ms. (steps per millisecond=651 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95806 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95982 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95301 resets, run finished after 693 ms. (steps per millisecond=1443 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000000 steps, including 95683 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95774 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95268 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 6) seen :1
[2023-03-08 10:43:20] [INFO ] Invariant cache hit.
[2023-03-08 10:43:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:20] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2023-03-08 10:43:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:20] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-08 10:43:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:20] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-08 10:43:20] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 10:43:20] [INFO ] [Nat]Added 100 Read/Feed constraints in 44 ms returned sat
[2023-03-08 10:43:20] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 15 ms.
[2023-03-08 10:43:20] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2023-03-08 10:43:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 10:43:20] [INFO ] Added : 19 causal constraints over 4 iterations in 216 ms. Result :sat
Minimization took 58 ms.
[2023-03-08 10:43:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:20] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 10:43:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:20] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-08 10:43:20] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2023-03-08 10:43:21] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 16 ms.
[2023-03-08 10:43:21] [INFO ] Added : 11 causal constraints over 3 iterations in 84 ms. Result :sat
Minimization took 60 ms.
[2023-03-08 10:43:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:21] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 10:43:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:21] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Nat]Added 100 Read/Feed constraints in 22 ms returned sat
[2023-03-08 10:43:21] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 15 ms.
[2023-03-08 10:43:21] [INFO ] Added : 10 causal constraints over 2 iterations in 73 ms. Result :sat
Minimization took 46 ms.
[2023-03-08 10:43:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:21] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 10:43:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:21] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Nat]Added 100 Read/Feed constraints in 15 ms returned sat
[2023-03-08 10:43:21] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 13 ms.
[2023-03-08 10:43:21] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-08 10:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 10:43:21] [INFO ] Added : 7 causal constraints over 3 iterations in 173 ms. Result :sat
Minimization took 44 ms.
[2023-03-08 10:43:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:21] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:22] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 10:43:22] [INFO ] [Nat]Added 100 Read/Feed constraints in 27 ms returned sat
[2023-03-08 10:43:22] [INFO ] Computed and/alt/rep : 56/144/56 causal constraints (skipped 183 transitions) in 16 ms.
[2023-03-08 10:43:22] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2023-03-08 10:43:22] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-08 10:43:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-03-08 10:43:22] [INFO ] Added : 18 causal constraints over 5 iterations in 310 ms. Result :sat
Minimization took 56 ms.
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 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 240/240 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 147 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 147 transition count 239
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 146 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 146 transition count 237
Applied a total of 4 rules in 18 ms. Remains 146 /148 variables (removed 2) and now considering 237/240 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 146/148 places, 237/240 transitions.
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 10:43:22] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229764 resets, run finished after 1494 ms. (steps per millisecond=669 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95618 resets, run finished after 668 ms. (steps per millisecond=1497 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95851 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95627 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95754 resets, run finished after 674 ms. (steps per millisecond=1483 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95463 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 5) seen :0
[2023-03-08 10:43:27] [INFO ] Invariant cache hit.
[2023-03-08 10:43:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:27] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 10:43:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:27] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-08 10:43:27] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:27] [INFO ] [Nat]Added 98 Read/Feed constraints in 30 ms returned sat
[2023-03-08 10:43:27] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 15 ms.
[2023-03-08 10:43:27] [INFO ] Added : 20 causal constraints over 4 iterations in 97 ms. Result :sat
Minimization took 59 ms.
[2023-03-08 10:43:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:28] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:28] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Nat]Added 98 Read/Feed constraints in 24 ms returned sat
[2023-03-08 10:43:28] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:28] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2023-03-08 10:43:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 10:43:28] [INFO ] Added : 17 causal constraints over 5 iterations in 193 ms. Result :sat
Minimization took 54 ms.
[2023-03-08 10:43:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:28] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-08 10:43:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:28] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Nat]Added 98 Read/Feed constraints in 23 ms returned sat
[2023-03-08 10:43:28] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:28] [INFO ] Added : 16 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 71 ms.
[2023-03-08 10:43:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:28] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-08 10:43:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:29] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-08 10:43:29] [INFO ] [Nat]Added 98 Read/Feed constraints in 16 ms returned sat
[2023-03-08 10:43:29] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2023-03-08 10:43:29] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-08 10:43:29] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-08 10:43:29] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2023-03-08 10:43:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 319 ms
[2023-03-08 10:43:29] [INFO ] Added : 19 causal constraints over 5 iterations in 482 ms. Result :sat
Minimization took 74 ms.
[2023-03-08 10:43:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:29] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-08 10:43:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:29] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-08 10:43:29] [INFO ] [Nat]Added 98 Read/Feed constraints in 35 ms returned sat
[2023-03-08 10:43:29] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2023-03-08 10:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 10:43:29] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:30] [INFO ] Added : 14 causal constraints over 3 iterations in 100 ms. Result :sat
Minimization took 52 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 9 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 9 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 10 ms. Remains 146 /146 variables (removed 0) and now considering 237/237 (removed 0) transitions.
[2023-03-08 10:43:30] [INFO ] Invariant cache hit.
[2023-03-08 10:43:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-08 10:43:30] [INFO ] Invariant cache hit.
[2023-03-08 10:43:30] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:30] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2023-03-08 10:43:30] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 10:43:30] [INFO ] Invariant cache hit.
[2023-03-08 10:43:31] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 655 ms. Remains : 146/146 places, 237/237 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05
[2023-03-08 10:43:31] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2341 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 989 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 10:43:31] [INFO ] Invariant cache hit.
[2023-03-08 10:43:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:31] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-08 10:43:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:31] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-08 10:43:31] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:31] [INFO ] [Nat]Added 98 Read/Feed constraints in 30 ms returned sat
[2023-03-08 10:43:31] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:31] [INFO ] Added : 20 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 63 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 29 ms. Remains : 127/146 places, 180/237 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 10:43:31] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 230067 resets, run finished after 1163 ms. (steps per millisecond=859 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95947 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :0
[2023-03-08 10:43:33] [INFO ] Invariant cache hit.
[2023-03-08 10:43:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:33] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 10:43:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:33] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-08 10:43:33] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 10:43:33] [INFO ] [Nat]Added 59 Read/Feed constraints in 28 ms returned sat
[2023-03-08 10:43:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-08 10:43:33] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2023-03-08 10:43:33] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2023-03-08 10:43:33] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2023-03-08 10:43:33] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-03-08 10:43:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 316 ms
[2023-03-08 10:43:33] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 10 ms.
[2023-03-08 10:43:33] [INFO ] Added : 14 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 45 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 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 5 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 10:43:33] [INFO ] Invariant cache hit.
[2023-03-08 10:43:34] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 10:43:34] [INFO ] Invariant cache hit.
[2023-03-08 10:43:34] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 10:43:34] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 10:43:34] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:43:34] [INFO ] Invariant cache hit.
[2023-03-08 10:43:34] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05 in 3406 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 10:43:34] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 958 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 10:43:34] [INFO ] Invariant cache hit.
[2023-03-08 10:43:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:34] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:34] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-08 10:43:34] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:34] [INFO ] [Nat]Added 98 Read/Feed constraints in 24 ms returned sat
[2023-03-08 10:43:34] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:34] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2023-03-08 10:43:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-08 10:43:34] [INFO ] Added : 17 causal constraints over 5 iterations in 205 ms. Result :sat
Minimization took 56 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 20 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 20 ms. Remains : 127/146 places, 180/237 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 10:43:35] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230036 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95874 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 1) seen :0
[2023-03-08 10:43:36] [INFO ] Invariant cache hit.
[2023-03-08 10:43:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:36] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 10:43:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:36] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 10:43:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 10:43:36] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2023-03-08 10:43:36] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2023-03-08 10:43:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 10:43:36] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 13 ms.
[2023-03-08 10:43:37] [INFO ] Added : 13 causal constraints over 3 iterations in 66 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 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-08 10:43:37] [INFO ] Invariant cache hit.
[2023-03-08 10:43:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 10:43:37] [INFO ] Invariant cache hit.
[2023-03-08 10:43:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-08 10:43:37] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-08 10:43:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 10:43:37] [INFO ] Invariant cache hit.
[2023-03-08 10:43:37] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-07 in 3065 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 10:43:37] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2306 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 988 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 10:43:37] [INFO ] Invariant cache hit.
[2023-03-08 10:43:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:37] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:37] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-08 10:43:37] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:37] [INFO ] [Nat]Added 98 Read/Feed constraints in 22 ms returned sat
[2023-03-08 10:43:37] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:37] [INFO ] Added : 16 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 63 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 16 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 16 ms. Remains : 126/146 places, 179/237 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-08 10:43:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229621 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95934 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 1) seen :0
[2023-03-08 10:43:39] [INFO ] Invariant cache hit.
[2023-03-08 10:43:39] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:39] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:39] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 10:43:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 10:43:39] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2023-03-08 10:43:39] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 128 transitions) in 11 ms.
[2023-03-08 10:43:39] [INFO ] Added : 16 causal constraints over 4 iterations in 63 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-08 10:43:39] [INFO ] Invariant cache hit.
[2023-03-08 10:43:40] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 10:43:40] [INFO ] Invariant cache hit.
[2023-03-08 10:43:40] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 10:43:40] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-08 10:43:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 10:43:40] [INFO ] Invariant cache hit.
[2023-03-08 10:43:40] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 2888 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-13
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 10:43:40] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-08 10:43:40] [INFO ] Invariant cache hit.
[2023-03-08 10:43:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:40] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:40] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-08 10:43:40] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:40] [INFO ] [Nat]Added 98 Read/Feed constraints in 14 ms returned sat
[2023-03-08 10:43:40] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 15 ms.
[2023-03-08 10:43:40] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-08 10:43:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2023-03-08 10:43:40] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-08 10:43:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2023-03-08 10:43:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 321 ms
[2023-03-08 10:43:41] [INFO ] Added : 19 causal constraints over 5 iterations in 469 ms. Result :sat
Minimization took 77 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 17 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 18 ms. Remains : 128/146 places, 178/237 transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-08 10:43:41] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229956 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96147 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :0
[2023-03-08 10:43:42] [INFO ] Invariant cache hit.
[2023-03-08 10:43:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:43] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 10:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:43] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-08 10:43:43] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 10:43:43] [INFO ] [Nat]Added 54 Read/Feed constraints in 11 ms returned sat
[2023-03-08 10:43:43] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 126 transitions) in 11 ms.
[2023-03-08 10:43:43] [INFO ] Added : 6 causal constraints over 2 iterations in 45 ms. Result :sat
Minimization took 29 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 5 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 5 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 10:43:43] [INFO ] Invariant cache hit.
[2023-03-08 10:43:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-08 10:43:43] [INFO ] Invariant cache hit.
[2023-03-08 10:43:43] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 10:43:43] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-08 10:43:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:43:43] [INFO ] Invariant cache hit.
[2023-03-08 10:43:43] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 483 ms. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-13 in 3267 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15
// Phase 1: matrix 237 rows 146 cols
[2023-03-08 10:43:43] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2322 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 897 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 10:43:43] [INFO ] Invariant cache hit.
[2023-03-08 10:43:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:43] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-08 10:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:43] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-08 10:43:43] [INFO ] State equation strengthened by 98 read => feed constraints.
[2023-03-08 10:43:43] [INFO ] [Nat]Added 98 Read/Feed constraints in 27 ms returned sat
[2023-03-08 10:43:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-08 10:43:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-08 10:43:44] [INFO ] Computed and/alt/rep : 56/141/56 causal constraints (skipped 180 transitions) in 17 ms.
[2023-03-08 10:43:44] [INFO ] Added : 14 causal constraints over 3 iterations in 98 ms. Result :sat
Minimization took 56 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 14 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 14 ms. Remains : 131/146 places, 199/237 transitions.
// Phase 1: matrix 199 rows 131 cols
[2023-03-08 10:43:44] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230262 resets, run finished after 1264 ms. (steps per millisecond=791 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95565 resets, run finished after 589 ms. (steps per millisecond=1697 ) properties (out of 1) seen :0
[2023-03-08 10:43:46] [INFO ] Invariant cache hit.
[2023-03-08 10:43:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 10:43:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:46] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-08 10:43:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 10:43:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 10:43:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 10:43:46] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-08 10:43:46] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 10:43:46] [INFO ] [Nat]Added 73 Read/Feed constraints in 25 ms returned sat
[2023-03-08 10:43:46] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 16 ms.
[2023-03-08 10:43:46] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2023-03-08 10:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-08 10:43:46] [INFO ] Added : 15 causal constraints over 4 iterations in 183 ms. Result :sat
Minimization took 52 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-08 10:43:46] [INFO ] Invariant cache hit.
[2023-03-08 10:43:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 10:43:46] [INFO ] Invariant cache hit.
[2023-03-08 10:43:46] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-08 10:43:46] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-08 10:43:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 10:43:47] [INFO ] Invariant cache hit.
[2023-03-08 10:43:47] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-15 in 3386 ms.
[2023-03-08 10:43:47] [INFO ] Flatten gal took : 62 ms
[2023-03-08 10:43:47] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 10:43:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 146 places, 237 transitions and 935 arcs took 3 ms.
Total runtime 68901 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/830/ub_0_ --maxsum=/tmp/830/ub_1_ --maxsum=/tmp/830/ub_2_ --maxsum=/tmp/830/ub_3_ --maxsum=/tmp/830/ub_4_
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1678272231932
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
mcc2023
ub formula name DBSingleClientW-PT-d2m04-UpperBounds-05
ub formula formula --maxsum=/tmp/830/ub_0_
ub formula name DBSingleClientW-PT-d2m04-UpperBounds-07
ub formula formula --maxsum=/tmp/830/ub_1_
ub formula name DBSingleClientW-PT-d2m04-UpperBounds-10
ub formula formula --maxsum=/tmp/830/ub_2_
ub formula name DBSingleClientW-PT-d2m04-UpperBounds-13
ub formula formula --maxsum=/tmp/830/ub_3_
ub formula name DBSingleClientW-PT-d2m04-UpperBounds-15
ub formula formula --maxsum=/tmp/830/ub_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 146 places, 237 transitions and 935 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m04 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 237->224 groups
pnml2lts-sym: Regrouping took 0.060 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 146; there are 224 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 66052 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.570 real 2.300 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 35040 states, 10953 nodes
pnml2lts-sym: Maximum sum of /tmp/830/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/830/ub_1_ is: 1
pnml2lts-sym: Maximum sum of /tmp/830/ub_2_ is: 1
pnml2lts-sym: Maximum sum of /tmp/830/ub_3_ is: 1
pnml2lts-sym: Maximum sum of /tmp/830/ub_4_ is: 1
pnml2lts-sym: group_next: 2102 nodes total
pnml2lts-sym: group_explored: 2700 nodes, 2199 short vectors total
pnml2lts-sym: max token count: 4
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="ltsminxred"
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 ltsminxred"
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 r105-tall-167814481000293"
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 '
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 ;