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-167873953400789.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-S10J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400789
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 30K Feb 26 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 26 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 786K Feb 26 01:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 26 01:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 34K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 181K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 38K Feb 26 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 02:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Feb 26 02:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K 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 14M 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-S10J80-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679552935987

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-S10J80
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 06:28:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 06:28:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:28:58] [INFO ] Load time of PNML (sax parser for PT used): 552 ms
[2023-03-23 06:28:58] [INFO ] Transformed 1614 places.
[2023-03-23 06:28:58] [INFO ] Transformed 13500 transitions.
[2023-03-23 06:28:58] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 698 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 3381 out of 3390 initially.
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-23 06:28:58] [INFO ] Computed 192 place invariants in 256 ms
Incomplete random walk after 10000 steps, including 560 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :42
FORMULA PolyORBNT-PT-S10J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :41
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 15) seen :31
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 15) seen :31
[2023-03-23 06:28:59] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-23 06:28:59] [INFO ] Computed 192 place invariants in 117 ms
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive place invariants in 62 ms returned sat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 65 ms returned unsat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive place invariants in 49 ms returned sat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 23 ms returned unsat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive place invariants in 41 ms returned sat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 45 ms returned unsat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive place invariants in 49 ms returned sat
[2023-03-23 06:29:00] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 66 ms returned unsat
[2023-03-23 06:29:01] [INFO ] [Real]Absence check using 159 positive place invariants in 42 ms returned sat
[2023-03-23 06:29:01] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 22 ms returned unsat
[2023-03-23 06:29:01] [INFO ] [Real]Absence check using 159 positive place invariants in 43 ms returned sat
[2023-03-23 06:29:01] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 61 ms returned unsat
[2023-03-23 06:29:01] [INFO ] [Real]Absence check using 159 positive place invariants in 40 ms returned sat
[2023-03-23 06:29:01] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 70 ms returned sat
[2023-03-23 06:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:29:06] [INFO ] [Real]Absence check using state equation in 4767 ms returned unknown
[2023-03-23 06:29:06] [INFO ] [Real]Absence check using 159 positive place invariants in 43 ms returned sat
[2023-03-23 06:29:06] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 62 ms returned sat
[2023-03-23 06:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:29:11] [INFO ] [Real]Absence check using state equation in 4423 ms returned unsat
[2023-03-23 06:29:11] [INFO ] [Real]Absence check using 159 positive place invariants in 42 ms returned sat
[2023-03-23 06:29:11] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 29 ms returned unsat
[2023-03-23 06:29:11] [INFO ] [Real]Absence check using 159 positive place invariants in 40 ms returned sat
[2023-03-23 06:29:11] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 68 ms returned sat
[2023-03-23 06:29:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:29:13] [INFO ] [Real]Absence check using state equation in 2299 ms returned sat
[2023-03-23 06:29:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:29:14] [INFO ] [Nat]Absence check using 159 positive place invariants in 39 ms returned sat
[2023-03-23 06:29:14] [INFO ] [Nat]Absence check using 159 positive and 33 generalized place invariants in 61 ms returned sat
[2023-03-23 06:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:29:19] [INFO ] [Nat]Absence check using state equation in 4783 ms returned unknown
[2023-03-23 06:29:19] [INFO ] [Real]Absence check using 159 positive place invariants in 40 ms returned sat
[2023-03-23 06:29:19] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 66 ms returned sat
[2023-03-23 06:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:29:23] [INFO ] [Real]Absence check using state equation in 3951 ms returned sat
[2023-03-23 06:29:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:29:23] [INFO ] [Nat]Absence check using 159 positive place invariants in 42 ms returned sat
[2023-03-23 06:29:23] [INFO ] [Nat]Absence check using 159 positive and 33 generalized place invariants in 71 ms returned sat
[2023-03-23 06:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:29:28] [INFO ] [Nat]Absence check using state equation in 4735 ms returned unknown
[2023-03-23 06:29:28] [INFO ] [Real]Absence check using 159 positive place invariants in 40 ms returned sat
[2023-03-23 06:29:28] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 66 ms returned unsat
[2023-03-23 06:29:28] [INFO ] [Real]Absence check using 159 positive place invariants in 41 ms returned sat
[2023-03-23 06:29:28] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 41 ms returned unsat
[2023-03-23 06:29:29] [INFO ] [Real]Absence check using 159 positive place invariants in 43 ms returned sat
[2023-03-23 06:29:29] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 72 ms returned unsat
[2023-03-23 06:29:29] [INFO ] [Real]Absence check using 159 positive place invariants in 38 ms returned sat
[2023-03-23 06:29:29] [INFO ] [Real]Absence check using 159 positive and 33 generalized place invariants in 60 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 1, 1, 1, 1, 1, 377, 10, 1, 2954, 610, 1, 10, 1, 1] Max seen :[10, 1, 1, 1, 1, 1, 1, 10, 1, 0, 1, 1, 10, 1, 1]
FORMULA PolyORBNT-PT-S10J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 83 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1604 transition count 3304
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 182 place count 1518 transition count 3304
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 182 place count 1518 transition count 3220
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 350 place count 1434 transition count 3220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 351 place count 1433 transition count 3219
Iterating global reduction 2 with 1 rules applied. Total rules applied 352 place count 1433 transition count 3219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 356 place count 1431 transition count 3217
Applied a total of 356 rules in 743 ms. Remains 1431 /1614 variables (removed 183) and now considering 3217/3390 (removed 173) transitions.
[2023-03-23 06:29:30] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
// Phase 1: matrix 3208 rows 1431 cols
[2023-03-23 06:29:30] [INFO ] Computed 182 place invariants in 77 ms
[2023-03-23 06:29:33] [INFO ] Dead Transitions using invariants and state equation in 3049 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1431/1614 places, 2602/3390 transitions.
Applied a total of 0 rules in 136 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3933 ms. Remains : 1431/1614 places, 2602/3390 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:29:33] [INFO ] Computed 182 place invariants in 56 ms
Incomplete random walk after 1000000 steps, including 70248 resets, run finished after 13834 ms. (steps per millisecond=72 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 1000001 steps, including 6435 resets, run finished after 3747 ms. (steps per millisecond=266 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 6329 resets, run finished after 2358 ms. (steps per millisecond=424 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 1000001 steps, including 6420 resets, run finished after 2379 ms. (steps per millisecond=420 ) properties (out of 3) seen :11
[2023-03-23 06:29:55] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:29:55] [INFO ] Computed 182 place invariants in 53 ms
[2023-03-23 06:29:55] [INFO ] [Real]Absence check using 159 positive place invariants in 39 ms returned sat
[2023-03-23 06:29:56] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 45 ms returned unsat
[2023-03-23 06:29:56] [INFO ] [Real]Absence check using 159 positive place invariants in 39 ms returned sat
[2023-03-23 06:29:56] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 41 ms returned unsat
[2023-03-23 06:29:56] [INFO ] [Real]Absence check using 159 positive place invariants in 39 ms returned sat
[2023-03-23 06:29:56] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 51 ms returned sat
[2023-03-23 06:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:30:41] [INFO ] [Real]Absence check using state equation in 44796 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 4, 317] Max seen :[4, 4, 3]
FORMULA PolyORBNT-PT-S10J80-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J80-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 122 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:30:41] [INFO ] Computed 182 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 70462 resets, run finished after 11375 ms. (steps per millisecond=87 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6391 resets, run finished after 2128 ms. (steps per millisecond=469 ) properties (out of 1) seen :3
[2023-03-23 06:30:54] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:30:55] [INFO ] Computed 182 place invariants in 70 ms
[2023-03-23 06:30:55] [INFO ] [Real]Absence check using 159 positive place invariants in 39 ms returned sat
[2023-03-23 06:30:55] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 50 ms returned sat
[2023-03-23 06:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:31:40] [INFO ] [Real]Absence check using state equation in 44799 ms returned unknown
Current structural bounds on expressions (after SMT) : [317] Max seen :[3]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 88 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 88 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-23 06:31:40] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:31:40] [INFO ] Invariant cache hit.
[2023-03-23 06:31:43] [INFO ] Implicit Places using invariants in 2906 ms returned []
[2023-03-23 06:31:43] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:31:43] [INFO ] Invariant cache hit.
[2023-03-23 06:31:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:32:14] [INFO ] Performed 420/1431 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 06:32:44] [INFO ] Performed 805/1431 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-23 06:33:14] [INFO ] Performed 1172/1431 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-23 06:33:36] [INFO ] Implicit Places using invariants and state equation in 113075 ms returned []
Implicit Place search using SMT with State Equation took 115983 ms to find 0 implicit places.
[2023-03-23 06:33:36] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-23 06:33:36] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:33:36] [INFO ] Invariant cache hit.
[2023-03-23 06:33:38] [INFO ] Dead Transitions using invariants and state equation in 2364 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118630 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J80-UpperBounds-11
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:33:38] [INFO ] Computed 182 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 676 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2023-03-23 06:33:39] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:33:39] [INFO ] Computed 182 place invariants in 53 ms
[2023-03-23 06:33:39] [INFO ] [Real]Absence check using 159 positive place invariants in 37 ms returned sat
[2023-03-23 06:33:39] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 50 ms returned sat
[2023-03-23 06:33:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:33:44] [INFO ] [Real]Absence check using state equation in 4809 ms returned unknown
Current structural bounds on expressions (after SMT) : [317] Max seen :[3]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 94 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-23 06:33:44] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:33:44] [INFO ] Invariant cache hit.
[2023-03-23 06:33:46] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2486 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Normalized transition count is 2593 out of 2602 initially.
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:33:46] [INFO ] Computed 182 place invariants in 59 ms
Incomplete random walk after 1000000 steps, including 70446 resets, run finished after 11405 ms. (steps per millisecond=87 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 6275 resets, run finished after 2101 ms. (steps per millisecond=475 ) properties (out of 1) seen :3
[2023-03-23 06:34:00] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
// Phase 1: matrix 2593 rows 1431 cols
[2023-03-23 06:34:00] [INFO ] Computed 182 place invariants in 58 ms
[2023-03-23 06:34:00] [INFO ] [Real]Absence check using 159 positive place invariants in 38 ms returned sat
[2023-03-23 06:34:00] [INFO ] [Real]Absence check using 159 positive and 23 generalized place invariants in 50 ms returned sat
[2023-03-23 06:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:34:45] [INFO ] [Real]Absence check using state equation in 44798 ms returned unknown
Current structural bounds on expressions (after SMT) : [317] Max seen :[3]
Support contains 1 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 91 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 2602/2602 transitions.
Applied a total of 0 rules in 83 ms. Remains 1431 /1431 variables (removed 0) and now considering 2602/2602 (removed 0) transitions.
[2023-03-23 06:34:45] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:34:45] [INFO ] Invariant cache hit.
[2023-03-23 06:34:48] [INFO ] Implicit Places using invariants in 2877 ms returned []
[2023-03-23 06:34:48] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:34:48] [INFO ] Invariant cache hit.
[2023-03-23 06:34:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:35:19] [INFO ] Performed 467/1431 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-23 06:35:49] [INFO ] Performed 838/1431 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-23 06:36:19] [INFO ] Performed 1137/1431 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-23 06:36:45] [INFO ] Implicit Places using invariants and state equation in 117644 ms returned []
Implicit Place search using SMT with State Equation took 120523 ms to find 0 implicit places.
[2023-03-23 06:36:46] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-23 06:36:46] [INFO ] Flow matrix only has 2593 transitions (discarded 9 similar events)
[2023-03-23 06:36:46] [INFO ] Invariant cache hit.
[2023-03-23 06:36:48] [INFO ] Dead Transitions using invariants and state equation in 2358 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123131 ms. Remains : 1431/1431 places, 2602/2602 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J80-UpperBounds-11 in 189679 ms.
[2023-03-23 06:36:48] [INFO ] Flatten gal took : 266 ms
[2023-03-23 06:36:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-23 06:36:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1431 places, 2602 transitions and 14421 arcs took 15 ms.
Total runtime 471565 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S10J80
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: 1431 places, 2602 transitions, 14421 arcs.
Final Score: 755139.947
Took : 58 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13315496 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16074916 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../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-S10J80"
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-S10J80, 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-167873953400789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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