About the Execution of LTSMin+red for DBSingleClientW-PT-d2m08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1137.632 | 161230.00 | 197536.00 | 548.90 | 0 0 0 0 0 ? 0 0 0 0 0 0 0 ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189600581.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is DBSingleClientW-PT-d2m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189600581
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717191117847
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-d2m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:31:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:31:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:31:59] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-31 21:31:59] [INFO ] Transformed 4763 places.
[2024-05-31 21:31:59] [INFO ] Transformed 2478 transitions.
[2024-05-31 21:31:59] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 3580 places in 26 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-31 21:31:59] [INFO ] Computed 6 invariants in 148 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
RANDOM walk for 10000 steps (2313 resets) in 378 ms. (26 steps per ms)
BEST_FIRST walk for 40002 steps (3717 resets) in 252 ms. (158 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
[2024-05-31 21:32:00] [INFO ] Invariant cache hit.
[2024-05-31 21:32:00] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-31 21:32:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-31 21:32:01] [INFO ] [Real]Absence check using state equation in 708 ms returned sat
[2024-05-31 21:32:02] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-31 21:32:02] [INFO ] [Real]Added 1588 Read/Feed constraints in 733 ms returned sat
[2024-05-31 21:32:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:32:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:32:03] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2024-05-31 21:32:04] [INFO ] [Nat]Added 1588 Read/Feed constraints in 871 ms returned sat
[2024-05-31 21:32:05] [INFO ] Deduced a trap composed of 237 places in 767 ms of which 126 ms to minimize.
[2024-05-31 21:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 999 ms
[2024-05-31 21:32:06] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 668 ms.
[2024-05-31 21:32:07] [INFO ] Deduced a trap composed of 32 places in 724 ms of which 8 ms to minimize.
[2024-05-31 21:32:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:32:08] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:32:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-31 21:32:08] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2024-05-31 21:32:09] [INFO ] [Real]Added 1588 Read/Feed constraints in 735 ms returned sat
[2024-05-31 21:32:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:32:09] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:32:10] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-31 21:32:11] [INFO ] [Nat]Added 1588 Read/Feed constraints in 901 ms returned sat
[2024-05-31 21:32:12] [INFO ] Deduced a trap composed of 243 places in 720 ms of which 8 ms to minimize.
[2024-05-31 21:32:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 867 ms
[2024-05-31 21:32:12] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 628 ms.
[2024-05-31 21:32:13] [INFO ] Added : 11 causal constraints over 3 iterations in 1142 ms. Result :sat
Minimization took 627 ms.
[2024-05-31 21:32:14] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 21:32:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:32:14] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2024-05-31 21:32:15] [INFO ] [Real]Added 1588 Read/Feed constraints in 837 ms returned sat
[2024-05-31 21:32:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:32:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-31 21:32:16] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2024-05-31 21:32:17] [INFO ] [Nat]Added 1588 Read/Feed constraints in 926 ms returned sat
[2024-05-31 21:32:18] [INFO ] Deduced a trap composed of 194 places in 679 ms of which 7 ms to minimize.
[2024-05-31 21:32:18] [INFO ] Deduced a trap composed of 221 places in 718 ms of which 7 ms to minimize.
[2024-05-31 21:32:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1851 ms
[2024-05-31 21:32:19] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 349 ms.
[2024-05-31 21:32:20] [INFO ] Added : 10 causal constraints over 3 iterations in 864 ms. Result :sat
Minimization took 569 ms.
[2024-05-31 21:32:20] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-31 21:32:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:32:21] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2024-05-31 21:32:22] [INFO ] [Real]Added 1588 Read/Feed constraints in 742 ms returned sat
[2024-05-31 21:32:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-31 21:32:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-31 21:32:23] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2024-05-31 21:32:24] [INFO ] [Nat]Added 1588 Read/Feed constraints in 939 ms returned sat
[2024-05-31 21:32:24] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 378 ms.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 46 places in 766 ms of which 8 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 947 ms
[2024-05-31 21:32:26] [INFO ] Added : 16 causal constraints over 4 iterations in 2157 ms. Result :sat
Minimization took 613 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Support contains 4 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 (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1317 place count 434 transition count 880
Iterating global reduction 2 with 314 rules applied. Total rules applied 1631 place count 434 transition count 880
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1643 place count 434 transition count 868
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1881 place count 196 transition count 529
Iterating global reduction 3 with 238 rules applied. Total rules applied 2119 place count 196 transition count 529
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2328 place count 196 transition count 320
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2353 place count 171 transition count 280
Iterating global reduction 4 with 25 rules applied. Total rules applied 2378 place count 171 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2384 place count 171 transition count 274
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2401 place count 154 transition count 257
Iterating global reduction 5 with 17 rules applied. Total rules applied 2418 place count 154 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2422 place count 154 transition count 253
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2436 place count 140 transition count 239
Iterating global reduction 6 with 14 rules applied. Total rules applied 2450 place count 140 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2463 place count 140 transition count 226
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2468 place count 135 transition count 204
Iterating global reduction 7 with 5 rules applied. Total rules applied 2473 place count 135 transition count 204
Applied a total of 2473 rules in 234 ms. Remains 135 /1183 variables (removed 1048) and now considering 204/2478 (removed 2274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 135/1183 places, 204/2478 transitions.
// Phase 1: matrix 204 rows 135 cols
[2024-05-31 21:32:27] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
RANDOM walk for 1000000 steps (229971 resets) in 2410 ms. (414 steps per ms)
BEST_FIRST walk for 4000003 steps (381482 resets) in 4141 ms. (965 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
[2024-05-31 21:32:33] [INFO ] Invariant cache hit.
[2024-05-31 21:32:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:33] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-31 21:32:33] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 21:32:33] [INFO ] [Real]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:32:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Nat]Added 77 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:32:34] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 15 ms.
[2024-05-31 21:32:34] [INFO ] Added : 17 causal constraints over 4 iterations in 86 ms. Result :sat
Minimization took 103 ms.
[2024-05-31 21:32:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Real]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:32:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Nat]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:32:34] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 13 ms.
[2024-05-31 21:32:34] [INFO ] Added : 12 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 91 ms.
[2024-05-31 21:32:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Real]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:32:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-31 21:32:34] [INFO ] [Nat]Added 77 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:32:34] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 16 ms.
[2024-05-31 21:32:34] [INFO ] Added : 10 causal constraints over 3 iterations in 68 ms. Result :sat
Minimization took 90 ms.
[2024-05-31 21:32:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:32:35] [INFO ] [Real]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:32:35] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:32:35] [INFO ] [Nat]Added 77 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:32:35] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 16 ms.
[2024-05-31 21:32:35] [INFO ] Added : 15 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 135/135 places, 204/204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 204/204 (removed 0) transitions.
[2024-05-31 21:32:35] [INFO ] Invariant cache hit.
[2024-05-31 21:32:35] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 21:32:35] [INFO ] Invariant cache hit.
[2024-05-31 21:32:35] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 21:32:36] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-31 21:32:36] [INFO ] Redundant transitions in 9 ms returned []
Running 203 sub problems to find dead transitions.
[2024-05-31 21:32:36] [INFO ] Invariant cache hit.
[2024-05-31 21:32:36] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/339 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/339 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 339/339 variables, and 214 constraints, problems are : Problem set: 0 solved, 203 unsolved in 5749 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/339 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 77/214 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/339 variables, 203/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/339 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Int declared 339/339 variables, and 417 constraints, problems are : Problem set: 0 solved, 203 unsolved in 15400 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints]
After SMT, in 21506ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 21516ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21981 ms. Remains : 135/135 places, 204/204 transitions.
RANDOM walk for 40000 steps (9269 resets) in 985 ms. (40 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3852 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3891 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3817 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3861 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3776 resets) in 108 ms. (366 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3783 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3793 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (4028 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 683477 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :4 out of 8
Probabilistic random walk after 683477 steps, saw 282652 distinct states, run finished after 3004 ms. (steps per millisecond=227 ) properties seen :4
[2024-05-31 21:33:01] [INFO ] Invariant cache hit.
[2024-05-31 21:33:01] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 76/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 139/234 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
After SMT solving in domain Real declared 330/339 variables, and 132 constraints, problems are : Problem set: 4 solved, 0 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/135 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[8, 8, 2887, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:33:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2300 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (986 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:33:01] [INFO ] Invariant cache hit.
[2024-05-31 21:33:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:01] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:33:01] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 21:33:01] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:33:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:01] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-31 21:33:01] [INFO ] [Nat]Added 77 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:33:01] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 14 ms.
[2024-05-31 21:33:02] [INFO ] Added : 17 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 128 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 127 transition count 179
Applied a total of 19 rules in 20 ms. Remains 127 /135 variables (removed 8) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 127/135 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-31 21:33:02] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (230180 resets) in 2184 ms. (457 steps per ms)
BEST_FIRST walk for 1000001 steps (95301 resets) in 964 ms. (1036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:33:05] [INFO ] Invariant cache hit.
[2024-05-31 21:33:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:05] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:33:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:33:05] [INFO ] [Real]Added 58 Read/Feed constraints in 10 ms returned sat
[2024-05-31 21:33:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:33:05] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:33:05] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:33:05] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 13 ms.
[2024-05-31 21:33:05] [INFO ] Added : 12 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:33:05] [INFO ] Invariant cache hit.
[2024-05-31 21:33:05] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:33:05] [INFO ] Invariant cache hit.
[2024-05-31 21:33:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:33:06] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-31 21:33:06] [INFO ] Redundant transitions in 12 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:33:06] [INFO ] Invariant cache hit.
[2024-05-31 21:33:06] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5426 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 12156 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 17814ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 17816ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18178 ms. Remains : 127/127 places, 179/179 transitions.
RANDOM walk for 40000 steps (9243 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3769 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3760 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1731572 steps, run timeout after 3001 ms. (steps per millisecond=576 ) properties seen :1 out of 2
Probabilistic random walk after 1731572 steps, saw 723916 distinct states, run finished after 3001 ms. (steps per millisecond=576 ) properties seen :1
[2024-05-31 21:33:27] [INFO ] Invariant cache hit.
[2024-05-31 21:33:27] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 91 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-05 in 25514 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
// Phase 1: matrix 204 rows 135 cols
[2024-05-31 21:33:27] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2348 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (959 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:33:27] [INFO ] Invariant cache hit.
[2024-05-31 21:33:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:27] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:33:27] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 21:33:27] [INFO ] [Real]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:33:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:27] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:33:27] [INFO ] [Nat]Added 77 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:33:27] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 15 ms.
[2024-05-31 21:33:27] [INFO ] Added : 12 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 196
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 128 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 128 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 127 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 127 transition count 179
Applied a total of 19 rules in 20 ms. Remains 127 /135 variables (removed 8) and now considering 179/204 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 127/135 places, 179/204 transitions.
// Phase 1: matrix 179 rows 127 cols
[2024-05-31 21:33:27] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (229886 resets) in 2215 ms. (451 steps per ms)
BEST_FIRST walk for 1000001 steps (95547 resets) in 990 ms. (1009 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-31 21:33:30] [INFO ] Invariant cache hit.
[2024-05-31 21:33:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:30] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:33:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:33:31] [INFO ] [Real]Added 58 Read/Feed constraints in 18 ms returned sat
[2024-05-31 21:33:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:31] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:33:31] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:33:31] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 16 ms.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 213 ms
[2024-05-31 21:33:31] [INFO ] Added : 16 causal constraints over 4 iterations in 302 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-31 21:33:31] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 21:33:31] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:33:31] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-05-31 21:33:31] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-31 21:33:31] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 187 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4667 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/306 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 178/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10575 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 15464ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 15467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15863 ms. Remains : 127/127 places, 179/179 transitions.
RANDOM walk for 40000 steps (9239 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3804 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3802 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1725380 steps, run timeout after 3001 ms. (steps per millisecond=574 ) properties seen :1 out of 2
Probabilistic random walk after 1725380 steps, saw 721772 distinct states, run finished after 3001 ms. (steps per millisecond=574 ) properties seen :1
[2024-05-31 21:33:50] [INFO ] Invariant cache hit.
[2024-05-31 21:33:50] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/222 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 88 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-13 in 23393 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2887]
// Phase 1: matrix 204 rows 135 cols
[2024-05-31 21:33:50] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 10000 steps (2313 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10000 steps (960 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2024-05-31 21:33:50] [INFO ] Invariant cache hit.
[2024-05-31 21:33:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:50] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-31 21:33:50] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 21:33:50] [INFO ] [Real]Added 77 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:33:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:50] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:33:50] [INFO ] [Nat]Added 77 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:33:50] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 20 ms.
[2024-05-31 21:33:50] [INFO ] Added : 10 causal constraints over 3 iterations in 67 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 129 transition count 197
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 129 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 129 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 126 transition count 186
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 126 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 126 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 125 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 125 transition count 177
Applied a total of 23 rules in 13 ms. Remains 125 /135 variables (removed 10) and now considering 177/204 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 125/135 places, 177/204 transitions.
// Phase 1: matrix 177 rows 125 cols
[2024-05-31 21:33:51] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2887]
RANDOM walk for 1000000 steps (229870 resets) in 2198 ms. (454 steps per ms)
BEST_FIRST walk for 1000000 steps (95666 resets) in 981 ms. (1018 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2887]
[2024-05-31 21:33:54] [INFO ] Invariant cache hit.
[2024-05-31 21:33:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:54] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:33:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:33:54] [INFO ] [Real]Added 57 Read/Feed constraints in 14 ms returned sat
[2024-05-31 21:33:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:33:54] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-31 21:33:54] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:33:54] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 11 ms.
[2024-05-31 21:33:54] [INFO ] Added : 13 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2887]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2887]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-31 21:33:54] [INFO ] Invariant cache hit.
[2024-05-31 21:33:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-31 21:33:54] [INFO ] Invariant cache hit.
[2024-05-31 21:33:54] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-31 21:33:54] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-31 21:33:54] [INFO ] Redundant transitions in 6 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-31 21:33:54] [INFO ] Invariant cache hit.
[2024-05-31 21:33:54] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 184 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6197 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/302 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 176/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 360 constraints, problems are : Problem set: 0 solved, 176 unsolved in 10792 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 17198ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 17201ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17540 ms. Remains : 125/125 places, 177/177 transitions.
RANDOM walk for 40000 steps (9214 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3810 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3771 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1757142 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :1 out of 2
Probabilistic random walk after 1757142 steps, saw 732943 distinct states, run finished after 3001 ms. (steps per millisecond=585 ) properties seen :1
[2024-05-31 21:34:15] [INFO ] Invariant cache hit.
[2024-05-31 21:34:15] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/133 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/205 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/220 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/220 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 302/302 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 121 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[2887]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-14 in 24765 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 204 rows 135 cols
[2024-05-31 21:34:15] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2323 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10000 steps (995 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:34:15] [INFO ] Invariant cache hit.
[2024-05-31 21:34:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:34:15] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 21:34:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-31 21:34:15] [INFO ] [Real]Added 77 Read/Feed constraints in 15 ms returned sat
[2024-05-31 21:34:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:34:15] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-31 21:34:15] [INFO ] [Nat]Added 77 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:34:15] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 151 transitions) in 15 ms.
[2024-05-31 21:34:15] [INFO ] Added : 15 causal constraints over 4 iterations in 80 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 204/204 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 201
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 132 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 128 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 128 transition count 196
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 128 transition count 194
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 126 transition count 180
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 126 transition count 180
Applied a total of 21 rules in 19 ms. Remains 126 /135 variables (removed 9) and now considering 180/204 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/135 places, 180/204 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-31 21:34:15] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229725 resets) in 2222 ms. (449 steps per ms)
BEST_FIRST walk for 1000000 steps (95273 resets) in 961 ms. (1039 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-31 21:34:19] [INFO ] Invariant cache hit.
[2024-05-31 21:34:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:34:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-31 21:34:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:34:19] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:34:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:34:19] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-31 21:34:19] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2024-05-31 21:34:19] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-31 21:34:19] [INFO ] Added : 29 causal constraints over 7 iterations in 108 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-31 21:34:19] [INFO ] Invariant cache hit.
[2024-05-31 21:34:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 21:34:19] [INFO ] Invariant cache hit.
[2024-05-31 21:34:19] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 21:34:19] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-31 21:34:19] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-31 21:34:19] [INFO ] Invariant cache hit.
[2024-05-31 21:34:19] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4800 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10421 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15455ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15803 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9203 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3826 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3825 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1743163 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :1 out of 2
Probabilistic random walk after 1743163 steps, saw 724290 distinct states, run finished after 3001 ms. (steps per millisecond=580 ) properties seen :1
[2024-05-31 21:34:38] [INFO ] Invariant cache hit.
[2024-05-31 21:34:38] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 82 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-15 in 23196 ms.
[2024-05-31 21:34:38] [INFO ] Flatten gal took : 43 ms
[2024-05-31 21:34:38] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:34:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 204 transitions and 805 arcs took 5 ms.
Total runtime 159612 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DBSingleClientW-PT-d2m08-UpperBounds-05
Could not compute solution for formula : DBSingleClientW-PT-d2m08-UpperBounds-13
Could not compute solution for formula : DBSingleClientW-PT-d2m08-UpperBounds-14
Could not compute solution for formula : DBSingleClientW-PT-d2m08-UpperBounds-15
BK_STOP 1717191279077
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DBSingleClientW-PT-d2m08-UpperBounds-05
ub formula formula --maxsum=/tmp/774/ub_0_
ub formula name DBSingleClientW-PT-d2m08-UpperBounds-13
ub formula formula --maxsum=/tmp/774/ub_1_
ub formula name DBSingleClientW-PT-d2m08-UpperBounds-14
ub formula formula --maxsum=/tmp/774/ub_2_
ub formula name DBSingleClientW-PT-d2m08-UpperBounds-15
ub formula formula --maxsum=/tmp/774/ub_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-5568"
echo " Executing tool ltsminxred"
echo " Input is DBSingleClientW-PT-d2m08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189600581"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m08.tgz
mv DBSingleClientW-PT-d2m08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;