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.r101-tall-167814475100253.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 itstools
Input is DBSingleClientW-PT-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475100253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K 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-d1m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678240704704

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-08 01:58:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 01:58:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:58:26] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-08 01:58:26] [INFO ] Transformed 1440 places.
[2023-03-08 01:58:26] [INFO ] Transformed 672 transitions.
[2023-03-08 01:58:26] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 01:58:26] [INFO ] Computed 6 place invariants in 43 ms
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 965 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 962 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
[2023-03-08 01:58:26] [INFO ] Invariant cache hit.
[2023-03-08 01:58:26] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2023-03-08 01:58:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned unsat
[2023-03-08 01:58:26] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:58:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 01:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:27] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-08 01:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:58:27] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 01:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:27] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-08 01:58:27] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 01:58:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 85 ms returned sat
[2023-03-08 01:58:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 123 ms.
[2023-03-08 01:58:27] [INFO ] Added : 11 causal constraints over 3 iterations in 341 ms. Result :sat
Minimization took 97 ms.
[2023-03-08 01:58:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:58:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2023-03-08 01:58:28] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:58:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:58:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:28] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-08 01:58:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:58:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 01:58:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:28] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-08 01:58:28] [INFO ] [Nat]Added 418 Read/Feed constraints in 56 ms returned sat
[2023-03-08 01:58:28] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 59 ms.
[2023-03-08 01:58:28] [INFO ] Added : 2 causal constraints over 1 iterations in 149 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [1, 7, 1, 8] Max seen :[1, 0, 1, 1]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 185 place count 229 transition count 327
Iterating global reduction 1 with 96 rules applied. Total rules applied 281 place count 229 transition count 327
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 285 place count 229 transition count 323
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 358 place count 156 transition count 250
Iterating global reduction 2 with 73 rules applied. Total rules applied 431 place count 156 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 437 place count 156 transition count 244
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 479 place count 114 transition count 176
Iterating global reduction 3 with 42 rules applied. Total rules applied 521 place count 114 transition count 176
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 544 place count 114 transition count 153
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 556 place count 102 transition count 134
Iterating global reduction 4 with 12 rules applied. Total rules applied 568 place count 102 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 570 place count 102 transition count 132
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 579 place count 93 transition count 123
Iterating global reduction 5 with 9 rules applied. Total rules applied 588 place count 93 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 591 place count 93 transition count 120
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 598 place count 86 transition count 113
Iterating global reduction 6 with 7 rules applied. Total rules applied 605 place count 86 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 608 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 609 place count 85 transition count 108
Iterating global reduction 7 with 1 rules applied. Total rules applied 610 place count 85 transition count 108
Applied a total of 610 rules in 86 ms. Remains 85 /347 variables (removed 262) and now considering 108/672 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 85/347 places, 108/672 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 01:58:28] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229771 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98618 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98607 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 2) seen :2
[2023-03-08 01:58:30] [INFO ] Invariant cache hit.
[2023-03-08 01:58:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:30] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:58:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:30] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:58:30] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:30] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-08 01:58:30] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 01:58:30] [INFO ] Added : 13 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 25 ms.
[2023-03-08 01:58:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:30] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 01:58:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:58:31] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-08 01:58:31] [INFO ] Deduced a trap composed of 11 places in 553 ms of which 502 ms to minimize.
[2023-03-08 01:58:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 565 ms
[2023-03-08 01:58:31] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 11 ms.
[2023-03-08 01:58:31] [INFO ] Added : 13 causal constraints over 4 iterations in 55 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [7, 8] Max seen :[0, 2]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:58:31] [INFO ] Invariant cache hit.
[2023-03-08 01:58:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:58:31] [INFO ] Invariant cache hit.
[2023-03-08 01:58:31] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:31] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 01:58:31] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:58:31] [INFO ] Invariant cache hit.
[2023-03-08 01:58:31] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 85/85 places, 108/108 transitions.
[2023-03-08 01:58:31] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229722 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98287 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98466 resets, run finished after 392 ms. (steps per millisecond=2551 ) properties (out of 2) seen :2
[2023-03-08 01:58:33] [INFO ] Invariant cache hit.
[2023-03-08 01:58:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:58:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:33] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:58:33] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-08 01:58:33] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 01:58:33] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 22 ms.
[2023-03-08 01:58:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 01:58:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:33] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:58:33] [INFO ] [Nat]Added 36 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:58:33] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-08 01:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 01:58:33] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-08 01:58:33] [INFO ] Added : 13 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [7, 8] Max seen :[0, 2]
Support contains 2 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:58:34] [INFO ] Invariant cache hit.
[2023-03-08 01:58:34] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 01:58:34] [INFO ] Invariant cache hit.
[2023-03-08 01:58:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:34] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-08 01:58:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:58:34] [INFO ] Invariant cache hit.
[2023-03-08 01:58:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 239 ms. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06
[2023-03-08 01:58:34] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-08 01:58:34] [INFO ] Invariant cache hit.
[2023-03-08 01:58:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:34] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 01:58:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:58:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:34] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-08 01:58:34] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-08 01:58:34] [INFO ] Added : 13 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 85/85 places, 108/108 transitions.
[2023-03-08 01:58:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229581 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98857 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :0
[2023-03-08 01:58:35] [INFO ] Invariant cache hit.
[2023-03-08 01:58:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-08 01:58:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 01:58:35] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:35] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-08 01:58:35] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 01:58:35] [INFO ] Added : 13 causal constraints over 3 iterations in 47 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:58:35] [INFO ] Invariant cache hit.
[2023-03-08 01:58:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 01:58:35] [INFO ] Invariant cache hit.
[2023-03-08 01:58:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:36] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-08 01:58:36] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:58:36] [INFO ] Invariant cache hit.
[2023-03-08 01:58:36] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06 in 1874 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14
[2023-03-08 01:58:36] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2340 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-08 01:58:36] [INFO ] Invariant cache hit.
[2023-03-08 01:58:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:36] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:58:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:36] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:58:36] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:58:36] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-08 01:58:36] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-08 01:58:36] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 82 transition count 99
Applied a total of 7 rules in 13 ms. Remains 82 /85 variables (removed 3) and now considering 99/108 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/85 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-08 01:58:36] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229673 resets, run finished after 727 ms. (steps per millisecond=1375 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98006 resets, run finished after 355 ms. (steps per millisecond=2816 ) properties (out of 1) seen :2
[2023-03-08 01:58:37] [INFO ] Invariant cache hit.
[2023-03-08 01:58:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 01:58:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:58:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:58:37] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:58:37] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:58:37] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2023-03-08 01:58:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-08 01:58:37] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 8 ms.
[2023-03-08 01:58:37] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-08 01:58:37] [INFO ] Invariant cache hit.
[2023-03-08 01:58:37] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 01:58:37] [INFO ] Invariant cache hit.
[2023-03-08 01:58:37] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:58:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-08 01:58:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:58:37] [INFO ] Invariant cache hit.
[2023-03-08 01:58:37] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 82/82 places, 99/99 transitions.
[2023-03-08 01:58:37] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229610 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98584 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 1) seen :2
[2023-03-08 01:58:38] [INFO ] Invariant cache hit.
[2023-03-08 01:58:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 01:58:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:58:39] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:58:39] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-08 01:58:39] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:58:39] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:58:39] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 2 ms to minimize.
[2023-03-08 01:58:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-08 01:58:39] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 7 ms.
[2023-03-08 01:58:39] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-08 01:58:39] [INFO ] Invariant cache hit.
[2023-03-08 01:58:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 01:58:39] [INFO ] Invariant cache hit.
[2023-03-08 01:58:39] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:58:39] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 01:58:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:58:39] [INFO ] Invariant cache hit.
[2023-03-08 01:58:39] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14 in 3215 ms.
[2023-03-08 01:58:39] [INFO ] Flatten gal took : 30 ms
[2023-03-08 01:58:39] [INFO ] Applying decomposition
[2023-03-08 01:58:39] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11986559005272719151.txt' '-o' '/tmp/graph11986559005272719151.bin' '-w' '/tmp/graph11986559005272719151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11986559005272719151.bin' '-l' '-1' '-v' '-w' '/tmp/graph11986559005272719151.weights' '-q' '0' '-e' '0.001'
[2023-03-08 01:58:39] [INFO ] Decomposing Gal with order
[2023-03-08 01:58:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 01:58:39] [INFO ] Removed a total of 119 redundant transitions.
[2023-03-08 01:58:39] [INFO ] Flatten gal took : 36 ms
[2023-03-08 01:58:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 6 ms.
[2023-03-08 01:58:39] [INFO ] Time to serialize gal into /tmp/UpperBounds15267820450441342241.gal : 5 ms
[2023-03-08 01:58:39] [INFO ] Time to serialize properties into /tmp/UpperBounds18104074228928376547.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15267820450441342241.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18104074228928376547.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds18104074228928376547.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,478508,0.259759,14692,942,491,17027,2747,330,39410,95,18691,0
Total reachable state count : 478508

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-06 :0 <= i4.u9.s9 <= 1
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 1 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-d1m06-UpperBounds-06,0,0.290216,14952,1,0,17027,2747,423,39410,117,18691,715
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-14 :0 <= i1.u1.l618 <= 2
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 2 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-d1m06-UpperBounds-14,0,0.291097,14952,1,0,17027,2747,450,39410,123,18691,904
Total runtime 13941 ms.

BK_STOP 1678240726297

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d1m06, 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 r101-tall-167814475100253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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