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.r299-tall-167873953400725.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 smartxred
Input is PolyORBNT-PT-S05J30, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400725
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 15K Feb 25 23:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K Feb 25 23:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 274K Feb 25 23:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Feb 25 23:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 216K Feb 25 23:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 30K Feb 25 23:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Feb 25 23:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 PolyORBNT-PT-S05J30-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J30-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679537128855

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J30
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 02:05:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 02:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 02:05:30] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-23 02:05:30] [INFO ] Transformed 489 places.
[2023-03-23 02:05:30] [INFO ] Transformed 1400 transitions.
[2023-03-23 02:05:30] [INFO ] Parsed PT model containing 489 places and 1400 transitions and 9764 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 741 out of 745 initially.
// Phase 1: matrix 741 rows 489 cols
[2023-03-23 02:05:30] [INFO ] Computed 82 place invariants in 55 ms
FORMULA PolyORBNT-PT-S05J30-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 685 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 15) seen :35
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 180 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :26
Incomplete Best-First random walk after 10000 steps, including 160 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :26
Incomplete Best-First random walk after 10000 steps, including 172 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :27
FORMULA PolyORBNT-PT-S05J30-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10001 steps, including 156 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :34
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :35
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :26
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :32
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :33
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :17
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :36
[2023-03-23 02:05:31] [INFO ] Flow matrix only has 741 transitions (discarded 4 similar events)
// Phase 1: matrix 741 rows 489 cols
[2023-03-23 02:05:31] [INFO ] Computed 82 place invariants in 29 ms
[2023-03-23 02:05:31] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2023-03-23 02:05:31] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 24 ms returned unsat
[2023-03-23 02:05:31] [INFO ] [Real]Absence check using 58 positive place invariants in 14 ms returned sat
[2023-03-23 02:05:31] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-23 02:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:31] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-23 02:05:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:05:31] [INFO ] [Nat]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-23 02:05:31] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 25 ms returned sat
[2023-03-23 02:05:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:32] [INFO ] [Nat]Absence check using state equation in 298 ms returned unsat
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned unsat
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using 58 positive place invariants in 13 ms returned sat
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 23 ms returned unsat
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-23 02:05:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:32] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-23 02:05:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:05:32] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:32] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-23 02:05:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:37] [INFO ] [Nat]Absence check using state equation in 4927 ms returned unknown
[2023-03-23 02:05:37] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-23 02:05:37] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-23 02:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:38] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-23 02:05:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:05:38] [INFO ] [Nat]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:38] [INFO ] [Nat]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-23 02:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:38] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2023-03-23 02:05:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:05:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2023-03-23 02:05:38] [INFO ] Computed and/alt/rep : 449/1109/449 causal constraints (skipped 286 transitions) in 57 ms.
[2023-03-23 02:05:39] [INFO ] Deduced a trap composed of 301 places in 197 ms of which 6 ms to minimize.
[2023-03-23 02:05:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 362 ms
[2023-03-23 02:05:39] [INFO ] Added : 20 causal constraints over 4 iterations in 962 ms. Result :sat
Minimization took 296 ms.
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 6 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 10 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 12 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using state equation in 159 ms returned unsat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:40] [INFO ] [Real]Absence check using 58 positive and 24 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 3, 10, 320, 1, 2, 1, 1, 1, 1, 10, 3] Max seen :[1, 4, 1, 3, 4, 3, 1, 2, 1, 1, 1, 1, 10, 3]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J30-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 745/745 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 484 transition count 709
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 77 place count 448 transition count 709
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 77 place count 448 transition count 675
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 145 place count 414 transition count 675
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 146 place count 413 transition count 674
Iterating global reduction 2 with 1 rules applied. Total rules applied 147 place count 413 transition count 674
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 151 place count 411 transition count 672
Applied a total of 151 rules in 155 ms. Remains 411 /489 variables (removed 78) and now considering 672/745 (removed 73) transitions.
[2023-03-23 02:05:40] [INFO ] Flow matrix only has 668 transitions (discarded 4 similar events)
// Phase 1: matrix 668 rows 411 cols
[2023-03-23 02:05:40] [INFO ] Computed 77 place invariants in 17 ms
[2023-03-23 02:05:41] [INFO ] Dead Transitions using invariants and state equation in 464 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/489 places, 577/745 transitions.
Applied a total of 0 rules in 29 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 652 ms. Remains : 411/489 places, 577/745 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:05:41] [INFO ] Computed 77 place invariants in 16 ms
Incomplete random walk after 1000001 steps, including 47467 resets, run finished after 3955 ms. (steps per millisecond=252 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 4138 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 5500 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 2) seen :7
[2023-03-23 02:05:47] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:05:47] [INFO ] Computed 77 place invariants in 15 ms
[2023-03-23 02:05:47] [INFO ] [Real]Absence check using 59 positive place invariants in 10 ms returned sat
[2023-03-23 02:05:47] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 12 ms returned sat
[2023-03-23 02:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:47] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2023-03-23 02:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:05:47] [INFO ] [Nat]Absence check using 59 positive place invariants in 10 ms returned sat
[2023-03-23 02:05:47] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-23 02:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:49] [INFO ] [Nat]Absence check using state equation in 1693 ms returned unsat
[2023-03-23 02:05:49] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:49] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 21 ms returned sat
[2023-03-23 02:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:49] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2023-03-23 02:05:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:05:49] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-23 02:05:49] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-23 02:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:05:50] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-23 02:05:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:05:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 36 ms returned sat
[2023-03-23 02:05:50] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 1 ms to minimize.
[2023-03-23 02:05:50] [INFO ] Deduced a trap composed of 143 places in 118 ms of which 5 ms to minimize.
[2023-03-23 02:05:50] [INFO ] Deduced a trap composed of 128 places in 139 ms of which 0 ms to minimize.
[2023-03-23 02:05:50] [INFO ] Deduced a trap composed of 137 places in 116 ms of which 1 ms to minimize.
[2023-03-23 02:05:50] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 0 ms to minimize.
[2023-03-23 02:05:50] [INFO ] Deduced a trap composed of 128 places in 121 ms of which 0 ms to minimize.
[2023-03-23 02:05:51] [INFO ] Deduced a trap composed of 134 places in 118 ms of which 1 ms to minimize.
[2023-03-23 02:05:51] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 1 ms to minimize.
[2023-03-23 02:05:51] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-23 02:05:51] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 1 ms to minimize.
[2023-03-23 02:05:51] [INFO ] Deduced a trap composed of 142 places in 129 ms of which 0 ms to minimize.
[2023-03-23 02:05:52] [INFO ] Deduced a trap composed of 134 places in 114 ms of which 0 ms to minimize.
[2023-03-23 02:05:52] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 1 ms to minimize.
[2023-03-23 02:05:52] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 0 ms to minimize.
[2023-03-23 02:05:52] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:05:52] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 1 ms to minimize.
[2023-03-23 02:05:53] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 1 ms to minimize.
[2023-03-23 02:05:53] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:05:53] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 0 ms to minimize.
[2023-03-23 02:05:53] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 1 ms to minimize.
[2023-03-23 02:05:53] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 0 ms to minimize.
[2023-03-23 02:05:53] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 0 ms to minimize.
[2023-03-23 02:05:54] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 1 ms to minimize.
[2023-03-23 02:05:56] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:05:59] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9572 ms
Current structural bounds on expressions (after SMT) : [4, 320] Max seen :[4, 3]
FORMULA PolyORBNT-PT-S05J30-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 33 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:05:59] [INFO ] Computed 77 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 47249 resets, run finished after 3831 ms. (steps per millisecond=261 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5535 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties (out of 1) seen :3
[2023-03-23 02:06:04] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:06:04] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-23 02:06:04] [INFO ] [Real]Absence check using 59 positive place invariants in 9 ms returned sat
[2023-03-23 02:06:04] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 12 ms returned sat
[2023-03-23 02:06:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:06:04] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-23 02:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:06:04] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-23 02:06:04] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-23 02:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:06:05] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-23 02:06:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:06:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-23 02:06:05] [INFO ] Deduced a trap composed of 119 places in 109 ms of which 1 ms to minimize.
[2023-03-23 02:06:05] [INFO ] Deduced a trap composed of 143 places in 116 ms of which 1 ms to minimize.
[2023-03-23 02:06:05] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 0 ms to minimize.
[2023-03-23 02:06:05] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:06:05] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 1 ms to minimize.
[2023-03-23 02:06:05] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 0 ms to minimize.
[2023-03-23 02:06:06] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 1 ms to minimize.
[2023-03-23 02:06:06] [INFO ] Deduced a trap composed of 132 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:06:06] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 1 ms to minimize.
[2023-03-23 02:06:06] [INFO ] Deduced a trap composed of 137 places in 108 ms of which 1 ms to minimize.
[2023-03-23 02:06:06] [INFO ] Deduced a trap composed of 142 places in 116 ms of which 0 ms to minimize.
[2023-03-23 02:06:07] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 1 ms to minimize.
[2023-03-23 02:06:07] [INFO ] Deduced a trap composed of 122 places in 111 ms of which 0 ms to minimize.
[2023-03-23 02:06:07] [INFO ] Deduced a trap composed of 126 places in 113 ms of which 0 ms to minimize.
[2023-03-23 02:06:07] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2023-03-23 02:06:07] [INFO ] Deduced a trap composed of 129 places in 117 ms of which 0 ms to minimize.
[2023-03-23 02:06:07] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-23 02:06:08] [INFO ] Deduced a trap composed of 133 places in 109 ms of which 0 ms to minimize.
[2023-03-23 02:06:08] [INFO ] Deduced a trap composed of 133 places in 113 ms of which 0 ms to minimize.
[2023-03-23 02:06:08] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-23 02:06:08] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 0 ms to minimize.
[2023-03-23 02:06:08] [INFO ] Deduced a trap composed of 125 places in 110 ms of which 0 ms to minimize.
[2023-03-23 02:06:08] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 0 ms to minimize.
[2023-03-23 02:06:11] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 1 ms to minimize.
[2023-03-23 02:06:14] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9210 ms
Current structural bounds on expressions (after SMT) : [320] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 17 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 19 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-23 02:06:14] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:14] [INFO ] Invariant cache hit.
[2023-03-23 02:06:14] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-23 02:06:14] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:14] [INFO ] Invariant cache hit.
[2023-03-23 02:06:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:06:18] [INFO ] Implicit Places using invariants and state equation in 3521 ms returned []
Implicit Place search using SMT with State Equation took 4040 ms to find 0 implicit places.
[2023-03-23 02:06:18] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-23 02:06:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:18] [INFO ] Invariant cache hit.
[2023-03-23 02:06:18] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4496 ms. Remains : 411/411 places, 577/577 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-05
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:06:18] [INFO ] Computed 77 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 473 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :3
[2023-03-23 02:06:18] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:06:19] [INFO ] Computed 77 place invariants in 12 ms
[2023-03-23 02:06:19] [INFO ] [Real]Absence check using 59 positive place invariants in 10 ms returned sat
[2023-03-23 02:06:19] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 12 ms returned sat
[2023-03-23 02:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:06:19] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-23 02:06:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:06:19] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-23 02:06:19] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-23 02:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:06:19] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-23 02:06:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-23 02:06:19] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 1 ms to minimize.
[2023-03-23 02:06:19] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 1 ms to minimize.
[2023-03-23 02:06:19] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-23 02:06:20] [INFO ] Deduced a trap composed of 137 places in 123 ms of which 0 ms to minimize.
[2023-03-23 02:06:20] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 0 ms to minimize.
[2023-03-23 02:06:20] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 1 ms to minimize.
[2023-03-23 02:06:20] [INFO ] Deduced a trap composed of 134 places in 117 ms of which 1 ms to minimize.
[2023-03-23 02:06:20] [INFO ] Deduced a trap composed of 132 places in 134 ms of which 1 ms to minimize.
[2023-03-23 02:06:20] [INFO ] Deduced a trap composed of 131 places in 107 ms of which 1 ms to minimize.
[2023-03-23 02:06:21] [INFO ] Deduced a trap composed of 137 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:06:21] [INFO ] Deduced a trap composed of 142 places in 121 ms of which 0 ms to minimize.
[2023-03-23 02:06:21] [INFO ] Deduced a trap composed of 134 places in 120 ms of which 0 ms to minimize.
[2023-03-23 02:06:21] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 0 ms to minimize.
[2023-03-23 02:06:21] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-23 02:06:22] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 0 ms to minimize.
[2023-03-23 02:06:22] [INFO ] Deduced a trap composed of 129 places in 110 ms of which 1 ms to minimize.
[2023-03-23 02:06:22] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 0 ms to minimize.
[2023-03-23 02:06:22] [INFO ] Deduced a trap composed of 133 places in 118 ms of which 0 ms to minimize.
[2023-03-23 02:06:22] [INFO ] Deduced a trap composed of 133 places in 121 ms of which 3 ms to minimize.
[2023-03-23 02:06:22] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 5 ms to minimize.
[2023-03-23 02:06:23] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 0 ms to minimize.
[2023-03-23 02:06:23] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 0 ms to minimize.
[2023-03-23 02:06:23] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 0 ms to minimize.
[2023-03-23 02:06:24] [INFO ] Trap strengthening (SAT) tested/added 23/23 trap constraints in 4704 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 28 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-23 02:06:24] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:24] [INFO ] Invariant cache hit.
[2023-03-23 02:06:24] [INFO ] Dead Transitions using invariants and state equation in 388 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 411/411 places, 577/577 transitions.
Normalized transition count is 573 out of 577 initially.
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:06:24] [INFO ] Computed 77 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 47448 resets, run finished after 3824 ms. (steps per millisecond=261 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 5479 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 1) seen :3
[2023-03-23 02:06:29] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
// Phase 1: matrix 573 rows 411 cols
[2023-03-23 02:06:29] [INFO ] Computed 77 place invariants in 14 ms
[2023-03-23 02:06:29] [INFO ] [Real]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-23 02:06:29] [INFO ] [Real]Absence check using 59 positive and 18 generalized place invariants in 13 ms returned sat
[2023-03-23 02:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:06:29] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-23 02:06:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:06:29] [INFO ] [Nat]Absence check using 59 positive place invariants in 11 ms returned sat
[2023-03-23 02:06:29] [INFO ] [Nat]Absence check using 59 positive and 18 generalized place invariants in 14 ms returned sat
[2023-03-23 02:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:06:30] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2023-03-23 02:06:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:06:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2023-03-23 02:06:30] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 1 ms to minimize.
[2023-03-23 02:06:30] [INFO ] Deduced a trap composed of 143 places in 111 ms of which 1 ms to minimize.
[2023-03-23 02:06:30] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 0 ms to minimize.
[2023-03-23 02:06:30] [INFO ] Deduced a trap composed of 137 places in 112 ms of which 1 ms to minimize.
[2023-03-23 02:06:30] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 1 ms to minimize.
[2023-03-23 02:06:30] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-23 02:06:31] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 0 ms to minimize.
[2023-03-23 02:06:31] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 0 ms to minimize.
[2023-03-23 02:06:31] [INFO ] Deduced a trap composed of 131 places in 116 ms of which 1 ms to minimize.
[2023-03-23 02:06:31] [INFO ] Deduced a trap composed of 137 places in 121 ms of which 1 ms to minimize.
[2023-03-23 02:06:31] [INFO ] Deduced a trap composed of 142 places in 111 ms of which 1 ms to minimize.
[2023-03-23 02:06:32] [INFO ] Deduced a trap composed of 134 places in 125 ms of which 0 ms to minimize.
[2023-03-23 02:06:32] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 0 ms to minimize.
[2023-03-23 02:06:32] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 0 ms to minimize.
[2023-03-23 02:06:32] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 1 ms to minimize.
[2023-03-23 02:06:32] [INFO ] Deduced a trap composed of 129 places in 119 ms of which 1 ms to minimize.
[2023-03-23 02:06:32] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2023-03-23 02:06:33] [INFO ] Deduced a trap composed of 133 places in 111 ms of which 0 ms to minimize.
[2023-03-23 02:06:33] [INFO ] Deduced a trap composed of 133 places in 111 ms of which 0 ms to minimize.
[2023-03-23 02:06:33] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 1 ms to minimize.
[2023-03-23 02:06:33] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 0 ms to minimize.
[2023-03-23 02:06:33] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2023-03-23 02:06:33] [INFO ] Deduced a trap composed of 122 places in 122 ms of which 0 ms to minimize.
[2023-03-23 02:06:36] [INFO ] Deduced a trap composed of 128 places in 116 ms of which 0 ms to minimize.
[2023-03-23 02:06:39] [INFO ] Trap strengthening (SAT) tested/added 24/24 trap constraints in 9346 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 15 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 411/411 places, 577/577 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 577/577 transitions.
Applied a total of 0 rules in 14 ms. Remains 411 /411 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2023-03-23 02:06:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:39] [INFO ] Invariant cache hit.
[2023-03-23 02:06:39] [INFO ] Implicit Places using invariants in 477 ms returned []
[2023-03-23 02:06:39] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:39] [INFO ] Invariant cache hit.
[2023-03-23 02:06:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:06:43] [INFO ] Implicit Places using invariants and state equation in 3371 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
[2023-03-23 02:06:43] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-23 02:06:43] [INFO ] Flow matrix only has 573 transitions (discarded 4 similar events)
[2023-03-23 02:06:43] [INFO ] Invariant cache hit.
[2023-03-23 02:06:43] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4270 ms. Remains : 411/411 places, 577/577 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J30-UpperBounds-05 in 24855 ms.
[2023-03-23 02:06:44] [INFO ] Flatten gal took : 129 ms
[2023-03-23 02:06:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 02:06:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 411 places, 577 transitions and 2961 arcs took 9 ms.
Total runtime 73798 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S05J30
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 411 places, 577 transitions, 2961 arcs.
Final Score: 24937.788
Took : 46 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6775220 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104940 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="PolyORBNT-PT-S05J30"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PolyORBNT-PT-S05J30, 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 r299-tall-167873953400725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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