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

About the Execution of LoLa+red for DBSingleClientW-PT-d2m07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
852.155 68970.00 156028.00 479.20 0 0 0 0 0 0 0 3 0 0 0 5 1 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/mcc2023-input.r103-tall-167814478200317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DBSingleClientW-PT-d2m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478200317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678245936066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:25:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 03:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:25:37] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-08 03:25:37] [INFO ] Transformed 4763 places.
[2023-03-08 03:25:37] [INFO ] Transformed 2478 transitions.
[2023-03-08 03:25:37] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 03:25:38] [INFO ] Computed 6 place invariants in 158 ms
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 963 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 951 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :1
[2023-03-08 03:25:38] [INFO ] Invariant cache hit.
[2023-03-08 03:25:38] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-08 03:25:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 03:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:39] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2023-03-08 03:25:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:25:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-08 03:25:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 03:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:40] [INFO ] [Nat]Absence check using state equation in 555 ms returned sat
[2023-03-08 03:25:40] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 03:25:41] [INFO ] [Nat]Added 1588 Read/Feed constraints in 596 ms returned sat
[2023-03-08 03:25:41] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 663 ms.
[2023-03-08 03:25:42] [INFO ] Added : 2 causal constraints over 1 iterations in 945 ms. Result :sat
Minimization took 806 ms.
[2023-03-08 03:25:43] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-08 03:25:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 03:25:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:43] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2023-03-08 03:25:44] [INFO ] [Real]Added 1588 Read/Feed constraints in 928 ms returned sat
[2023-03-08 03:25:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:25:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:25:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 03:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:45] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2023-03-08 03:25:46] [INFO ] [Nat]Added 1588 Read/Feed constraints in 647 ms returned sat
[2023-03-08 03:25:46] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 385 ms.
[2023-03-08 03:25:46] [INFO ] Added : 1 causal constraints over 1 iterations in 654 ms. Result :sat
Minimization took 502 ms.
[2023-03-08 03:25:47] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 03:25:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-08 03:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:48] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2023-03-08 03:25:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:25:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 03:25:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 03:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:48] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2023-03-08 03:25:50] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1500 ms returned sat
[2023-03-08 03:25:51] [INFO ] Deduced a trap composed of 119 places in 678 ms of which 12 ms to minimize.
[2023-03-08 03:25:51] [INFO ] Deduced a trap composed of 252 places in 596 ms of which 2 ms to minimize.
[2023-03-08 03:25:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1525 ms
[2023-03-08 03:25:52] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 355 ms.
[2023-03-08 03:25:53] [INFO ] Deduced a trap composed of 140 places in 598 ms of which 2 ms to minimize.
[2023-03-08 03:25:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [3, 7, 7] Max seen :[1, 2, 0]
Support contains 3 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.9 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1322 place count 431 transition count 877
Iterating global reduction 2 with 315 rules applied. Total rules applied 1637 place count 431 transition count 877
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 431 transition count 865
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1890 place count 190 transition count 522
Iterating global reduction 3 with 241 rules applied. Total rules applied 2131 place count 190 transition count 522
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2343 place count 190 transition count 310
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2367 place count 166 transition count 271
Iterating global reduction 4 with 24 rules applied. Total rules applied 2391 place count 166 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2397 place count 166 transition count 265
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2413 place count 150 transition count 249
Iterating global reduction 5 with 16 rules applied. Total rules applied 2429 place count 150 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2431 place count 150 transition count 247
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2445 place count 136 transition count 233
Iterating global reduction 6 with 14 rules applied. Total rules applied 2459 place count 136 transition count 233
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2472 place count 136 transition count 220
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2479 place count 129 transition count 184
Iterating global reduction 7 with 7 rules applied. Total rules applied 2486 place count 129 transition count 184
Applied a total of 2486 rules in 246 ms. Remains 129 /1183 variables (removed 1054) and now considering 184/2478 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 129/1183 places, 184/2478 transitions.
// Phase 1: matrix 184 rows 129 cols
[2023-03-08 03:25:53] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229710 resets, run finished after 1233 ms. (steps per millisecond=811 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95451 resets, run finished after 577 ms. (steps per millisecond=1733 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 96418 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95104 resets, run finished after 572 ms. (steps per millisecond=1748 ) properties (out of 3) seen :3
[2023-03-08 03:25:56] [INFO ] Invariant cache hit.
[2023-03-08 03:25:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:56] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:25:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:56] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 03:25:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:25:56] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2023-03-08 03:25:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2023-03-08 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 03:25:56] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 11 ms.
[2023-03-08 03:25:57] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 20 ms.
[2023-03-08 03:25:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:57] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 03:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:25:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:57] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-08 03:25:57] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2023-03-08 03:25:57] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 16 ms.
[2023-03-08 03:25:57] [INFO ] Added : 1 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 16 ms.
[2023-03-08 03:25:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:57] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 03:25:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:25:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:25:57] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 03:25:57] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2023-03-08 03:25:57] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 12 ms.
[2023-03-08 03:25:57] [INFO ] Added : 17 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [3, 7, 7] Max seen :[2, 4, 0]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 129/129 places, 184/184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-08 03:25:57] [INFO ] Invariant cache hit.
[2023-03-08 03:25:57] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-08 03:25:57] [INFO ] Invariant cache hit.
[2023-03-08 03:25:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:25:58] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2023-03-08 03:25:58] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 03:25:58] [INFO ] Invariant cache hit.
[2023-03-08 03:25:58] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 701 ms. Remains : 129/129 places, 184/184 transitions.
[2023-03-08 03:25:58] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229864 resets, run finished after 1190 ms. (steps per millisecond=840 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95546 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 96929 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95555 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 3) seen :3
[2023-03-08 03:26:01] [INFO ] Invariant cache hit.
[2023-03-08 03:26:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:01] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:26:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:01] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-08 03:26:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:26:01] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2023-03-08 03:26:01] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2023-03-08 03:26:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 03:26:01] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 10 ms.
[2023-03-08 03:26:01] [INFO ] Added : 2 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 21 ms.
[2023-03-08 03:26:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:01] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 03:26:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:01] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2023-03-08 03:26:01] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 12 ms.
[2023-03-08 03:26:01] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 16 ms.
[2023-03-08 03:26:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:01] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-08 03:26:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:01] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:26:01] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2023-03-08 03:26:01] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 17 ms.
[2023-03-08 03:26:01] [INFO ] Added : 17 causal constraints over 4 iterations in 78 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [3, 7, 7] Max seen :[2, 4, 0]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 129/129 places, 184/184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 7 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-08 03:26:02] [INFO ] Invariant cache hit.
[2023-03-08 03:26:02] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 03:26:02] [INFO ] Invariant cache hit.
[2023-03-08 03:26:02] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:26:02] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 03:26:02] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 03:26:02] [INFO ] Invariant cache hit.
[2023-03-08 03:26:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 416 ms. Remains : 129/129 places, 184/184 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-07
[2023-03-08 03:26:02] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 03:26:02] [INFO ] Invariant cache hit.
[2023-03-08 03:26:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:02] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:26:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:02] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 03:26:02] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:26:02] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2023-03-08 03:26:02] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 10 ms.
[2023-03-08 03:26:02] [INFO ] Added : 2 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 126 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 181
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 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 125 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 125 transition count 172
Applied a total of 9 rules in 20 ms. Remains 125 /129 variables (removed 4) and now considering 172/184 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 125/129 places, 172/184 transitions.
// Phase 1: matrix 172 rows 125 cols
[2023-03-08 03:26:02] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229813 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95675 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :2
[2023-03-08 03:26:04] [INFO ] Invariant cache hit.
[2023-03-08 03:26:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:04] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-08 03:26:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 03:26:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-08 03:26:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 03:26:04] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2023-03-08 03:26:04] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 121 transitions) in 12 ms.
[2023-03-08 03:26:04] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 125/125 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-08 03:26:04] [INFO ] Invariant cache hit.
[2023-03-08 03:26:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 03:26:04] [INFO ] Invariant cache hit.
[2023-03-08 03:26:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 03:26:04] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-08 03:26:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:26:04] [INFO ] Invariant cache hit.
[2023-03-08 03:26:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 125/125 places, 172/172 transitions.
[2023-03-08 03:26:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229951 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95393 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 1) seen :2
[2023-03-08 03:26:06] [INFO ] Invariant cache hit.
[2023-03-08 03:26:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:06] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:26:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:06] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:26:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 03:26:06] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2023-03-08 03:26:06] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 121 transitions) in 12 ms.
[2023-03-08 03:26:06] [INFO ] Added : 2 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 125/125 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-08 03:26:06] [INFO ] Invariant cache hit.
[2023-03-08 03:26:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-08 03:26:06] [INFO ] Invariant cache hit.
[2023-03-08 03:26:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 03:26:07] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 03:26:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:26:07] [INFO ] Invariant cache hit.
[2023-03-08 03:26:07] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 125/125 places, 172/172 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-07 in 4829 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11
// Phase 1: matrix 184 rows 129 cols
[2023-03-08 03:26:07] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2345 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :3
[2023-03-08 03:26:07] [INFO ] Invariant cache hit.
[2023-03-08 03:26:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:07] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 03:26:07] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:26:07] [INFO ] [Real]Added 60 Read/Feed constraints in 8 ms returned sat
[2023-03-08 03:26:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:07] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 03:26:07] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2023-03-08 03:26:07] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 12 ms.
[2023-03-08 03:26:07] [INFO ] Added : 1 causal constraints over 1 iterations in 42 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 125 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 125 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 124 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 124 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 123 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 123 transition count 168
Applied a total of 15 rules in 13 ms. Remains 123 /129 variables (removed 6) and now considering 168/184 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/129 places, 168/184 transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-08 03:26:07] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230240 resets, run finished after 1203 ms. (steps per millisecond=831 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96728 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 1) seen :5
[2023-03-08 03:26:09] [INFO ] Invariant cache hit.
[2023-03-08 03:26:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:09] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 03:26:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:09] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-08 03:26:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 03:26:09] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2023-03-08 03:26:09] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 13 ms.
[2023-03-08 03:26:09] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-08 03:26:09] [INFO ] Invariant cache hit.
[2023-03-08 03:26:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 03:26:09] [INFO ] Invariant cache hit.
[2023-03-08 03:26:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 03:26:09] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-08 03:26:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:26:09] [INFO ] Invariant cache hit.
[2023-03-08 03:26:09] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 123/123 places, 168/168 transitions.
[2023-03-08 03:26:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229973 resets, run finished after 1079 ms. (steps per millisecond=926 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96654 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 1) seen :3
[2023-03-08 03:26:11] [INFO ] Invariant cache hit.
[2023-03-08 03:26:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:11] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 03:26:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:11] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-08 03:26:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 03:26:11] [INFO ] [Nat]Added 49 Read/Feed constraints in 11 ms returned sat
[2023-03-08 03:26:11] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 11 ms.
[2023-03-08 03:26:11] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-08 03:26:11] [INFO ] Invariant cache hit.
[2023-03-08 03:26:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 03:26:11] [INFO ] Invariant cache hit.
[2023-03-08 03:26:11] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 03:26:12] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-08 03:26:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:26:12] [INFO ] Invariant cache hit.
[2023-03-08 03:26:12] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11 in 4894 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-12
// Phase 1: matrix 184 rows 129 cols
[2023-03-08 03:26:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2336 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 03:26:12] [INFO ] Invariant cache hit.
[2023-03-08 03:26:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:12] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:26:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 03:26:12] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 03:26:12] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2023-03-08 03:26:12] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 12 ms.
[2023-03-08 03:26:12] [INFO ] Added : 17 causal constraints over 4 iterations in 76 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 127 transition count 180
Applied a total of 6 rules in 8 ms. Remains 127 /129 variables (removed 2) and now considering 180/184 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/129 places, 180/184 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 03:26:12] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229860 resets, run finished after 1160 ms. (steps per millisecond=862 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95415 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 1) seen :0
[2023-03-08 03:26:14] [INFO ] Invariant cache hit.
[2023-03-08 03:26:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:14] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-08 03:26:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 03:26:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 03:26:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 03:26:14] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 03:26:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 03:26:14] [INFO ] [Nat]Added 59 Read/Feed constraints in 14 ms returned sat
[2023-03-08 03:26:14] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 13 ms.
[2023-03-08 03:26:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-08 03:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 03:26:14] [INFO ] Added : 18 causal constraints over 4 iterations in 153 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 03:26:14] [INFO ] Invariant cache hit.
[2023-03-08 03:26:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 03:26:14] [INFO ] Invariant cache hit.
[2023-03-08 03:26:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 03:26:14] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-08 03:26:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:26:14] [INFO ] Invariant cache hit.
[2023-03-08 03:26:14] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-12 in 2842 ms.
[2023-03-08 03:26:15] [INFO ] Flatten gal took : 44 ms
[2023-03-08 03:26:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 03:26:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 184 transitions and 727 arcs took 1 ms.
Total runtime 37811 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d2m07
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/363
Upper Bounds

FORMULA DBSingleClientW-PT-d2m07-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m07-UpperBounds-07 3 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d2m07-UpperBounds-11 5 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678246005036

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/363/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/363/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/363/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 12 (type EXCL) for 3 DBSingleClientW-PT-d2m07-UpperBounds-11
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 3 DBSingleClientW-PT-d2m07-UpperBounds-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 3 DBSingleClientW-PT-d2m07-UpperBounds-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type FNDP) for 6 DBSingleClientW-PT-d2m07-UpperBounds-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 7
sara: try reading problem file /home/mcc/execution/363/UpperBounds-11.sara.
sara: place or transition ordering is non-deterministic
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-UpperBounds-11: BOUND 0 0 3 0 1 0 0 0
DBSingleClientW-PT-d2m07-UpperBounds-12: BOUND 0 2 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 BOUND FNDP 5/1800 0/5 DBSingleClientW-PT-d2m07-UpperBounds-12 1066157 t fired, 116627 attempts, .
10 BOUND FNDP 5/1800 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 1182374 t fired, 126706 attempts, .
11 BOUND STEQ 5/1800 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 --
12 BOUND EXCL 5/1200 4/32 DBSingleClientW-PT-d2m07-UpperBounds-11 918982 m, 183796 m/sec, 1293646 t fired, result in [5,7] .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 4 of 4 Visible: 3
sara: warning, failure of lp_solve (at job 556)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
DBSingleClientW-PT-d2m07-UpperBounds-11: BOUND 0 0 3 0 1 0 0 0
DBSingleClientW-PT-d2m07-UpperBounds-12: BOUND 0 2 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 BOUND FNDP 10/1795 0/5 DBSingleClientW-PT-d2m07-UpperBounds-12 2424909 t fired, 266395 attempts, .
10 BOUND FNDP 10/1795 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 2393500 t fired, 257463 attempts, .
11 BOUND STEQ 10/1795 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 --
12 BOUND EXCL 10/1200 8/32 DBSingleClientW-PT-d2m07-UpperBounds-11 2019935 m, 220190 m/sec, 2903218 t fired, result in [5,7] .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 4 of 4 Visible: 3
lola: REPORT NUM
lola: FINISHED task # 9 (type FNDP) for DBSingleClientW-PT-d2m07-UpperBounds-12
lola: fired transitions : 2655135
lola: tried executions : 291868
lola: time used : 11.000000
lola: LAUNCH task # 15 (type FNDP) for 0 DBSingleClientW-PT-d2m07-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: REPORT NUM
lola: FINISHED task # 15 (type FNDP) for DBSingleClientW-PT-d2m07-UpperBounds-07
lola: fired transitions : 16472
lola: tried executions : 1667
lola: time used : 0.000000
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m07-UpperBounds-07: BOUND 3 findpath
DBSingleClientW-PT-d2m07-UpperBounds-12: BOUND 1 findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-UpperBounds-11: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 BOUND FNDP 15/3600 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 3972512 t fired, 428412 attempts, .
11 BOUND STEQ 15/3600 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 --
12 BOUND EXCL 15/3600 13/32 DBSingleClientW-PT-d2m07-UpperBounds-11 3226142 m, 241241 m/sec, 4609645 t fired, result in [5,7] .

