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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 16K Feb 26 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 223K Feb 26 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 956K Feb 26 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 211K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 658K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 167K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 773K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9M 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 PolyORBLF-PT-S06J06T04-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679520657057

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=PolyORBLF-PT-S06J06T04
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 21:30:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 21:30:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 21:30:58] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2023-03-22 21:30:58] [INFO ] Transformed 506 places.
[2023-03-22 21:30:59] [INFO ] Transformed 7154 transitions.
[2023-03-22 21:30:59] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Normalized transition count is 1750 out of 1774 initially.
// Phase 1: matrix 1750 rows 506 cols
[2023-03-22 21:30:59] [INFO ] Computed 54 place invariants in 125 ms
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 54 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 14) seen :37
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :19
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :23
[2023-03-22 21:30:59] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2023-03-22 21:30:59] [INFO ] Computed 54 place invariants in 63 ms
[2023-03-22 21:30:59] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2023-03-22 21:30:59] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-22 21:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:01] [INFO ] [Real]Absence check using state equation in 1683 ms returned sat
[2023-03-22 21:31:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:31:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 119 ms returned sat
[2023-03-22 21:31:02] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned sat
[2023-03-22 21:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:06] [INFO ] [Nat]Absence check using state equation in 4738 ms returned unknown
[2023-03-22 21:31:06] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-22 21:31:06] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned sat
[2023-03-22 21:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:07] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2023-03-22 21:31:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:31:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-22 21:31:08] [INFO ] [Nat]Absence check using 23 positive and 31 generalized place invariants in 19 ms returned sat
[2023-03-22 21:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:12] [INFO ] [Nat]Absence check using state equation in 4931 ms returned unknown
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 20 ms returned unsat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 14 ms returned unsat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned unsat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 12 ms returned unsat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 6 ms returned unsat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 13 ms returned unsat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-22 21:31:13] [INFO ] [Real]Absence check using 23 positive and 31 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, 356, 6, 4, 1, 4, 1, 1, 1] Max seen :[3, 2, 6, 4, 1, 4, 1, 1, 1]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 28 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 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 42 rules applied. Total rules applied 42 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 78 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 190 place count 408 transition count 1682
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 286 place count 360 transition count 1634
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 294 place count 360 transition count 1626
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 302 place count 352 transition count 1626
Applied a total of 302 rules in 276 ms. Remains 352 /506 variables (removed 154) and now considering 1626/1774 (removed 148) transitions.
[2023-03-22 21:31:13] [INFO ] Flow matrix only has 1602 transitions (discarded 24 similar events)
// Phase 1: matrix 1602 rows 352 cols
[2023-03-22 21:31:13] [INFO ] Computed 48 place invariants in 39 ms
[2023-03-22 21:31:14] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 352/506 places, 1014/1774 transitions.
Applied a total of 0 rules in 28 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1103 ms. Remains : 352/506 places, 1014/1774 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-22 21:31:14] [INFO ] Computed 48 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 9610 resets, run finished after 5588 ms. (steps per millisecond=178 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 1412 resets, run finished after 2311 ms. (steps per millisecond=432 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 385 resets, run finished after 2451 ms. (steps per millisecond=407 ) properties (out of 2) seen :5
[2023-03-22 21:31:25] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-22 21:31:25] [INFO ] Computed 48 place invariants in 22 ms
[2023-03-22 21:31:25] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 21:31:25] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-22 21:31:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:26] [INFO ] [Real]Absence check using state equation in 1472 ms returned sat
[2023-03-22 21:31:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:31:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 21:31:26] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-22 21:31:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:27] [INFO ] [Nat]Absence check using state equation in 1231 ms returned sat
[2023-03-22 21:31:27] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:31:28] [INFO ] [Nat]Added 112 Read/Feed constraints in 811 ms returned sat
[2023-03-22 21:31:29] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 3 ms to minimize.
[2023-03-22 21:31:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 252 ms
[2023-03-22 21:31:29] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 21:31:29] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-22 21:31:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:30] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-22 21:31:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:31:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 21:31:30] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-22 21:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:33] [INFO ] [Nat]Absence check using state equation in 2602 ms returned sat
[2023-03-22 21:31:34] [INFO ] [Nat]Added 112 Read/Feed constraints in 992 ms returned sat
[2023-03-22 21:31:34] [INFO ] Deduced a trap composed of 80 places in 232 ms of which 1 ms to minimize.
[2023-03-22 21:31:34] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2023-03-22 21:31:34] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2023-03-22 21:31:35] [INFO ] Deduced a trap composed of 198 places in 240 ms of which 1 ms to minimize.
[2023-03-22 21:31:35] [INFO ] Deduced a trap composed of 184 places in 217 ms of which 1 ms to minimize.
[2023-03-22 21:31:38] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 4671 ms
Current structural bounds on expressions (after SMT) : [3, 356] Max seen :[3, 2]
FORMULA PolyORBLF-PT-S06J06T04-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 1014/1014 transitions.
Normalized transition count is 990 out of 1014 initially.
// Phase 1: matrix 990 rows 352 cols
[2023-03-22 21:31:38] [INFO ] Computed 48 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 9758 resets, run finished after 5554 ms. (steps per millisecond=180 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 362 resets, run finished after 2467 ms. (steps per millisecond=405 ) properties (out of 1) seen :2
[2023-03-22 21:31:46] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
// Phase 1: matrix 990 rows 352 cols
[2023-03-22 21:31:47] [INFO ] Computed 48 place invariants in 28 ms
[2023-03-22 21:31:47] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 21:31:47] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 14 ms returned sat
[2023-03-22 21:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:48] [INFO ] [Real]Absence check using state equation in 1326 ms returned sat
[2023-03-22 21:31:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:31:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-22 21:31:48] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 13 ms returned sat
[2023-03-22 21:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:31:51] [INFO ] [Nat]Absence check using state equation in 2568 ms returned sat
[2023-03-22 21:31:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:31:52] [INFO ] [Nat]Added 112 Read/Feed constraints in 990 ms returned sat
[2023-03-22 21:31:52] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 0 ms to minimize.
[2023-03-22 21:31:52] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-22 21:31:52] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 0 ms to minimize.
[2023-03-22 21:31:53] [INFO ] Deduced a trap composed of 198 places in 231 ms of which 1 ms to minimize.
[2023-03-22 21:31:53] [INFO ] Deduced a trap composed of 184 places in 219 ms of which 1 ms to minimize.
[2023-03-22 21:31:56] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 4623 ms
Current structural bounds on expressions (after SMT) : [356] Max seen :[2]
Support contains 24 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 1014/1014 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 1014/1014 transitions.
Applied a total of 0 rules in 19 ms. Remains 352 /352 variables (removed 0) and now considering 1014/1014 (removed 0) transitions.
[2023-03-22 21:31:56] [INFO ] Flow matrix only has 990 transitions (discarded 24 similar events)
[2023-03-22 21:31:56] [INFO ] Invariant cache hit.
[2023-03-22 21:31:57] [INFO ] Implicit Places using invariants in 372 ms returned [17, 70, 145, 291]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 379 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 348/352 places, 1014/1014 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 344 transition count 1010
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 344 transition count 1010
Applied a total of 8 rules in 35 ms. Remains 344 /348 variables (removed 4) and now considering 1010/1014 (removed 4) transitions.
[2023-03-22 21:31:57] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:31:57] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-22 21:31:57] [INFO ] Implicit Places using invariants in 372 ms returned []
[2023-03-22 21:31:57] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:31:57] [INFO ] Invariant cache hit.
[2023-03-22 21:31:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:32:08] [INFO ] Implicit Places using invariants and state equation in 10908 ms returned []
Implicit Place search using SMT with State Equation took 11283 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/352 places, 1010/1014 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11717 ms. Remains : 344/352 places, 1010/1014 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:32:08] [INFO ] Computed 44 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 9781 resets, run finished after 5450 ms. (steps per millisecond=183 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 369 resets, run finished after 2415 ms. (steps per millisecond=414 ) properties (out of 1) seen :2
[2023-03-22 21:32:16] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:32:16] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-22 21:32:16] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 21:32:16] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-22 21:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:18] [INFO ] [Real]Absence check using state equation in 2270 ms returned sat
[2023-03-22 21:32:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:32:18] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-22 21:32:18] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-22 21:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:21] [INFO ] [Nat]Absence check using state equation in 3092 ms returned sat
[2023-03-22 21:32:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:32:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 976 ms returned sat
[2023-03-22 21:32:23] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 1 ms to minimize.
[2023-03-22 21:32:23] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:32:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 698 ms
[2023-03-22 21:32:23] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 75 ms.
[2023-03-22 21:32:25] [INFO ] Added : 94 causal constraints over 19 iterations in 2097 ms. Result :sat
Minimization took 1259 ms.
Current structural bounds on expressions (after SMT) : [356] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 17 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 18 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-22 21:32:27] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:32:27] [INFO ] Invariant cache hit.
[2023-03-22 21:32:28] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-22 21:32:28] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:32:28] [INFO ] Invariant cache hit.
[2023-03-22 21:32:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:32:40] [INFO ] Implicit Places using invariants and state equation in 12046 ms returned []
Implicit Place search using SMT with State Equation took 12431 ms to find 0 implicit places.
[2023-03-22 21:32:40] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-22 21:32:40] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:32:40] [INFO ] Invariant cache hit.
[2023-03-22 21:32:40] [INFO ] Dead Transitions using invariants and state equation in 495 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13027 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-02
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:32:40] [INFO ] Computed 44 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :2
[2023-03-22 21:32:40] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:32:40] [INFO ] Computed 44 place invariants in 24 ms
[2023-03-22 21:32:40] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 21:32:40] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-22 21:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:43] [INFO ] [Real]Absence check using state equation in 2262 ms returned sat
[2023-03-22 21:32:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:32:43] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 21:32:43] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 12 ms returned sat
[2023-03-22 21:32:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:46] [INFO ] [Nat]Absence check using state equation in 3127 ms returned sat
[2023-03-22 21:32:46] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:32:47] [INFO ] [Nat]Added 112 Read/Feed constraints in 981 ms returned sat
[2023-03-22 21:32:47] [INFO ] Deduced a trap composed of 85 places in 189 ms of which 0 ms to minimize.
[2023-03-22 21:32:48] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-22 21:32:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 663 ms
[2023-03-22 21:32:48] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 50 ms.
[2023-03-22 21:32:48] [INFO ] Added : 5 causal constraints over 1 iterations in 159 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 18 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-22 21:32:48] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:32:48] [INFO ] Invariant cache hit.
[2023-03-22 21:32:48] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 554 ms. Remains : 344/344 places, 1010/1010 transitions.
Normalized transition count is 986 out of 1010 initially.
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:32:48] [INFO ] Computed 44 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 9882 resets, run finished after 5186 ms. (steps per millisecond=192 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 338 resets, run finished after 2343 ms. (steps per millisecond=426 ) properties (out of 1) seen :2
[2023-03-22 21:32:56] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
// Phase 1: matrix 986 rows 344 cols
[2023-03-22 21:32:56] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-22 21:32:56] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 21:32:56] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 19 ms returned sat
[2023-03-22 21:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 21:32:58] [INFO ] [Real]Absence check using state equation in 2254 ms returned sat
[2023-03-22 21:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 21:32:58] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-22 21:32:58] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 11 ms returned sat
[2023-03-22 21:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 21:33:01] [INFO ] [Nat]Absence check using state equation in 3084 ms returned sat
[2023-03-22 21:33:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:33:02] [INFO ] [Nat]Added 112 Read/Feed constraints in 977 ms returned sat
[2023-03-22 21:33:03] [INFO ] Deduced a trap composed of 85 places in 180 ms of which 1 ms to minimize.
[2023-03-22 21:33:03] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 0 ms to minimize.
[2023-03-22 21:33:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2023-03-22 21:33:03] [INFO ] Computed and/alt/rep : 574/2809/569 causal constraints (skipped 411 transitions) in 46 ms.
[2023-03-22 21:33:05] [INFO ] Added : 94 causal constraints over 19 iterations in 1986 ms. Result :sat
Minimization took 1253 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 24 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 344/344 places, 1010/1010 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 1010/1010 transitions.
Applied a total of 0 rules in 15 ms. Remains 344 /344 variables (removed 0) and now considering 1010/1010 (removed 0) transitions.
[2023-03-22 21:33:07] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:33:07] [INFO ] Invariant cache hit.
[2023-03-22 21:33:07] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-22 21:33:07] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:33:07] [INFO ] Invariant cache hit.
[2023-03-22 21:33:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 21:33:19] [INFO ] Implicit Places using invariants and state equation in 11693 ms returned []
Implicit Place search using SMT with State Equation took 12086 ms to find 0 implicit places.
[2023-03-22 21:33:19] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-22 21:33:19] [INFO ] Flow matrix only has 986 transitions (discarded 24 similar events)
[2023-03-22 21:33:19] [INFO ] Invariant cache hit.
[2023-03-22 21:33:20] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12641 ms. Remains : 344/344 places, 1010/1010 transitions.
Ending property specific reduction for PolyORBLF-PT-S06J06T04-UpperBounds-02 in 39386 ms.
[2023-03-22 21:33:20] [INFO ] Flatten gal took : 128 ms
[2023-03-22 21:33:20] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 21:33:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 344 places, 1010 transitions and 5974 arcs took 7 ms.
Total runtime 141921 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBLF (PT), instance S06J06T04
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: 344 places, 1010 transitions, 5974 arcs.
Final Score: 37595.28
Took : 94 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10557436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092432 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="PolyORBLF-PT-S06J06T04"
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 PolyORBLF-PT-S06J06T04, 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-167873953200613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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