Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292600079.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DBSingleClientW-PT-d1m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 7 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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-d1m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745191052

Running Version 0
[2022-06-09 03:26:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:26:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:26:32] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2022-06-09 03:26:32] [INFO ] Transformed 1440 places.
[2022-06-09 03:26:32] [INFO ] Transformed 672 transitions.
[2022-06-09 03:26:32] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:26:32] [INFO ] Computed 6 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 2338 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 1042 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 991 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:26:33] [INFO ] Computed 6 place invariants in 32 ms
[2022-06-09 03:26:33] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-09 03:26:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:33] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2022-06-09 03:26:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:26:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:33] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-06-09 03:26:33] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:26:34] [INFO ] [Nat]Added 418 Read/Feed constraints in 272 ms returned sat
[2022-06-09 03:26:34] [INFO ] Deduced a trap composed of 21 places in 176 ms of which 4 ms to minimize.
[2022-06-09 03:26:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-06-09 03:26:34] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 134 ms.
[2022-06-09 03:26:35] [INFO ] Added : 108 causal constraints over 22 iterations in 1218 ms. Result :sat
Minimization took 685 ms.
[2022-06-09 03:26:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:26:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:36] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-09 03:26:36] [INFO ] [Real]Added 418 Read/Feed constraints in 198 ms returned sat
[2022-06-09 03:26:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:26:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-06-09 03:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:37] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2022-06-09 03:26:37] [INFO ] [Nat]Added 418 Read/Feed constraints in 312 ms returned sat
[2022-06-09 03:26:37] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 2 ms to minimize.
[2022-06-09 03:26:37] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 1 ms to minimize.
[2022-06-09 03:26:37] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2022-06-09 03:26:38] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2022-06-09 03:26:38] [INFO ] Deduced a trap composed of 29 places in 129 ms of which 0 ms to minimize.
[2022-06-09 03:26:38] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
[2022-06-09 03:26:38] [INFO ] Deduced a trap composed of 30 places in 159 ms of which 1 ms to minimize.
[2022-06-09 03:26:38] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 12 ms to minimize.
[2022-06-09 03:26:38] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 0 ms to minimize.
[2022-06-09 03:26:39] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2022-06-09 03:26:39] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 1 ms to minimize.
[2022-06-09 03:26:39] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 0 ms to minimize.
[2022-06-09 03:26:39] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 1 ms to minimize.
[2022-06-09 03:26:39] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 0 ms to minimize.
[2022-06-09 03:26:39] [INFO ] Deduced a trap composed of 30 places in 126 ms of which 0 ms to minimize.
[2022-06-09 03:26:40] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 1 ms to minimize.
[2022-06-09 03:26:40] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 0 ms to minimize.
[2022-06-09 03:26:40] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 1 ms to minimize.
[2022-06-09 03:26:40] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2022-06-09 03:26:40] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 1 ms to minimize.
[2022-06-09 03:26:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 3820 ms
[2022-06-09 03:26:41] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 72 ms.
[2022-06-09 03:26:42] [INFO ] Deduced a trap composed of 26 places in 157 ms of which 1 ms to minimize.
[2022-06-09 03:26:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 03:26:42] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:26:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:42] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-06-09 03:26:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2022-06-09 03:26:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-06-09 03:26:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:42] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-06-09 03:26:42] [INFO ] [Nat]Added 418 Read/Feed constraints in 220 ms returned sat
[2022-06-09 03:26:42] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 1 ms to minimize.
[2022-06-09 03:26:42] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 0 ms to minimize.
[2022-06-09 03:26:43] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2022-06-09 03:26:43] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 1 ms to minimize.
[2022-06-09 03:26:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 665 ms
[2022-06-09 03:26:43] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 69 ms.
[2022-06-09 03:26:44] [INFO ] Added : 117 causal constraints over 24 iterations in 1247 ms. Result :sat
Minimization took 576 ms.
Current structural bounds on expressions (after SMT) : [7, 3, 1428] Max seen :[0, 1, 0]
Incomplete Parikh walk after 30100 steps, including 5920 resets, run finished after 160 ms. (steps per millisecond=188 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 87200 steps, including 17325 resets, run finished after 417 ms. (steps per millisecond=209 ) properties (out of 3) seen :2 could not realise parikh vector
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.9 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 326 transition count 587
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 181 place count 231 transition count 330
Iterating global reduction 1 with 95 rules applied. Total rules applied 276 place count 231 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 280 place count 231 transition count 326
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 353 place count 158 transition count 253
Iterating global reduction 2 with 73 rules applied. Total rules applied 426 place count 158 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 432 place count 158 transition count 247
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 474 place count 116 transition count 179
Iterating global reduction 3 with 42 rules applied. Total rules applied 516 place count 116 transition count 179
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 539 place count 116 transition count 156
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 549 place count 106 transition count 140
Iterating global reduction 4 with 10 rules applied. Total rules applied 559 place count 106 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 561 place count 106 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 569 place count 98 transition count 130
Iterating global reduction 5 with 8 rules applied. Total rules applied 577 place count 98 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 578 place count 98 transition count 129
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 585 place count 91 transition count 122
Iterating global reduction 6 with 7 rules applied. Total rules applied 592 place count 91 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 595 place count 91 transition count 119
Applied a total of 595 rules in 112 ms. Remains 91 /347 variables (removed 256) and now considering 119/672 (removed 553) transitions.
Finished structural reductions, in 1 iterations. Remains : 91/347 places, 119/672 transitions.
// Phase 1: matrix 119 rows 91 cols
[2022-06-09 03:26:45] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229470 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 98309 resets, run finished after 508 ms. (steps per millisecond=1968 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 98443 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 98274 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 3) seen :3
// Phase 1: matrix 119 rows 91 cols
[2022-06-09 03:26:48] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:26:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:48] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2022-06-09 03:26:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:48] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:26:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:48] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:26:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 03:26:48] [INFO ] [Nat]Added 44 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:26:48] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:26:48] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2022-06-09 03:26:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2022-06-09 03:26:48] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 87 transitions) in 6 ms.
[2022-06-09 03:26:48] [INFO ] Added : 29 causal constraints over 6 iterations in 62 ms. Result :sat
Minimization took 33 ms.
[2022-06-09 03:26:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:26:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:48] [INFO ] [Real]Absence check using state equation in 28 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 3, 1] Max seen :[1, 2, 1]
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 17600 steps, including 3181 resets, run finished after 21 ms. (steps per millisecond=838 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 281 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 117
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 87 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 86 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 85 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 85 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 84 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 84 transition count 103
Applied a total of 16 rules in 26 ms. Remains 84 /91 variables (removed 7) and now considering 103/119 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/91 places, 103/119 transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:48] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229426 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98598 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties (out of 1) seen :2
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:26:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:49] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:26:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:50] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:26:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:50] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:26:50] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2022-06-09 03:26:50] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-06-09 03:26:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2022-06-09 03:26:50] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 4 ms.
[2022-06-09 03:26:50] [INFO ] Added : 27 causal constraints over 6 iterations in 56 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Incomplete Parikh walk after 14900 steps, including 2480 resets, run finished after 24 ms. (steps per millisecond=620 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:50] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:50] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:26:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:50] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2022-06-09 03:26:50] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:50] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:26:50] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-08
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:50] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:50] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:26:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:50] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 03:26:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:50] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:26:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2022-06-09 03:26:50] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2022-06-09 03:26:50] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2022-06-09 03:26:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2022-06-09 03:26:50] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 10 ms.
[2022-06-09 03:26:50] [INFO ] Added : 28 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 14900 steps, including 2368 resets, run finished after 19 ms. (steps per millisecond=784 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:50] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229116 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98407 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :2
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:26:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:52] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:26:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:52] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:26:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:52] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:26:52] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-06-09 03:26:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 8 ms to minimize.
[2022-06-09 03:26:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2022-06-09 03:26:52] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 6 ms.
[2022-06-09 03:26:52] [INFO ] Added : 27 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 14900 steps, including 2450 resets, run finished after 21 ms. (steps per millisecond=709 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 11 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:26:52] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:52] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:26:52] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:52] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2022-06-09 03:26:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:52] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:52] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229797 resets, run finished after 845 ms. (steps per millisecond=1183 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98868 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :2
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:53] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:53] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:26:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:54] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:26:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:54] [INFO ] [Nat]Added 30 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:26:54] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2022-06-09 03:26:54] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2022-06-09 03:26:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-06-09 03:26:54] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 5 ms.
[2022-06-09 03:26:54] [INFO ] Added : 27 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 14900 steps, including 2458 resets, run finished after 20 ms. (steps per millisecond=745 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting structural reductions, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:26:54] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:26:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-06-09 03:26:54] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 03:26:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:26:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-08 in 3927 ms.
[2022-06-09 03:26:54] [INFO ] Flatten gal took : 41 ms
[2022-06-09 03:26:54] [INFO ] Applying decomposition
[2022-06-09 03:26:54] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph2499099986278530770.txt, -o, /tmp/graph2499099986278530770.bin, -w, /tmp/graph2499099986278530770.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph2499099986278530770.bin, -l, -1, -v, -w, /tmp/graph2499099986278530770.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:26:54] [INFO ] Decomposing Gal with order
[2022-06-09 03:26:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:26:54] [INFO ] Removed a total of 93 redundant transitions.
[2022-06-09 03:26:54] [INFO ] Flatten gal took : 52 ms
[2022-06-09 03:26:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 13 ms.
[2022-06-09 03:26:54] [INFO ] Time to serialize gal into /tmp/UpperBounds7800997477216465825.gal : 5 ms
[2022-06-09 03:26:54] [INFO ] Time to serialize properties into /tmp/UpperBounds16755151043734683155.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7800997477216465825.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16755151043734683155.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7800997477216465825.gal -t CGAL -reachable-file /tmp/UpperBounds16755151043734683155.prop --nowitness
Loading property file /tmp/UpperBounds16755151043734683155.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.00878e+06,2.55853,59716,1739,709,59112,12962,347,323983,135,116436,0
Total reachable state count : 3008782

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m07-UpperBounds-08 :0 <= i0.u0.l965 <= 3
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-08 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m07-UpperBounds-08,0,2.79628,59716,1,0,59112,12962,438,323983,160,116436,1255

BK_STOP 1654745218642

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-d1m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d1m07, 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 r323-tall-165472292600079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m07.tgz
mv DBSingleClientW-PT-d1m07 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 ;