Time elapsed: 15 secs. Pages in use: 13
# running tasks: 3 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m07-UpperBounds-07: BOUND 3 findpath
DBSingleClientW-PT-d2m07-UpperBounds-12: BOUND 1 findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-UpperBounds-11: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 BOUND FNDP 20/3600 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 5602725 t fired, 605094 attempts, .
11 BOUND STEQ 20/3600 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 --
12 BOUND EXCL 20/3600 17/32 DBSingleClientW-PT-d2m07-UpperBounds-11 4276107 m, 209993 m/sec, 6304754 t fired, result in [5,7] .

Time elapsed: 20 secs. Pages in use: 17
# running tasks: 3 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m07-UpperBounds-07: BOUND 3 findpath
DBSingleClientW-PT-d2m07-UpperBounds-12: BOUND 1 findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d2m07-UpperBounds-11: BOUND 0 0 3 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 BOUND FNDP 25/3600 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 7233607 t fired, 781699 attempts, .
11 BOUND STEQ 25/3600 0/5 DBSingleClientW-PT-d2m07-UpperBounds-11 --
12 BOUND EXCL 25/3600 20/32 DBSingleClientW-PT-d2m07-UpperBounds-11 5300693 m, 204917 m/sec, 7854492 t fired, result in [5,7] .

Time elapsed: 25 secs. Pages in use: 20
# running tasks: 3 of 4 Visible: 3
lola: REPORT NUM
lola: FINISHED task # 12 (type EXCL) for DBSingleClientW-PT-d2m07-UpperBounds-11
lola: markings : 6014381
lola: fired transitions : 8958048
lola: time used : 29.000000
lola: memory pages used : 23
lola: CANCELED task # 10 (type FNDP) for DBSingleClientW-PT-d2m07-UpperBounds-11 (obsolete)
lola: CANCELED task # 11 (type EQUN) for DBSingleClientW-PT-d2m07-UpperBounds-11 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m07-UpperBounds-07: BOUND 3 findpath
DBSingleClientW-PT-d2m07-UpperBounds-11: BOUND 5 state space
DBSingleClientW-PT-d2m07-UpperBounds-12: BOUND 1 findpath


Time elapsed: 29 secs. Pages in use: 23

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-d2m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DBSingleClientW-PT-d2m07, 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 r103-tall-167814478200317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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