About the Execution of Smart+red for PolyORBNT-PT-S05J40
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7153.451 | 3600000.00 | 3679587.00 | 8822.10 | 1 1 1 1 1 1 3 41 1 ? 1 1 1 3 1 1 | normal |
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-167873953400733.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-S05J40, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400733
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 34K Feb 25 23:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 23:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Feb 25 23:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 251K Feb 25 23:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Feb 25 23:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 217K Feb 25 23:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 168K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 755K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.3M 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-S05J40-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J40-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679539878007
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-S05J40
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 02:51:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 02:51:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 02:51:19] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2023-03-23 02:51:19] [INFO ] Transformed 629 places.
[2023-03-23 02:51:19] [INFO ] Transformed 1590 transitions.
[2023-03-23 02:51:19] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 931 out of 935 initially.
// Phase 1: matrix 931 rows 629 cols
[2023-03-23 02:51:19] [INFO ] Computed 102 place invariants in 72 ms
FORMULA PolyORBNT-PT-S05J40-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-UpperBounds-07 41 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 683 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 14) seen :18
FORMULA PolyORBNT-PT-S05J40-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 248 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :9
[2023-03-23 02:51:20] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2023-03-23 02:51:20] [INFO ] Computed 102 place invariants in 45 ms
[2023-03-23 02:51:20] [INFO ] [Real]Absence check using 76 positive place invariants in 24 ms returned sat
[2023-03-23 02:51:20] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 23 ms returned unsat
[2023-03-23 02:51:20] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-23 02:51:20] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 19 ms returned unsat
[2023-03-23 02:51:20] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-23 02:51:20] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-23 02:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:21] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-23 02:51:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:51:21] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-23 02:51:21] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned unsat
[2023-03-23 02:51:21] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-23 02:51:21] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-23 02:51:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:22] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-03-23 02:51:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:51:22] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:51:22] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-23 02:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:23] [INFO ] [Nat]Absence check using state equation in 1654 ms returned sat
[2023-03-23 02:51:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:51:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 02:51:23] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 86 ms.
[2023-03-23 02:51:25] [INFO ] Deduced a trap composed of 343 places in 251 ms of which 4 ms to minimize.
[2023-03-23 02:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 439 ms
[2023-03-23 02:51:25] [INFO ] Added : 13 causal constraints over 3 iterations in 1429 ms. Result :sat
Minimization took 199 ms.
[2023-03-23 02:51:25] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:51:25] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 17 ms returned unsat
[2023-03-23 02:51:25] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-23 02:51:25] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 30 ms returned unsat
[2023-03-23 02:51:25] [INFO ] [Real]Absence check using 76 positive place invariants in 32 ms returned sat
[2023-03-23 02:51:25] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 21 ms returned unsat
[2023-03-23 02:51:26] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-23 02:51:26] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-23 02:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:26] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-23 02:51:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:51:26] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-23 02:51:26] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-23 02:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:28] [INFO ] [Nat]Absence check using state equation in 1348 ms returned sat
[2023-03-23 02:51:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 02:51:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 3536 ms returned unknown
[2023-03-23 02:51:31] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-23 02:51:31] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 21 ms returned unsat
[2023-03-23 02:51:31] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:51:31] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 18 ms returned unsat
[2023-03-23 02:51:31] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:51:31] [INFO ] [Real]Absence check using 76 positive and 26 generalized place invariants in 19 ms returned sat
[2023-03-23 02:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:32] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2023-03-23 02:51:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:51:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-23 02:51:32] [INFO ] [Nat]Absence check using 76 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-23 02:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:34] [INFO ] [Nat]Absence check using state equation in 1644 ms returned sat
[2023-03-23 02:51:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 02:51:34] [INFO ] Computed and/alt/rep : 549/1329/549 causal constraints (skipped 376 transitions) in 62 ms.
[2023-03-23 02:51:35] [INFO ] Deduced a trap composed of 343 places in 240 ms of which 1 ms to minimize.
[2023-03-23 02:51:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2023-03-23 02:51:35] [INFO ] Added : 13 causal constraints over 3 iterations in 1427 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1] Max seen :[1, 1, 1, 0, 1, 1, 1, 3, 1, 1, 0]
FORMULA PolyORBNT-PT-S05J40-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA PolyORBNT-PT-S05J40-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 7 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 841
Applied a total of 193 rules in 229 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
[2023-03-23 02:51:36] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2023-03-23 02:51:36] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-23 02:51:36] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 530/629 places, 746/935 transitions.
Applied a total of 0 rules in 37 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 945 ms. Remains : 530/629 places, 746/935 transitions.
Normalized transition count is 742 out of 746 initially.
// Phase 1: matrix 742 rows 530 cols
[2023-03-23 02:51:37] [INFO ] Computed 97 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 51988 resets, run finished after 4955 ms. (steps per millisecond=201 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4524 resets, run finished after 1164 ms. (steps per millisecond=859 ) properties (out of 1) seen :3
[2023-03-23 02:51:43] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-23 02:51:43] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-23 02:51:43] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:51:43] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-23 02:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:43] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2023-03-23 02:51:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:51:43] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:51:43] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-23 02:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:51:43] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-23 02:51:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:51:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 841 ms returned sat
[2023-03-23 02:51:44] [INFO ] Deduced a trap composed of 187 places in 180 ms of which 1 ms to minimize.
[2023-03-23 02:51:45] [INFO ] Deduced a trap composed of 175 places in 180 ms of which 2 ms to minimize.
[2023-03-23 02:51:45] [INFO ] Deduced a trap composed of 181 places in 181 ms of which 1 ms to minimize.
[2023-03-23 02:51:45] [INFO ] Deduced a trap composed of 201 places in 181 ms of which 3 ms to minimize.
[2023-03-23 02:51:45] [INFO ] Deduced a trap composed of 174 places in 180 ms of which 1 ms to minimize.
[2023-03-23 02:51:46] [INFO ] Deduced a trap composed of 174 places in 202 ms of which 1 ms to minimize.
[2023-03-23 02:51:46] [INFO ] Deduced a trap composed of 182 places in 171 ms of which 1 ms to minimize.
[2023-03-23 02:51:46] [INFO ] Deduced a trap composed of 169 places in 176 ms of which 1 ms to minimize.
[2023-03-23 02:51:46] [INFO ] Deduced a trap composed of 178 places in 177 ms of which 1 ms to minimize.
[2023-03-23 02:51:47] [INFO ] Deduced a trap composed of 188 places in 159 ms of which 0 ms to minimize.
[2023-03-23 02:51:47] [INFO ] Deduced a trap composed of 164 places in 155 ms of which 1 ms to minimize.
[2023-03-23 02:51:47] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 0 ms to minimize.
[2023-03-23 02:51:47] [INFO ] Deduced a trap composed of 170 places in 164 ms of which 1 ms to minimize.
[2023-03-23 02:51:47] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 1 ms to minimize.
[2023-03-23 02:51:48] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 0 ms to minimize.
[2023-03-23 02:51:48] [INFO ] Deduced a trap composed of 179 places in 169 ms of which 1 ms to minimize.
[2023-03-23 02:51:48] [INFO ] Deduced a trap composed of 183 places in 167 ms of which 1 ms to minimize.
[2023-03-23 02:51:49] [INFO ] Deduced a trap composed of 171 places in 167 ms of which 1 ms to minimize.
[2023-03-23 02:51:49] [INFO ] Deduced a trap composed of 173 places in 174 ms of which 1 ms to minimize.
[2023-03-23 02:51:49] [INFO ] Deduced a trap composed of 175 places in 170 ms of which 1 ms to minimize.
[2023-03-23 02:51:49] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 0 ms to minimize.
[2023-03-23 02:51:50] [INFO ] Deduced a trap composed of 175 places in 168 ms of which 0 ms to minimize.
[2023-03-23 02:51:53] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 8529 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 23 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 24 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-23 02:51:53] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:51:53] [INFO ] Invariant cache hit.
[2023-03-23 02:51:53] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-23 02:51:53] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:51:53] [INFO ] Invariant cache hit.
[2023-03-23 02:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:52:00] [INFO ] Implicit Places using invariants and state equation in 6444 ms returned []
Implicit Place search using SMT with State Equation took 7113 ms to find 0 implicit places.
[2023-03-23 02:52:00] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-23 02:52:00] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:52:00] [INFO ] Invariant cache hit.
[2023-03-23 02:52:00] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7784 ms. Remains : 530/530 places, 746/746 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-09
Normalized transition count is 742 out of 746 initially.
// Phase 1: matrix 742 rows 530 cols
[2023-03-23 02:52:00] [INFO ] Computed 97 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 518 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :3
[2023-03-23 02:52:01] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-23 02:52:01] [INFO ] Computed 97 place invariants in 24 ms
[2023-03-23 02:52:01] [INFO ] [Real]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-23 02:52:01] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 14 ms returned sat
[2023-03-23 02:52:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:52:01] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-23 02:52:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:52:01] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:52:01] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-23 02:52:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:52:01] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-23 02:52:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:52:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 856 ms returned sat
[2023-03-23 02:52:02] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 0 ms to minimize.
[2023-03-23 02:52:03] [INFO ] Deduced a trap composed of 175 places in 161 ms of which 0 ms to minimize.
[2023-03-23 02:52:03] [INFO ] Deduced a trap composed of 181 places in 178 ms of which 1 ms to minimize.
[2023-03-23 02:52:03] [INFO ] Deduced a trap composed of 201 places in 177 ms of which 1 ms to minimize.
[2023-03-23 02:52:03] [INFO ] Deduced a trap composed of 174 places in 187 ms of which 1 ms to minimize.
[2023-03-23 02:52:03] [INFO ] Deduced a trap composed of 174 places in 159 ms of which 0 ms to minimize.
[2023-03-23 02:52:04] [INFO ] Deduced a trap composed of 182 places in 184 ms of which 1 ms to minimize.
[2023-03-23 02:52:04] [INFO ] Deduced a trap composed of 169 places in 175 ms of which 1 ms to minimize.
[2023-03-23 02:52:04] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 0 ms to minimize.
[2023-03-23 02:52:05] [INFO ] Deduced a trap composed of 188 places in 169 ms of which 1 ms to minimize.
[2023-03-23 02:52:05] [INFO ] Deduced a trap composed of 164 places in 163 ms of which 1 ms to minimize.
[2023-03-23 02:52:05] [INFO ] Deduced a trap composed of 162 places in 152 ms of which 1 ms to minimize.
[2023-03-23 02:52:05] [INFO ] Deduced a trap composed of 170 places in 186 ms of which 0 ms to minimize.
[2023-03-23 02:52:05] [INFO ] Deduced a trap composed of 176 places in 165 ms of which 0 ms to minimize.
[2023-03-23 02:52:06] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 0 ms to minimize.
[2023-03-23 02:52:06] [INFO ] Deduced a trap composed of 179 places in 179 ms of which 0 ms to minimize.
[2023-03-23 02:52:06] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 3869 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 32 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-23 02:52:06] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:52:06] [INFO ] Invariant cache hit.
[2023-03-23 02:52:07] [INFO ] Dead Transitions using invariants and state equation in 629 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 663 ms. Remains : 530/530 places, 746/746 transitions.
Normalized transition count is 742 out of 746 initially.
// Phase 1: matrix 742 rows 530 cols
[2023-03-23 02:52:07] [INFO ] Computed 97 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 52231 resets, run finished after 4894 ms. (steps per millisecond=204 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 4461 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 1) seen :3
[2023-03-23 02:52:13] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-23 02:52:13] [INFO ] Computed 97 place invariants in 21 ms
[2023-03-23 02:52:13] [INFO ] [Real]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:52:13] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-23 02:52:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 02:52:13] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-23 02:52:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 02:52:13] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-23 02:52:13] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-23 02:52:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 02:52:13] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-23 02:52:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:52:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 823 ms returned sat
[2023-03-23 02:52:14] [INFO ] Deduced a trap composed of 187 places in 176 ms of which 1 ms to minimize.
[2023-03-23 02:52:15] [INFO ] Deduced a trap composed of 175 places in 191 ms of which 0 ms to minimize.
[2023-03-23 02:52:15] [INFO ] Deduced a trap composed of 181 places in 181 ms of which 0 ms to minimize.
[2023-03-23 02:52:15] [INFO ] Deduced a trap composed of 201 places in 184 ms of which 0 ms to minimize.
[2023-03-23 02:52:15] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 0 ms to minimize.
[2023-03-23 02:52:16] [INFO ] Deduced a trap composed of 174 places in 180 ms of which 0 ms to minimize.
[2023-03-23 02:52:16] [INFO ] Deduced a trap composed of 182 places in 174 ms of which 1 ms to minimize.
[2023-03-23 02:52:16] [INFO ] Deduced a trap composed of 169 places in 185 ms of which 0 ms to minimize.
[2023-03-23 02:52:16] [INFO ] Deduced a trap composed of 178 places in 195 ms of which 1 ms to minimize.
[2023-03-23 02:52:17] [INFO ] Deduced a trap composed of 188 places in 193 ms of which 1 ms to minimize.
[2023-03-23 02:52:17] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 7 ms to minimize.
[2023-03-23 02:52:17] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 1 ms to minimize.
[2023-03-23 02:52:17] [INFO ] Deduced a trap composed of 170 places in 147 ms of which 0 ms to minimize.
[2023-03-23 02:52:18] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 0 ms to minimize.
[2023-03-23 02:52:18] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 2 ms to minimize.
[2023-03-23 02:52:18] [INFO ] Deduced a trap composed of 179 places in 198 ms of which 0 ms to minimize.
[2023-03-23 02:52:19] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 9 ms to minimize.
[2023-03-23 02:52:19] [INFO ] Deduced a trap composed of 171 places in 181 ms of which 0 ms to minimize.
[2023-03-23 02:52:19] [INFO ] Deduced a trap composed of 173 places in 183 ms of which 0 ms to minimize.
[2023-03-23 02:52:19] [INFO ] Deduced a trap composed of 175 places in 185 ms of which 0 ms to minimize.
[2023-03-23 02:52:20] [INFO ] Deduced a trap composed of 176 places in 195 ms of which 0 ms to minimize.
[2023-03-23 02:52:20] [INFO ] Deduced a trap composed of 175 places in 167 ms of which 1 ms to minimize.
[2023-03-23 02:52:23] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 8735 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 27 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 25 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-23 02:52:23] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:52:23] [INFO ] Invariant cache hit.
[2023-03-23 02:52:24] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2023-03-23 02:52:24] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:52:24] [INFO ] Invariant cache hit.
[2023-03-23 02:52:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 02:52:30] [INFO ] Implicit Places using invariants and state equation in 6294 ms returned []
Implicit Place search using SMT with State Equation took 7324 ms to find 0 implicit places.
[2023-03-23 02:52:30] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-23 02:52:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-23 02:52:30] [INFO ] Invariant cache hit.
[2023-03-23 02:52:31] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8037 ms. Remains : 530/530 places, 746/746 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J40-UpperBounds-09 in 30546 ms.
[2023-03-23 02:52:32] [INFO ] Flatten gal took : 189 ms
[2023-03-23 02:52:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 12 ms.
[2023-03-23 02:52:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 530 places, 746 transitions and 3809 arcs took 9 ms.
Total runtime 72680 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S05J40
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: 530 places, 746 transitions, 3809 arcs.
Final Score: 64004.505
Took : 55 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8996300 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16102560 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J40"
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-S05J40, 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-167873953400733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 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 '
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 ;